Towards Tractable Algebras for Bags

Bags, i.e., sets with duplicates, are often used to implement relations in database systems. In this paper, we study the expressive power of algebras for manipulating bags. The algebra we present is a simple extension of the nested relation algebra. Our aim is to investigate how the use of bags in the language extends its expressive power and increases its complexity. We consider two main issues, namely (i) the impact of the depth of bag nesting on the expressive power and (ii) the complexity and the expressive power induced by the algebraic operations. We show that the bag algebra is more expressive than the nested relation algebra (at all levels of nesting), and that the difference may be subtle. We establish a hierarchy based on the structure of algebra expressions. This hierarchy is shown to be highly related to the properties of the powerset operator.

[1]  Gabriel M. Kuper,et al.  On the Complexity of Queries in the Logical Data Model , 1993, Theor. Comput. Sci..

[2]  Victor Vianu,et al.  Tractable query languages for complex object databases , 1991, PODS '91.

[3]  Dennis McLeod,et al.  Database description with SDM: a semantic database model , 1981, TODS.

[4]  Joseph Albert,et al.  Algebraic Properties of Bag Data Types , 1991, VLDB.

[5]  Stéphane Grumbach,et al.  On the Expressive Power of Counting , 1995, Theor. Comput. Sci..

[6]  Gabriel M. Kuper,et al.  On the Complexity of Queries in the Logical Data Model (Extended Abstract) , 1988, ICDT.

[7]  Randy H. Katz,et al.  An extended relational algebra with control over duplicate elimination , 1982, PODS.

[8]  Nathan Goodman,et al.  Multirelations - Semantics and Languages , 1998 .

[9]  Patrick C. Fischer,et al.  Nested Relational Structures , 1986, Adv. Comput. Res..

[10]  Marc Gyssens,et al.  The powerset algebra as a result of adding programming constructs to the nested relational algebra , 1988, SIGMOD '88.

[11]  Limsoon Wong,et al.  Normal forms and conservative properties for query languages over collection types , 1993, PODS.

[12]  Martin Otto,et al.  Inductive Definability with Counting on Finite Structures , 1992, CSL.

[13]  Marc Gyssens,et al.  The Powerset Algebra as a Natural Tool to Handle Nested Database Relations , 1992, J. Comput. Syst. Sci..

[14]  Tova Milo,et al.  Calculi for Bags and their Complexity , 1993, DBPL.

[15]  Limsoon Wong,et al.  Naturally Embedded Query Languages , 1992, ICDT.

[16]  Nathan Goodman,et al.  Multirelations - Semantice and Languages , 1985, VLDB.

[17]  Saharon Shelah,et al.  Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[18]  Limsoon Wong,et al.  New techniques for studying set languages, bag languages and aggregate functions , 1994, PODS '94.

[19]  Catriel Beeri,et al.  Algebraic Optimization of Object-Oriented Query Languages , 1990, Theor. Comput. Sci..

[20]  Tova Milo,et al.  Towards tractable algebras for bags , 1993, PODS '93.

[21]  G. Fayolle,et al.  Asymptotic probabilities of languages with generalized quantifiers , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[22]  Dirk Van Gucht,et al.  Possibilities and limitations of using flat operators in nested algebra expressions , 1988, PODS '88.

[23]  Jan Van den Bussche,et al.  The expressive power structured values in pure OODB's (extended abstract) , 1991, PODS '91.

[24]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[25]  Limsoon Wong,et al.  Aggregate Functions, Conservative Extensions, and Linear Orders , 1993, DBPL.

[26]  Tova Milo,et al.  An Algebra for Pomsets , 1995, ICDT.

[27]  Ronald Fagin,et al.  Monadic generalized spectra , 1975, Math. Log. Q..

[28]  Catriel Beeri,et al.  On the power of languages for manipulation of complex objects , 1987, VLDB 1987.

[29]  Surajit Chaudhuri,et al.  Optimization of real conjunctive queries , 1993, PODS '93.

[30]  Catriel Beeri,et al.  Functional and predictive programming in OODB's , 1992, PODS '92.

[31]  Hamid Pirahesh,et al.  The Magic of Duplicates and Aggregates , 1990, VLDB.

[32]  Val Tannen,et al.  Logical and Computational Aspects of Programming with Sets/Bags/Lists , 1991, ICALP.

[33]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[34]  Catriel Beeri,et al.  On the power of algebras with recursion , 1993, SIGMOD '93.

[35]  Serge Abiteboul,et al.  Generic Computation and its complexity , 1991, STOC '91.

[36]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[37]  Jianwen Su,et al.  On the expressive power of database queries with intermediate types , 1988, PODS '88.

[38]  Ming-Chien Shan,et al.  Iris: An Object-Oriented Database Management System , 1989, ACM Trans. Inf. Syst..

[39]  Phokion G. Kolaitis,et al.  Fixpoint logic vs. infinitary logic in finite-model theory , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[40]  A. Selman,et al.  Complexity theory retrospective II , 1998 .

[41]  Gabriel M. Kuper,et al.  A new approach to database logic , 1984, PODS.

[42]  Limsoon Wong,et al.  Some Properties of Query Languages for Bags , 1993, DBPL.

[43]  Serge Abiteboul,et al.  Nested Relations and Complex Objects in Databases , 1989, Lecture Notes in Computer Science.

[44]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[45]  Dan Suciu.  Bounded Fixpoints for Complex Objects , 1993 .

[46]  A. Ehrenfeucht.  An application of games to the completeness problem for formalized theories , 1961 .

[47]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[48]  Jianwen Su,et al.  Untyped sets, invention, and computable queries , 1989, PODS '89.

[49]  David J. DeWitt,et al.  A data model and query language for EXODUS , 1988, SIGMOD '88.

[50]  Umeshwar Dayal,et al.  PDM: An Object-Oriented Data Model , 1986, OODBS.