1. A.W-C. Fu, P. M-S. Chan, Y-L. Cheung, and Y.S. Moon. Dynamic vp-Tree Indexing for n-Nearest Neighbor Search Given Pair-Wise Distances. VLDB Journal, 9(2):154--173 , 2000. (bibtex entry)

2. E. Nardelli and G. Proietti. An efficient Spatial Access Method for Spatial Images Containing non-overlapping features. Information Systems, 25(8):553--568 , 2000. (bibtex entry)

3. E. Tousidou, A. Nanopoulos, and Y. Manolopoulos. Improved Methods for Signature Tree Construction. The Computer Journal, 43(4):301--314, 2000. (http://delab.csd.auth.gr/publications.html ) (bibtex entry)

4. T. Tzouramanis, M. Vassilakopoulos, and Y. Manolopoulos. Overlapping Linear Quadtrees and Spatio-Temporal Query Processing. The Computer Journal, 43(4):325--343 , 2000. (bibtex entry)

5. Yuh-Horng Yang, Kuo-Liang Chung, and Yao-Hong Tsai. A compact improved quadtree representation with image manipulations. Image and Vision Computing, 18(3):223-231 , 2000. (bibtex entry)

1. I. Bartolini and M. Patella. Correct and Efficient Evaluation of Region-Based Image Search. In In Atti dell'Ottavo Convegno Nazionale su Sistemi Evoluti per Basi di Dati (SEBD 2000), L'Aquila (Italy), 2000. (http://www-db.deis.unibo.it/research/papers/SEBD00.BP.pdf ) (bibtex entry)

2. P. Ciaccia and M. Patella. The M$^2$-tree: Processing Complex Multi-Feature Queries with Just One Index. In Proc. of the 1st DELOS Network of Excellence Workshop on Information Seeking, Searching and Querying in Digital Libraries, Zurich (Switzerland), 2000. (http://www-db.deis.unibo.it/research/papers/DELOS00.CP.pdf ) (bibtex entry)

3. N.G. Colossi and M.A. Nascimento. Benchmarking Access Structures for High-Dimensional Multimedia Data. In Proc. of the IEEE Int. Conf. on Multimedia and Expo (ICME'2000), New York (USA), pages 1215--1218, 2000. (http://www.cs.ualberta.ca/~mn/publications.html ) (bibtex entry)

4. L. Jiang, B. Salzberg, D. Lomet, and M. Barrena. The BT-tree: A Branched and Temporal Access Method. In Proc. of the 26th Int. Conf. on Very Large Data Bases (VLDB'00), Cairo (Egypt), pages 451--460, 2000. (ftp://ftp.ccs.neu.edu/pub/people/salzberg/bttree.ps.gz ) (bibtex entry)

5. H. Lu, Y.Y. Ng, and Z. Tian. T-Tree or B-Tree: Main Memory Database Index Structure Revisited. In Proc. of the 11th Australasian Database Conference 2000, Canberra (Australia), pages 65-73, 2000. IEEE Computer Society. (http://www.dcs.st-and.ac.uk/research/publications/LNT00a.php ) (bibtex entry)

6. J. Rao and K.A. Ross. Making B$^+$-Trees Cache Conscious in Main Memory. In Proc. of ACM SIGMOD Int. Conf. on Management of Data - SIGMOD Record 29(2), Dallas (USA), pages 475--486, 2000. (www.cs.duke.edu/~junyang/courses/cps216-2003-spring/ papers/rao-ross-2000.pdf ) (bibtex entry)

7. Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima. The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation. In Proc. of the 26th Int. Conf. on Very Large DataBases (VLDB'00), Cairo (Egypt) , pages 516--526, 2000. (bibtex entry)

8. J. Srinivasan, R. Murthy, S. Sundara, N. Agarwal, and S. DeFazio. Extensible Indexing: A Framework for Integrating Domian-SPecific Indexing SChemes into Oracle8i. In Int. Conf on Data Engineering (ICDE'2000), San Diego, CA (USA) , pages 91--1000, 2000. (bibtex entry)

9. E. Tousidou and Y. Manolopoulos. A Performance Comparison of Quadtree-based Access Methods for Color Images. In Proceedings 14th ACM Symposium on Applied Computing (SAC'2000), Como (Italy), March 2000. (bibtex entry)

10. C. Traina Jr., A.J.M. Traina, B. Seeger, and C. Faloutsos. Slim-trees: High Performance Metric Trees Minimizing Overlap Between Nodes. In VII Int. Conf. on Extending Database Technology (EDBT), Konstanz (Germany), pages 51--65, 2000. (pdf) (bibtex entry)

11. T. Tzouramanis, M. Vassilakopoulos, and Y. Manolopoulos. Multiversion Linear Quadtree for Spatio-Temporal Data. In East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications, (ADBIS-DASFAA 2000), Prague (Czech Republic), pages 279--292, September 5-8 2000. Lecture Notes in Computer Science, Vol. 1884, Springer . (bibtex entry)

1. L. Jiang, B. Salzberg, D.B. Lomet, and M. Barrena. An Abstract Framework for a Family of Paginated Access Methods for Versioned Data. Technical report, College of Computer Science at Northeastern University, 2000. (ftp://ftp.ccs.neu.edu/pub/people/salzberg/family.ps.gz ) (bibtex entry)

2. T. Tzouramanis, M. Vassilakopoulos, and Y. Manolopoulos. Multiversion Linear Quadtree for Spatio-Temporal Data. Technical report, Dept. of Informatics, Aristotle University, Thessaloniki, Greece, mars 2000. (http://skyblue.csd.auth.gr/~theo/TechnicalReports/ ) (bibtex entry)

BACK TO INDEX