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 division in rank-aware databases

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F16%3A33160158" target="_blank" >RIV/61989592:15310/16:33160158 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.sciencedirect.com/science/article/pii/S0020025516303097" target="_blank" >http://www.sciencedirect.com/science/article/pii/S0020025516303097</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.ins.2016.02.060" target="_blank" >10.1016/j.ins.2016.02.060</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Relational division in rank-aware databases

  • Original language description

    We present a survey of existing approaches to relational division in rank-aware databases, discuss issues of the present approaches, and outline generalizations of several types of classic division-like operations. We work in a model which generalizes the Codd model of data by considering tuples in relations annotated by ranks, indicating degrees to which tuples in relations match queries. The approach utilizes complete residuated lattices as the basic structures of degrees. We argue that unlike the classic model, relational divisions are fundamental operations which cannot in general be expressed by means of other operations. In addition, we compare the existing and proposed operations and identify those which are faithful counterparts of universally quantified queries formulated in relational calculi. We introduce Pseudo Tuple Calculus in the ranked model which is further used to show mutual definability of the various forms of divisions presented in the paper.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GA14-11585S" target="_blank" >GA14-11585S: Relational Similarity-Based Databases</a><br>

  • Continuities

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

Others

  • Publication year

    2016

  • 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

  • Name of the periodical

    Information Sciences

  • ISSN

    0020-0255

  • e-ISSN

  • Volume of the periodical

    366

  • Issue of the periodical within the volume

    OCT

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    22

  • Pages from-to

    48-69

  • UT code for WoS article

    000380068900004

  • EID of the result in the Scopus database

    2-s2.0-84973341478