Research in Continuous Nearest Neighbor Queries

Article Preview

Abstract:

This paper analyzes several methods of the present continuous nearest neighbor queries and proposes a query algorithm based on R – tree through the geometric feature of this problem, the algorithms can not only avoid the loss of dividing points and high cost of the query, but also can finish the continuous nearest neighbor query for moving objects effectively.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 457-458)

Pages:

461-466

Citation:

Online since:

January 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] P Sistla. O and Wolfson. S, Chamberlain Modeling and Querying Moving Objects, Proc. of 13th International Conference on Data Engineering, Birmingham, U K, pp.422-432, (1997).

DOI: 10.1109/icde.1997.581973

Google Scholar

[2] Song Z and Roussopoulos N, K-NN search for moving query point, Proc. of 7th International Symposium on Spatial and Temporal Databases, pp.79-96, (2001).

DOI: 10.1007/3-540-47724-1_5

Google Scholar

[3] Y. Tao and D. Papadias, Time Parameterized Queries in Spatio-Temporal Dtabase. ACM SIGMOD, (2002).

DOI: 10.1145/564691.564730

Google Scholar

[4] Yingyuan Xiao, Hongya Wang. An Efficient Algorithm for Continuous Nearest Neighbor Queries Based on the VDTPR-tree. Journal of Computational Information Systems, 2008, 4(2): 527-534.

Google Scholar

[5] Wen-Ge Ma, Design of Signal Fuzzy Controller of Single Intersection in Intelligence Transportation System, International Journal of Innovative Computing, Information and Control (IJICIC), vol. 3, no. 4, pp.1023-1029, 2007(8).

Google Scholar

[6] Takamasa Akiyama and Masashi Okushima, Advanced Fuzzy Traffic Controller for Urban Expressway, International Journal of Innovative Computing, Information and Control (IJICIC), vol. 2, no. 2, pp.339-355, (2006).

Google Scholar