Abstract
Even though the problem of k nearest neighbor (kNN) query is well-studied in serial environment, there is little prior work on parallel kNN search processing in parallel one. In this paper, we present the first Best-First based Parallel kNN (BFPkNN) query algorithm in a multi-disk setting, for efficient handling of kNN retrieval with arbitrary values of k by parallelization. The core of our method is to access more entries from multiple disks simultaneously and enable several effective pruning heuristics to discard non-qualifying entries. Extensive experiments with real and synthetic datasets confirm that BFPkNN significantly outperforms its competitors in both efficiency and scalability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Henrich, A.: A distance-scan algorithm for spatial access structures. In: ACM GIS, pp. 136–143 (1994)
Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71–79 (1995)
Cheung, K.L., Fu, A.W.-C.: Enhanced nearest neighbour search on the R-tree. ACM SIGMOD Record 27, 16–21 (1998)
Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM TODS 24, 265–318 (1999)
Papadopoulos, A.N., Manolopoulos, Y.: Similarity query processing using disk arrays. In: SIGMOD, pp. 225–236 (1998)
Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD, pp. 47–57 (1984)
Sellis, T., Roussopoulos, N., Faloutsos, C.: The R + -tree: a dynamic index for multi-dimensional Objects. In: VLDB, pp. 507–518 (1987)
Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD, pp. 322–331 (1990)
Kamel, I., Faloutsos, C.: Parallel R-trees. In: SIGMOD, pp. 195–204 (1992)
Theodoridis, Y., Sellis, T.K.: A model for the prediction of R-tree performance. In: PODS, pp. 161–171 (1996)
Berchtold, S., Böhm, C., Braunmüller, B., Keim, D.A., Kriegel, H.-P.: Fast parallel similarity search in multimedia databases. In: SIGMOD, pp. 1–12 (1997)
Papadopoulos, A., Manolopoulos, Y.: Parallel processing of nearest neighbor queries in declustered spatial data. In: ACM GIS, pp. 35–43 (1996)
Koudas, N., Faloutsos, C., Kamel, I.: Declustering spatial databases on a multi-computer architecture. In: EDBT, pp. 592–614 (1996)
Gavrilova, M.L.: On a nearest-neighbor problem under minkowski and power metrics for large data sets. J. of Supercomputing 22, 87–98 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gao, Y., Chen, L., Chen, G., Chen, C. (2006). Efficient Parallel Processing for K-Nearest-Neighbor Search in Spatial Databases. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751649_5
Download citation
DOI: https://doi.org/10.1007/11751649_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34079-9
Online ISBN: 978-3-540-34080-5
eBook Packages: Computer ScienceComputer Science (R0)