Typing and querying XML documents: some complexity bounds

Authors:
Luc Segoufin
Affiliations:
INRIA, France
Venue:
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Year:
2003

Citing 28
Cited 18

The Boolean formula value problem is in ALOGTIME

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Problems complete for deterministic logarithmic space

Journal of Algorithms
Two applications of inductive counting for complementation problems

SIAM Journal on Computing
On the relative complexity of some languages in NC

Information Processing Letters
On uniformity within NC1

Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Properties that characterize LOGCFL

Journal of Computer and System Sciences
A note on the space complexity of some decision problems for finite automata

Information Processing Letters
A logspace algorithm for tree canonization (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Counting quantifiers, successor relations, and logarithmic space

Journal of Computer and System Sciences - special issue on complexity theory
Your mediators need data conversion!

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
One-unambiguous regular languages

Information and Computation
Trips on trees

Acta Cybernetica
Parenthesis Grammars

Journal of the ACM (JACM)
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

Journal of the ACM (JACM)
On the Tape Complexity of Deterministic Context-Free Languages

Journal of the ACM (JACM)
DTD inference for views of XML data

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of acyclic conjunctive queries

Journal of the ACM (JACM)
Introduction to Circuit Complexity: A Uniform Approach

Introduction to Circuit Complexity: A Uniform Approach
Validating streaming XML documents

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Handbook of Formal Languages

Handbook of Formal Languages
Incremental Validation of XML Documents

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Tree-Walking Pebble Automata

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
XPath: Looking Forward

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

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Typechecking for Semistructured Data

DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
The complexity of XPath query evaluation

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Semistructured Data: From Practice to Theory

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Efficient algorithms for processing XPath queries

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases

The complexity of XPath query evaluation

Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient Incremental Validation of XML Documents

ICDE '04 Proceedings of the 20th 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
The complexity of XPath query evaluation and XML typing

Journal of the ACM (JACM)
On the complexity of nonrecursive XQuery and functional query languages on complex values

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)
Structural properties of XPath fragments

Theoretical Computer Science - Database theory
The complexity of tree automata and XPath on grammar-compressed trees

Theoretical Computer Science - Implementation and application of automata
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
Incremental validation of string-based XML data in databases, file systems, and streams

ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
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
The complexity of querying external memory and streaming data

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Efficient incremental validation of XML documents after composite updates

XSym'06 Proceedings of the 4th international conference on Database and XML Technologies
Tree automata and XPath on compressed trees

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the complexity bound of validating XML documents, viewed as labeled unranked ordered trees, against various typing systems like DTDs, XML schemas, tree automata ... We also consider query evaluation complexities for various fragments of XPath. For both problems, validation and query evaluation, we consider data and combined complexity bounds.