ACM Home Page
Please provide us with feedback. Feedback
Towards tractable algebras for bags
Full text PdfPdf (1.02 MB)
Source Symposium on Principles of Database Systems archive
Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems table of contents
Washington, D.C., United States
Pages: 49 - 58  
Year of Publication: 1993
ISBN:0-89791-593-3
Authors
Stéphane Grumbach  I.N.R.I.A., Le Chesnay, France
Tova Milo  Univ. of Toronto, Toronto, Ont., Canada
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 26,   Citation Count: 15
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/153850.153855
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
AB87
 
AFS89
 
Alb91
 
BK90
BM92
BM93
BP91
 
BTS91
CDV88
 
CH80
A. Chandra and D. Harel. Computable Queries for Relational Data Bases. Journal of Computer and System Sciences, 21(2):156- 178, Oct. 1980.
DGK82
 
Fag75
R. Fagin. Monadic generalized spectra. Zeitschrift fur Mathematische Logik and Grand. der Math., 21:89-96, 1975.
 
FGT93
G. Fayolle, S. Grumbach, and C. Tollu. Asymptotic probabilities of languages with generalized quantifiers. In Proc. IEEE Syrup. of Logic in Computer Science, Montreal, June 1993.
 
Fis87
D.H. Fishman. et al. Iris: An object oriented database management system. In A CM Trans. Office Information Systems, 5:1, 1987.
 
GT92
 
GV90
GV91
HM81
HS88
HS89
 
IL90
N. Immerman and E. Lander. Complexity Theory Retrospective, chapter Describing Graphs : A First-Order Approach to Graph Canonization, pages 59-81. Springer Verlag, Ed. A. Selman, 1990.
 
KG85
A. Klausner and N. Goodman. Multirelations semantics and languages. In Proc. 11th Intl. Conf. on Very Large Databases, Stockholm, Sweden, 1985.
 
KV92
P. Kolaitis and J.A. V#in#nen. Generalized quantifiers and pebble games on finite structures. In Proc. 7th Syrup. of Logic in Computer Science, 1992.
 
MD86
 
Mum90
PvG88

CITED BY  15


REVIEW

"Riccardo Torlone : Reviewer"

The relational model, which is the foundation of current database management systems (DBMSs), describes information using sets of tuples, so duplicates are not allowed. Nevertheless, relational DBMSs have often been designed to allow duplicate  more...

Collaborative Colleagues:
Stéphane Grumbach: colleagues
Tova Milo: colleagues