Processing queries on tree-structured data efficiently

Authors:
Christoph Koch
Affiliations:
Saarland University, Saarbrücken, Germany
Venue:
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Year:
2006

Citing 59
Cited 9

LTUR: a simplified linear-time unit resolution algorithm for Horn formulae and computer implementation

Information Processing Letters
Decidable optimization problems for database logic programs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
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)
Polynomial graph-colorings

Discrete Applied Mathematics
Limits to parallel computation: P-completeness theory

Limits to parallel computation: P-completeness theory
Catching the boat with Strudel: experiences with a Web-site management system

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
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
Building intelligent web applications using lightweight wrappers

Data & Knowledge Engineering - Special issue on heterogeneous information resources need semantic access
The complexity of acyclic conjunctive queries

Journal of the ACM (JACM)
Complexity and expressive power of logic programming

ACM Computing Surveys (CSUR)
Validating streaming XML documents

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
Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
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
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
Efficient Filtering of XML Documents for Selective Dissemination of Information

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Visual Web Information Extraction with Lixto

Proceedings of the 27th 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
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
XML queries and algebra in the Enosys integration platform

Data & Knowledge Engineering - Special issue: Data integration over the Web
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
Constraint Processing

Constraint Processing
ViST: a dynamic index method for querying XML data by tree structures

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
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
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)
Archiving scientific data

ACM Transactions on Database Systems (TODS)
Accelerating XPath evaluation in any RDBMS

ACM Transactions on Database Systems (TODS)
PRIX: Indexing And Querying XML Using Prüfer Sequences

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
ORDPATHs: insert-friendly XML node labels

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
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)
Vectorizing and Querying Large XML Repositories

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Full-Fledged Algebraic XPath Processing in Natix

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
On the memory requirements of XPath evaluation over XML streams

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)
XML data exchange: consistency and query answering

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)
An Insider's Guide to Logic in Telecommunications Data

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Conjunctive queries over trees

Journal of the ACM (JACM)
Attribute grammars for scalable query processing on XML streams

The VLDB Journal — The International Journal on Very Large Data Bases
Efficient algorithms for processing XPath queries

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
MARS: a system for publishing XML from mixed and redundant storage

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
Holistic twig joins on indexed XML documents

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Schema-based scheduling of event processors and buffer minimization for queries on structured data streams

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
XQuery on SQL hosts

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Tight lower bounds for query processing on streaming and external memory data

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
First order paths in ordered trees

ICDT'05 Proceedings of the 10th international conference on Database Theory
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

Using a relational database for scalable XML search

The Journal of Supercomputing
Structural summaries for efficient XML query processing

Ph.D. '08 Proceedings of the 2008 EDBT Ph.D. workshop
Efficient provenance storage over nested data collections

Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
A methodology for coupling fragments of XPath with structural indexes for XML documents

Information Systems
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization

BNCOD 26 Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier
A methodology for coupling fragments of XPath with structural indexes for XML documents

DBPL'07 Proceedings of the 11th international conference on Database programming languages
Efficient enumeration for conjunctive queries over x-underbar structures

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Combining temporal logics for querying XML documents

ICDT'07 Proceedings of the 11th international conference on Database Theory
Structural tractability of enumerating CSP solutions

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that compute nodes or tuples of nodes—conjunctive queries, first-order queries, datalog, and XPath. I also point out a number of connections among previous results that have not been observed before.