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

Result code in 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>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Query systems in similarity-based databases: logical foundations, expressive power, and completeness.
Original language description
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.
Czech name
—
Czech description
—

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

Article name in the collection
Proceedings of the 25th Symposium On Applied Computing
ISBN
978-1-60558-638-0
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
ACM Press
Place of publication
New York
Event location
Sierre, Švýcarsko
Event date
Mar 22, 2010
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—

Similar results(10)