About: Similarity Searching: Towards Bulk-loading Peer-to-Peer Networks

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Similarity Searching: Towards Bulk-loading Peer-to-Peer Networks 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)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Due to the exponential growth of digital data and its complexity, we need a technique which allows us to search such collections efficiently. A suitable solution is based on the peer-to-peer (P2P) network paradigm and the metric-space model of similarity. When a large volume of data is being inserted, the P2P network must expand to new peers in order to maintain its efficiency. Thus, many peers must be split. During a peer split, the data is halved and one half is migrated to a new peer. In this paper, we study the problem of peer splits and propose a specialized algorithm for speeding it up. In particular, we use the structured P2P network called the M-Chord. Search performance within a single peer is enhanced by the M-tree. In experimental evaluation, we compare the proposed algorithm with several straightforward solutions on a real network organizing 10 million images. Our algorithm provides a significant performance boost. Due to the exponential growth of digital data and its complexity, we need a technique which allows us to search such collections efficiently. A suitable solution is based on the peer-to-peer (P2P) network paradigm and the metric-space model of similarity. When a large volume of data is being inserted, the P2P network must expand to new peers in order to maintain its efficiency. Thus, many peers must be split. During a peer split, the data is halved and one half is migrated to a new peer. In this paper, we study the problem of peer splits and propose a specialized algorithm for speeding it up. In particular, we use the structured P2P network called the M-Chord. Search performance within a single peer is enhanced by the M-tree. In experimental evaluation, we compare the proposed algorithm with several straightforward solutions on a real network organizing 10 million images. Our algorithm provides a significant performance boost. (en)
Title	Similarity Searching: Towards Bulk-loading Peer-to-Peer Networks Similarity Searching: Towards Bulk-loading Peer-to-Peer Networks (en)
skos:prefLabel	Similarity Searching: Towards Bulk-loading Peer-to-Peer Networks Similarity Searching: Towards Bulk-loading Peer-to-Peer Networks (en)
skos:notation	RIV/00216224:14330/08:00024136!RIV10-GA0-14330___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(1ET100300419), P(GP201/07/P240)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Sedmidubský, Jan Zezula, Pavel Novák, David Dohnal, Vlastislav
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	394733
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/08:00024136
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	similarity search; p2p network; peer split; index structure (en)
http://linked.open.../riv/klicoveSlovo	similarity search index structure p2p network peer split
http://linked.open...ontrolniKodProRIV	[2C45425DBEFE]
http://linked.open...v/mistoKonaniAkce	Cancun, Mexico
http://linked.open...i/riv/mistoVydani	Los Alamitos CA, Washington, Tokyo
http://linked.open...i/riv/nazevZdroje	1st International Workshop on Similarity Search and Applications (SISAP 2008)
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	4 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	Intelligent Models, Algorithms, Methods and Tools for the Semantic Web (realization) Distributed index structures for similarity searching
http://linked.open...UplatneniVysledku	2008
http://linked.open...iv/tvurceVysledku	Novák, David Sedmidubský, Jan Zezula, Pavel Dohnal, Vlastislav
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000255509900010
http://linked.open.../riv/zahajeniAkce	2008-04-11 (xsd:date)
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE Computer Society
https://schema.org/isbn	978-0-7695-3101-4
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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