Foundations of Relational Similarity-Based Query Language RESIQL

Kód výsledku v IS VaVaI

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

Výsledek na webu

<a href="http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6602450" target="_blank" >http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6602450</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Foundations of Relational Similarity-Based Query Language RESIQL

Popis výsledku v původním jazyce

We present a query language for similarity-based relational model of data with support of ordinal ranking and imperfect matches. The model utilized in this paper results from Codd's model of data by considering general residuated partially ordered scalesof degrees of satisfaction in place of the two-element Boolean scale implicitly used in the Codd model. As a result, we look at the traditional relational model of data from the perspective of general scales allowing us to represent partial matches of relational queries. From the data representation point of view, the basic structures representing both the stored data and results of queries are so-called ranked data tables, generalizing the ordinary data tables (relations). Compared to other approachesdealing with ranking and imperfect matches, ours has several benefits: (i) it is based on solid logical foundations-we do not introduce an additional ranking module on top of the Codd model but have all the necessary concepts as an integ

Název v anglickém jazyce

Foundations of Relational Similarity-Based Query Language RESIQL

Popis výsledku anglicky

We present a query language for similarity-based relational model of data with support of ordinal ranking and imperfect matches. The model utilized in this paper results from Codd's model of data by considering general residuated partially ordered scalesof degrees of satisfaction in place of the two-element Boolean scale implicitly used in the Codd model. As a result, we look at the traditional relational model of data from the perspective of general scales allowing us to represent partial matches of relational queries. From the data representation point of view, the basic structures representing both the stored data and results of queries are so-called ranked data tables, generalizing the ordinary data tables (relations). Compared to other approachesdealing with ranking and imperfect matches, ours has several benefits: (i) it is based on solid logical foundations-we do not introduce an additional ranking module on top of the Codd model but have all the necessary concepts as an integ

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

IEEE Symposium on Foundations of Computational Intelligence, FOCI 2013, Singapore, Singapore, April 16-19, 2013

ISBN

978-1-4673-5901-6

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

15-23

Název nakladatele

IEEE

Místo vydání

New York

Místo konání akce

Singapore

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

000332876700003