Sciweavers

552 search results - page 2 / 111
» Efficient Algorithms for Processing XPath Queries
Sort
View
PODS
2006
ACM
98views Database» more  PODS 2006»
14 years 5 months ago
Processing queries on tree-structured data efficiently
This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...
Christoph Koch
DATESO
2010
233views Database» more  DATESO 2010»
13 years 3 months ago
Efficient Implementation of XPath Processor on Multi-Core CPUs
Abstract. Current XPath processors use direct approach to query evaluation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case ...
Martin Krulis, Jakub Yaghob
SIGMOD
2007
ACM
120views Database» more  SIGMOD 2007»
14 years 5 months ago
Xpath on steroids: exploiting relational engines for xpath performance
A lot of research has been conducted by the database community on methods and techniques for efficient XPath processing, with great success. Despite the progress made, significant...
Haris Georgiadis, Vasilis Vassalos
VLDB
2004
ACM
111views Database» more  VLDB 2004»
13 years 11 months ago
A Framework for Using Materialized XPath Views in XML Query Processing
XML languages, such as XQuery, XSLT and SQL/XML, employ XPath as the search and extraction language. XPath expressions often define complicated navigation, resulting in expensive...
Andrey Balmin, Fatma Özcan, Kevin S. Beyer, R...
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
14 years 5 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis