XPath evaluation in linear time with polynomial combined complexity

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2009, Pages 55-64

  Parys, Pawel ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Algorithms; Languages; Theory

Indexed keywords

COMBINED COMPLEXITY; EXPONENTIAL COMPLEXITY; LANGUAGES; LINEAR DATA COMPLEXITY; LINEAR TIME; THEORY;

LINGUISTICS;

QUERY LANGUAGES;

EID: 70350660790     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559795.1559805     Document Type: Conference Paper

References (9)

1. M. A. Bender and M. FarachColton. The LCA problem revisited. In Latin American Theoretical Informatics, pages 88-94, 2000.
2. M. Benedikt and C. Koch. XPath leashed. ACM Computing Surveys.
3. M. Bojańczyk and P. Parys. XPath evaluation in linear time. In PODS, pages 241-250, 2008.
4. J. Clark and S. DeRose. XML Path language (XPath) version 1.0, W3C recommendation. Technical report, W3C, 1999.
5. G. Gottlob, C. Koch, and R. Pichler. XPath query evaluation: Improving time and space eficiency. In ICDE'03, pages 379-390, 2003.
6. G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. ACM Transactions on Database Systems, 30(2):444-491, 2005.
7. D. Harel and R. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338-355, 1984.
8. J. Kärkkäinen and P. Sanders. Simple linear work suffix array construction. In International Conference on Automata, Languages and Programming, volume 2719 of Lecture Notes in Computer Science, pages 943-955, 2003.
9. F. Neven. Automata theory for XML researchers. SIGMOD Record, 31(3), 2002.