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
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
ACM SIGMOD Record
Reactive Mobility by Failure: When Fail Means Move
Information Systems Frontiers
Transformation and reaction rules for data on the web
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
Journal of Computer and System Sciences
Applying model-checking to solve queries on semistructured data
Computer Languages, Systems and Structures
A structural/temporal query language for Business Processes
Journal of Computer and System Sciences
Validity-sensitive querying of XML databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
WebLab PROV: computing fine-grained provenance links for XML artifacts
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Hi-index | 0.00 |
We provide a concise yet complete formal definition of the semantics of XPath 1 and summarize efficient 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.