Fast Parallel Similarity Search in Multimedia Databases

Zitieren

Dateien zu dieser Ressource

Prüfsumme: MD5:2641c4f47022b7406cc4fe8cb9230f89

BERCHTOLD, Stefan, Christian BÖHM, Bernhard BRAUNMÜLLER, Daniel A. KEIM, Hans-Peter KRIEGEL, 1997. Fast Parallel Similarity Search in Multimedia Databases. the 1997 ACM SIGMOD international conference. Tucson, Arizona, United States, 11. Mai 1997 - 15. Mai 1997. In: Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97. the 1997 ACM SIGMOD international conference. Tucson, Arizona, United States, 11. Mai 1997 - 15. Mai 1997. New York, New York, USA:ACM Press, pp. 1-12. ISBN 0-89791-911-4

@inproceedings{Berchtold1997Paral-5776, title={Fast Parallel Similarity Search in Multimedia Databases}, year={1997}, doi={10.1145/253260.253263}, isbn={0-89791-911-4}, address={New York, New York, USA}, publisher={ACM Press}, booktitle={Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD '97}, pages={1--12}, author={Berchtold, Stefan and Böhm, Christian and Braunmüller, Bernhard and Keim, Daniel A. and Kriegel, Hans-Peter} }

<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/5776"> <dcterms:title>Fast Parallel Similarity Search in Multimedia Databases</dcterms:title> <dc:creator>Kriegel, Hans-Peter</dc:creator> <dc:contributor>Böhm, Christian</dc:contributor> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:02Z</dc:date> <dc:format>application/pdf</dc:format> <dc:creator>Berchtold, Stefan</dc:creator> <dc:contributor>Keim, Daniel A.</dc:contributor> <dc:contributor>Braunmüller, Bernhard</dc:contributor> <dcterms:issued>1997</dcterms:issued> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/5776"/> <dc:language>eng</dc:language> <dc:creator>Keim, Daniel A.</dc:creator> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2011-03-24T16:00:02Z</dcterms:available> <dc:creator>Braunmüller, Bernhard</dc:creator> <dcterms:bibliographicCitation>First publ. in: Proceedings of the 1997 ACM SIGMOD international conference on Management of data, 1997, pp. 1-12</dcterms:bibliographicCitation> <dcterms:rights rdf:resource="https://creativecommons.org/licenses/by-nc-nd/2.0/legalcode"/> <dc:contributor>Kriegel, Hans-Peter</dc:contributor> <dc:contributor>Berchtold, Stefan</dc:contributor> <dcterms:abstract xml:lang="eng">Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature space which is computationally very intensive. In this paper, we present a new parallel method for fast nearest-neighbor search in high-dimensional feature spaces. The core problem of designing a parallel nearestneighbor algorithm is to find an adequate distribution of the data onto the disks. Unfortunately, the known declustering methods do not perform well for high-dimensional nearest-neighbor search. In contrast, our method has been optimized based on the special properties of high-dimensional spaces and therefore provides a near-optimal distribution of the data items among the disks. The basic idea of our data declustering technique is to assign the buckets corresponding to different quadrants of the data space to different disks. We show that our technique - in contrast to other declustering methods - guarantees that all buckets corresponding to neighboring quadrants are assigned to different disks. We evaluate our method using large amounts of real data (up to 40 MBytes) and compare it with the best known data declustering method, the Hilbert curve. Our experiments show that our method provides an almost linear speed-up and a constant scale-up. Additionally, it outperforms the Hilbert approach by a factor of up to 5.</dcterms:abstract> <dc:creator>Böhm, Christian</dc:creator> <dc:rights>deposit-license</dc:rights> </rdf:Description> </rdf:RDF>

Dateiabrufe seit 01.10.2014 (Informationen über die Zugriffsstatistik)

sigmod97_para_final_web.pdf 178

Das Dokument erscheint in:

deposit-license Solange nicht anders angezeigt, wird die Lizenz wie folgt beschrieben: deposit-license

KOPS Suche


Stöbern

Mein Benutzerkonto