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”

Relational algebra for multi-ranked similarity-based databases

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Relational algebra for multi-ranked similarity-based databases

  • Original language description

    We present multi-ranked relational model of data which extends the classic Codd's model by considering similarity relations on domains and ranks assigned to values of tuples. The ranks represent degrees to which values in tuples match similarity-based queries. Unlike various single-ranked similarity-based database models where ranks are assigned to whole tuples, in the present model the ranks are assigned to tuple values. As a consequence, the multi-ranked model allows users to directly observe how values in tuples contribute to results of similarity-based queries. We present foundations of the model, relational operations and relational algebra as the primary query language, and its relationship to single-ranked models which have been used in the past. We argue that the multi-ranked model is more suitable for applications in which data analysts require a finer view on results of queries than in the single-ranked model.

  • 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

    Foundations of Computational Intelligence (FOCI), 2013 IEEE Symposium on

  • ISBN

    978-1-4673-5900-9

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    1-8

  • Publisher name

    Institute of Electrical and Electronics Engineers (IEEE)

  • Place of publication

    Singapur

  • Event location

    Singapur, Singapur

  • Event date

    Apr 16, 2013

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article