Publikation: Indexing the solution space : a new technique for nearest neighbor search in high-dimensional space
Dateien
Datum
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
DOI (zitierfähiger Link)
Internationale Patentnummer
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Publikationsstatus
Erschienen in
Zusammenfassung
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query processing. As recent theoretical results show, state of the art approaches to nearest-neighbor search are not efficient in higher dimensions. In our new approach, we therefore precompute the result of any nearest-neighbor search which corresponds to a computation of the Voronoi cell of each data point. In a second step, we store conservative approximations of the Voronoi cells in an index structure efficient for high-dimensional data spaces. As a result, nearest neighbor search corresponds to a simple point query on the index structure. Although our technique is based on a precomputation of the solution space, it is dynamic, i.e., it supports insertions of new data points. An extensive experimental evaluation of our technique demonstrates the high efficiency for uniformly distributed as well as real data. We obtained a significant reduction of the search time compared to nearest neighbor search in other index structures such as the X-tree.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
Schlagwörter
Konferenz
Rezension
Zitieren
ISO 690
BERCHTOLD, Stefan, Daniel A. KEIM, Hans-Peter KRIEGEL, Thomas SEIDL, 2000. Indexing the solution space : a new technique for nearest neighbor search in high-dimensional space. In: IEEE Transactions on Knowledge and Data Engineering. 2000, 12(1), pp. 45-57. ISSN 1041-4347. eISSN 1558-2191. Available under: doi: 10.1109/69.842249BibTex
@article{Berchtold2000Index-40847, year={2000}, doi={10.1109/69.842249}, title={Indexing the solution space : a new technique for nearest neighbor search in high-dimensional space}, number={1}, volume={12}, issn={1041-4347}, journal={IEEE Transactions on Knowledge and Data Engineering}, pages={45--57}, author={Berchtold, Stefan and Keim, Daniel A. and Kriegel, Hans-Peter and Seidl, Thomas} }
RDF
<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/40847"> <dc:creator>Berchtold, Stefan</dc:creator> <dcterms:title>Indexing the solution space : a new technique for nearest neighbor search in high-dimensional space</dcterms:title> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-12-06T08:00:51Z</dc:date> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/40847"/> <dcterms:abstract xml:lang="eng">Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query processing. As recent theoretical results show, state of the art approaches to nearest-neighbor search are not efficient in higher dimensions. In our new approach, we therefore precompute the result of any nearest-neighbor search which corresponds to a computation of the Voronoi cell of each data point. In a second step, we store conservative approximations of the Voronoi cells in an index structure efficient for high-dimensional data spaces. As a result, nearest neighbor search corresponds to a simple point query on the index structure. Although our technique is based on a precomputation of the solution space, it is dynamic, i.e., it supports insertions of new data points. An extensive experimental evaluation of our technique demonstrates the high efficiency for uniformly distributed as well as real data. We obtained a significant reduction of the search time compared to nearest neighbor search in other index structures such as the X-tree.</dcterms:abstract> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:language>eng</dc:language> <dc:creator>Kriegel, Hans-Peter</dc:creator> <dc:contributor>Berchtold, Stefan</dc:contributor> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-12-06T08:00:51Z</dcterms:available> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/> <dc:contributor>Seidl, Thomas</dc:contributor> <dc:contributor>Kriegel, Hans-Peter</dc:contributor> <foaf:homepage rdf:resource="http://localhost:8080/"/> <dc:creator>Seidl, Thomas</dc:creator> <dcterms:issued>2000</dcterms:issued> <dc:contributor>Keim, Daniel A.</dc:contributor> <dc:creator>Keim, Daniel A.</dc:creator> </rdf:Description> </rdf:RDF>