Semiring-annotated data

Abstract

We present an overview of the literature on querying semiring-annotated data, a notion we introduced five years ago in a paper with Val Tannen. First, we show that positive relational algebra calculations for various forms of annotated relations, as well as provenance models for such queries, are particular cases of the same general algorithm involving commutative semirings. For this reason, we present a formal framework for answering queries on data with annotations from commutative semirings, and propose a comprehensive provenance representation based on semirings of polynomials. We extend these considerations to XQuery views over annotated, unordered XML data, and show that the semiring framework suffices for a large positive fragment of XQuery applied to such data. Finally, we conclude with a brief overview of the large body of work that builds upon these results, including both extensions to the theoretical foundations and uses in practical applications. * Portions of this column were adapted from joint work with Val Tannen [19] and Nate Foster and Val Tannen [12].Database Principles Column. Column editor:

Language-integrated provenance

“…Semiring provenance has been extended to nested relational calculus and X [Foster et al, 2008], aggregations [Amsterdamer et al, 2011b], difference [Amsterdamer et al, 2011a], and negation [Köhler et al, 2013]. For even more on semiring provenance, see recent surveys of the literature [Green and Tannen, 2017;Karvounarakis and Green, 2012].…”