Query systems in similarity-based databases: logical foundations, expressive power, and completeness.

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F10%3A10216467" target="_blank" >RIV/61989592:15310/10:10216467 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Query systems in similarity-based databases: logical foundations, expressive power, and completeness.

Popis výsledku v původním jazyce

We present logical foundations for an extension of Codd's relational model of data which aims at utilizing various aspects of similarity. This paper argues that solid foundations for similarity-based databases can be developed in a conceptually sound way. We outline the foundations and propose two query systems for similarity-based databases: a domain relational calculus (DRC) and a relational algebra (RA). We compare the expressive power of DRC and RA in our model and prove relational completeness of RA over DRC. A major implication of the paper is that similarity-based data querying can be made an integral part of an extended, similarity-based, relational model of data which is based on first-order predicate logics using residuated structures of truth values in much the same way as the querying in the Codd's model is based on the classic first-order predicate logic.

Název v anglickém jazyce

Query systems in similarity-based databases: logical foundations, expressive power, and completeness.

Popis výsledku anglicky

We present logical foundations for an extension of Codd's relational model of data which aims at utilizing various aspects of similarity. This paper argues that solid foundations for similarity-based databases can be developed in a conceptually sound way. We outline the foundations and propose two query systems for similarity-based databases: a domain relational calculus (DRC) and a relational algebra (RA). We compare the expressive power of DRC and RA in our model and prove relational completeness of RA over DRC. A major implication of the paper is that similarity-based data querying can be made an integral part of an extended, similarity-based, relational model of data which is based on first-order predicate logics using residuated structures of truth values in much the same way as the querying in the Codd's model is based on the classic first-order predicate logic.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2010

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

Proceedings of the 25th Symposium On Applied Computing

ISBN

978-1-60558-638-0

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

—

Název nakladatele

ACM Press

Místo vydání

New York

Místo konání akce

Sierre, Švýcarsko

Datum konání akce

22. 3. 2010

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

CST - Celostátní akce

Kód UT WoS článku

—