1. Y. Manolopoulos, Y. Theodoridis, and V.J. Tsotras. Advanced Database Indexing. Kluwer Academic Publishers, 1999. ISBN 0-7923-7716-8 . (bibtex entry)

1. M. Patella. Similarity Search in Multimedia Database. PhD thesis, Dipartimento di Elettronica Informatica e Sistemistica, Università degli Studi di Bologna, Bologna (Italy), Feb. 1999. (ftp://ftp-db.deis.unibo.it/pub/patella/tesi.pdf ) (bibtex entry)

1. C. Faloutsos. Modern Information Retrieval, chapter 12 - Multimedia IR: Indexing and Searching, pages 345--366. Baeza-Yates, R. and Ribeiro-Neto, B. - Addison Wesley - ACM press, 1999. ISBN:0-201-39829-X . (bibtex entry)

2. G. Navarro. Modern Information Retrieval, chapter 8 - Indexing and Searching, pages 191--228. Baeza-Yates, R. and Ribeiro-Neto, B. - Addison Wesley - ACM press, 1999 . (bibtex entry)

3. E. Bertino and B.C. Ooi. The Indispensability of Dispensable Indexes. IEEE Trans. on Know. and Data Eng. (TKDE), 11(1):17--27 , jan.-feb. 1999. (bibtex entry)

4. T. Bozkaya and M. Özsoyoglu. Indexing Large Metric Spaces for Similarity Search Queries. ACM Transactions on Database Systems (TODS), 24(3):361--404 , 1999. (bibtex entry)

5. B. Salzberg and V.J. Tsotras. A Comparison of Access for Time Evolving Data. ACM Computing Surveys, 31(2):158--221, 1999. (ftp://ftp.ccs.neu.edu/pub/people/salzberg/tempsurvey.ps.gz ) (bibtex entry)

6. T. Tzouramanis, Y. Manolopoulos, and N. Lorentzos. Overlapping B+-trees : An Implementation of Transaction Time Access Method. Data and Knowledge Eng. Journal, 29(3):381--404 , 1999. (bibtex entry)

1. P. Boncz, S. Manegold, and M. Kersten. Database Architecture Optimized for the new Bottleneck: Memory Access. In Proc. of the 25th Int. Conf. on Very Large DataBases (VLDB'99), Edinburgh, Scotland, pages 54--65 , sept. 1999. (bibtex entry)

2. K. Chakrabarti and S. Mehrotra. The Hybrid Tree: An Index Structure for High Demensional Feature Spaces. In Proc. of Int. Conf. on Data Engineering (ICDE'99), pages 440-447, 1999 . (bibtex entry)

3. A. Corral, M. Vassilakopoulos, and Y. Manolopoulos. Algorithms for Joining R-trees and Linear Region Quadtrees. In Proceedings 6th International Symposium on Spatial Databases (SSD'99), Hong-Kong, July 1999. (http://delab.csd.auth.gr/publications.html ) (bibtex entry)

4. A. Gionis, P. Indyk, and R. Motwani. Similarity Search in High Dimensions via Hashing. In Proc. of the 25th Int. Conf. on Very Large DataBases (VLDB'99), Edinburgh, Scotland, pages 518--259 , sept. 1999. (bibtex entry)

5. C.H. Goh, B.C. Ooi, D. Sim, and Tan K-L.. GHOST: Fine Granularity Buffering of Index. In Proc. of the 25th Int. Conf. on Very Large DataBases(VLDB'99), Edinburgh, Scotland, pages 339--350 , sept. 1999. (bibtex entry)

6. C. Jermaine, A. Datta, and E. Omiecinski. A Novel Index Supporting High Volume Data Warehouse Insertions. In Proc. of the 25th Int. Conf.Very Large DataBases (VLDB'99), Edinburgh, Scotland, pages 235--246 , sept. 1999. (bibtex entry)

7. Y. Niu, M. Tamer Özsu, and X. Li. 2-D-S Tree: An Index Structure for Content-Based Retrieval of Images. In Proc. Multimedia Computing and Networking, San Jose, California, 25-29 janv. 1999. (http://www.cs.ualberta.ca/~database/multimedia/publications.html ) (bibtex entry)

8. K. Norvag. The Persistent Cache: Improving OID Indexing in Temporal Object-Oriented Database Systems. In Proc. of the 25th Int. Conf. on Very Large DataBases (VLDB'99), Edinburgh, Scotland, pages 66--77 , sept. 1999. (bibtex entry)

9. J. Rao and K.A. Ross. Cache Conscious Indexing for Decision-Support in Main Memory. In Proc. of the 25th Int. Conf. on Very Large DataBases (VLDB'99), Edinburgh (Scotland), pages 78--89 , sept. 1999. (bibtex entry)

10. M. Shah, M. Kornacker, and J. Hellerstein. Amdb: A Visual Access Method Development Tool. In Int. Workshop on User Interfaces to Data Intensive Systems, Edinburgh (UK) , pages 130--140, 1999. (bibtex entry)

11. T. Tzouramanis, M. Vassilakopoulos, and Y. Manolopoulos. Processing of Spatio-temporal Queries in Image Databases. In East-European Conference on Advances in Databases and Information Systems (ADBIS'99), Maribor (Slovenia), pages 85--97, September 1999. Lecture Notes in Computer Science, Vol. 1691, Springer-Verlag LNCS . (bibtex entry)

12. M. Vassilakopoulos and Y. Manolopoulos. External Balanced Regular (x-BR) trees: New Structures for Very Large Spatial Databases. In Proc. of the 7th National Computer Conf. Also in, Advances in Informatics, by Fotiadis D.I. and Nikolopoulos S.D. (eds), World Scientific, pages 361--368, 1999. (bibtex entry)

1. B. Salzberg, D.B. Lomet, M. Barrena, and L. Jiang. The BT-tree: A Branched and Temporal Access Method. Technical report, College of Computer Science at Northeastern University, 1999. (ftp://ftp.ccs.neu.edu/pub/people/salzberg/forest.ps.gz ) (bibtex entry)

BACK TO INDEX