SEA-CNN: Scalable processing of continuous K-nearest neighbor queries in spatio-temporal databases

Xiaopeng Xiong, Mohamed Mokbel, Walid G. Aref

Research output: Chapter in Book/Report/Conference proceedingConference contribution

231 Citations (Scopus)

Abstract

Location-aware environments are characterized by a large number of objects and a large number of continuous queries. Both the objects and continuous queries may change their locations over time. In this paper, we focus on continuous k-nearest neighbor queries (CKNN, for short). We present a new algorithm, termed SEA-CNN, for answering continuously a collection of concurrent CKNN queries. SEA-CNN has two important features: incremental evaluation and shared execution. SEA-CNN achieves both efficiency and scalability in the presence of a set of concurrent queries. Furthermore, SEA-CNN does not make any assumptions about the movement of objects, e.g., the objects velocities and shapes of trajectories, or about the mutability of the objects and/or the queries, i.e., moving or stationary queries issued on moving or stationary objects. We provide theoretical analysis of SEA-CNN with respect to the execution costs, memory requirements and effects of tunable parameters. Comprehensive experimentation shows that SEACNN is highly scalable and is more efficient in terms of both I/O and CPU costs in comparison to other R-tree-based CKNN techniques.

Original languageEnglish
Title of host publicationProceedings - 21st International Conference on Data Engineering, ICDE 2005
Pages643-654
Number of pages12
DOIs
Publication statusPublished - 12 Dec 2005
Externally publishedYes
Event21st International Conference on Data Engineering, ICDE 2005 - Tokyo, Japan
Duration: 5 Apr 20058 Apr 2005

Other

Other21st International Conference on Data Engineering, ICDE 2005
CountryJapan
CityTokyo
Period5/4/058/4/05

Fingerprint

Processing
Program processors
Scalability
Costs
Trajectories
Data storage equipment

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems

Cite this

Xiong, X., Mokbel, M., & Aref, W. G. (2005). SEA-CNN: Scalable processing of continuous K-nearest neighbor queries in spatio-temporal databases. In Proceedings - 21st International Conference on Data Engineering, ICDE 2005 (pp. 643-654) https://doi.org/10.1109/ICDE.2005.128

SEA-CNN : Scalable processing of continuous K-nearest neighbor queries in spatio-temporal databases. / Xiong, Xiaopeng; Mokbel, Mohamed; Aref, Walid G.

Proceedings - 21st International Conference on Data Engineering, ICDE 2005. 2005. p. 643-654.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Xiong, X, Mokbel, M & Aref, WG 2005, SEA-CNN: Scalable processing of continuous K-nearest neighbor queries in spatio-temporal databases. in Proceedings - 21st International Conference on Data Engineering, ICDE 2005. pp. 643-654, 21st International Conference on Data Engineering, ICDE 2005, Tokyo, Japan, 5/4/05. https://doi.org/10.1109/ICDE.2005.128
Xiong X, Mokbel M, Aref WG. SEA-CNN: Scalable processing of continuous K-nearest neighbor queries in spatio-temporal databases. In Proceedings - 21st International Conference on Data Engineering, ICDE 2005. 2005. p. 643-654 https://doi.org/10.1109/ICDE.2005.128
Xiong, Xiaopeng ; Mokbel, Mohamed ; Aref, Walid G. / SEA-CNN : Scalable processing of continuous K-nearest neighbor queries in spatio-temporal databases. Proceedings - 21st International Conference on Data Engineering, ICDE 2005. 2005. pp. 643-654
@inproceedings{0b00199777e14079b1da7d465c891ea5,
title = "SEA-CNN: Scalable processing of continuous K-nearest neighbor queries in spatio-temporal databases",
abstract = "Location-aware environments are characterized by a large number of objects and a large number of continuous queries. Both the objects and continuous queries may change their locations over time. In this paper, we focus on continuous k-nearest neighbor queries (CKNN, for short). We present a new algorithm, termed SEA-CNN, for answering continuously a collection of concurrent CKNN queries. SEA-CNN has two important features: incremental evaluation and shared execution. SEA-CNN achieves both efficiency and scalability in the presence of a set of concurrent queries. Furthermore, SEA-CNN does not make any assumptions about the movement of objects, e.g., the objects velocities and shapes of trajectories, or about the mutability of the objects and/or the queries, i.e., moving or stationary queries issued on moving or stationary objects. We provide theoretical analysis of SEA-CNN with respect to the execution costs, memory requirements and effects of tunable parameters. Comprehensive experimentation shows that SEACNN is highly scalable and is more efficient in terms of both I/O and CPU costs in comparison to other R-tree-based CKNN techniques.",
author = "Xiaopeng Xiong and Mohamed Mokbel and Aref, {Walid G.}",
year = "2005",
month = "12",
day = "12",
doi = "10.1109/ICDE.2005.128",
language = "English",
isbn = "0769522858",
pages = "643--654",
booktitle = "Proceedings - 21st International Conference on Data Engineering, ICDE 2005",

}

TY - GEN

T1 - SEA-CNN

T2 - Scalable processing of continuous K-nearest neighbor queries in spatio-temporal databases

AU - Xiong, Xiaopeng

AU - Mokbel, Mohamed

AU - Aref, Walid G.

PY - 2005/12/12

Y1 - 2005/12/12

N2 - Location-aware environments are characterized by a large number of objects and a large number of continuous queries. Both the objects and continuous queries may change their locations over time. In this paper, we focus on continuous k-nearest neighbor queries (CKNN, for short). We present a new algorithm, termed SEA-CNN, for answering continuously a collection of concurrent CKNN queries. SEA-CNN has two important features: incremental evaluation and shared execution. SEA-CNN achieves both efficiency and scalability in the presence of a set of concurrent queries. Furthermore, SEA-CNN does not make any assumptions about the movement of objects, e.g., the objects velocities and shapes of trajectories, or about the mutability of the objects and/or the queries, i.e., moving or stationary queries issued on moving or stationary objects. We provide theoretical analysis of SEA-CNN with respect to the execution costs, memory requirements and effects of tunable parameters. Comprehensive experimentation shows that SEACNN is highly scalable and is more efficient in terms of both I/O and CPU costs in comparison to other R-tree-based CKNN techniques.

AB - Location-aware environments are characterized by a large number of objects and a large number of continuous queries. Both the objects and continuous queries may change their locations over time. In this paper, we focus on continuous k-nearest neighbor queries (CKNN, for short). We present a new algorithm, termed SEA-CNN, for answering continuously a collection of concurrent CKNN queries. SEA-CNN has two important features: incremental evaluation and shared execution. SEA-CNN achieves both efficiency and scalability in the presence of a set of concurrent queries. Furthermore, SEA-CNN does not make any assumptions about the movement of objects, e.g., the objects velocities and shapes of trajectories, or about the mutability of the objects and/or the queries, i.e., moving or stationary queries issued on moving or stationary objects. We provide theoretical analysis of SEA-CNN with respect to the execution costs, memory requirements and effects of tunable parameters. Comprehensive experimentation shows that SEACNN is highly scalable and is more efficient in terms of both I/O and CPU costs in comparison to other R-tree-based CKNN techniques.

UR - http://www.scopus.com/inward/record.url?scp=28044449142&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=28044449142&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2005.128

DO - 10.1109/ICDE.2005.128

M3 - Conference contribution

AN - SCOPUS:28044449142

SN - 0769522858

SP - 643

EP - 654

BT - Proceedings - 21st International Conference on Data Engineering, ICDE 2005

ER -