Subspace similarity search: Efficient k-NN queries in arbitrary subspaces

Thomas Bernecker*, Tobias Emrich, Franz Graf, Hans Peter Kriegel, Peer Kröger, Matthias Renz, Erich Schubert, Arthur Zimek

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Abstract

There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, only. While much research has been done in efficient support of single column similarity queries or of similarity queries in the full space, scarcely any support of similarity search in subspaces has been provided so far. The three existing approaches are variations of the sequential scan. Here, we propose the first index-based solution to subspace similarity search in arbitrary subspaces.

Original languageEnglish
Title of host publicationScientific and Statistical Database Management - 22nd International Conference, SSDBM 2010, Proceedings
PublisherSpringer
Publication date3. Aug 2010
Pages555-564
ISBN (Print)978-3-642-13817-1
ISBN (Electronic)978-3-642-13818-8
DOIs
Publication statusPublished - 3. Aug 2010
Externally publishedYes
Event22nd International Conference on Scientific and Statistical Database Management - Heidelberg, Germany
Duration: 30. Jun 20102. Jul 2010

Conference

Conference22nd International Conference on Scientific and Statistical Database Management
CountryGermany
CityHeidelberg
Period30/06/201002/07/2010
SponsorHeidelberg University , Heidelberg Institute for Theoretical Studies (HITS)
SeriesLecture Notes in Computer Science
Volume6187
ISSN0302-9743

Cite this

Bernecker, T., Emrich, T., Graf, F., Kriegel, H. P., Kröger, P., Renz, M., ... Zimek, A. (2010). Subspace similarity search: Efficient k-NN queries in arbitrary subspaces. In Scientific and Statistical Database Management - 22nd International Conference, SSDBM 2010, Proceedings (pp. 555-564). Springer. Lecture Notes in Computer Science, Vol.. 6187 https://doi.org/10.1007/978-3-642-13818-8_38
Bernecker, Thomas ; Emrich, Tobias ; Graf, Franz ; Kriegel, Hans Peter ; Kröger, Peer ; Renz, Matthias ; Schubert, Erich ; Zimek, Arthur. / Subspace similarity search : Efficient k-NN queries in arbitrary subspaces. Scientific and Statistical Database Management - 22nd International Conference, SSDBM 2010, Proceedings. Springer, 2010. pp. 555-564 (Lecture Notes in Computer Science, Vol. 6187).
@inproceedings{c70524156b294c85ad2c6b6fd0d24551,
title = "Subspace similarity search: Efficient k-NN queries in arbitrary subspaces",
abstract = "There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, only. While much research has been done in efficient support of single column similarity queries or of similarity queries in the full space, scarcely any support of similarity search in subspaces has been provided so far. The three existing approaches are variations of the sequential scan. Here, we propose the first index-based solution to subspace similarity search in arbitrary subspaces.",
author = "Thomas Bernecker and Tobias Emrich and Franz Graf and Kriegel, {Hans Peter} and Peer Kr{\"o}ger and Matthias Renz and Erich Schubert and Arthur Zimek",
year = "2010",
month = "8",
day = "3",
doi = "10.1007/978-3-642-13818-8_38",
language = "English",
isbn = "978-3-642-13817-1",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "555--564",
booktitle = "Scientific and Statistical Database Management - 22nd International Conference, SSDBM 2010, Proceedings",
address = "Germany",

}

Bernecker, T, Emrich, T, Graf, F, Kriegel, HP, Kröger, P, Renz, M, Schubert, E & Zimek, A 2010, Subspace similarity search: Efficient k-NN queries in arbitrary subspaces. in Scientific and Statistical Database Management - 22nd International Conference, SSDBM 2010, Proceedings. Springer, Lecture Notes in Computer Science, vol. 6187, pp. 555-564, 22nd International Conference on Scientific and Statistical Database Management, Heidelberg, Germany, 30/06/2010. https://doi.org/10.1007/978-3-642-13818-8_38

Subspace similarity search : Efficient k-NN queries in arbitrary subspaces. / Bernecker, Thomas; Emrich, Tobias; Graf, Franz; Kriegel, Hans Peter; Kröger, Peer; Renz, Matthias; Schubert, Erich; Zimek, Arthur.

Scientific and Statistical Database Management - 22nd International Conference, SSDBM 2010, Proceedings. Springer, 2010. p. 555-564 (Lecture Notes in Computer Science, Vol. 6187).

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

TY - GEN

T1 - Subspace similarity search

T2 - Efficient k-NN queries in arbitrary subspaces

AU - Bernecker, Thomas

AU - Emrich, Tobias

AU - Graf, Franz

AU - Kriegel, Hans Peter

AU - Kröger, Peer

AU - Renz, Matthias

AU - Schubert, Erich

AU - Zimek, Arthur

PY - 2010/8/3

Y1 - 2010/8/3

N2 - There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, only. While much research has been done in efficient support of single column similarity queries or of similarity queries in the full space, scarcely any support of similarity search in subspaces has been provided so far. The three existing approaches are variations of the sequential scan. Here, we propose the first index-based solution to subspace similarity search in arbitrary subspaces.

AB - There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, only. While much research has been done in efficient support of single column similarity queries or of similarity queries in the full space, scarcely any support of similarity search in subspaces has been provided so far. The three existing approaches are variations of the sequential scan. Here, we propose the first index-based solution to subspace similarity search in arbitrary subspaces.

U2 - 10.1007/978-3-642-13818-8_38

DO - 10.1007/978-3-642-13818-8_38

M3 - Article in proceedings

AN - SCOPUS:77955044339

SN - 978-3-642-13817-1

T3 - Lecture Notes in Computer Science

SP - 555

EP - 564

BT - Scientific and Statistical Database Management - 22nd International Conference, SSDBM 2010, Proceedings

PB - Springer

ER -

Bernecker T, Emrich T, Graf F, Kriegel HP, Kröger P, Renz M et al. Subspace similarity search: Efficient k-NN queries in arbitrary subspaces. In Scientific and Statistical Database Management - 22nd International Conference, SSDBM 2010, Proceedings. Springer. 2010. p. 555-564. (Lecture Notes in Computer Science, Vol. 6187). https://doi.org/10.1007/978-3-642-13818-8_38