Relational algebra for multi-ranked similarity-based databases

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F13%3A33148383" target="_blank" >RIV/61989592:15310/13:33148383 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/FOCI.2013.6602448" target="_blank" >http://dx.doi.org/10.1109/FOCI.2013.6602448</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/FOCI.2013.6602448" target="_blank" >10.1109/FOCI.2013.6602448</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Relational algebra for multi-ranked similarity-based databases

Popis výsledku v původním jazyce

We present multi-ranked relational model of data which extends the classic Codd's model by considering similarity relations on domains and ranks assigned to values of tuples. The ranks represent degrees to which values in tuples match similarity-based queries. Unlike various single-ranked similarity-based database models where ranks are assigned to whole tuples, in the present model the ranks are assigned to tuple values. As a consequence, the multi-ranked model allows users to directly observe how values in tuples contribute to results of similarity-based queries. We present foundations of the model, relational operations and relational algebra as the primary query language, and its relationship to single-ranked models which have been used in the past. We argue that the multi-ranked model is more suitable for applications in which data analysts require a finer view on results of queries than in the single-ranked model.

Název v anglickém jazyce

Relational algebra for multi-ranked similarity-based databases

Popis výsledku anglicky

We present multi-ranked relational model of data which extends the classic Codd's model by considering similarity relations on domains and ranks assigned to values of tuples. The ranks represent degrees to which values in tuples match similarity-based queries. Unlike various single-ranked similarity-based database models where ranks are assigned to whole tuples, in the present model the ranks are assigned to tuple values. As a consequence, the multi-ranked model allows users to directly observe how values in tuples contribute to results of similarity-based queries. We present foundations of the model, relational operations and relational algebra as the primary query language, and its relationship to single-ranked models which have been used in the past. We argue that the multi-ranked model is more suitable for applications in which data analysts require a finer view on results of queries than in the single-ranked model.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP103%2F11%2F1456" target="_blank" >GAP103/11/1456: Základy pro zpracování dat s využitím podobností</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2013

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Foundations of Computational Intelligence (FOCI), 2013 IEEE Symposium on

ISBN

978-1-4673-5900-9

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

1-8

Název nakladatele

Institute of Electrical and Electronics Engineers (IEEE)

Místo vydání

Singapur

Místo konání akce

Singapur, Singapur

Datum konání akce

16. 4. 2013

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—