Abstract
Database systems cope with the management of large groups of persistent data in a shared, reliable, effective, and efficient way.Within a database, a multiset (or bag) is a collection of elements of the same type that may contain duplicates. There exists a tight coupling between databases and multisets. First, a large varietyof data models explicitly support multiset constructors. Second, commercial relational database systems, even if founded on a formal data model which is set-oriented in nature, allows for the multiset-oriented manipulation of tables. Third, multiset processing in databases mayb e dictated byefficiencyreasons, as the cost of duplicate removal mayturn out to be prohibitive. Finally, even in a pure set-oriented conceptual framework, multiset processing mayturn out to be appropriate for optimization of queryev aluation. The mismatch between the relational model and standardized relational querylanguages has led researchers to provide a foundation to the manipulation of multisets. Other research has focused on extending the relational model byrelaxing the first normal form assumption, giving rise to the notion of a nested relation and to a corresponding nested relational algebra. These two research streams have been integrated within the concept of a complex relation, where diffierent types of constructors other than relation coexist, such as multiset and list. Several other database research areas cope with multiset processing, including view maintenance, data warehousing, and web information discovery.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul and N. Bidoit. Non-first-normal form relations to represent hierarchicallyorganized data. In Third ACM SIGMOD SIGACT Symposium on Principlesof Database Systems, 1984.
S. Abiteboul and N. Bidoit. Nonfirst normal form relations: An algebra allowingdata restructuring. Journal of Comp. and System Sc., 33(1):361–393, 1986.
S. Abiteboul, P.C. Fisher, and H.J. Schek, editors. Nested Relations and ComplexObjects in Databases. Number 361 in LNCS. Springer-Verlag, Berlin, Germany,1989.
S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley,Reading, MA, 1994.
J. Albert. Algebraic properties of bag data types. InG. M. Lohman, A. Sernadas,and R. Camps, editors, Seventeenth International Conference on Very Large DataBases, pages 211–219, Barcelona, Spain, 1991.
H. Arisawa, K. Moriya, and T. Miura. Operation and the properties on non-first-normal-form relational databases. In Ninth International Conference on VeryLarge data Bases, pages 197–204, Florence, Italy, 1983.
S. S. Bhowmick, S. K. Madria, W. K. Ng, and E.P. Lim. Webb ags-are theyuseful in a webw arehouse? In Fifth International Conference on Foundations of Data Organization, Kobe, Japan, 1998.
N. Bidoit. The Verso algebra or how to answer queries with fewer joins. Journal of Computer and System Sciences, 35(3):321–364, 1987.
V. Breazu-Tannen and R. Subrahmanyam. Logical and computational aspectsof programming with sets/bags/lists. In Eighteenth International Colloquium onAutomata, Languages, and Programming, number 510 in LNCS, Madrid, Spain,1991.
F. Cacace and G. Lamperti. Advanced Relational Programming, volume 371 of Mathematics and Its Applications. Kluwer Academic Publisher, Dordrecht, TheNetherlands, 1997.
L. Cardelli. Types for data-oriented languages. InJ. W. Schmidt, S. Ceri, and M. Missiko., editors, International Conference on Extending Database Technology,number 303 in LNCS, pages 1–15, Venice, Italy, 1988.
M. J. Carey, D. J. De Witt, and S. L. Vandenberg. A data model and query languagefor EXODUS. InH. Boral and P. Larson, editors, ACM SIGMOD InternationalConference of Management of Data, pages 413–423, Chicago, IL, 1988.
J. Celko. SQL for Smarties. Morgan-Kaufmann, San Francisco, CA, 1995.
S. Ceri, S. Crespi-Reghizzi, G. Lamperti, L. Lavazza, and R. Zicari. Algres: Anadvanced database system for complex applications. IEEE-Software, 7(4):68–78,1990.
D. D. Chamberlin, M. M. Astrahan, K. P. Eswaran, P. P. Griffiths, R. A. Lorie, J. W. Mehl, P. Reisner, and B. W. Wade. SEQUEL 2: A unified approach to datadefinition, manipulation, and control. IBM Journal of Research and Development,20(6):560–575, 1976.
E.F. Codd. A relational model for large shared data banks. Communications of the ACM, 13(6):377–387, 1970.
L.S. Colby. A recursive algebra and query optimization for nested relations. In ACM SIGMOD Conference on Management of Data, pages 273–283, Portland,OR, 1989.
P. Dadam, K. Küspert, F. Andersen, H. Blanken, R. Erbe, J. Günauer, V. Lum, P. Pistor, and G. Walch. A DBMS prototype to support extended NF2 relations:An integrated view on flat tables and hierarchies. In ACM SIGMOD Conferenceon Management of Data, pages 356–366, Washington, DC, 1986.
C. J. Date and H. Darwen. A Guide to the SQL Standard. Addison-Wesley,Reading, MA, 1993.
U. Dayal, N. Goodman, and R. H. Katz. An extended relational algebra withcontrol over duplicate elimination. In ACM Symposium on Principles of DatabaseSystems, pages 117–123, Los Angeles, CA, 1982.
V. Desphande and P.Å. Larson. An algebra for nested relations. Technical Report Research Report CS-87-65, University of Waterloo, Waterloo, Ontario, December1987.
P.C. Fischer and S.J. Thomas. Operators for non-first-normal-form relations. In Seventh International Computer Software Applications Conference, pages 464–475,Chicago, IL, 1983.
D. H. Fishman, D. Beech, H. P. Cate, E. C. Chow, T. Connors, J. W. Davis, N. Derrette, C. G. Hoch, W. Kent, P. Lyngbaek, B. Mahbod, M. A. Neimat, T. A. Ryan, and M.C. Shan. Iris: An object-oriented database management system.ACM Transactions on Information Systems, 5(1):48–69, 1987.
M. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-timehierarchy. Mathematical System Theory, 17:13–27, 1984.
T. Griffin and L. Libkin. Incremental maintenance of views with duplicates. InM. J. Carey and D. A. Schneider, editors, ACM SIGMOD International Conferenceon Management of Data, pages 328–339, San Jose, CA, 1995.
S. Grumbach, L. Libkin, T. Milo, and L. Wong. Query languages for bags: Expressivepower and complexity. SIGACTN: SIGACT News (ACM Special Interestroup on Automata and Computability Theory), 27, 1996.
S. Grumbach and T. Milo. Towards tractable algebras for bags. In Twelfth ACMSIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages49–58, Washington, DC, 1993.
M. Hammer and D. McLeod. Database description with SDM: A semantic databasemodel. ACM Transaction on Database Systems, 6(3):351–386, 1981.
G. Jaenschke. Recursive algebra for relations with relation valued attributes. Technical Report 85.03.002, Heidelberg Scientific Centre, IBM, Heidelberg, Germany,1985.
G. Jaenschke and H.J. Schek. Remarks on the algebra for non first normal formrelations. In First ACM SIGACT SIGMOD Symposium on Principles of DatabaseSystems, pages 124–138, 1982.
A. Klausner and N. Goodman. Multirelations-semantics and languages. InA. Pirotte and Y. Vassiliou, editors, Eleventh International Conference on Veryarge Data Bases, pages 251–258, Stockholm, Sweden, 1985.
A. Levy. Answering queries using views: A survey, 2000.http://www.cs.washington.edu/homes/alon/site/.les/view-survey.ps.
L. Libkin and L. Wong. Some properties of query languages for bags. InC. Beeri, A. Ohori, and D. Shasha, editors, Fourth International Workshop on Database ProgrammingLanguages — Object Models and Languages, Workshops in Computing,pages 97–114, New York, NY, 1993.
L. Libkin and L. Wong. Query languages for bags and aggregate functions. Journalof Computer and System Sciences, 55(2):241–272, 1997.
S. K. Madria, S. S. Bhowmick, W. K. Ng, and E. P. Lim. Research issues inwebdata mining. InM. K. Mohania and A. Min Tjoa, editors, Data Warehousingand Knowledge Discovery International Conference, pages 303–312, Florence, Italy,1999.
F. Manola and U. Dayal. PDM: An object-oriented data model. InK. R. Dittrich and U. Dayal, editors, International Workshop on Object-Oriented DatabaseSystems, pages 18–25, Pacific Grove, CA, 1986.
J. Melton and A. R. Simon. Understanding the New SQL: A Complete Guide.Morgan-Kaufmann, San Francisco, CA, 1993.
I. S. Mumick, H. Pirahesh, and R. Ramakrishnan. The magic of duplicates and aggregates.InD. McLeod, R. Sacks-Davis, and H. Schek, editors, Sixteenth International Conference on Very Large Data Bases, pages 264–277, Brisbane, Australia,1990.
G. Ozsoyoglu, Z.M. Ozsoyoglu, and V. Matos. Extending relational algebra andrelational calculus with set-valued attributes and aggregate functions. ACM Transactionson Database Systems, 12(4):566–592, 1987.
M.A. Roth, H.F. Korth, and A. Silberschatz. Extended algebra and calculus for ¬1NF relational databases. ACM Transactions on Database Systems, 13(4):389–417, 1988.
H.J. Scheck and M.H. Scholl. The relational model with relation-valued attributes.Information Systems, 11(2):137–147, 1986.
H.J. Schek and P. Pistor. Data structures for an integrated database managementand information retrieval systems. In Eighth International Conference on VeryLarge Data Bases, pages 197–207, Mexico City, Mexico, 1982.
M.H. Scholl, S. Abiteboul, F. Bancilhon, N. Bidoit, S. Gamerman, D. Plateau, P. Richard, and A. Verroust. Verso: A database machine based on nested relations.InS. Abiteboul, P.C. Fischer, and H.J. Schek, editors, Nested relations and complexobjects in databases, number 361 in LNCS. Springer-Verlag, Heidelberg, Germany,1989.
P. M. Schwarz, W. Chang, J. C. Freytag, G. M. Lohman, J. McPherson, C. Mohan, and H. Pirahesh. Extensibility in the Starburst database system. InK. R. Dittrich and U. Dayal, editors, roceedings of the International Workshop on Object-OrientedDatabase Systems, pages 85–92, Pacific Grove, CA, 1986.
D. W. Shipman. The functional data model and the data language DAPLEX.ACM Transaction on Database Systems, 6(1):140–173, 1981.
D. Srivastava, S. Dar, H. V. Jagadish, and A. Y. Levy. Answering queries withaggregation using views. InT. M. Vijayaraman, A. P. Buchmann, C. Mohan, and N. L. Sarda, editors, Twenty-second International Conference on Very Large DataBases, pages 318–329, Mumbai, India, 1996.
M. Stonebraker, E. Wong, P. Kreps, and G. Held. The design and implementationof INGRES. ACM Transaction on Database Systems, 1(3):189–222, 1976.
D. Suciu and V. Tannen. A query language for NC. In Thirteenth ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems, Minneapolis,Minnesota, 1994.
S. L. Vandenberg and D. J. DeWitt. Algebraic support for complex objects witharrays, identity, and inheritance. InJ. Clifford and R. King, editors, ACM SIGMOD International Conference on Management of Data, pages 158–167, Denver, CO,1991.
L. Wong. Normal form and conservative properties for query languages. In Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems,Washington, DC, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lamperti, G., Melchiori, M., Zanella, M. (2001). On Multisets in Database Systems. In: Calude, C.S., PĂun, G., Rozenberg, G., Salomaa, A. (eds) Multiset Processing. WMC 2000. Lecture Notes in Computer Science, vol 2235. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45523-X_9
Download citation
DOI: https://doi.org/10.1007/3-540-45523-X_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43063-6
Online ISBN: 978-3-540-45523-3
eBook Packages: Springer Book Archive