Sciweavers

51 search results - page 4 / 11
» Rewriting and Evaluating Tree Queries with XPath
Sort
View
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 5 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
WEBDB
2005
Springer
97views Database» more  WEBDB 2005»
13 years 11 months ago
Towards a Query Language for Multihierarchical XML: Revisiting XPath
In recent years it has been argued that when XML encodings become complex, DOM trees are no longer adequate for query processing. Alternative representations of XML documents, suc...
Ionut Emil Iacob, Alex Dekhtyar
XIMEP
2004
ACM
74views Database» more  XIMEP 2004»
13 years 11 months ago
Schema Validation and Type Annotation for Encoded Trees
We argue that efficient support for schema validation and type annotation in XQuery processors deserves as much attention as efficient evaluation techniques for XPath queries have...
Torsten Grust, Stefan Klinger
ICDT
2010
ACM
194views Database» more  ICDT 2010»
13 years 7 months ago
Bag Equivalence of XPath Queries
When a query is evaluated under bag semantics, each answer is returned as many times as it has derivations. Bag semantics has long been recognized as important, especially when ag...
Sara Cohen, Yaacov Y. Weiss
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
14 years 5 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...