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

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

Namespace Prefixes

PrefixIRI
n10http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F06%3A00015399%21RIV10-AV0-14330___/
n14http://localhost/temp/predkladatel/
n3http://purl.org/net/nknouf/ns/bibtex#
n12http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n6http://linked.opendata.cz/resource/domain/vavai/projekt/
n9http://linked.opendata.cz/ontology/domain/vavai/
n17https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n5http://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#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n21http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F06%3A00015399%21RIV10-AV0-14330___
rdf:type
n9:Vysledek skos:Concept
dcterms:description
The problem of similarity searching is nowadays attracting a lot of attention, because upcoming applications process complex data and the traditional exact match searching is not sufficient. There are efficient solutions, but they are tailored for the needs of specific data domains. General solutions, based on the metric space abstraction, are extensible, but they are designed to operate on a single computer only. Therefore, their scalability is limited and they cannot adapt to different performance requirements. In this paper, we propose a distributed access structure which is fully dynamic and exploits a Grid infrastructure. We study properties of this structure in numerous experiments. Besides, the performance tuning is analyzed with respect to user-specific requirements which include the maximum response time and the number of queries executed concurrently. The problem of similarity searching is nowadays attracting a lot of attention, because upcoming applications process complex data and the traditional exact match searching is not sufficient. There are efficient solutions, but they are tailored for the needs of specific data domains. General solutions, based on the metric space abstraction, are extensible, but they are designed to operate on a single computer only. Therefore, their scalability is limited and they cannot adapt to different performance requirements. In this paper, we propose a distributed access structure which is fully dynamic and exploits a Grid infrastructure. We study properties of this structure in numerous experiments. Besides, the performance tuning is analyzed with respect to user-specific requirements which include the maximum response time and the number of queries executed concurrently.
dcterms:title
M-Grid: Similarity Searching in Grids M-Grid: Similarity Searching in Grids
skos:prefLabel
M-Grid: Similarity Searching in Grids M-Grid: Similarity Searching in Grids
skos:notation
RIV/00216224:14330/06:00015399!RIV10-AV0-14330___
n5:aktivita
n21:P
n5:aktivity
P(1ET100300419)
n5:dodaniDat
n15:2010
n5:domaciTvurceVysledku
n12:3540324 n12:8876398 n12:3165647
n5:druhVysledku
n18:D
n5:duvernostUdaju
n8:S
n5:entitaPredkladatele
n13:predkladatel
n5:idSjednocenehoVysledku
485605
n5:idVysledku
RIV/00216224:14330/06:00015399
n5:jazykVysledku
n16:eng
n5:klicovaSlova
similarity searching; metric space; M-Grid; D-index; performance analysis
n5:klicoveSlovo
n7:metric%20space n7:performance%20analysis n7:D-index n7:similarity%20searching n7:M-Grid
n5:kontrolniKodProRIV
[2866C8577457]
n5:mistoKonaniAkce
Arlington, VA, USA
n5:mistoVydani
Arlington
n5:nazevZdroje
Proceedings of International Workshop on Information Retrieval in Peer-to-Peer Networks, ACM CIKM 2006
n5:obor
n20:IN
n5:pocetDomacichTvurcuVysledku
3
n5:pocetTvurcuVysledku
3
n5:projekt
n6:1ET100300419
n5:rokUplatneniVysledku
n15:2006
n5:tvurceVysledku
Batko, Michal Dohnal, Vlastislav Zezula, Pavel
n5:typAkce
n10:WRD
n5:zahajeniAkce
2006-01-01+01:00
s:numberOfPages
8
n3:hasPublisher
ACM Press
n17:isbn
1-59593-531-2
n14:organizacniJednotka
14330