On Multisets in Database Systems

  • Authors:

  • Gianfranco Lamperti;Michele Melchiori;Marina Zanella

  • Affiliations:

  • -;-;-

  • Venue:
  • WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

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 different 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.