On accessing object-oriented databases: expressive power, complexity, and restrictions
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Tractable query languages for complex object databases
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Towards tractable algebras for bags
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of queries in the logical data model
ICDT Selected papers of the 4th international conference on Database theory
Algebraic and calculus query languages for recursively typed complex objects
PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Principles of programming with complex objects and collection types
ICDT '92 Selected papers of the fourth international conference on Database theory
Normal forms and conservative extension properties for query languages over collection types
Journal of Computer and System Sciences
Query languages for bags: expressive power and complexity
ACM SIGACT News
Query languages for bags and aggregate functions
Journal of Computer and System Sciences - Special issue on principles of database systems
Complexity of nonrecursive logic programs with complex values
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Possibilities and limitations of using flat operators in nested algebra expressions
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Journal of the ACM (JACM)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
A new approach to database logic
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Remarks on the algebra of non first normal form relations
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
The power of languages for the manipulation of complex values
The VLDB Journal — The International Journal on Very Large Data Bases
Naturally Embedded Query Languages
ICDT '92 Proceedings of the 4th International Conference on Database Theory
Space Usage in Functional Query Languages
ICDT '95 Proceedings of the 5th International Conference on Database Theory
Complexity of Query Answering in Logic Databases with Complex Values
LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science
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
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
A transducer-based XML query processor
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
The BEA/XQRL streaming XQuery processor
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Using reflection for querying XML documents
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
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)
Attribute grammars for scalable query processing on XML streams
The VLDB Journal — The International Journal on Very Large Data Bases
Completing queries: rewriting of incomplete web queries under schema constraints
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Behavioral simulations in MapReduce
Proceedings of the VLDB Endowment
Structural recursion on ordered trees and list-based complex objects
ICDT'07 Proceedings of the 11th international conference on Database Theory
Interpreting tree-to-tree queries
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
On the expressive power of XQuery fragments
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
Towards algebraic query optimisation for XQuery
Journal on Data Semantics VII
Hi-index | 0.00 |
This paper studies the complexity of evaluating functional query languages for complex values such as monad algebra and the recursion-free fragment of XQuery.We show that monad algebra with equality restricted to atomic values is complete for the class TA[2o(n), O(n)] of problems solvable in linear exponential time with a linear number of alternations. The monotone fragment of monad algebra with atomic value equality but without negation is complete for nondeterministic exponential time. For monad algebra with deep equality, we establish TA[2o(n), O(n)] lower and exponential-space upper bounds.Then we study a fragment of XQuery, Core XQuery, that seems to incorporate all the features of a query language on complex values that are traditionally deemed essential. A close connection between monad algebra on lists and Core XQuery (with "child" as the only axis) is exhibited, and it is shown that these languages are expressively equivalent up to representation issues. We show that Core XQuery is just as hard as monad algebra w.r.t. combined complexity, and that it is in TC0 if the query is assumed fixed.