XPath evaluation in linear time

Authors:
Mikolaj Bojańczyk;Pawel Parys
Affiliations:
Warsaw University, Warsaw, Poland;Warsaw University, Warsaw, Poland
Venue:
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Year:
2008

Citing 7
Cited 13

Factorization forests of finite height

Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
Automata theory for XML researchers

ACM SIGMOD Record
Efficient algorithms for processing XPath queries

ACM Transactions on Database Systems (TODS)
Two-variable logic on data trees and XML reasoning

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XPath leashed

ACM Computing Surveys (CSUR)
Factorisation forests for infinite words application to countable scattered linear orderings

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
A combinatorial theorem for trees applications to monadic logic and infinite structures

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Incremental XPath evaluation

Proceedings of the 12th International Conference on Database Theory
XPath evaluation in linear time with polynomial combined complexity

Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An Automata-Theoretic Approach to Regular XPath

DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
Incremental XPath evaluation

ACM Transactions on Database Systems (TODS)
Efficient evaluation of nondeterministic automata using factorization forests

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Efficient evaluation for a temporal logic on changing XML documents

Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XPath evaluation in linear time

Journal of the ACM (JACM)
Mixing bottom-up and top-down XPath query evaluation

ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Foundations of XML based on logic and automata: a snapshot

FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Regular expressions for data words

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Regular path queries on graphs with data

Proceedings of the 15th International Conference on Database Theory
XPath fragments on XML in columns

Proceedings of the 14th International Conference on Information Integration and Web-based Applications & Services
Schema-less XML in columns

ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a fragment of XPath where attribute values can only be tested for equality. We show that for any fixed unary query in this fragment, the set of nodes that satisfy the query can be calculated in time linear in the document size.