Results 61 to 70 of about 16,042 (210)
Path Queries on Compressed XML [PDF]
, 2003 Central to any XML query language is a path language such as XPath which operates on the tree structure of the XML document. We demonstrate in this paper that the tree structure can be e#ectively compressed and manipulated using techniques derived ...
Abiteboul +19 more
core +2 more sources
A system for the static analysis of XPath [PDF]
ACM Transactions on Information Systems, 2006 XPath is the standard language for navigating XML documents and returning a set of matching nodes. We present a sound and complete decision procedure for containment of XPath queries, as well as other related XPath decision problems such as satisfiability, equivalence, overlap, and coverage.
Genevès, Pierre, Layaïda, Nabil
openaire +2 more sources
Automata Approach to XML Data Indexing
Information, 2018 The internal structure of XML documents can be viewed as a tree. Trees are among the fundamental and well-studied data structures in computer science. They express a hierarchical structure and are widely used in many applications.
Eliška Šestáková, Jan Janoušek
doaj +1 more source
Alternating register automata on finite words and trees [PDF]
Logical Methods in Computer Science, 2012 We study alternating register automata on data words and data trees in relation to logics. A data word (resp. data tree) is a word (resp. tree) whose every position carries a label from a finite alphabet and a data value from an infinite domain.
Diego Figueira
doaj +1 more source
Intelligent Self-Repairable Web Wrappers [PDF]
, 2011 The amount of information available on the Web grows at an incredible high rate. Systems and procedures devised to extract these data from Web sources already exist, and different approaches and techniques have been investigated during the last years. On
A. Laender +11 more
core +2 more sources
Containment for Conditional Tree Patterns [PDF]
Logical Methods in Computer Science, 2015 A Conditional Tree Pattern (CTP) expands an XML tree pattern with labels attached to the descendant edges. These labels can be XML element names or Boolean CTPs.
Alessandro Facchini +3 more
doaj +1 more source
Classification of index partitions to boost XML query performance [PDF]
, 2010 XML query optimization continues to occupy considerable research effort due to the increasing usage of XML data. Despite many innovations over recent years, XML databases struggle to compete with more traditional database systems. Rather than using node
Marks, Gerard, Roantree, Mark
core +1 more source
Satisfiability of XPath Expressions [PDF]
, 2004 In this paper, we investigate the complexity of deciding the satisfiability of XPath 2.0 expressions, i.e., whether there is an XML document for which their result is nonempty. Several fragments that allow certain types of expressions are classified as either in PTIME or NP-hard to see which type of expression make this a hard problem.
openaire +2 more sources
Staircase Join: Teach a Relational DBMS to Watch its (Axis) Steps [PDF]
, 2003 Relational query processors derive much of their effectiveness from the awareness of specific table properties like sort order, size, or absence of duplicate tuples.
Grust, Torsten +2 more
core +3 more sources
Logics for Unranked Trees: An Overview [PDF]
, 2005 Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purposes: some are better suited for extracting data, some for expressing ...
A. Arnold +26 more
core +6 more sources