Abstract
bag Very loosely, a “set” that permits duplicates; more precisely, a collection of objects, called elements, in which the same element can appear any number of times. An example is the collection (y, y, x, z, y, z), which can equivalently be written as (x, y, y, y, z, z), since bags, like sets, have no ordering to their elements. The number of times a given element appears in a given bag is the multiplicity (of that element with respect to that bag).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 C. J. Date
About this chapter
Cite this chapter
(2008). B. In: The Relational Database Dictionary. Apress. https://doi.org/10.1007/978-1-4302-1042-9_2
Download citation
DOI: https://doi.org/10.1007/978-1-4302-1042-9_2
Publisher Name: Apress
Print ISBN: 978-1-4302-1041-2
Online ISBN: 978-1-4302-1042-9
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books