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

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

Namespace Prefixes

PrefixIRI
n6http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n20http://localhost/temp/predkladatel/
n17http://purl.org/net/nknouf/ns/bibtex#
n11http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/resource/domain/vavai/projekt/
n7http://linked.opendata.cz/ontology/domain/vavai/
n12http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F09%3A00029661%21RIV10-GA0-14330___/
n18https://schema.org/
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/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F09%3A00029661%21RIV10-GA0-14330___
rdf:type
n7:Vysledek skos:Concept
dcterms:description
Metric space as a universal and versatile model of similarity can be applied in various areas of non-text information retrieval. However, a general, efficient and scalable solution for metric data management is still a resisting research challenge. We introduce a novel indexing and searching mechanism called Metric Index (M-Index), that employs practically all known principles of metric space partitioning, pruning and filtering. The heart of the M-Index is a general mapping mechanism that enables to actually store the data in well-established structures such as the B+-tree or even in a distributed storage. We have implemented the M-Index with B+-tree and performed experiments on a combination of five MPEG-7 descriptors in a database of hundreds of thousands digital images. The experiments put under test several M-Index variants and compare them with two orthogonal approaches - the PM-Tree and the iDistance. Metric space as a universal and versatile model of similarity can be applied in various areas of non-text information retrieval. However, a general, efficient and scalable solution for metric data management is still a resisting research challenge. We introduce a novel indexing and searching mechanism called Metric Index (M-Index), that employs practically all known principles of metric space partitioning, pruning and filtering. The heart of the M-Index is a general mapping mechanism that enables to actually store the data in well-established structures such as the B+-tree or even in a distributed storage. We have implemented the M-Index with B+-tree and performed experiments on a combination of five MPEG-7 descriptors in a database of hundreds of thousands digital images. The experiments put under test several M-Index variants and compare them with two orthogonal approaches - the PM-Tree and the iDistance.
dcterms:title
Metric Index: An Efficient and Scalable Solution for Similarity Search Metric Index: An Efficient and Scalable Solution for Similarity Search
skos:prefLabel
Metric Index: An Efficient and Scalable Solution for Similarity Search Metric Index: An Efficient and Scalable Solution for Similarity Search
skos:notation
RIV/00216224:14330/09:00029661!RIV10-GA0-14330___
n3:aktivita
n19:P
n3:aktivity
P(GA201/09/0683)
n3:dodaniDat
n8:2010
n3:domaciTvurceVysledku
n11:8876398 n11:3445771
n3:druhVysledku
n21:D
n3:duvernostUdaju
n14:S
n3:entitaPredkladatele
n12:predkladatel
n3:idSjednocenehoVysledku
326014
n3:idVysledku
RIV/00216224:14330/09:00029661
n3:jazykVysledku
n10:eng
n3:klicovaSlova
metric space; similarity search; data structure; approximation; scalability
n3:klicoveSlovo
n5:metric%20space n5:scalability n5:similarity%20search n5:approximation n5:data%20structure
n3:kontrolniKodProRIV
[7BB6F05C1F48]
n3:mistoKonaniAkce
Prague, Czech Republic
n3:mistoVydani
Washington, DC, USA
n3:nazevZdroje
Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
n3:obor
n15:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n9:GA201%2F09%2F0683
n3:rokUplatneniVysledku
n8:2009
n3:tvurceVysledku
Batko, Michal Novák, David
n3:typAkce
n6:WRD
n3:zahajeniAkce
2009-01-01+01:00
s:numberOfPages
9
n17:hasPublisher
IEEE Computer Society
n18:isbn
978-0-7695-3765-8
n20:organizacniJednotka
14330