Article

An efficient algorithm for predictive continuous nearest neighbor query processing and result maintenance

Authors:

Ken C. K. Lee,

Hong Va Leong,

Jing Zhou,

Antonio SiAuthors Info & Claims

MDM '05: Proceedings of the 6th international conference on Mobile data management

Pages 178 - 182

https://doi.org/10.1145/1071246.1071273

Published: 09 May 2005 Publication History

Get Access

Abstract

Predictive continuous nearest neighbor queries are concerned with finding the nearest neighbor objects for some future time period according to the current object and query locations and their motion information. Existing continuous query processing algorithms are not efficient enough, requiring multiple dataset lookups to evaluate the query results throughout the duration of a continuous query. More importantly, the complete result for the whole query time interval is only available at the moment when all object motion updates have been examined, based on which adjustment of the query result is made. In this paper, we propose an algorithm which requires only one dataset lookup to deliver a complete predictive result. We then apply a differential update technique to maintain the query results incrementally in the presence of object location and motion updates.

References

[1]

R. Benetis, C. S. Jensen, and S. S. G. Karciauskas. Nearest Neighbor and Reverse Nearest Queries for Moving Objects. In Proc. of IDEAS, pages 44--53, 2002.

Digital Library

Google Scholar

[2]

G. R. Hjaltason and H. Samet. Distance Browsing in Spatial Databases. ACM Transactions on Database Systems, 24(2):265--318, 1999.

Digital Library

Google Scholar

[3]

G. S. Iwerks, H. Samet, and K. Smith. Continuous K-Nearest Neighbor Queries for Continuous Moving Points with Updates. In Proc. of VLDB, pages 512--523, 2003.

Digital Library

Google Scholar

[4]

H. Mokhtar, J. Su, and O. Ibarra. On Moving Object Queries. In Proc. of ACM PODS, pages 188--198, 2002.

Digital Library

Google Scholar

[5]

K. Raptopoulou, A. Papadopoulos, and Y. Manolopoulos. Fast Nearest-Neighbor Query Processing in Moving-Object Databases. GeoInformatica, 7(2):113--137, 2003.

Digital Library

Google Scholar

[6]

N. Roussopoulos, S. Kelly, and F. Vincent. Nearest Neighbor Queries. In Proc. of ACM SIGMOD, pages 71--79, 1995.

Digital Library

Google Scholar

[7]

S. Šaltenis, C. Jensen, S. Leutenegger, and M. Lopez. Indexing the Positions of Continuously Moving Objects. In Proc. of ACM SIGMOD, pages 331--342, 2000.

Digital Library

Google Scholar

[8]

Y. Tao and D. Papadias. Time-Parameterized Queries in Spatial-Temporal Databases. In Proc. of ACM SIGMOD, pages 334--345, 2002.

Digital Library

Google Scholar

[9]

Y. Tao, D. Papadias, and Q. Shen. Continuous Nearest Neighbor Search. In Proc. of VLDB, pages 287--298, 2002.

Digital Library

Google Scholar

Cited By

View all

Hendawi AAli MMokbel M(2017)PandaźGeoinformatica10.1007/s10707-016-0284-821:2(175-208)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1007/s10707-016-0284-8
Hendawi AMokbel MChow C(2012)Predictive spatio-temporal queriesProceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems10.1145/2442810.2442828(97-104)Online publication date: 6-Nov-2012
https://dl.acm.org/doi/10.1145/2442810.2442828
Hendawi AMokbel MCruz IKnoblock CKröger PTanin EWidmayer P(2012)PandaProceedings of the 20th International Conference on Advances in Geographic Information Systems10.1145/2424321.2424324(13-22)Online publication date: 6-Nov-2012
https://dl.acm.org/doi/10.1145/2424321.2424324
Show More Cited By

Index Terms

An efficient algorithm for predictive continuous nearest neighbor query processing and result maintenance
1. Information systems

Recommendations

Ranked Reverse Nearest Neighbor Search

Given a set of data points P and a query point q in a multidimensional space, Reverse Nearest Neighbor (RNN) query finds data points in P whose nearest neighbors are q. Reverse k-Nearest Neighbor (RkNN) query (where k ≥ 1) generalizes RNN query to find ...
On efficient mutual nearest neighbor query processing in spatial databases

This paper studies a new form of nearest neighbor queries in spatial databases, namely, mutual nearest neighbor (MNN) search. Given a set D of objects and a query object q, an MNN query returns from D, the set of objects that are among the k"1 (>=1) ...
Continuous visible nearest neighbor query processing in spatial databases

In this paper, we identify and solve a new type of spatial queries, called continuous visible nearest neighbor (CVNN) search. Given a data set P , an obstacle set O , and a query line segment q in a two-dimensional space, a CVNN query returns a ...

Comments

Information & Contributors

Information

Published In

MDM '05: Proceedings of the 6th international conference on Mobile data management

May 2005

329 pages

ISBN:1595930418

DOI:10.1145/1071246

Conference Chairs:
Panos K. Chrysanthis
U. of Pittsburgh, USA
,
George Samaras
U. of Cyprus, Cyprus

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 May 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

MDM05

Sponsor:

MDM05: International Conference on mobile Data Management

May 9 - 13, 2005

Ayia Napa, Cyprus

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
357
Total Downloads

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

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hendawi AAli MMokbel M(2017)PandaźGeoinformatica10.1007/s10707-016-0284-821:2(175-208)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1007/s10707-016-0284-8
Hendawi AMokbel MChow C(2012)Predictive spatio-temporal queriesProceedings of the First ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems10.1145/2442810.2442828(97-104)Online publication date: 6-Nov-2012
https://dl.acm.org/doi/10.1145/2442810.2442828
Hendawi AMokbel MCruz IKnoblock CKröger PTanin EWidmayer P(2012)PandaProceedings of the 20th International Conference on Advances in Geographic Information Systems10.1145/2424321.2424324(13-22)Online publication date: 6-Nov-2012
https://dl.acm.org/doi/10.1145/2424321.2424324
Lin LHuang Y(2011)Scalable processing of continuous K-nearest neighbor queries with uncertain velocityExpert Systems with Applications: An International Journal10.1016/j.eswa.2011.01.02838:8(9256-9265)Online publication date: 1-Aug-2011
https://dl.acm.org/doi/10.1016/j.eswa.2011.01.028
Lee KUnger BZheng BLee W(2011)Location-dependent spatial query containmentData & Knowledge Engineering10.1016/j.datak.2011.06.00170:10(842-865)Online publication date: 1-Oct-2011
https://dl.acm.org/doi/10.1016/j.datak.2011.06.001
Lee KLee WLeong H(2010)Nearest Surrounder QueriesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2009.17222:10(1444-1458)Online publication date: 1-Oct-2010
https://dl.acm.org/doi/10.1109/TKDE.2009.172
Huang YLee C(2010)Efficient evaluation of continuous spatio-temporal queries on moving objects with uncertain velocityGeoinformatica10.1007/s10707-009-0081-814:2(163-200)Online publication date: 1-Apr-2010
https://dl.acm.org/doi/10.1007/s10707-009-0081-8
Leong H(2009)Database Support for M-Commerce and L-CommerceEncyclopedia of Information Science and Technology, Second Edition10.4018/978-1-60566-026-4.ch154(967-973)Online publication date: 2009
https://doi.org/10.4018/978-1-60566-026-4.ch154
Lee KSchiffman JZheng BLee WLeong H(2007)Round-EyeJournal of Systems and Software10.1016/j.jss.2007.03.00780:12(2063-2076)Online publication date: 1-Dec-2007
https://dl.acm.org/doi/10.1016/j.jss.2007.03.007

View Options

Login options

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

Cited By

Index Terms

Recommendations

Ranked Reverse Nearest Neighbor Search

On efficient mutual nearest neighbor query processing in spatial databases

Continuous visible nearest neighbor query processing in spatial databases

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Ranked Reverse Nearest Neighbor Search

On efficient mutual nearest neighbor query processing in spatial databases

Continuous visible nearest neighbor query processing in spatial databases

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations