Abstract
In this paper, for the first time, we present the concept of nearest collection (NC) search. Given a set of spatial data points D and a query point q, a nearest collection search retrieves a certain subset c (|c| = k), called collection from D. We formally define a collection as clustered k objects and the nearest collection search problem. Since the brute-force approach of this problem requires large computational cost, we propose two approaches using database techniques to reduce search space. The first approach is the multiple query method which uses existing method (i.e. k-nearest neighbor query) based on normal R-tree. The second approach is the effective NC query processing based on the branch and bound method using an aggregate R-tree (simply aR-tree). Our experimental results show that the efficiency and effectiveness of our proposed approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aji, A.: High performance spatial query processing for large scale scientific data. In: SIGMOD PhD Symposium (2012)
Lazaridis, I., Mehrotra, S.: Progressive approximate aggregate queries with a multiresolution tree structure. In: Proc. ACM SIGMOD (2001)
Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proc. ACM SIGMOD (1984)
Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: Efficient OLAP operations in spatial data warehouse. In: SSTD (2001)
Roussopoulos, N., Kelly, S., Vincent, F.: Nearest neighbor queries. In: Proc. ACM SIGMOD (1995)
Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: Proc. ACM SIGMOD (2000)
Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. Proc. ICDE (2004)
Cheung, K., Fu, A.W.C.: Enhanced nearest neighbor search on the R-tree. ACM SIGMOD Record 27(3), 16–21 (1998)
Hjaltason, G., Samet, H.: Distance browsing in spatial databases. ACM Trans. Database Systems 24(2), 265–318 (1999)
Spatial Data Generator by Yannis Theodoridis, http://www.rtreeportal.org/software/SpatialDataGenerator.zip
U.S. Cencus Bureau. Tiger/Line Shapefiles, http://www.census.gov/geo/www/tiger/shp.html
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jang, HJ. et al. (2014). Towards Nearest Collection Search on Spatial Databases. In: Jeong, YS., Park, YH., Hsu, CH., Park, J. (eds) Ubiquitous Information Technologies and Applications. Lecture Notes in Electrical Engineering, vol 280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41671-2_55
Download citation
DOI: https://doi.org/10.1007/978-3-642-41671-2_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41670-5
Online ISBN: 978-3-642-41671-2
eBook Packages: EngineeringEngineering (R0)