All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Foundations of Relational Similarity-Based Query Language RESIQL

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Foundations of Relational Similarity-Based Query Language RESIQL

  • Original language description

    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

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP103%2F11%2F1456" target="_blank" >GAP103/11/1456: Foundations of Similarity-Based Data Processing</a><br>

  • Continuities

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

Others

  • Publication year

    2013

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

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

  • ISBN

    978-1-4673-5901-6

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    15-23

  • Publisher name

    IEEE

  • Place of publication

    New York

  • Event location

    Singapore

  • Event date

    Apr 16, 2013

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000332876700003