Abstract
In this paper, we propose an efficient solution to the problem of nearest neighbor query processing in declustered spatial databases. Recently a branch-and-bound nearest neighbor finding (BB-NNF) algorithm has been designed to process nearest neighbor queries in R-trees. However, this algorithm is strictly serial (branch-and-bound oriented) and its performance degrades, during processing of a nearest neighbor query, if applied to a parallel environment, since it does not exploit any kind of parallelization. We develop an efficient query processing strategy for parallel nearest neighbor finding (P-NNF), assuming a shared nothing multi-processor architecture, where the processors communicate via a network. In our method, the relevant sites are activated simultaneously. In order to achieve this goal, statistical information is used. The efficiency measure is the response time of a given query. Experimental results, based on real-life and synthetic datasets, show that the proposed method outperforms the branch-and-bound method by factors.
Similar content being viewed by others
References
W. Aref. “Query Processing and Optimization in Spatial Databases”, Technical Report CS-TR-3097, Department of Computer Science, University of Maryland at College Park, MD, 1993.
N. Beckmann, H.P. Kriegel and B. Seeger. “The R*-tree: an Efficient and Robust Method for Points and Rectangles”, Proceedings of the 1990 ACM SIGMOD Conference, pp. 322–331, Atlantic City, NJ, 1990.
A. Belussi and C. Faloutsos. “Estimating the Selectivity of Spatial Queries Using the ‘Correlation’ Fractal Dimension”, Proceedings of the 21th VLDC Conference, pp.299–310, Zurich, Switzerland, 1995.
T. Brinkhoff, H-P. Kriegel and B. Seeger. “Efficient Processing of Spatial Join Using R-trees”, Proceedings of the 1990 ACM SIGMOD Conference, pp.237–246, Washington DC, 1993.
P. Ciaccia and A. Veronezi. “Dynamic Declustering Methods for Parallel Grid Files”, Proceedings of the Austrian Center for Parallel Computation Conference (ACPC'96), 1996.
D. DeWitt and P. Valduriez. “Parallel Database Systems: The Future of High Performance Database Systems”, Communications of the ACM, vol.6,no.6, pp.85–98, 1992.
M. Egenhofer. “Spatial SQL: a Query and Presentation Language”, IEEE Transactions on Knowledge and Data Engineering, vol.6,no.1, pp.86–95, 1994.
C. Faloutsos and D. Metaxas. “Disk Allocation Methods Using Error Correcting Codes”, IEEE Transactions on Computers, vol.40,no.8, 1991.
C. Faloutsos and P. Bhagwat. “Declustering Using Fractals”, Proceedings of the 2nd International Conference on Parallel and Distributed Information Systems (PDIS'93), pp.18–25, 1993.
C. Faloutsos and I. Kamel. “Beyond Uniformity and Independence: Analysis of R-trees Using the Concept of Fractal Dimension”, Proceedings of the 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '94), pp.4–13, Minneapolis, MN, 1994.
J.H. Friedman, J.L. Bentley and R.A. Finkel. “An Algorithm for Finding the Best Matches in Logarithmic Expected Time”, ACM Transactions on Mathematical Software, vol.3, pp.209–226, 1977.
O. Guenther. “The Design of the Cell-tree: an Object-Oriented Index Structure for Geometric Databases”, Proceedings of the 5th IEEE Conference on Data Engineering, pp.598–615, Los Angeles, CA, 1989.
R.H. Guting. “An Introduction to Spatial Database Systems”, The VLDB Journal, vol.3,no.4, pp.357–399, 1994.
A. Guttman. “R-trees: a Dynamic Index Structure for Spatial Searching”, Proceedings of the 1984 ACM SIGMOD Conference, pp.47–57, Boston, MA, 1984.
A. Henrich, H.W. Six and P. Widmayer. “The LSD-tree: Spatial Access to Multidimensional Point and Non-Point Objects”, Proceedings of the 15th VLDB Conference, pp.45–53, Amsterdam, Netherlands, 1989.
I. Kamel and C. Faloutsos. “Parallel R-trees”, Proceedings of the 1992 ACM SIGMOD Conference, pp.195–204, 1992.
I. Kamel and C. Faloutsos. “On Packing R-trees”, Proceedings of the 2nd Conference on Information and Knowledge Management (CIKM), Washington DC, 1993.
I. Kamel and C. Faloutsos. “Hilbert R-tree: an Improved R-tree Using Fractals”, Proceedings of the 20th VLDB Conference, pp.500–509, Santiago, Chile, 1994.
N. Koudas, C. Faloutsos and I. Kamel. “Declustering Spatial Databases on a Multi-Computer Architecture”, Proceedings of the Extending Database Technology Conference (EDBT'96), 1996.
R. Laurini and D. Thompson. Fundamentals of Spatial Information Systems, Academic Press, London, 1992.
J. Liebeherr, E.R. Omiecinski and F. Akyildiz. “The Effect of Index Partitioning Schemes on the Performance of Distributed Query Processing”, IEEE Transactions on Knowledge and Data Engineering, vol.5,no.3, pp.510–522, 1993.
M.-L. Lo and C.V. Ravishankar. “Spatial Joins Using Seeded Trees”, Proceedings of the 1994 ACM SIGMOD Conference, pp.209–220, Minneapolis, MN, 1994.
J. Orenstein. “Spatial Query Processing in an Object-Oriented Database System”, Proceedings of the 1986 ACM SIGMOD Conference, pp.326–336, Washington DC, 1986.
B.U. Pagel, H.W. Six, H. Toben and P. Widmayer. “Towards an Analysis of Range Query Performance in Spatial Data Structures”, Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '93), pp.214–221, Washington DC, 1993.
A. Papadopoulos and Y. Manolopoulos. “Performance of Nearest Neighbor Queries in R-trees”, Proceedings of the 6th International Conference on Database Theory (ICDT 97), pp.394–408, Delphi, Greece, January 1997.
F. P. Preparata and M. I. Shamos. Computational Geometry: an Introduction, Springer-Verlag, New York, 1985.
N. Roussopoulos and D. Leifker. “Direct Spatial Search on Pictorial Databases Using Packed R-trees”, Proceedings of the 1985 ACM SIGMOD Conference, pp.17–31, Austin, TX, 1985.
N. Roussopoulos, S. Kelley and F. Vincent. “Nearest Neighbor Queries”, Proceedings of the 1995 ACM SIGMOD Conference, pp.71–79, San Jose, CA, 1995.
H. Samet. The Design and Analysis of Spatial Data Structures, Addison-Wesley, Reading, MA, 1990.
T. Sellis, N. Roussopoulos and C. Faloutsos. “The R+-tree: a Dynamic Index for Multidimensional Objects”, Proceedings of the 13th VLDB Conference, pp.507–518, Brighton, UK, 1987.
A. Tanenbaum. Computer Networks, Prentice-Hall, 1989.
Y. Theodoridis and T. Sellis. “A Model for the Prediction of R-tree Performance”, Proceedings of the 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '96), Montreal, Canada, 1996.
T. Ozsu and P. Valduriez. Principles of Distributed Database Systems, Prentice Hall, 1991.
R. Williams et al. “R*: An Overview of the Architecture”, IBM Research Report, San Jose, Calif., RJ3325, 1981.
Y. Zhou, S. Shekhar and M. Coyle. “Disk Allocation Methods for Parallelizing Grid Files”, Proceedings of the 10th International Conference on Data Engineering, pp.243–252, 1994.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Papadopoulos, A., Manolopoulos, Y. Nearest Neighbor Queries in Shared-Nothing Environments. GeoInformatica 1, 369–392 (1997). https://doi.org/10.1023/A:1009758427967
Issue Date:
DOI: https://doi.org/10.1023/A:1009758427967