591 search results - page 15 / 119 » The complexity of XPath query evaluation |
PODS
2006
ACM
15 years 12 months ago
2006
ACM
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...
111
click to vote
CIKM
2004
Springer
15 years 5 months ago
2004
Springer
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...
175
click to vote
VLDB
2005
ACM
15 years 12 months ago
2005
ACM
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...
102
click to vote
WIDM
2004
ACM
15 years 5 months ago
2004
ACM
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...
99
Voted
CORR
2010
Springer
14 years 12 months ago
2010
Springer
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...