This HTML5 document contains 39 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n20http://purl.org/net/nknouf/ns/bibtex#
n18http://localhost/temp/predkladatel/
n19http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n10http://linked.opendata.cz/ontology/domain/vavai/
n17https://schema.org/
n12http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989592%3A15310%2F06%3A00002583%21RIV10-MSM-15310___/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989592%3A15310%2F06%3A00002583%21RIV10-MSM-15310___
rdf:type
skos:Concept n10:Vysledek
dcterms:description
We present an extension of Codd's relational model of data. Our extension is motivated by similarity-based querying. It consists in equipping each domain of attribute values with a similarity relation and in modifying the classical relational model in order to account for issues generated by adding similarities. As a counterpart to data tables over a set of domains of Codd's model, we introduce ranked data tables over domains with similarities. We present a relational algebra, and tuple and domain calculi for our model and prove their equivalence. An interesting point is that our relational algebra contains operations like \mathrm{top}_k (k best results matching a query). Then, we study functional dependencies extended by similarities, argue that they form a new type of data dependency not captured by the classical model, prove a completeness result w.r.t. Armstrong-like rules, describe non-redundant bases and provide an algorithm for computing the bases. In addition to that, we compare our We present an extension of Codd's relational model of data. Our extension is motivated by similarity-based querying. It consists in equipping each domain of attribute values with a similarity relation and in modifying the classical relational model in order to account for issues generated by adding similarities. As a counterpart to data tables over a set of domains of Codd's model, we introduce ranked data tables over domains with similarities. We present a relational algebra, and tuple and domain calculi for our model and prove their equivalence. An interesting point is that our relational algebra contains operations like \mathrm{top}_k (k best results matching a query). Then, we study functional dependencies extended by similarities, argue that they form a new type of data dependency not captured by the classical model, prove a completeness result w.r.t. Armstrong-like rules, describe non-redundant bases and provide an algorithm for computing the bases. In addition to that, we compare our
dcterms:title
Relational model of data over domains with similarities: an extension for similarity queries and knowledge extraction. Relational model of data over domains with similarities: an extension for similarity queries and knowledge extraction.
skos:prefLabel
Relational model of data over domains with similarities: an extension for similarity queries and knowledge extraction. Relational model of data over domains with similarities: an extension for similarity queries and knowledge extraction.
skos:notation
RIV/61989592:15310/06:00002583!RIV10-MSM-15310___
n3:aktivita
n13:Z
n3:aktivity
Z(MSM6198959214)
n3:dodaniDat
n6:2010
n3:domaciTvurceVysledku
n19:9623264 n19:1236784
n3:druhVysledku
n16:D
n3:duvernostUdaju
n8:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
497063
n3:idVysledku
RIV/61989592:15310/06:00002583
n3:jazykVysledku
n15:eng
n3:klicovaSlova
Relational model; domains with similarities; similarity queries; knowledge extraction.
n3:klicoveSlovo
n5:domains%20with%20similarities n5:knowledge%20extraction. n5:similarity%20queries n5:Relational%20model
n3:kontrolniKodProRIV
[FC224D309BF8]
n3:mistoVydani
New York
n3:nazevZdroje
The 2006 IEEE International Conference Information Reuse and Integration
n3:obor
n14:BD
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:rokUplatneniVysledku
n6:2006
n3:tvurceVysledku
Vychodil, Vilém Bělohlávek, Radim
n3:zamer
n12:MSM6198959214
s:numberOfPages
1500
n20:hasPublisher
IEEE Computer Society Press
n17:isbn
0-7803-9788-6
n18:organizacniJednotka
15310