Relational queries computable in polynomial time
Information and Control
Languages that capture complexity classes
SIAM Journal on Computing
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Datalog extensions for database queries and updates
Journal of Computer and System Sciences
Handbook of theoretical computer science (vol. B)
ACM Transactions on Database Systems (TODS)
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
A query language for list-based complex objects
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Domain independence and the relational calculus
Acta Informatica
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Languages for relational databases over interpreted structures
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An expressive language for linear spatial database queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium 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
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An Improved Lower Bound for the Elementary Theories of Trees
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
First-Order Queries on Finite Structures Over the Reals
LICS '95 Proceedings of the 10th 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
String operations in query languages
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Applications of Alfred Tarski's Ideas in Database Theory
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Definable relations and first-order query languages over strings
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
On the complexity of nonrecursive XQuery and functional query languages on complex values
ACM Transactions on Database Systems (TODS)
Logical definability and query languages over ranked and unranked trees
ACM Transactions on Computational Logic (TOCL)
Specifying and Composing Non-functional Requirements in Model-Based Development
SC '09 Proceedings of the 8th International Conference on Software Composition
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
Hi-index | 0.00 |
We extend the traditional query languages by primitives for handling lists and trees. Our main results characterize the expressive power and data complexity of the following extended languages: (1) relational algebra with lists and trees, (2) nonrecursive Datalog@@@@ with lists and trees, (3) nonrecursive Prolog with lists and trees, (4) first-order logic over lists and trees.Languages (2)-(4) turn out to have the same expressive power; their range-restricted fragments have the same expressive power as (1). Every query in these languages is a boolean combination of range-restricted queries.We also prove that these query languages have polynomial data complexity under any “reasonable” encoding of inputs. Furthermore, under a natural encoding of inputs, languages (2)-(4) have the same expressive power as first-order logic over finite structures, therefore their data complexity is in A Co. Thus, the use of lists and trees in nonrecursive query languages gives no gain in the expressiveness. This contrasts with a huge difference between the nonelementary program complexity of extended languages (2)-(4) and the PSPA CE program complexity of their relational counterparts.Our results partly explain why lists and trees are not so widely used in nonrecursive query languages as other collection types.