References

Beckmann, N., H.P. Kriegel, R. Schneider and B. Seeger, 1990. The R-tree: An efficient and robust access method for points and rectangles. Proceedings of the ACM-SIGMOD International Confrence on Management of Data, 1990, University of British Columbia, pp: 322-331.

Bohm, C. and F. Krebs, 2002. High performance data mining using the nearest neighbor join. Proceedings of the IEEE International Conference on Data Mining, December 9-12, 2002, Maebashi City, Japan, pp: 43-50.

Borzsonyi, S., D. Kossmann and K. Stocker, 2001. The skyline operator. Proceedings of the 17th International Conference on Data Engineering, April 2-6, 2001, Heidelberg, pp: 421-430.

Brito, M., E. Chaves, A. Quiroz and J. Yukich, 1997. Connectivity of the mutual k-nearest-neighbor graph in clustering and outlier detection. Stat. Probab. Lett., 35: 33-42.
CrossRef  |  

Chan, T.M., 2006. A dynamic data structure for 3-d convex hulls and 2-D nearest neighbor queries. Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, January 22-26, 2006, Miami, Florida, USA -.

De Berg, M., M. van Kreveld, M. Overmars and O. Schwarzkopf, 2000. Computational Geometry: Algorithms and Applications. 2nd Edn., Springer Verlag, USA.

Ding, C. and X. He, 2004. K-nearest-neighbor consistency in data clustering: Incorporating local information into global optimization. Proceedings of the ACM Symposium on Applied Computing, March 14-17, 2004, Nicosia, Cyprus, New York, pp: 584-589.

Fagin, R., A. Lotem and M. Naor, 2003. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci., 66: 614-656.
Direct Link  |  

Gowda, K. and G. Krishna, 1978. Agglomerative clustering using the concept of mutual nearest neighborhood. Patt. Recog., 10: 105-112.
Direct Link  |  

Gowda, K. and G. Krishna, 1979. The condensed nearest neighbor rule using the concept of mutual nearest neighborhood (Corresp.). IEEE Trans. Inf. Theor., 25: 488-490.
CrossRef  |  

Hjaltason, G.R. and H. Samet, 1998. Incremental distance join algorithms for spatial databases. Proceedings of the ACM SIGMOD International Conference on Management of Data, June 2-4, 1998, Seattle, Washington, USA., pp: 237-248.

Hjaltason, G.R. and H. Samet, 1999. Distance browsing in spatial databases. ACM Trans. Database Syst., 24: 265-318.
Direct Link  |  

Jagadish, H.V., B.C. Ooi, K.L. Tan, C. Yu and R. Zhang, 2005. Distance: An adaptive B⁺-tree based indexing method for nearest neighbor search. TODS, 30: 364-397.
CrossRef  |  

Papadias, D., Y. Tao, G. Fu, and B. Seeger, 2005. Progressive skyline computation in database systems. ACM Trans. Database Syst., 30: 41-82.
CrossRef  |  Direct Link  |  

Tao, Y., V. Hristidis, D. Papadias and Y. Papakonstantinou, 2007. Branch-and bound processing of ranked queries. Inform. Syst., 32: 424-445.
CrossRef  |  Direct Link  |  

Wong, R.C.W., Y. Tao, A.W.C. Fu and X. Xiao, 2007. On efficient spatial matching. Proccedings of the VLDB, September 23-28, 2007, Vienna, Austria, pp: 579-590.