1. E. Chávez, G. Navarro, R.A. Baeza-Yates, and J.L. Marroquín. Searching in metric spaces. ACM Computing Surveys, 33(3):273--321 , 2001. (bibtex entry)

2. K. Kim, S.K. Cha, and K. Kwon. Optimizing multidimensional index trees for main memory access. ACM SIGMOD Record, 30(2):139-150 , 2001. (bibtex entry)

3. Y. Manolopoulos, E. Nardelli, G. Proietti, and E. Tousidou. A generalized comparison of linear representations of thematic layers. Data & Knowledge Engineering (DKE), 37(1):1--23, April 2001. (bibtex entry)

1. P. Bohannon, P. Mcllroy, and R. Rastogi. Main-memory index structures with fixed-size partial keys. In Proc. of the 2001 ACM SIGMOD Int. Conf. on Management of data (SIGMOD'01), 2001 . (bibtex entry)

2. K. Kim, S.K. Cha, and K. Kwon. Optimizing Multidimensional Index Trees for Main Memory Access. In ACM SIGMOD Conference, Santa Barbara, CA (USA), 2001. (www.csis.hku.hk/~nikos/courses/CSIS7101/papers/mmrtree.pdf ) (bibtex entry)

3. K. Ross, I. Sitzmann, and P.J. Stuckey. Cost-based Unbalanced R-trees. In Proc. 10th SSDBM Conference, pages 203--212, 2001. (www.cs.columbia.edu/~kar/pubsk/curtree.pdf ) (bibtex entry)

4. T. Tzouramanis, M. Vassilakopoulos, and Y. Manolopoulos. Time-Split Linear Quadtrees for Indexing Image Databases. In Proceedings 8th IEEE International Conference on Image Processing (ICIP'2001), Thessaloniki (Greece), pages 733--736, October 7-10 2001. (bibtex entry)

BACK TO INDEX