Abstract
The architecture named the GALIS is a cluster-based distributed computing system architecture which has been devised to efficiently handle a large volume of LBS application data. In this paper, we propose a distributed k-NN query processing scheme for moving objects on multiple computing nodes, each of which keeps records relevant to a different geographical zone. We also propose a hybrid k-NN scheme, which utilizes range queries instead of k-NN queries for the neighboring overlapped nodes, thus resulting in 30% reduction of query processing cost. Through some experiments, we show the efficiency of hybrid k-NN scheme over naïve k-NN scheme.
Chapter PDF
Similar content being viewed by others
References
Nah, Y., Kim, K.H., Wang, T., Kim, M.H., Lee, J., Yang, Y.K: GALIS: A Cluster-based Scalable Architecture for Location-based Service Systems. Database Research, 18(4). KISS SIGDB, 66–80 (2002)
Nah, Y., Kim, K.H., Wang, T., Kim, M.H., Lee, J., Yang, Y.K: A Cluster-based TMO-structured Scalable Approach for Location Information Systems. In: Proc. WORDS 2003 Fall, pp. 225–233. IEEE Computer Society Press, Los Alamitos (2003)
Kim, M.H., Kim, K.H., Nah, Y., Lee, J., Wang, T., Lee, J., Yang, Y.K: Distributed Adaptive Architecture for Managing Large Volumes of Moving Items. In: IDPT. Society for Design and Process Science, vol. 2, pp. 737–744 (2003)
Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the Positions of Continuously Moving Objects. In: Proc. ACM SIGMOD, pp. 331–342 (2000)
Zhang, J., Zhu, M., Papadias, D., Tao, Y., Lee, D.: Location-Based Spatial Queries. In: Proc. ACM SIGMOD, pp. 467–478. ACM Press, New York (2003)
Hjaltason, G.R., Samet, H.: Ranking in Spatial Databases. In: Egenhofer, M.J., Herring, J.R. (eds.) SSD 1995. LNCS, vol. 951, pp. 83–95. Springer, Heidelberg (1995)
Cheung, K.L., Fu, A.W.-C: Enhanced Nearest Neighbor Search on the R-tree. SIGMOD Record 27(3), 16–21 (1998)
Iwerks, G.S., Samet, H., Smith, K.P.: Continuous k-Nearest Neighbor Queries for Continuously Moving Points with Updates. In: Proc. VLDB, pp. 512–523 (2003)
Dasarathy, B.V.: Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques (1991)
Song, Z., Roussopoulos, N.: K-Nearest Neighbor Search for Moving Query Point. In: Proc. SSTD, pp. 79–96 (2001)
Hadjieleftheriou, M., Hoel, E.G., Tsotras, V.J.: SaIL: A Spatial Index Library for Efficient Application Integration. GeoInformatica 9(4), 367–389 (2005)
Shakhnarovish, Darrell, Indyk (eds.): Nearest-Neighbor Methods in Learning and Vision. MIT Press (2005)
Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: Proc. ACM SIGMOD, pp. 47–57. ACM Press, New York (1984)
Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-Tree: an Efficient and Robust Access Method for Points and Rectangles. In: Proc. ACM SIGMOD, pp. 322–331. ACM Press, New York (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 IFIP International Federation for Information Processing
About this paper
Cite this paper
Han, J., Lee, J., Park, S., Hwang, J., Nah, Y. (2007). Distributed k-NN Query Processing for Location Services. In: Obermaisser, R., Nah, Y., Puschner, P., Rammig, F.J. (eds) Software Technologies for Embedded and Ubiquitous Systems. SEUS 2007. Lecture Notes in Computer Science, vol 4761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75664-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-75664-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75663-7
Online ISBN: 978-3-540-75664-4
eBook Packages: Computer ScienceComputer Science (R0)