Fragments of Bag Relational Algebra: Expressiveness and Certain Answers

Research output: Contribution to journalArticlepeer-review

Abstract

While all relational database systems are based on the bag data model, much of theoretical research still views relations as sets. Recent attempts to provide theoretical foundations for modern data management problems under the bag semantics concentrated on applications that need to deal with incomplete relations, i.e., relations populated by constants and nulls. Our goal is to provide a complete characterization of the complexity of query answering over such relations in fragments of bag relational algebra.

The main challenges that we face are twofold. First, bag relational algebra has more operations than its set analog (e.g., additive union, max-union, min-intersection, duplicate elimination) and the relationship between various fragments is not fully known. Thus we first fill this gap. Second, we look at query answering over incomplete data, which again is more complex than in the set case: rather than certainty and possibility of answers, we now have numerical information about occurrences of tuples. We then fully classify the complexity of finding this information in all the fragments of bag relational algebra.
Original languageEnglish
Article number101604
Number of pages36
JournalInformation Systems
Volume105
Early online date22 Jul 2020
DOIs
Publication statusPublished - 1 Mar 2022

Keywords

  • Bag semantics
  • Relational algebra
  • Expressivity
  • Certain answers
  • Complexity

Fingerprint

Dive into the research topics of 'Fragments of Bag Relational Algebra: Expressiveness and Certain Answers'. Together they form a unique fingerprint.

Cite this