Continuous monitoring of exclusive closest pairs

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

Volumn 4605 LNCS, Issue , 2007, Pages 1-19

  Leong Hou, U ^a   Mamoulis, Nikos ^a   Yiu, Man Lung ^b  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DYNAMIC PROGRAMMING; SOFTWARE PROTOTYPING;

DATASETS; EXCLUSIVE CLOSEST PAIRS; ONE-TO-ONE ASSIGNMENT;

DATA STRUCTURES;

EID: 37849048363     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (24)

1. Anderberg, M.R.: Cluster Analysis for Applications. Academic Press, Inc, London (1973)
2. Brinkhoff, T., Kriegel, H.-P., Seeger, B.: Efficient processing of spatial joins using r-trees. In: SIGMOD Conference, pp. 237-246 (1993)
3. Cardinal, J., Eppstein, D.: Lazy algorithms for dynamic closest pair with arbitrary distance measures. In: Algorithm Engineering and Experiments Workshop (ALENEX) (2004)
4. Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Closest pair queries in spatial databases. In: SIGMOD Conference, pp. 189-200 (2000)
5. Eppstein, D.: Fast hierarchical clustering and other applications of dynamic closest pairs. ACM Journal of Experimental Algorithms 5(1) (2000)
6. Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Amer. Math. 69, 9-14 (1962)
7. Gusfield, D., Irving, R.W.: The Stable Marriage Problem, Structure and Algorithms. MIT Press, Cambridge (1989)
8. Guttman, A.: R-Trees: A Dynamic Index Structure for Spatial Searching. In: SIGMOD (1984)
9. Hjaltason, G.R., Samet, H.: Incremental distance join algorithms for spatial databases. In: SIGMOD Conference, pp. 237-248 (1998)
10. Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Trans. Database Syst. 24(2), 265-318 (1999)
11. Hu, H., Xu, J., Lee, D.L.: A generic framework for monitoring continuous spatial queries over moving objects. In: SIGMOD Conference (2005)
12. Iwerks, G.S., Samet, H., Smith, K.P.: Maintenance of k-nn and spatial join queries on continuously moving points. ACM Trans. Database Syst. 31(2), 485-536 (2006)
13. Koudas, N., Ooi, B.C., Tan, K.-L., Zhang, R.: Approximate nn queries on streams with guaranteed error/performance bounds. In: VLDB, pp. 804-815 (2004)
14. Koudas, N., Sevcik, K.C.: High dimensional similarity joins: Algorithms and performance evaluation. In: ICDE (1998)
15. Lee, M.-L., Hsu, W., Jensen, C.S., Cui, B., Teo, K.L.: Supporting frequent updates in r-trees: A bottom-up approach. In: VLDB, pp. 608-619 (2003)
16. Mokbel, M.F., Xiong, X., Aref, W.G.: Sina: Scalable incremental processing of continuous queries in spatio-temporal databases. In: SIGMOD Conference, pp. 623-634 (2004)
17. Mokbel, M.F., Xiong, X., Hammad, M.A., Aref, W.G.: Continuous query processing of spatio-temporal data streams in place. In: STDBM, pp. 57-64 (2004)
18. Mouratidis, K., Papadias, D., Hadjieleftheriou, M.: Conceptual partitioning: An efficient method for continuous nearest neighbor monitoring. In: SIGMOD Conference, pp. 634-645 (2005)
19. Nering, E.D., Tucker, A.W.: Linear Programs & Related Problems: A Volume in the Computer Science and Scientific Computing Series. Academic Press, Inc. London (1992)
20. Xiong, X., Aref, W.G.: R-trees with update memos. In: ICDE (2006)
21. Xiong, X., Mokbel, M.F., Aref, W.G.: Sea-cnn: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In: ICDE, pp. 643-654 (2005)
22. Yang, C., Lin, K.-I.: An index structure for improving nearest closest pairs and related join queries in spatial databases. In: IDEAS, pp. 140-149 (2002)
23. Yu, X., Pu, K.Q., Koudas, N.: Monitoring k-nearest neighbor queries over moving objects. In: ICDE, pp. 631-642 (2005)
24. Zhang, J., Mamoulis, N., Papadias, D., Tao, Y.: All-nearest-neighbors queries in spatial databases. In: SSDBM, pp. 297-306 (2004)