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

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

Namespace Prefixes

PrefixIRI
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F08%3A00025336%21RIV10-GA0-14330___/
dctermshttp://purl.org/dc/terms/
n14http://localhost/temp/predkladatel/
n13http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n6http://linked.opendata.cz/resource/domain/vavai/projekt/
n10http://linked.opendata.cz/ontology/domain/vavai/
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#
n16http://linked.opendata.cz/ontology/domain/vavai/riv/vyuzitiJinymSubjektem/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n11http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F08%3A00025336%21RIV10-GA0-14330___
rdf:type
skos:Concept n10:Vysledek
dcterms:description
D-index is an index structure which is able to search in data modelled as a metric space. This structure is static with respect to the number of buckets and levels, so the split functions must be designed before the D-index is instantiated and loaded with data. When this prerequisite is fulfiled, the D-index is capable of storing nearly %22unlimited%22 number of data objects due to the elasticity of individual buckets. In particular, buckets are capable of storing theoretically any amount of data. D-index is an index structure which is able to search in data modelled as a metric space. This structure is static with respect to the number of buckets and levels, so the split functions must be designed before the D-index is instantiated and loaded with data. When this prerequisite is fulfiled, the D-index is capable of storing nearly %22unlimited%22 number of data objects due to the elasticity of individual buckets. In particular, buckets are capable of storing theoretically any amount of data.
dcterms:title
D-index: Distance Index D-index: Distance Index
skos:prefLabel
D-index: Distance Index D-index: Distance Index
skos:notation
RIV/00216224:14330/08:00025336!RIV10-GA0-14330___
n3:aktivita
n18:P
n3:aktivity
P(GP201/07/P240)
n3:dodaniDat
n11:2010
n3:domaciTvurceVysledku
n13:3540324 n13:3165647
n3:druhVysledku
n5:R
n3:duvernostUdaju
n7:S
n3:entitaPredkladatele
n17:predkladatel
n3:idSjednocenehoVysledku
363696
n3:idVysledku
RIV/00216224:14330/08:00025336
n3:interniIdentifikace
D-index
n3:jazykVysledku
n15:eng
n3:klicovaSlova
D-index; index structure; similarity searching; metric space; similarity query; hashing
n3:klicoveSlovo
n8:hashing n8:similarity%20searching n8:D-index n8:index%20structure n8:similarity%20query n8:metric%20space
n3:kontrolniKodProRIV
[B5DADE5A02C1]
n3:lokalizaceVysledku
Fakulta informatiky, Masarykovy univerzity
n3:obor
n12:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n6:GP201%2F07%2FP240
n3:rokUplatneniVysledku
n11:2008
n3:technickeParametry
A centralized index structure for similarity searching in multimedia data modelled as a metric space
n3:tvurceVysledku
Dohnal, Vlastislav Zezula, Pavel
n3:vlastnik
n17:vlastnikVysledku
n3:vyuzitiJinymSubjektem
n16:N
n14:organizacniJednotka
14330