Constrained k-nearest neighbor query processing over moving object trajectories

Yunjun Gao; Gencai Chen; Qing Li; Chun Li; Chun Chen

doi:10.1007/978-3-540-78568-2_56

Constrained k-nearest neighbor query processing over moving object trajectories

Yunjun Gao, Gencai Chen, Qing Li, Chun Li, Chun Chen

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

4 Citations (Scopus)

Abstract

Given a set D of trajectories, a query object (point or trajectory) q, a time interval T, and a constrained region CR, a constrained k-nearest neighbor (CkNN) query over moving object trajectories retrieves from D within T, the k ( 1) trajectories that lie closest to q and intersect (or are enclosed by) CR. In this paper, we propose several algorithms for efficiently processing CkNN search on moving object trajectories. In particular, we thoroughly investigate two types of CkNN queries, viz. CkNN_P and CkNN_T queries, which are defined w.r.t. stationary query points and moving query trajectories, respectively. The performance of our algorithms is evaluated with extensive experiments using both real and synthetic datasets.

Original language	English
Title of host publication	Database Systems for Advanced Applications - 13th International Conference, DASFAA 2008, Proceedings
Pages	635-643
Number of pages	9
DOIs	https://doi.org/10.1007/978-3-540-78568-2_56
Publication status	Published - 21 Jul 2008
Externally published	Yes
Event	13th International Conference on Database Systems for Advanced Applications, DASFAA 2008 - New Delhi, India Duration: 19 Mar 2008 → 21 Mar 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4947 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	13th International Conference on Database Systems for Advanced Applications, DASFAA 2008
Country/Territory	India
City	New Delhi
Period	19/03/08 → 21/03/08

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

More information

10.1007/978-3-540-78568-2_56

Cite this

Gao, Y., Chen, G., Li, Q., Li, C., & Chen, C. (2008). Constrained k-nearest neighbor query processing over moving object trajectories. In Database Systems for Advanced Applications - 13th International Conference, DASFAA 2008, Proceedings (pp. 635-643). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4947 LNCS). https://doi.org/10.1007/978-3-540-78568-2_56

Gao, Yunjun ; Chen, Gencai ; Li, Qing et al. / Constrained k-nearest neighbor query processing over moving object trajectories. Database Systems for Advanced Applications - 13th International Conference, DASFAA 2008, Proceedings. 2008. pp. 635-643 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{3d0bbb3d675a4045b1c02e974eaa07b4,

title = "Constrained k-nearest neighbor query processing over moving object trajectories",

abstract = "Given a set D of trajectories, a query object (point or trajectory) q, a time interval T, and a constrained region CR, a constrained k-nearest neighbor (CkNN) query over moving object trajectories retrieves from D within T, the k ( 1) trajectories that lie closest to q and intersect (or are enclosed by) CR. In this paper, we propose several algorithms for efficiently processing CkNN search on moving object trajectories. In particular, we thoroughly investigate two types of CkNN queries, viz. CkNNP and CkNNT queries, which are defined w.r.t. stationary query points and moving query trajectories, respectively. The performance of our algorithms is evaluated with extensive experiments using both real and synthetic datasets.",

author = "Yunjun Gao and Gencai Chen and Qing Li and Chun Li and Chun Chen",

year = "2008",

month = jul,

day = "21",

doi = "10.1007/978-3-540-78568-2_56",

language = "English",

isbn = "3540785671",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "635--643",

booktitle = "Database Systems for Advanced Applications - 13th International Conference, DASFAA 2008, Proceedings",

note = "13th International Conference on Database Systems for Advanced Applications, DASFAA 2008 ; Conference date: 19-03-2008 Through 21-03-2008",

}

Gao, Y, Chen, G, Li, Q, Li, C & Chen, C 2008, Constrained k-nearest neighbor query processing over moving object trajectories. in Database Systems for Advanced Applications - 13th International Conference, DASFAA 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4947 LNCS, pp. 635-643, 13th International Conference on Database Systems for Advanced Applications, DASFAA 2008, New Delhi, India, 19/03/08. https://doi.org/10.1007/978-3-540-78568-2_56

Constrained k-nearest neighbor query processing over moving object trajectories. / Gao, Yunjun; Chen, Gencai; Li, Qing et al.
Database Systems for Advanced Applications - 13th International Conference, DASFAA 2008, Proceedings. 2008. p. 635-643 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4947 LNCS).

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - Constrained k-nearest neighbor query processing over moving object trajectories

AU - Gao, Yunjun

AU - Chen, Gencai

AU - Li, Qing

AU - Li, Chun

AU - Chen, Chun

PY - 2008/7/21

Y1 - 2008/7/21

N2 - Given a set D of trajectories, a query object (point or trajectory) q, a time interval T, and a constrained region CR, a constrained k-nearest neighbor (CkNN) query over moving object trajectories retrieves from D within T, the k ( 1) trajectories that lie closest to q and intersect (or are enclosed by) CR. In this paper, we propose several algorithms for efficiently processing CkNN search on moving object trajectories. In particular, we thoroughly investigate two types of CkNN queries, viz. CkNNP and CkNNT queries, which are defined w.r.t. stationary query points and moving query trajectories, respectively. The performance of our algorithms is evaluated with extensive experiments using both real and synthetic datasets.

AB - Given a set D of trajectories, a query object (point or trajectory) q, a time interval T, and a constrained region CR, a constrained k-nearest neighbor (CkNN) query over moving object trajectories retrieves from D within T, the k ( 1) trajectories that lie closest to q and intersect (or are enclosed by) CR. In this paper, we propose several algorithms for efficiently processing CkNN search on moving object trajectories. In particular, we thoroughly investigate two types of CkNN queries, viz. CkNNP and CkNNT queries, which are defined w.r.t. stationary query points and moving query trajectories, respectively. The performance of our algorithms is evaluated with extensive experiments using both real and synthetic datasets.

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

U2 - 10.1007/978-3-540-78568-2_56

DO - 10.1007/978-3-540-78568-2_56

M3 - Conference article published in proceeding or book

AN - SCOPUS:47249089044

SN - 3540785671

SN - 9783540785675

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 635

EP - 643

BT - Database Systems for Advanced Applications - 13th International Conference, DASFAA 2008, Proceedings

T2 - 13th International Conference on Database Systems for Advanced Applications, DASFAA 2008

Y2 - 19 March 2008 through 21 March 2008

ER -

Gao Y, Chen G, Li Q, Li C, Chen C. Constrained k-nearest neighbor query processing over moving object trajectories. In Database Systems for Advanced Applications - 13th International Conference, DASFAA 2008, Proceedings. 2008. p. 635-643. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-78568-2_56

Constrained k-nearest neighbor query processing over moving object trajectories

Abstract

Publication series

Conference

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this