XPath leashed

Authors:
Michael Benedikt;Christoph Koch
Affiliations:
Oxford University Computing Laboratory, Oxford, UK;Cornell University, Ithaca, NY
Venue:
ACM Computing Surveys (CSUR)
Year:
2009

Citing 77
Cited 31

Automata-Theoretic techniques for modal logics of programs

Journal of Computer and System Sciences
Properties that characterize LOGCFL

Journal of Computer and System Sciences
A catalog of complexity classes

Handbook of theoretical computer science (vol. A)
Graph rewriting: an algebraic and logic approach

Handbook of theoretical computer science (vol. B)
Limits to parallel computation: P-completeness theory

Limits to parallel computation: P-completeness theory
On the complexity of bounded-variable queries (extended abstract)

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Over words, two variables are as powerful as one quantifier alternation

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Hypertree decompositions and tractable queries

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An Until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic

Information and Computation - Special issue: LICS 1996—Part 1
Conjunctive-query containment and constraint satisfaction

Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Minimization of tree pattern queries

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
The complexity of acyclic conjunctive queries

Journal of the ACM (JACM)
Expressiveness of structured document query languages based on attribute grammars

Journal of the ACM (JACM)
Validating streaming XML documents

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Containment and equivalence for an XPath fragment

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Storing and querying ordered XML using a relational database system

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Query automata over finite trees

Theoretical Computer Science
Multi-level operator combination in XML query processing

Proceedings of the eleventh international conference on Information and knowledge management
Automata theory for XML researchers

ACM SIGMOD Record
Query evaluation via tree-decompositions

Journal of the ACM (JACM)
Conjunctive Query Containment Revisited

ICDT '97 Proceedings of the 6th International Conference on Database Theory
Containment for XPath Fragments under DTD Constraints

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Processing XML Streams with Deterministic Automata

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Structural Properties of XPath Fragments

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Monadic Queries over Tree-Structured Data

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Relational Databases for Querying XML Documents: Limitations and Opportunities

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Efficient Filtering of XML Documents for Selective Dissemination of Information

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
XPath: Looking Forward

EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
Factors of Words

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Evaluating Queries on Structure with eXtended Access Support Relations

Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
Locating Matches of Tree Patterns in Forests

Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Partially-Ordered Two-Way Automata: A New Characterization of DA

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
XPath Containment in the Presence of Disjunction, DTDs, and Variables

ICDT '03 Proceedings of the 9th International Conference on Database Theory
First-order logic with two variables and unary temporal logic

Information and Computation - Special issue: LICS'97
Query Evaluation on Compressed Trees (Extended Abstract)

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Stream processing of XPath queries with predicates

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
XPath queries on streaming data

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
YFilter: Efficient and Scalable Filtering of XML Documents

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Efficient Filtering of XML Documents with XPath Expressions

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Structural Joins: A Primitive for Efficient XML Query Pattern Matching

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
The complexity of translating logic to finite automata

Automata logics, and infinite games
Monadic datalog and the expressive power of languages for Web information extraction

Journal of the ACM (JACM)
XPath query containment

ACM SIGMOD Record
Accelerating XPath evaluation in any RDBMS

ACM Transactions on Database Systems (TODS)
Secure XML querying with security views

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
ORDPATHs: insert-friendly XML node labels

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
CTL Model Checking for Processing Simple XPath Queries

TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)

Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Full-Fledged Algebraic XPath Processing in Natix

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Conditional XPath, the first order complete XPath dialect

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Conjunctive queries over trees

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Querying XML streams

The VLDB Journal — The International Journal on Very Large Data Bases
The complexity of XPath query evaluation and XML typing

Journal of the ACM (JACM)
XPath satisfiability in the presence of DTDs

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Buffering in query evaluation over XML streams

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

ACM Transactions on Database Systems (TODS)
Temporal Logics over Unranked Trees

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Automata for XML---A survey

Journal of Computer and System Sciences
On the memory requirements of XPath evaluation over XML streams

Journal of Computer and System Sciences
Tight lower bounds for query processing on streaming and external memory data

Theoretical Computer Science
Efficient algorithms for evaluating xpath over streams

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
SPEX: Streamed and Progressive Evaluation of XPath

IEEE Transactions on Knowledge and Data Engineering
Algorithms for acyclic database schemes

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Efficient algorithms for processing XPath queries

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient processing of expressive node-selecting queries on XML data in secondary storage: a tree automata-based approach

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Staircase join: teach a relational DBMS to watch its (axis) steps

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
On testing satisfiability of tree pattern queries

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient algorithms for the tree homeomorphism problem

DBPL'07 Proceedings of the 11th international conference on Database programming languages
Satisfiability of XPath queries with sibling axes

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
First order paths in ordered trees

ICDT'05 Proceedings of the 10th international conference on Database Theory
Verification of tree updates for optimization

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
The BIRD numbering scheme for XML and tree databases – deciding and reconstructing tree relations using efficient arithmetic operations

XSym'05 Proceedings of the Third international conference on Database and XML Technologies
Index vs. navigation in XPath evaluation

XSym'06 Proceedings of the 4th international conference on Database and XML Technologies

XPath evaluation in linear time

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity of Data Tree Patterns over XML Documents

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Incremental XPath evaluation

Proceedings of the 12th International Conference on Database Theory
Two-variable logic on data trees and XML reasoning

Journal of the ACM (JACM)
Reasoning about XML update constraints

Journal of Computer and System Sciences
XPath evaluation in linear time with polynomial combined complexity

Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Semantics, Types and Effects for XML Updates

DBPL '09 Proceedings of the 12th International Symposium on Database Programming Languages
From XQuery to relational logics

ACM Transactions on Database Systems (TODS)
Four lessons in versatility or how query languages adapt to the web

Semantic techniques for the web
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
Information extraction using XPath

KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part III
SXPath: extending XPath towards spatial querying on web documents

Proceedings of the VLDB Endowment
On the equivalence of distributed systems with queries and communication

Proceedings of the 14th International Conference on Database Theory
Satisfiability algorithms for conjunctive queries over trees

Proceedings of the 14th International Conference on Database Theory
Value joins are expensive over (probabilistic) XML

Proceedings of the 4th International Workshop on Logic in Databases
XPath evaluation in linear time

Journal of the ACM (JACM)
Impact of XML Schema Evolution

ACM Transactions on Internet Technology (TOIT)
On equivalence and rewriting of XPath queries using views under DTD constraints

DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
OPAL: automated form understanding for the deep web

Proceedings of the 21st international conference on World Wide Web
Foundations of regular expressions in XML schema languages and SPARQL

PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism

Journal of Discrete Algorithms
Deciding twig-definability of node selecting tree automata

Proceedings of the 15th International Conference on Database Theory
Answering queries using views over probabilistic XML: complexity and tractability

Proceedings of the VLDB Endowment
Detecting conflicts among declarative UI extensions

Proceedings of the 8th symposium on Dynamic languages
OXPath: A language for scalable data extraction, automation, and crawling on the deep web

The VLDB Journal — The International Journal on Very Large Data Bases
Optimizing XML querying using type-based document projection

ACM Transactions on Database Systems (TODS)
On the equivalence of distributed systems with queries and communication

Journal of Computer and System Sciences
Revisiting “forward node-selecting queries over trees”

ACM Transactions on Database Systems (TODS)
Complexity of two-variable logic on finite trees

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
The ontological key: automatically understanding and integrating forms to access the deep Web

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

This survey gives an overview of formal results on the XML query language XPath. We identify several important fragments of XPath, focusing on subsets of XPath 1.0. We then give results on the expressiveness of XPath and its fragments compared to other formalisms for querying trees, algorithms, and complexity bounds for evaluation of XPath queries, as well as static analysis of XPath queries.