XPath processing in a nutshell

Authors:
Georg Gottlob;Christoph Koch;Reinhard Pichler
Affiliations:
Technische Universität Wien, Vienna, Austria;Technische Universität Wien, Vienna, Austria;Technische Universität Wien, Vienna, Austria
Venue:
ACM SIGMOD Record
Year:
2003

Citing 4
Cited 4

Containment and equivalence for an XPath fragment

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Monadic Queries over Tree-Structured Data

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
The complexity of XPath query evaluation

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient algorithms for processing XPath queries

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases

An efficient single-pass query evaluator for XML data streams

Proceedings of the 2004 ACM symposium on Applied computing
Supporting complex queries on multiversion XML documents

ACM Transactions on Internet Technology (TOIT)
Automata for XML---A survey

Journal of Computer and System Sciences
WDEE: web data extraction by example

DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a concise yet complete formal definition of the semantics of XPath 1 and summarize e cient algorithms for processing queries in this language. Our presentation is intended both for the reader who is looking for a short but comprehensive formal account of XPath as well as the software developer in need of material that facilitates the rapid implementation of XPath engines.