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
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 catalog of complexity classes
Handbook of theoretical computer science (vol. A)
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
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
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
Acta Cybernetica
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
Incremental Validation of XML Documents
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
Quilt: An XML Query Language for Heterogeneous Data Sources
Selected papers from the Third International Workshop WebDB 2000 on The World Wide Web and Databases
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
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of XPath query evaluation
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
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
Conjunctive queries over trees
Journal of the ACM (JACM)
Processing queries on tree-structured data efficiently
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient evaluation of n-ary conjunctive queries over trees and graphs
WIDM '06 Proceedings of the 8th annual ACM international workshop on Web information and data management
On the complexity of nonrecursive XQuery and functional query languages on complex values
ACM Transactions on Database Systems (TODS)
The complexity of tree automata and XPath on grammar-compressed trees
Theoretical Computer Science - Implementation and application of automata
Logical definability and query languages over ranked and unranked trees
ACM Transactions on Computational Logic (TOCL)
On the minimization of XML Schemas and tree automata for unranked trees
Journal of Computer and System Sciences
The complexity of query containment in expressive fragments of XPath 2.0
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reasoning about XML update constraints
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Using a relational database for scalable XML search
The Journal of Supercomputing
Data flow testing of service-oriented workflow applications
Proceedings of the 30th international conference on Software engineering
Distributed XML processing: Theory and applications
Journal of Parallel and Distributed Computing
ACM Computing Surveys (CSUR)
Proceedings of the 12th International Conference on Database Theory
Reasoning about XML update constraints
Journal of Computer and System Sciences
The complexity of query containment in expressive fragments of XPath 2.0
Journal of the ACM (JACM)
Efficient algorithms for descendant-only tree pattern queries
Information Systems
Controlling Access to XML Documents over XML Native and Relational Databases
SDM '09 Proceedings of the 6th VLDB Workshop on Secure Data Management
Worst-case optimal algorithm for XPath evaluation over XML streams
Journal of Computer and System Sciences
Tractable database design and datalog abduction through bounded treewidth
Information Systems
Efficient algorithms for the tree homeomorphism problem
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Conjunctive query containment over trees
DBPL'07 Proceedings of the 11th international conference on Database programming languages
XML data management and XPath evaluation in wireless sensor networks
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
ACM Transactions on Database Systems (TODS)
XPath whole query optimization
Proceedings of the VLDB Endowment
Conjunctive query containment over trees
Journal of Computer and System Sciences
Memory lower bounds for XPath evaluation over XML streams
Journal of Computer and System Sciences
Combining temporal logics for querying XML documents
ICDT'07 Proceedings of the 11th international conference on Database Theory
Automata for positive core XPath queries on compressed documents
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Logics for unranked trees: an overview
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A formal comparison of visual web wrapper generators
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
MultiCrawler: a pipelined architecture for crawling and indexing semantic web data
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Deciding twig-definability of node selecting tree automata
Proceedings of the 15th International Conference on Database Theory
Optimising XML---RDF data integration: a formal approach to improve XSPARQL efficiency
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
Hi-index | 0.00 |
We study the complexity of two central XML processing problems. The first is XPath 1.0 query processing, which has been shown to be in PTIME in previous work. We prove that both the data complexity and the query complexity of XPath 1.0 fall into lower (highly parallelizable) complexity classes, while the combined complexity is PTIME-hard. Subsequently, we study the sources of this hardness and identify a large and practically important fragment of XPath 1.0 for which the combined complexity is LOGCFL-complete and, therefore, in the highly parallelizable complexity class NC2. The second problem is the complexity of validating XML documents against various typing schemes like Document Type Definitions (DTDs), XML Schema Definitions (XSDs), and tree automata, both with respect to data and to combined complexity. For data complexity, we prove that validation is in LOGSPACE and depends crucially on how XML data is represented. For the combined complexity, we show that the complexity ranges from LOGSPACE to LOGCFL, depending on the typing scheme.