The complexity of XPath query evaluation
- 9 June 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 179-190
- https://doi.org/10.1145/773153.773171
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- XPath query evaluation: improving time and space efficiencyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Typing and querying XML documentsPublished by Association for Computing Machinery (ACM) ,2003
- Properties that characterize LOGCFLJournal of Computer and System Sciences, 1991
- Two Applications of Inductive Counting for Complementation ProblemsSIAM Journal on Computing, 1989
- Problems complete for deterministic logarithmic spaceJournal of Algorithms, 1987
- The complexity of relational query languages (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1982