The relational model has recently been extended to so-called K-relations in which tuples are assigned a unique value in a semiring K A query language, denoted by RA(K)(+), similar to the classical positive relational algebra, allows for the querying of K-relations In this paper, we define more expressive query languages for K-relations that extend RA(K)(+) with the difference and constant annotations operations on annotated tuples The latter are natural extensions of the duplicate elimination operator of the relational algebra on bags We investigate conditions on semirings under which these operations can be added to RA(K)(+) in a natural way, and establish basic properties of the resulting query languages Moreover, we show how the provenance semiring of Green et al. can be extended to record provenance of data in the presence of difference and constant annotations Finally, we investigate the completeness of RA(K)(+) and extensions thereof in the sense of Bancilhon and Paredaens (C) 2009 Elsevier B V All rights reserved

On database query languages for K-relations / Geerts, Floris; Poggi, Antonella. - In: JOURNAL OF APPLIED LOGIC. - ISSN 1570-8683. - 8:2(2010), pp. 173-185. (Intervento presentato al convegno Logic in Databases Workshop 2009 tenutosi a Rome, ITALY nel MAY 19-20, 2008) [10.1016/j.jal.2009.09.001].

On database query languages for K-relations

POGGI, Antonella
2010

Abstract

The relational model has recently been extended to so-called K-relations in which tuples are assigned a unique value in a semiring K A query language, denoted by RA(K)(+), similar to the classical positive relational algebra, allows for the querying of K-relations In this paper, we define more expressive query languages for K-relations that extend RA(K)(+) with the difference and constant annotations operations on annotated tuples The latter are natural extensions of the duplicate elimination operator of the relational algebra on bags We investigate conditions on semirings under which these operations can be added to RA(K)(+) in a natural way, and establish basic properties of the resulting query languages Moreover, we show how the provenance semiring of Green et al. can be extended to record provenance of data in the presence of difference and constant annotations Finally, we investigate the completeness of RA(K)(+) and extensions thereof in the sense of Bancilhon and Paredaens (C) 2009 Elsevier B V All rights reserved
2010
annotations; language completeness; provenance; query language; relational model
01 Pubblicazione su rivista::01a Articolo in rivista
On database query languages for K-relations / Geerts, Floris; Poggi, Antonella. - In: JOURNAL OF APPLIED LOGIC. - ISSN 1570-8683. - 8:2(2010), pp. 173-185. (Intervento presentato al convegno Logic in Databases Workshop 2009 tenutosi a Rome, ITALY nel MAY 19-20, 2008) [10.1016/j.jal.2009.09.001].
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/340471
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 54
  • ???jsp.display-item.citation.isi??? 32
social impact