Article

Free access

Closest pair queries in spatial databases

Authors:

Antonio Corral,

Yannis Manolopoulos,

Yannis Theodoridis,

Michael VassilakopoulosAuthors Info & Claims

SIGMOD '00: Proceedings of the 2000 ACM SIGMOD international conference on Management of data

Pages 189 - 200

https://doi.org/10.1145/342009.335414

Published: 16 May 2000 Publication History

Abstract

This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five different algorithms (four recursive and one iterative) are presented for solving this problem. The case of 1 closest pair is treated as a special case. An extensive study, based on experiments performed with synthetic as well as with real point data sets, is presented. A wide range of values for the basic parameters affecting the performance of the algorithms, especially the effect of overlap between the two data sets, is explored. Moreover, an algorithmic as well as an experimental comparison with existing incremental algorithms addressing the same problem is presented. In most settings, the new algorithms proposed clearly outperform the existing ones.

References

[1]

N. Beckmann, H.P. Kriegel, R. Schneider and B. Seeger: "The R*-tree: an Efficient and Robust Access Method for Points and Rectangles", Proc. 1990 A CM SIGMOD Conf., pp.322-331, Atlantic City, N J, 1990.]]

Digital Library

[2]

K.S. Beyer, J. Goldstein, R. Ramakrishnan and U. Shaft: "When Is 'Nearest Neighbor' Meaningful?", Proc. 7th Int. Conf. on Database Theory (ICDT'99), pp.217-235, Jerusalem, Israel, 1999.]]

Digital Library

[3]

T. Brinkhoff, H.-P. Kriegel and B. Seeger: "Efficient Processing of Spatial Joins Using R-trees", Proc. 1993 A CM SIGMOD Conf., pp.237-246, Washington, DC, 1993.]]

Digital Library

[4]

A. Corral, M. Vassilakopoulos and Y. Manolopoulos: "Algorithms for Joining R-trees and Linear Region Quadtrees", Proc. 6th Int. Syrup. on Spatial Databases (SSD'99), pp.251-269, Hong Kong, China, 1999.]]

Digital Library

[5]

A. Corral, Y. Manolopoulos, Y. Theodoridis and M. Vassilakopoulos: "Closest Pair Queries in Spatial Databases", Technical Report, Data Engineering Lab, Dept. of Informatics, Aristotle Univ. of Thessaloniki, Greece, 1999 (available from URL: http://delab, csd. auth. gr/#michalis/cpq, html).]]

[6]

D.J. DeWitt, N. Kabra, J. Luo, J.M. Patel and J.- B. Yu: "Client-Server Paradise", Proc. 20th VLDB Conf., pp. 558-569, Santiago, Chile, 1994.]]

Digital Library

[7]

M. Dietzfelbinger, T. Hagerup, J. Katajainen and M. Penttonen: "A Reliable Randomized Algorithm for the Closest-Pair Problem", Journal of Algorithms, Vol.25, No.l, pp.19-51, 1997.]]

Digital Library

[8]

V. Gaede and O. Guenther: "Multidimensional Access Methods", A CM Computer Surveys, Vol.30, No.2, pp.170-231, 1998.]]

Digital Library

[9]

M.T. Goodrich, J.-J. Tsay, D.E. Vengroff and J.S. Vitter: "External-Memory Computational Geometry", Proc. 3#th Annual IEEE Syrup. on Foundations of Comp. Science (FOCS'93), pp.714- 723, Palo Alto, CA, 1993.]]

Digital Library

[10]

A. Guttman: "R-trees- a Dynamic Index Structure for Spatial Searching", Proc. 198# A CM SIG- MOD Conf., pp.47-57, Boston, MA, 1984.]]

Digital Library

[11]

G.R. Hjaltason and H. Samet: "Incremental Distance Join Algorithms for Spatial Databases", Proc. 1998 A CM SIGMOD Conf., pp.237-248, Seattle, WA, 1998.]]

Digital Library

[12]

S. Khuller and Y. Matias: "A Simple Randomized Sieve Algorithm for the Closest-Pair Problem", Information and Computation, Vo1.118, No.l, pp.34- 37, 1995.]]

Digital Library

[13]

S.T. Leutenegger and M.A. Lopez: "The Effect of Buffering on the Performance of R-Trees", Proc. l#th IEEE Int. Conf. on Data Engineering (ICDE'98), pp.164-171, Orlando, FL, 1998.]]

Digital Library

[14]

N. Mamoulis and D. Papadias: "Integration of Spatial Join Algorithms for Processing Multiple Inputs", Proc. 1999 ACM SIGMOD Conf., pp.1- 12, Philadelphia, PA, 1999.]]

Digital Library

[15]

Y. Manolopoulos, Y. Theodoridis and V. Tsotras: Advanced Database Indexing, Kluwer Academic Publishers, 1999.]]

Digital Library

[16]

D. Papadias, N. Mamoulis and Y. Theodoridis: "Processing and Optimization of Multi-way Spatial Joins Using R-trees", Proc. 18th ACM PODS Syrup. (PODS'99), pp.44-55, Philadelphia, PA, 1999.]]

Digital Library

[17]

A.N. Papadopoulos and Y. Manolopoulos: "Performance of Nearest Neighbor Queries in R- Trees", Proc. 6th Int. Conf. on Database Theory (ICDT'97), pp.394-408, Delphi, Greece, 1997.]]

Digital Library

[18]

A.N. Papadopoulos and Y. Manolopoulos: "Nearest Neighbor Queries in Shared-Nothing Environments", Geoinformatica, Vol.1, No.4, pp.369-392, 1997.]]

Digital Library

[19]

J.M. Patel et al.: "Building a Scalable Geo- Spatial DBMS: Technology, Implementation, and Evaluation", Proc. 1997 ACM SIGMOD Conf., pp.336-347, Tucson, AZ, 1997]]

Digital Library

[20]

F.P. Preparata and M.I. Shamos: Computational Geometry: an Introduction, Springer-Verlag, 1985.]]

Digital Library

[21]

N. Roussopoulos, S. Kelley and F. Vincent: "Nearest Neighbor Queries", Proc. 1995 A CM SIGMOD Conf., pp.71-79, San Hose, CA, 1995.]]

Digital Library

[22]

M. Stonebraker, J. Frew, K. Gardels and J. Meredith: "The Sequoia 2000 Benchmark", Proc. 1993 A CM SIGMOD Conf., pp.2-11, Washington, DC, 1993.]]

Digital Library

[23]

Y. Theodoridis, E. Stefanakis and T. Sellis: "Cost Models for Join Queries in Spatial Databases", Proc. l#th IEEE Int. Conf. on Data Engineering (ICDE'98), pp.476-483, Orlando, FL, 1998.]]

Digital Library

Cited By

Michalopoulos ATsitsigkos DBouros PMamoulis NTerrovitis M(2024)Efficient Distance Queries on Non-point DataACM Transactions on Spatial Algorithms and Systems10.1145/369819411:1(1-37)Online publication date: 2-Oct-2024
https://dl.acm.org/doi/10.1145/3698194
de Bernardo GPenabad MCorral ABrisaboa N(2024)Classic distance join queries using compact data structuresInformation Sciences: an International Journal10.1016/j.ins.2024.120732674:COnline publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1016/j.ins.2024.120732
Zhu RWang BYang XZheng B(2023)Closest Pairs Search Over Data StreamProceedings of the ACM on Management of Data10.1145/36173261:3(1-26)Online publication date: 13-Nov-2023
https://dl.acm.org/doi/10.1145/3617326
Show More Cited By

Index Terms

Closest pair queries in spatial databases
1. Human-centered computing
  1. Visualization
    1. Visualization application domains
      1. Geographic visualization
2. Information systems
  1. Data management systems
    1. Query languages
  2. Information systems applications
    1. Spatial-temporal systems

Recommendations

Closest pair queries in spatial databases

This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five different algorithms (four recursive and one iterative) are presented for solving ...
Closest Pair Query on Spatial Data Sets without Index
SCCC '10: Proceedings of the 2010 XXIX International Conference of the Chilean Computer Science Society

In this work, we present an algorithm that finds the closest pair on two data sets, assuming that neither set has an index. A straightforward solution is to build the spatial index on the fly, and then apply algorithms that use such indexes. But if the ...
Algorithms for processing K-closest-pair queries in spatial databases

This paper addresses the problem of finding the K closest pairs between two spatial datasets (the so-called, K closest pairs query, K-CPQ), where each dataset is stored in an R-tree. There are two different techniques for solving this kind of distance-...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '00: Proceedings of the 2000 ACM SIGMOD international conference on Management of data

May 2000

604 pages

ISBN:1581132174

DOI:10.1145/342009

Chairmen:
Maggie Dunham
Southern Methodist Univ.
,
Jeffrey F. Naughton
Univ. of Wisconsin-Madison
,
Weidong Chen
Southern Methodist Univ.
,
Nick Koudas
AT &T Labs

ACM SIGMOD Record Volume 29, Issue 2
June 2000
609 pages
ISSN:0163-5808
DOI:10.1145/335191
Editors:
Weidong Chen
Southern Methodist Univ., Dallas, TX
,
Jeffrey Naughton
Univ. of Wisconsin-Madison, Madison
,
Philip A. Bernstein
Microsoft
Issue’s Table of Contents

Copyright © 2000 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 May 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS00

Sponsor:

SIGMOD

SIGMOD/PODS00: ACM International Conference on Management of Data and Symposium on Principles of Database Systems

May 15 - 18, 2000

Texas, Dallas, USA

Acceptance Rates

SIGMOD '00 Paper Acceptance Rate 42 of 248 submissions, 17%;

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

220
Total Citations
View Citations
369
Total Downloads

Downloads (Last 12 months)135
Downloads (Last 6 weeks)16

Reflects downloads up to 27 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Michalopoulos ATsitsigkos DBouros PMamoulis NTerrovitis M(2024)Efficient Distance Queries on Non-point DataACM Transactions on Spatial Algorithms and Systems10.1145/369819411:1(1-37)Online publication date: 2-Oct-2024
https://dl.acm.org/doi/10.1145/3698194
de Bernardo GPenabad MCorral ABrisaboa N(2024)Classic distance join queries using compact data structuresInformation Sciences: an International Journal10.1016/j.ins.2024.120732674:COnline publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1016/j.ins.2024.120732
Zhu RWang BYang XZheng B(2023)Closest Pairs Search Over Data StreamProceedings of the ACM on Management of Data10.1145/36173261:3(1-26)Online publication date: 13-Nov-2023
https://dl.acm.org/doi/10.1145/3617326
Velentzas PVassilakopoulos MCorral AAntonopoulos C(2023)GPU-Based Algorithms for Processing the k Nearest-Neighbor Query on Spatial Data Using Partitioning and Concurrent Kernel ExecutionInternational Journal of Parallel Programming10.1007/s10766-023-00755-8Online publication date: 21-Jul-2023
https://doi.org/10.1007/s10766-023-00755-8
Moti MSimatis PPapadias D(2022)WaffleProceedings of the VLDB Endowment10.14778/3574245.357425316:4(670-683)Online publication date: 1-Dec-2022
https://dl.acm.org/doi/10.14778/3574245.3574253
Tang JWang YLiu WLuo XZhou Z(2021)SCP-Tree: Finding Multiple Nearest Parking Spots With Minimal Group Travel CostIEEE Access10.1109/ACCESS.2021.31312299(158946-158960)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3131229
Carniel AChbeir RManolopoulos YDamiani EBenslimane DBellatreche LMorzy T(2020)Spatial Information Retrieval in Digital EcosystemsProceedings of the 12th International Conference on Management of Digital EcoSystems10.1145/3415958.3433038(10-17)Online publication date: 2-Nov-2020
https://dl.acm.org/doi/10.1145/3415958.3433038
Qi SBouros PMamoulis N(2020)Top-k spatial distance joinsGeoInformatica10.1007/s10707-020-00393-z24:3(591-631)Online publication date: 12-Feb-2020
https://doi.org/10.1007/s10707-020-00393-z
Wang HYang LXiao Y(2020)SETJoin: a novel top-k similarity join algorithmSoft Computing10.1007/s00500-020-04807-wOnline publication date: 6-Mar-2020
https://doi.org/10.1007/s00500-020-04807-w
Qiu YHei XOhmori TFujita H(2019)An Object-Pair Driven Approach for Top-k mCK Query Problem by Using Hilbert R-Tree2019 18th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/13th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE)10.1109/TrustCom/BigDataSE.2019.00093(655-661)Online publication date: Aug-2019
https://doi.org/10.1109/TrustCom/BigDataSE.2019.00093
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents