Article

Exploiting a page-level upper bound for multi-type nearest neighbor queries

Authors:

Shashi Shekhar,

Pusheng ZhangAuthors Info & Claims

GIS '06: Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems

Pages 179 - 186

https://doi.org/10.1145/1183471.1183501

Published: 10 November 2006 Publication History

Abstract

Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of each feature is visited during the tour. For example, a tourist may be interested in finding the shortest tour which starts at a hotel and passes through a post office, a gas station, and a grocery store. The MTNN query problem is different from the traditional nearest neighbor query problem in that there are many objects for each feature type and the shortest tour should pass through only one object from each feature type. In this paper, we propose an R-tree based algorithm that exploits a page-level upper bound for efficient computation in clustered data sets and finds optimal query results. We compare our method with a recently proposed method, RLORD, which was developed to solve the optimal sequenced route (OSR) query. In our view, OSR represents a spatially constrained version of MTNN. Experimental results are provided to show the strength of our algorithm and design decisions related to performance tuning.

References

[1]

S. Berchtold, C. Bohm, D. Keim, and H. Kriegel. A Cost Model for Nearest Neighbor in High-Dimensional Data Space. In PODS, pages 78--86, 1997.]]

Digital Library

[2]

K. Cheung and A. Fu. Enhanced Nearest Neighbor Search on the R-tree. ACM SIGMOD Record, pages 16--21, 1998.]]

Digital Library

[3]

K. Clarkson. Fast Algorithms for the All-Nearest-Neighbors Problem. In FOCS, 1983.]]

Digital Library

[4]

J. G. Cleary. Analysis of an algorithm for finding nearest neighbor in Euclidean space. ACM Transactions on Mathematical Software, pages 183--192, June 1979.]]

Digital Library

[5]

A. Corral, Y. Manolopoulos, and M. Vassilakopoulos. Closest Pair Queries in Spatial Databases. In ACM SIGMOD, 2000.]]

Digital Library

[6]

A. Corral, Y. Manolopoulos, and M. Vassilakopoulos. Algorithms for Processing K-closest-pair Queries in Spatial Databases. Data and Knowledge Engineering, pages 67--104, 2004.]]

Digital Library

[7]

A. Corral, M. Vassilakopoulos, and Y. Manolopoulos. The impact of Buffering on Closest Pairs Queries Using R-Trees. In ADBIS'01, pages 41--54, 2001.]]

Digital Library

[8]

C. Yang and K.-I. Lin. A index structure for efficient reverse nearest neighbor queries. In ICDE, 2001.]]

Digital Library

[9]

J. H. Friedman, J. L. Bentley, and R. A. Finkel. An algorithm for finding best matches in logrithmic expected time. ACM Transactions on Mathematical Software, pages 209--226, September 1977.]]

Digital Library

[10]

H. Herhatosmanoglu, D. A. I. Stanoi, and A. Abbadi. Constrained Nearest Nieghbor Queries. In SSTD, 2001.]]

Digital Library

[11]

C. Hjaltason and H. Samet. Incremental Distance Join Algorithms for Spatial Databases. In ACM SIGMOD, 1998.]]

Digital Library

[12]

C. Hjaltason and H. Samet. Distance Browsing for Spatial Databases. ACM TODS, pages 265--318, 2 1999.]]

Digital Library

[13]

F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In ACM SIGMOD, 2000.]]

Digital Library

[14]

F. Korn, S. Muthukrishnan, and D. Srivastava. Reverse nearest neighbor aggregates over data stream. In VLDB, 2002.]]

[15]

F. Li, D. Chen, M. Hadjieleftherious, G. Kollios, and S. Teng. On trip planning queries in spatial databases. In SSTD, 2005.]]

Digital Library

[16]

X. Ma, S. Shekhar, H. Xiong, and P. Zhang. Exploiting a page-level upper bound for multi-type nearest neighbor queries. In TR 05-008, CS, UMN, 2005.]]

[17]

D. Papadias, Y. T. Q. Shen, and K. Mouratidis. Group nearest neighbor queries. In ICDE, 2004.]]

Digital Library

[18]

A. Papadopoulos and Y. Manolopoulos. Performance of Nearest Neighbor Queries in R-trees. In ICDT, pages 394--408, 1997.]]

Digital Library

[19]

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

Digital Library

[20]

N. Roussopoulos and F. V. S. Kelly. Nearest Neighbor Queries. In SIGMOD, 1995.]]

Digital Library

[21]

M. Sharifzadeh, M. Kolahdouzan, and C. Shahabi. The optimal sequenced route query. In TR 05-840, CS, USC, January 2005.]]

[22]

I. Stanoi, D. Agrawal, and A. E. Abbadi. Reverse nearest neighbor queries for dynamic databases. In SIGMOD workshop on Research Issues in data mining and knowledge discovery, 2000.]]

[23]

I. Stanoi, M. Riedewald, D. Agrawal, and A. E. Abbadi. Discovery of influence sets in frequently updated databases. In VLDB, 2001.]]

Digital Library

[24]

Y. Tao, D. Papadias, and Q. Shen. Continuous Nearest Neighbor Search. In VLDB, 2002.]]

Digital Library

[25]

J. Zhang, N. Mamoulis, D. Papadias, and Y. Tao. All-Nearest-Neighbors Queries in Spatial Databases. In SSDBM, 2004.]]

Cited By

Lu ESyu S(2021)An Efficient Method for Multi-request Route SearchIntelligent Information and Database Systems10.1007/978-3-030-73280-6_51(643-652)Online publication date: 5-Apr-2021
https://doi.org/10.1007/978-3-030-73280-6_51
Choi DPei JLin X(2020)On spatial keyword coveringKnowledge and Information Systems10.1007/s10115-020-01446-362:7(2577-2612)Online publication date: 18-Feb-2020
https://doi.org/10.1007/s10115-020-01446-3
NISHIMURA TISHIKAWA KTAKAYAMA TYANAGISAWA MTOGAWA N(2019)A Multiple Cyclic-Route Generation Method with Route Length Constraint Considering Point-of-InterestsIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.E102.A.641E102.A:4(641-653)Online publication date: 1-Apr-2019
https://doi.org/10.1587/transfun.E102.A.641
Show More Cited By

Index Terms

Exploiting a page-level upper bound for multi-type nearest neighbor queries
1. Information systems
  1. Information retrieval
  2. Information storage systems

Recommendations

Multi-type nearest neighbor queries in road networks with time window constraints
GIS '09: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

This paper presents a study of Multi-type Nearest Neighbor (MTNN) Queries in road networks with time window constraints. Specifically, we provide a label correcting algorithm, which is based on a time aggregated multi-type graph. This algorithm gives ...
On multi-type reverse nearest neighbor search

This paper presents a study of the Multi-Type Reverse Nearest Neighbor (MTRNN) query problem. Traditionally, a reverse nearest neighbor (RNN) query finds all the objects that have the query point as their nearest neighbor. In contrast, an MTRNN query ...
Multi-type nearest and reverse nearest neighbor search: concepts and algorithms

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GIS '06: Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems

November 2006

264 pages

ISBN:1595935290

DOI:10.1145/1183471

General Chairs:
Rolf A. de By
ITC, The Netherlands
,
Silvia Nittel
University of Maine, USA

Copyright © 2006 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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 November 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CIKM06

Sponsor:

CIKM06: Conference on Information and Knowledge Management

November 10 - 11, 2006

Virginia, Arlington, USA

Acceptance Rates

Overall Acceptance Rate 220 of 1,116 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
368
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lu ESyu S(2021)An Efficient Method for Multi-request Route SearchIntelligent Information and Database Systems10.1007/978-3-030-73280-6_51(643-652)Online publication date: 5-Apr-2021
https://doi.org/10.1007/978-3-030-73280-6_51
Choi DPei JLin X(2020)On spatial keyword coveringKnowledge and Information Systems10.1007/s10115-020-01446-362:7(2577-2612)Online publication date: 18-Feb-2020
https://doi.org/10.1007/s10115-020-01446-3
NISHIMURA TISHIKAWA KTAKAYAMA TYANAGISAWA MTOGAWA N(2019)A Multiple Cyclic-Route Generation Method with Route Length Constraint Considering Point-of-InterestsIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.E102.A.641E102.A:4(641-653)Online publication date: 1-Apr-2019
https://doi.org/10.1587/transfun.E102.A.641
Feng KCong GJensen CGuo T(2019)Finding attribute-aware similar regions for data analysisProceedings of the VLDB Endowment10.14778/3342263.334227712:11(1414-1426)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.14778/3342263.3342277
Hsueh YHuang H(2019)Personalized itinerary recommendation with time constraints using GPS datasetsKnowledge and Information Systems10.1007/s10115-018-1217-760:1(523-544)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.1007/s10115-018-1217-7
Hsueh YZimmermann R(2018)Trip Planning QueriesEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_80712(4229-4235)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_80712
Li WCao JGuan JYiu MZhou S(2017)Efficient Retrieval of Bounded-Cost Informative RoutesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2017.272140829:10(2182-2196)Online publication date: 1-Oct-2017
https://doi.org/10.1109/TKDE.2017.2721408
Choi DPei JLin X(2016)Finding the minimum spatial keyword cover2016 IEEE 32nd International Conference on Data Engineering (ICDE)10.1109/ICDE.2016.7498281(685-696)Online publication date: May-2016
https://doi.org/10.1109/ICDE.2016.7498281
Hsueh YZimmermann R(2016)Trip Planning QueriesEncyclopedia of Database Systems10.1007/978-1-4899-7993-3_80712-1(1-7)Online publication date: 27-Dec-2016
https://doi.org/10.1007/978-1-4899-7993-3_80712-1
Hashem TBarua SAli MKulik LTanin EBailey JMoffat AAggarwal Cde Rijke MKumar RMurdock VSellis TYu J(2015)Efficient Computation of Trips with Friends and FamiliesProceedings of the 24th ACM International on Conference on Information and Knowledge Management10.1145/2806416.2806433(931-940)Online publication date: 17-Oct-2015
https://dl.acm.org/doi/10.1145/2806416.2806433
Show More Cited By

View Options

Get Access

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents