Problems complete for deterministic logarithmic space
Journal of Algorithms
Two applications of inductive counting for complementation problems
SIAM Journal on Computing
Properties that characterize LOGCFL
Journal of Computer and System Sciences
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
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 relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
XPath processing in a nutshell
ACM SIGMOD Record
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XPath query transformation based on XSLT stylesheets
WIDM '03 Proceedings of the 5th ACM international workshop on Web information and data management
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
ACM SIGMOD Record
Specifying access control policies for XML documents with XPath
Proceedings of the ninth ACM symposium on Access control models and technologies
The design of PaMaNet the Paderborn mobile ad-hoc network
Proceedings of the second international workshop on Mobility management & wireless access protocols
EXPedite: a system for encoded XML processing
Proceedings of the thirteenth ACM international conference on Information and knowledge management
The Lixto data extraction project: back and forth between theory and practice
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
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
Conjunctive queries over trees
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)
ACM Transactions on Database Systems (TODS)
Rewriting XPath queries using materialized views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Semantic characterizations of navigational XPath
ACM SIGMOD Record
Structural properties of XPath fragments
Theoretical Computer Science - Database theory
LiXQuery: a formal foundation for XQuery research
ACM SIGMOD Record
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Reformulating XPath queries and XSLT queries on XSLT views
Data & Knowledge Engineering
Rewriting nested XML queries using nested views
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Using reflection for querying XML documents
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
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
Machine models and lower bounds for query processing
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SPEX: Streamed and Progressive Evaluation of XPath
IEEE Transactions on Knowledge and Data Engineering
Efficiently Querying Large XML Data Repositories: A Survey
IEEE Transactions on Knowledge and Data Engineering
On testing satisfiability of tree pattern queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Evaluation of partial path queries on xml data
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Online evaluation of regular tree queries
Nordic Journal of Computing
Structured materialized views for XML queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Data & Knowledge Engineering
On the expressibility of functions in XQuery fragments
Information Systems
A general approach to securely querying XML
Computer Standards & Interfaces
Applying model-checking to solve queries on semistructured data
Computer Languages, Systems and Structures
XML Methods for Validation of Temporal Properties on Message Traces with Data
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
Journal of Logic, Language and Information
To do or not to do: metadata-guided query evaluation in content caching networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Machine models for query processing
ACM SIGMOD Record
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
On the expressive power of XQuery fragments
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
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
Search tree patterns for mobile and distributed XML processing
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
The complexity of querying external memory and streaming data
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Web and semantic web query languages: a survey
Proceedings of the First international conference on Reasoning Web
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
Relational index support for XPath axes
XSym'05 Proceedings of the Third international conference on Database and XML Technologies
MemBeR: a micro-benchmark repository for XQuery
XSym'05 Proceedings of the Third international conference on Database and XML Technologies
Query translation for XPath-based security views
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Towards algebraic query optimisation for XQuery
Journal on Data Semantics VII
An ETL process for OLAP using RDF/OWL ontologies
Journal on Data Semantics XIII
Tree automata and XPath on compressed trees
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Semantic navigation on the web of data: specification of routes, web fragments and actions
Proceedings of the 21st international conference on World Wide Web
Hi-index | 0.00 |
In this paper, we study the precise complexity of XPath 1.0 query processing. Even though heavily used by its incorporation into a variety of XML-related standards, the precise cost of evaluating an XPath query is not yet wellunderstood. The first polynomial-time algorithm for XPath processing (with respect to combined complexity) was proposed only recently, and even to this day all major XPath engines take time exponential in the size of the input queries. From the standpoint of theory, the precise complexity of XPath query evaluation is open, and it is thus unknown whether the query evaluation problem can be parallelized.In this work, we show that both the data complexity and the query complexity of XPath 1.0 fall into lower (highly parallelizable) complexity classes, but that 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.