Sciweavers

591 search results - page 15 / 119
» The complexity of XPath query evaluation
Sort
View
PODS
2006
ACM
98views Database» more  PODS 2006»
14 years 9 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
CIKM
2004
Springer
14 years 2 months ago
Processing content-oriented XPath queries
Document-centric XML collections contain text-rich documents, marked up with XML tags that add lightweight semantics to the text. Querying such collections calls for a hybrid quer...
Börkur Sigurbjörnsson, Jaap Kamps, Maart...
VLDB
2005
ACM
123views Database» more  VLDB 2005»
14 years 9 months ago
Querying XML streams
Efficient querying of XML streams will be one of the fundamental features of next-generation information systems. In this paper we propose the TurboXPath path processor, which acce...
Vanja Josifovski, Marcus Fontoura, Attila Barta
WIDM
2004
ACM
14 years 2 months ago
XPath lookup queries in P2P networks
We address the problem of querying XML data over a P2P network. In P2P networks, the allowed kinds of queries are usually exact-match queries over file names. We discuss the exte...
Angela Bonifati, Ugo Matrangolo, Alfredo Cuzzocrea...
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 9 months ago
XPath Whole Query Optimization
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
Sebastian Maneth, Kim Nguyen