1Baeza-Yates R. Searching: an algorithmic tour. In: A. Kent, J.Williams, eds. Encyclopedia of Computer Science and Technology, Marcel Dekker Inc. , 1997,37; 331-359.
2Baeza-Yates R, Cunto W, Manber U, Wu S. Proximity matching using fixed-queries trees. In; Proe. 5th Combinatorial Pattern Matching (CPM'94), LNCS 807,1994. 198-212.
3Bentley J L. Multidimensional Binary Search Trees Used for Associative Searching. Communications of the ACM. 1975.18(9) : 509-517.
4Bozkaya T,Ozsoyoglu M. Distance-based indexing for high-dimen-sional metric spaces. In: ACM SIGMOD Intl. Conf. on Management of Data ,Sigmod Record ,1997,26(2) : 357-368.
5Brin S. Near neighbor search in large metric spaces. In: Proc. 21^st Conf. on Very Large Database(VLDB'95), 1995.574-584.
6Burkhard W -Keller R. Some approaches to best-match file searching. Comm. of the ACM,1973, 16(4) :230-236.
7Chavez E, Marroquin J, Navarro G. Overcoming the curse of dimensionality . In:European Worshop on Content-Based Multimedia Indexing (CBMI'99) ,1999.57-64.
8Chavez E, Navarro G, Baeza-Yates R, Marroquin J. Searching in Metric Spaces. ACM Computing Surveys, 2001.
9Ciaccia P,Patella M,Zezula P. M-tree: an efficient access method for similarity search in metric spaces. In:Proc. Of the 23^rd Conf.on Very Large Databases(VLDB'97),1997. 426-435.
10Ciaccia P, Patella M. The M^2-tree : Processing Complex Multi-Feature Queries with Just One Index. DELOS Workshop : Information Seeking, Searching and Querying in Digital Libraries 2000.
