The relational model with relation-valued attributes
Information Systems
Languages that capture complexity classes
SIAM Journal on Computing
A recursive algebra for nested relations
Information Systems
ACM SIGACT News
The expressiveness of a family of finite set languages
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)
Converting nested algebra expressions into flat algebra expressions
ACM Transactions on Database Systems (TODS)
Normal forms and conservative properties for query languages over collection types
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Towards tractable algebras for bags
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimization of real conjunctive queries
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finite-model theory—a personal perspective
ICDT Selected papers of the 4th international conference on Database theory
Low-complexity aggregation in GraphLog and Datalog
ICDT Selected papers of the 4th international conference on Database theory
Conservativity of nested relational calculi with internal generic functions
Information Processing Letters
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Naturally Embedded Query Languages
ICDT '92 Proceedings of the 4th International Conference on Database Theory
Some Properties of Query Languages for Bags
DBLP-4 Proceedings of the Fourth International Workshop on Database Programming Languages - Object Models and Languages
Aggregate Functions, Conservative Extensions, and Linear Orders
DBLP-4 Proceedings of the Fourth International Workshop on Database Programming Languages - Object Models and Languages
Normalizing incomplete databases
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Incremental maintenance of views with duplicates
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A query language for multidimensional arrays: design, implementation, and optimization techniques
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Query languages for bags: expressive power and complexity
ACM SIGACT News
Verifiable properties of database transactions
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the containment and equivalence of database queries with linear constraints (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Pushing extrema aggregates to optimize logic queries
Information Systems
The power of languages for the manipulation of complex values
The VLDB Journal — The International Journal on Very Large Data Bases
A Foundation for Conventional and Temporal Query Optimization Addressing Duplicates and Ordering
IEEE Transactions on Knowledge and Data Engineering
A Framework for the Investigation of Aggregate Functions in Database Queries
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Equivalence of nested queries with mixed semantics
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Towards algebraic query optimisation for XQuery
Journal on Data Semantics VII
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
Hi-index | 0.00 |
We provide new techniques for the analysis of the expressive power of query languages for nested collections. These languages may use set or bag semantics and may be further complicated by the presence of aggregate functions. We exhibit certain classes of graphs and prove that the properties of these graphs that can be tested in such languages are either finite or cofinite. This result settles the conjectures of Grumbach, Milo, and Paredaens that parity test, transitive closure, and balanced binary tree test are not expressible in bag languages like the PTIME fragment of BALG of Grumbach and Milo and BQL of Libkin and Wong. Moreover, it implies that many recursive queries, including simple ones like the test for a chain, cannot be expressed in a nested relational language even when aggregate functions are available. In an attempt to generalize the finite-cofiniteness result, we study the bounded degree property which says that the number of distinct in- and out-degrees in the output of a graph query does not depend on the size of the input if the input is “simple”. We show that such a property implies a number of inexpressibility results in a uniform fashion. We then prove the bounded degree property for the nested relational language.