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 relationship between the depth of bag nesting and the expressive power, and (ii) the relationship between the algebraic operations, and their complexity and expressive power. 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]  Jan Van den Bussche,et al.  The expressive power of structured values in pure OODB's , 1991, PODS 1991.

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

[3]  Phokion G. Kolaitis,et al.  Generalized Quantifiers and Pebble Games on Finite Structures , 1995, Ann. Pure Appl. Log..

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

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

[6]  Serge Abiteboul,et al.  Papers from the Workshop ``Theory and Applications of Nested Relations and Complex Objects' on Nested Relations and Complex Objects , 1987 .

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

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

[9]  Stéphane Grumbach,et al.  Query Languages with Counters , 1992, ICDT.

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

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

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

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

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

[15]  Victor Vianu,et al.  Tractable query languages for complex object databases , 1991, ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems.

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

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

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

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

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

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

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

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

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

[25]  E. Lander,et al.  Describing Graphs: A First-Order Approach to Graph Canonization , 1990 .

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