Languages for Bags

Abstract

In this paper we study theoretical foundations for programming with bags. We fully determine the strength of many polynomial bag operators relative to an ambient query language. Then picking the strongest combination of these operators we obtain the yardstick nested bag query language NBL(monus, unique). The relationship between nested relational algebra… (More)

2 Figures and Tables

Topics

  • Presentations referencing similar topics