Processing distance join queries with constraints

Computer Journal

Volumn 49, Issue 3, 2006, Pages 281-296

  Papadopoulos, Apostolos N ^a   Nanopoulos, Alexandros ^a   Manolopoulos, Yannis ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

Closest pair queries; Spatial constraints; Spatial data

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATA MINING; DATABASE SYSTEMS;

CLOSEST-PAIR QUERIES; SPATIAL CONSTRAINTS; SPATIAL DATA;

DATA PROCESSING;

EID: 33646243825     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxl002     Document Type: Article

References (21)

1. Mishra, P. and Eich, M. H. (1992) Join processing in relational databases. ACM Comput. Surv., 24(1), 63-113.
2. Brinkhoff, T. Kriegel, H. P. and Seeger, B. (1993) Efficient processing of spatial joins using R-trees. Proc. ACM Int. Conf. Management of Data (SIGMOD 1993). Washington, DC, May, pp. 237-246. ACM Press, New York.
3. Corral, A., Manolopoulos, Y., Theodoridis, Y. and Vassilakopoulos, M. (2000) Closest pair queries in spatial databases. Proc. ACM Int. Conf. Management of Data (SIGMOD 2000). Dallas, TX, pp. 189-200. ACM Press, New York.
4. Shim, K., Srikant, R. and Agrawal, R. (2002) High-dimensional similarity joins. IEEE Trans. Knowl. Data Eng., 14(1), 156-171.
5. Tao, Y. and Papadias, D. Time-parameterized queries in spatiotemporal databases. Proc. ACM Int. Conf. Management of Data (SIGMOD 2002), Madison, WI, pp. 334-345. ACM Press, New York.
6. Bohm, C. and Krebs, F. (2004) The k-nearest neighbor join: Turbo charging the KDD process. Knowl. Inform. Syst., 6(6), 728-749.
7. 2P: clustering based on closest pairs. Proc. 27th Int. Conf. Very Large Databases (VLDB 2001). Rome, Italy, pp. 331-340. Morgan kaufmann, San Francisco, CA.
8. Bohm, C. and Krebs, F. (2003) Supporting KDD applications by the K-nearest neighbor join. Proc. 14th Int. Conf. Database and Expert System Applications (DEXA 2003), Prague, Czech Republic, LNCS 2736, pp. 504-516. Springer Verlag, Berlin.
9. Xia, C., Lu, H., Ooi, B. C. and Hu, J. GORDER: An efficient method for KNN processing. Proc. 30th Int. Conf. Very Large Data Bases (VLDB 2004). Toronto, Canada, pp. 756-767. Morgan Kaufmann, San Francisco, CA.
10. Breunig, M. M. Kriegel, H.-P., Ng, R. T. and Sander, J. (2000) LOF: identifying density-based local outliers. Proc. ACM Int. Conf. Management of Data (SIGMOD 2000). Dallas, TX, pp. 93-104. ACM Press, New York.
11. Karypis, G., Han, E.-H. and Kumar, V. (1999) Chameleon: Hierarchical Clustering Using Dynamic Modeling. Computer., 32(8), 68-75.
12. Eppstein, D. (2000) Fast hierarchical clustering and other applications of dynamic closest pairs. J. Exp. Algorithm., 5(1), 1-23.
13. Beckmann, N., Kriegel, H.-P., Schneider, R. and Seeger, B. (1990) The R*-tree: An efficient and robust access method for points and rectangles. Proc. ACM SIGMOD. Atlantic City, NJ, May, pp. 322-331. ACM Press, New York.
14. Shan, J., Zhang, D. and Salzberg, B. (2003) On spatial-range closest-pair query. Proc. 8th Int. Symp. Spatial and Temporal Databases (SSTD 2003). Santorini, Greece, LNCS 2750, pp. 252-269. Springer Verlag, Berlin.
15. Shou, Y., Mamoulis, N., Cao, H., Papadias, D. and Cheung, D. W. (2003) Evaluation of iceberg distance joins. Proc. 8th Int. Symp. Spatial and Temporal Databases (SSTD 2003). Santorini, Greece, LNCS 2750, pp. 270-278. Springer Verlag, Berlin.
16. Zhang, J., Mamoulis, N., Papadias, D. and Tao, Y. All-nearest-neighbors queries in spatial databases. Proc. 16th International Conf. Scientific and Statistical Databases (SSDBM 2004). Santorini, Greece, pp. 297-306. IEEE Computer Society Press, Los Alamitos, CA.
17. Hjaltason, G. R. and Samet, H. (1998) Incremental distance join algorithms for spatial databases. Proc. ACM SIGMOD Conf., Seattle, WA, pp. 237-248. ACM Press, New York.
18. Corral, A., Manolopoulos, Y., Theodoridis, Y. and Vassilakopoulos, M. (2004) Algorithms for processing K-closest-pair queries in spatial databases. Data Knowl. Eng., 49(1), 67-104.
19. Shin, H., Moon, B. and Lee, S. (2000) Adaptive multi-stage distance join processing. Proc. ACM SIGMOD Conf., Philadelphia, PA, pp. 343-354. ACM Press, New York.
20. TIGER/Line Files. (1994), Technical Documentation. Prepared by the Bureau of the Census. Washington, DC. Available at http://www.census.gov/ geo/www/tiger/
21. Faloutsos, C. and Kamel, I (1994) Beyond uniformity and independence: analysis of R-trees using the concept of fractal dimension. Proc. 13th ACM Symp. Principles of Database Systems (PODS 1994), Minneapolis, MN, pp. 4-13. ACM Press, New York.