About: Relational model of data over domains with similarities: an extension for similarity queries and knowledge extraction.     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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 (en)
  • Prezentace výsledků studia relačního modelu dat na doménách s podobnostmi, rozšíření pro podobnostní dotazy a extrakci znalostí. (cs)
Title
  • Relational model of data over domains with similarities: an extension for similarity queries and knowledge extraction.
  • Relační model dat na doménách s podobnostmi: rozšíření pro podobnostní dotazy a extrakci znalostí (cs)
  • Relational model of data over domains with similarities: an extension for similarity queries and knowledge extraction. (en)
skos:prefLabel
  • Relational model of data over domains with similarities: an extension for similarity queries and knowledge extraction.
  • Relační model dat na doménách s podobnostmi: rozšíření pro podobnostní dotazy a extrakci znalostí (cs)
  • Relational model of data over domains with similarities: an extension for similarity queries and knowledge extraction. (en)
skos:notation
  • RIV/61989592:15310/06:00002583!RIV07-AV0-15310___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1ET101370417)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 497064
http://linked.open...ai/riv/idVysledku
  • RIV/61989592:15310/06:00002583
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Relational model; domains with similarities; similarity queries; knowledge extraction. (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...i/riv/kodPristupu
http://linked.open...ontrolniKodProRIV
  • [DF1434695FAD]
http://linked.open...telVyzkumneZpravy
  • IEEE Computer Society Press
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Bělohlávek, Radim
  • Vychodil, Vilém
https://schema.org/isbn
  • 0-7803-9788-6
http://localhost/t...ganizacniJednotka
  • 15310
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software