Invariance to ordinal transformations in rank-aware databases

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F17%3A73581161" target="_blank" >RIV/61989592:15310/17:73581161 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.sciencedirect.com/science/article/pii/S0020025516313950" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0020025516313950</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ins.2016.10.044" target="_blank" >10.1016/j.ins.2016.10.044</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Invariance to ordinal transformations in rank-aware databases

Popis výsledku v původním jazyce

We study influence of ordinal transformations on results of queries in rank-aware databases which derive their operations with ranked relations from totally ordered structures of scores with infima acting as aggregation functions. We introduce notions of ordinal containment and equivalence of ranked relations and prove that infima-based algebraic operations with ranked relations are invariant to ordinal transformations: Queries applied to original and transformed data yield results which are equivalent in terms of the order given by scores, meaning that top-k results of queries remain the same. We show this important property is preserved in alternative query systems based of relational calculi developed in context of Gödel logic. We comment on relationship to monotone query evaluation and show that the results can be attained in alternative rank-aware approaches.

Název v anglickém jazyce

Invariance to ordinal transformations in rank-aware databases

Popis výsledku anglicky

We study influence of ordinal transformations on results of queries in rank-aware databases which derive their operations with ranked relations from totally ordered structures of scores with infima acting as aggregation functions. We introduce notions of ordinal containment and equivalence of ranked relations and prove that infima-based algebraic operations with ranked relations are invariant to ordinal transformations: Queries applied to original and transformed data yield results which are equivalent in terms of the order given by scores, meaning that top-k results of queries remain the same. We show this important property is preserved in alternative query systems based of relational calculi developed in context of Gödel logic. We comment on relationship to monotone query evaluation and show that the results can be attained in alternative rank-aware approaches.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA14-11585S" target="_blank" >GA14-11585S: Relační podobnostní databáze</a><br>

Návaznosti

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

Rok uplatnění

2017

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 periodika

Information Sciences

ISSN

0020-0255

e-ISSN

—

Svazek periodika

378

Číslo periodika v rámci svazku

FEB

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

24

Strana od-do

75-98

Kód UT WoS článku

000389095200005

EID výsledku v databázi Scopus

2-s2.0-84994619735