1. J. Jaffar, R.H.C. Yap, and K.Q. Zhu. Indexing for Dynamic Abstract Regions. In Proc. of the 22nd Int. Conf. on Data Engineering (ICDE'2006), Atlanta (USA), Apr. 2006. (http://www.comp.nus.edu.sg/~joxan/papers/rct.pdf ) (bibtex entry)

1. Y.S. Min, C.Y. Yang, J.S. Yoo, J.M. Shim, and S.I. Song. PCR-Tree: An Enhanced Cache Conscious Multi-dimensional Index Structures. In Database and Expert Systems Applications - 15th Int. Conf. (DEXA 2004), Zaragoza (Spain) , pages 212-221, 2004. (bibtex entry)

2. B. Salzberg, L. Jiang, D.B. Lomet, M. Barrena García, and E. Kanoulas. A Framework for Access Methods for Versioned Data. In Advances in Database Technology - EDBT 2004, 9th Int. Conf. on Extending Database Technology, Heraklion, Crete (Greece), pages 730--747, March 2004. (http://www.ccs.neu.edu/research/dblab/publications/framework.pdf ) (bibtex entry)

1. S. Hwang, K. Kwon, S.K. Cha, and B.S. Lee. Performance Evaluation of Main-Memory R-tree Variants. In Proc. of Advances in Spatial and Temporal Databases, 8th International Symposium (SSTD 2003), Santorini Island (Greece), pages 10--27, July 2003. Lecture Notes in Computer Science 2750 Springer 2003 . (bibtex entry)

2. L. Jiang, B. Salzberg, D. Lomet, and M. Barrena. The BTR-Tree: Path-Defined Version-Range Splitting in a Branched and Temporal Structure. In 8th Int. Symp. on Spatial and Temporal Databases (SSTD 2003), Santorini Island (Greece), July 2003. (http://www.ccs.neu.edu/research/dblab/publications/jiang.pdf ) (bibtex entry)

3. K-T. Lee, I. Jung, and C-Y. Choi. Design and Implementation of a Cache-Conscious Index Manager for the Tachyon, a Main Memory DBMS. In 27th Annual Int. Computer Software and Applications Conf., Dallas, Texas (USA), Nov. 2003. (bibtex entry)

1. S. Brakatsoulas, D. Pfoser, and Y. Theodoridis. Revisiting R-tree Construction Principles. In Proc. 6th East-European Conference on Advances in Databases and Information Systems (ADBIS'02), Bratislava (Slovakia), pages 149--162, Sept. 2002. Springer LNCS #2435. (pdf) (bibtex entry)

2. S-W. Kim, S. Park, and W. Choi. Design and Implementation of an Index Manager for a Main Memory DBMS Tachyon. In Proc. 20th IASTED Int. Conf. on Applied Informatics (AI2002), Innsbruck (Austria), Feb. 2002. (http://www.postech.ac.kr/~sanghyun/papers/ai02.ps ) (bibtex entry)

3. D. Papadias, Y. Tao, P. Kalnis, and J. Zhang. Indexing Spatio-Temporal Data Warehouses. In Proc. of IEEE Int. Conf. on Data Engineering (ICDE), San Jose, pages 166--175, 2002. (http://www.cs.ust.hk/~dimitris/publications.html ) (bibtex entry)

4. I. Sitzmann and P.J. Stuckey. Compacting Discriminator Information for Spatial Trees. In Proc. of the 13th Australasian conference on Database technologies - Volume 5 (ADC2002), pages 167--176, 2002. ACM International Conference Proceeding Series; Vol. 18 . (bibtex entry)

5. Y. Tao, D. Papadias, and J. Zhang. Cost Models for Overlapping and Multi-Version B-trees. In Proc. of IEEE Int. Conf. on Data Engineering (ICDE), San Jose, pages 191--200, 2002. (http://www.cs.ust.hk/~dimitris/publications.html ) (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)

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. 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. P.M. Aoki. Generalizing Search in Generalized Search Trees. In Proc. of 14th Int. Conf. on Data Engineering (ICDE'98), Orlando, Floride US, pages 380--389, Fév. 1998. (http://gist.cs.berkeley.edu/ ) (bibtex entry)

2. R. Bliujute, C.S. Jensen, S. Saltenis, and G. Slivinskas. R-Tree Based Indexing of Now-Relative Bitemporal Data. In Proc. of the 24th Int. Conf. on Very Large Databases (VLDB'98), New-York (USA), pages 345--356 , 1998. (bibtex entry)

3. P. Ciaccia and M. Patella. Bulk loading the M-tree. In Proc. of th 9th Australasian Database Conf. (ADC'98), Perth (Australia), 1998. (http://www-db.deis.unibo.it/research/papers/ADC98.pdf ) (bibtex entry)

4. A. Henrich. The LSD$^h$-tree: An Access Structure for Feature Vectors. In 14th Int. Conf. on Data Engineering (ICDE'98), Orlando, Florida, pages 362--369 , fev. 1998. (bibtex entry)

5. M.A. Nascimento and J.R.O. Silva. Toward Historical R-trees. In Proc. of ACM Symposium on Applied Computing (SAC'98), pages 235--240 , Feb. 1998. (bibtex entry)

6. T. Tzouramanis, M. Vassilakopoulos, and Y. Manolopoulos. Overlapping Linear Quadtrees: a Spatio-temporal Access Method. In 6th ACM Workshop on Advances in Geographical Information Systems (ACM-GIS 98), Washington D.C., Nov. 1998 . (bibtex entry)

7. R. Weber, H-J. Schek, and S. Blott. A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. In Proc. of the 24rd Int. Conf. on Very Large DataBases (VLDB'98), New York (USA) , pages 194--205, 1998. (bibtex entry)

8. R. Weber, H-J. Schek, and S. Blott. A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. In Proc. 24th Int. Conf. on Very Large DataBases (VLDB'98), 1998 . (bibtex entry)

1. C-H. Ang and T.C. Tan. New Linear Node Splitting Algorithm for R-trees. In Proc. of the 5th Int. Symposium on Advances in Spatial Databases, pages 339--349, 1997. LNCS 1262. (www.comp.nus.edu.sg/~tantc/papers/nsplitLN.ps ) (bibtex entry)

2. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In Proc. of the 23rd Int. Conf. Very Large Database Conference (VLDB'97), Athens Greece , 1997. (bibtex entry)

3. N. Katayama and S. Satoh. The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries. In Proc. ACM SIGMOD Int. Conf. on Management of Data - SIGMOD Record 26(2), Tucson, Arizona, USA, pages 369--380 , 1997. (bibtex entry)

4. M.A. Nascimento and M.H. Dunham. Using B+-trees in a Two Disk-Single Processor Architecture to Efficiently Process Inclusion Spatial Queries. In Proc. of the 5th Inter. Workshop on Advances in Geographic Information Systems (ACM GIS-97), Nov. 1997. (bibtex entry)

5. Y. Niu, M. Tamer Özsu, and X. Li. 2D-h Trees: An Index Scheme for Content-Based Retrieval of Images in Multimedia Systems. In IEEE International Conference On Intelligent Processing Systems 1997 (IEEE ICIPS'97), Beijing, China, pages 1710--1715, oct. 1997. (http://www.cs.ualberta.ca/~database/multimedia/publications.html ) (bibtex entry)

6. R. Rastogi, S. Seshadri, P. Bohannona, D. Leinbaugh, A. Silberschatz, and S. Sudarshan. Logical and physical versioning in main-memory databases. In Proc. of the 23rd Int. Conf. on Very Large Databases, Aug. 1997. (pdf) (bibtex entry)

7. W. Reimer. Version-Based Index Management in an Object-Oriented Database System to support Software Engineering Applications. In 4th Inter. Conf. on Object-Oriented Information Systems (OOIS'97), Brisbane - Australia, pages 477--490 , Nov. 1997. (bibtex entry)

1. S. Berchtold, D.A. Keim, and H.P. Kriegel. The X-tree: An Index Structure for High-Dimensional Data. In Proc. of the 22nd Int. Conf. on Very Large DataBases (VLDB'96), Mumbai (Bombay - India), pages 28--39 , 1996. (bibtex entry)

2. S.S. Chawathe, A. Rajaraman, H. Garcia-Molina, and J. Widom. Change Detection in Hierarchically Structured Information. In Proc. of ACM SIGMOD Int. Conf. on Management of Data - SIGMOD Record 25(2), Montréal (Canada), pages 493--504, 1996. (http://www-db.stanford.edu/pub/papers/tdiff3-8.ps ) (bibtex entry)

3. K-R. Choi and K-C. Kim. T*-tree: a main memory database index structure for real time applications. In Third International Workshop on Real-Time Computing Systems Application (RTCSA'96), pages 81--88, 1996 . (bibtex entry)

4. M.A. Nascimento and M.H. Dunham. Using B+-trees as a Practical Alternative to the Classical R-tree. In SBBD'96 Proceedings, Sao Carlos, Brazil, pages 187--200, Oct. 1996. (http://calixto.cnptia.embrapa.br/~mario/ ) (bibtex entry)

5. E. Remias, G. Sheikholeslami, and A. Zhang. Block-Oriented Image Decomposition and Retrieval in Image Database Systems. In Int. Work. on Multi-media Database Management Sys., New York - USA, Aug. 1996. (bibtex entry)

6. Y. Theodoridis, M. Vazirgiannis, and T. Sellis. Spatio-Temporal Indexing of Large Multimedia Applications. In Proc. of MULTIMEDIA'96, pages 441--448 , 1996. (bibtex entry)

7. D.A. White and R. Jian. Similarity Indexing with the SS-tree. In ICDE, Tokyo, pages 516--523, Feb. 1996. (bibtex entry)

8. J. Won and R. Elmasri. Representing Retroactive and Proactive Versions in Bi-Temporal DataBases (2TDB). In Proc. of the 12th Int. Conf. on Data Engineering, Tokyo, pages 85--95, Fev. 1996. IEEE Computer Society . (bibtex entry)

1. P.A. Broncz and M.L. Kersten. Monet: An impressionnist sketch of an advanced database system. In IEEE BIWIT Workshop, San Sebastien (Spain), juillet 1995. (bibtex entry)

2. A. Eickler, C.A. Gerholf, and D. Kossmann. A Performance Evaluation of OID Mapping Techniques. In Proc. 21st Int. Conf. on Very Large DataBases (VLDB'95), Zurich (Switzerland), pages 18--29 , 1995. (bibtex entry)

3. G. Evangelidis, D. Lomet, and B. Salzberg. The hB$^II$-tree: A Modified hB-tree Supportong Concurrency, Recovery and Node Consolidation. In Proc. 21st Int. Conf. on Very Large DataBases (VLDB'95), Zurich (Switzerland), pages 551--561 , 1995. (bibtex entry)

4. J.M. Hellerstein, J.F. Naughton, and A. Pfeffer. Generalized Search Trees for Database Systems. In Proc. 21st Int. Conf. on Very Large Data Bases (VLDB'95), Zürich, pages 562--573, 1995. (http://db.cs.berkeley.edu/papers/vldb95-gist.pdf ) (bibtex entry)

5. J.M. Hellerstein, J.F. Naughton, and A. Pfeffer. Generalized Search Trees for Database Systems. In Proc. 21st Int. Conf. on Very Large DataBases (VLDB'95), Zurich (Switzerland), pages 562--573 , 1995. (bibtex entry)

6. M. Kornacker and D. Banks. High-Concurrency Locking in R-Trees. In Proc. of the 21st Int. Conf. On Very Large DataBases (VLDB'95), Zurich (Switzerland), pages 134--145 , 1995. (bibtex entry)

7. N. Roussopoulos, S. Kelly, and F. Vincent. Nearest Neighbor Queries. In Proc. of ACM SIGMOD Int. Conf. on Management of Data - SIGMOD Record 24(2), pages 71--79 , 1995. (bibtex entry)

1. T-c. Chieuh. Content-Based Image Indexing. In Proc. of the 20th Int. Conf. on Very Large DataBases(VLDB'94), Santiago, Chili, pages 582--593 , 1994. (bibtex entry)

2. I. Kamel and C. Faloutsos. Hilbert R-tree: An Improved R-tree Using Fractals. In Proc. of the 20th Int. Conf. on Very Large DataBases (VLDB'94), Santiago - Chili, pages 500--509 , 1994. (bibtex entry)

3. C. Kilger and G. Moerkotte. Indexing Multiple Sets. In Proc. 20th Int. Conf. on Very Large DataBases (VLDB'94), Santiago (Chile), pages 180--191 , 1994. (bibtex entry)

4. M.R. Mediano, M.A. Casanova, and M. Dreux. V-Tree - A Storage Method for Long Vector Data. In Proc. 20th Int. Conf. on Very Large DataBases (VLDB'94), Santiago (Chile), pages 321--330 , 1994. (bibtex entry)

5. B. Screenath and S. Seshadri. The hcC-tree: An Efficient Index Structure For Object Oriented Databases. In Proc. of 20th Int. Conf. on Very Large DataBases (VLDB'94), Santiago (Chile), pages 203--213 , 1994. (bibtex entry)

6. H. Shen, B.C. Ooi, and H. Lu. The TP-Index: A Dynamic and Efficient Indexing Mechanism for Temporal Databases. In Proc. of the 10th Int. Conf. on Data Engineering, pages 274--281, Fev. 1994. IEEE Computer Society . (bibtex entry)

7. J.R. Smith and S-F. Chang. Quad-Tree Segmentation for Texture-Based Image Query. In Proc. of 2nd Annual ACM Int. Conf. on Multimedia, San Fransisco, CA. USA, pages 279--286, Oct. 1994 . (bibtex entry)

1. M. Vassilakopoulos and Y. Manolopoulos. Analytical Results on the Quadtree Storage-Requirements. In Springer-Verlag, editor, Proceedings 5th International Conference on Computer Analysis of Images and Patterns (CAIP 93), IAPR, volume Lecture Notes in Computer Science 719, Budapest, pages 41--48 , Sept. 1993. (bibtex entry)

2. P.N. Yianilos. Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces. In SODA: ACM-SIAM Symposium on Discrete Algorithms (Conf. on Theoretical and Experimental Analysis of Discrete Algorithms), 1993 . (bibtex entry)

1. P.G. Anick and R.A. Flynn. Versionning a Full-text Information Retrieval System. In Proc. of the 15th Annuel Int. ACM SIGIR Conf. on Research and Development in Information Retrieval - Databases Structures, pages 98-111 , 1992. (bibtex entry)

2. A. Biliris. An Efficient Database Storage Structure for Large Dynamic Objects. In Proc. of IEEE 8th Conf. on Data Engineering (ICDE'92), Phoenix, Arizona (USA), pages 301--308 , Feb. 1992. (bibtex entry)

3. A. Biliris. The Performance of Three Database Storage Structures for Managing Large Objects. In Proc. of ACM SIGMOD Int. Conf. on Management of Data - SIGMOD Record 21(2), San Diego, CA (USA), pages 276--285 , 1992. (bibtex entry)

1. J.P. Cheiney and A. Touir. FI-Quadtree: a New Data Structure for Content-Oriented Retrieval and Fuzzy Search. In Proc. of the 2nd Symposium on Spatial Databases (SSD'91), pages 23--32 , 1991. (bibtex entry)

2. J.R. Driscoll, D.D.K. Sleator, and R.E. Tarjan. Fully Persistent Lists with Catenation. In Proc. of the second annual ACM-SIAM Symposium on Discrete Alogotihms, pages 89-99 , Jan. 1991. (bibtex entry)

3. S. Lanka and E. Mays. Fully Persistent B+-trees. In James Clifford and Roger King, editors, Proc. of ACM SIGMOD Int. Conf. on Management of Data - SIGMOD Record 20(2), Denver, Colorado (USA), pages 426--435 , 29--31 Mai 1991. (bibtex entry)

4. A. Touir and B. Kerhervé. Pattern Translation in Images Encoded by Linear Quadtree. In Proc. of IFIP TC 5.10 Working Conf. on modeling in Computer Graphics, Tokyo (Japon), pages 231--246 , avril 1991. (bibtex entry)

1. H.V. Jagadish. Spatial search with polyhedra. In IEEE Int. Conf. Data Engineering (ICDE'90), pages 311--319, 1990 . (bibtex entry)

2. Y. Manolopoulos and G. Kapetanakis. Overlapping B+-Trees for Temporal Data. In Proc. of Jerusalem Conf. on Inf. Technology (JCIT 90) - IEEE Computer Science Press #2078, Israël, pages 491--499 , Oct. 1990. (bibtex entry)

1. J. Estublier and J-M. Favre. Structuring Large Versionned Software Products. In Proc of IEEE COMPSAC, pages 404-411 , 1989. (bibtex entry)

1. T. Sellis, N. Roussopoulos, and C. Faloutsos. The R+-Tree: A Dynamic Index For Multi-Dimensional Objects. In Proc. of 13th Int. Conf. on Very Large DataBases (VLDB'87), Brighton, pages 507--518 , 1987. (bibtex entry)

1. S.D. Lang and J.R. Driscoll. Improving the Differential Fila Technique via Batch Operations fot Tree Structured File Organizations. In Proc. of IEEE International Conf. on Data Engineering (ICDE'86), pages 524--532 , 1986. (bibtex entry)

2. T.J. Lehman and M.J. Carey. A Study of Index Structures for Main Memory Database Management Systems. In Proc. of the 12th Int. Conf. on Very Large Data Bases (VLDB '86), pages 294--303 , 1986. (bibtex entry)

3. T.J. Lehman and M.J. Carey. Query processing in main memory database management systems. In Proc. of the 1986 ACM SIGMOD Int. Conf. on Management of data (SIGMOD '86), pages 239--250, 1986. ACM SIGMOD Record, Volume 15 Issue 2 . (bibtex entry)

1. A. Guttman. R-trees : A Dynamic Index Structure for Spatial Searching. In Proc. of ACM SIGMOD Int. Conf. on the Management of Data - SIGMOD Record 14(2), pages 45--57, 1984 . (bibtex entry)

BACK TO INDEX