Relational similarity-based model of data part 1: foundations and query systems

Kód výsledku v IS VaVaI

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

Výsledek na webu

<a href="http://dx.doi.org/10.1080/03081079.2017.1357550" target="_blank" >http://dx.doi.org/10.1080/03081079.2017.1357550</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1080/03081079.2017.1357550" target="_blank" >10.1080/03081079.2017.1357550</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Relational similarity-based model of data part 1: foundations and query systems

Popis výsledku v původním jazyce

We present a general rank-aware model of data which supports handling of similarity in relational databases. The model is based on the assumption that in many cases it is desirable to replace equalities on values in data tables by similarity relations expressing degrees to which the values are similar. In this context, we study various phenomena which emerge in the model, including similarity-based queries and similarity-based data dependencies. Central notion in our model is that of a ranked data table over domains with similarities which is our counterpart to the notion of relation on relation scheme from the classical relational model. We present fundamentals of the formal model and two equivalent query systems which are analogues of the classical relational algebra and domain relational calculus with range declarations. In the sequel to this paper, we deal with similarity-based dependencies.

Název v anglickém jazyce

Relational similarity-based model of data part 1: foundations and query systems

Popis výsledku anglicky

We present a general rank-aware model of data which supports handling of similarity in relational databases. The model is based on the assumption that in many cases it is desirable to replace equalities on values in data tables by similarity relations expressing degrees to which the values are similar. In this context, we study various phenomena which emerge in the model, including similarity-based queries and similarity-based data dependencies. Central notion in our model is that of a ranked data table over domains with similarities which is our counterpart to the notion of relation on relation scheme from the classical relational model. We present fundamentals of the formal model and two equivalent query systems which are analogues of the classical relational algebra and domain relational calculus with range declarations. In the sequel to this paper, we deal with similarity-based dependencies.

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/EE2.3.20.0059" target="_blank" >EE2.3.20.0059: Reintegrace českého vědce a vytvoření špičkového týmu v informačních vědách</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

International Journal of General Systems

ISSN

0308-1079

e-ISSN

—

Svazek periodika

46

Číslo periodika v rámci svazku

7

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

81

Strana od-do

671-751

Kód UT WoS článku

000409551400001

EID výsledku v databázi Scopus

2-s2.0-85026918653