1. S. Moses and L. Gruenwald. Scalability of indexing structures in a production systems testbed for computational research. Computers & Industrial Engineering, 48(1):97--109, Jan. 2005. (bibtex entry)

1. Z. Mao and C. Douligeris. A distributed database architecture for global roaming in next-generation mobile networks. IEEE/ACM Transactions on Networking (TON), 12(1):146--160, Feb. 2004. (bibtex entry)

2. J.M. Shim, S.I. Song, J.S. Yoo, and Y.S. Min. An Efficient Cache Conscious Multi-dimensional Index Structure. Information Processing Letters, 92(3):133-142, Nov. 2004. (bibtex entry)

1. K. Kato. Persistently Cached B-Trees. IEEE Trans. on Knowledge and Data Eng. (TKDE), 15(3):706-720, May/June 2003. (http://www.osss.is.tsukuba.ac.jp/kato/files/2001-04-tkde.pdf ) (bibtex entry)

1. M. Bern, D. Eppstein, and B. Hutchings. Algorithms for coloring quadtrees. Algorithmic, 32(1):87--94, 2002. (http://arXiv.org/abs/cs.CG/9907030 ) (bibtex entry)

2. G.R. Hjaltason and H. Samet. Speeding up construction of PMR quadtree-based spatial indexes. VLDB Journal, 11(2):110--137 , 2002. (bibtex entry)

3. P. Rigaux, M. Scholl, and A. Voisard. Spatial Databases With Application to GIS, chapter 6 - Spatial Access Methods, pages 201--266 . Morgan Kaufmann Pub., 2002. (bibtex entry)

4. C. Traina Jr., A.J.M. Traina, C. Faloutsos, and B. Seeger. Fast Indexing and Visualization of Metric Datasets using Slim-trees. IEEE Transactions on Knowledge and Data Engineering (TKDE), 14:244--260, 2002. (pdf) (bibtex entry)

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. 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. 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)

2. 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)

3. 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)

4. 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)

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. M. Bouzeghoub, M. Jouve, and P. Pucheral. Les Bases de données en questions - Tome 1 - Modèles de stockage et d'accés - placement, indexation, navigation, chapter 4 - Organisations arborescentes, pages 49--71. Hermes, 1998. ISBN: 2-86601-715-3 . (bibtex entry)

2. F. Brabec and H. Samet. Visual Database Systems 4 (VDB4), chapter Visualizing and animating r-trees and spatial operations in spatial databases on the worldwide web, pages 147--153. Chapman & Hall, 1998. (http://www.cs.umd.edu/~hjs/pubs.html ) (bibtex entry)

3. K.L. Cheung and A.W-C. Fu. Enhanced Nearest Neighbour Search on the R-tree. SIGMOD Record, 27(3):16--21 , 1998. (bibtex entry)

4. G.M. Davis. A Wavelet-Based Analysis of Fractal Image Compression. IEEE Trans. on Image Processing, 7(2):141--153 , Feb. 1998. (bibtex entry)

5. M.J Folk, B. Zoellick, and G. Riccardi. Files Structures - An Object-Oriented Approach with C++, chapter Chapter 9 - Multilevel Indexing and B-Trees, pages 369--422. 1998. ISBN: 0-201-87401-6 . (bibtex entry)

6. V. Gaede and O. Günther. Survey on Multidimensional Access Methods (Revised Version). ACM Computing Surveys, 30(2):170--231, juin 1998. (http://www.wiwi.hu-berlin.de/~gaede/survez.rey.ps.Z ) (bibtex entry)

7. O. Günther. Environmental Information Systems, chapter 3- Data Storage, pages 68--110. Springer, 1998. ISBN : 3-540-60926-1 . (bibtex entry)

8. A. Kumar, V.J. Tsotras, and C. Faloutsos. Designing Access Methods for Bitemporal Databases. IEEE Trans. on Knowledge abd Data Engineering (TKDE), 10(1):1--20 , 1998. (bibtex entry)

9. A. Kumar, V.J. Tsotras, and C. Faloutsos. Designing Access Methods for Bitemporal Databases. IEEE Transactions on Knowledge and Data Engineering (TKDE'98), 10(1):1--2 , 1998. (bibtex entry)

10. D. Lomet. B-tree Page Size When Caching is Considered. SIGMOD Record, 27(3):28--32 , Sept. 1998. (bibtex entry)

11. J. Paredaens and B. Kuijpers. Data models and query languages for spatial databases. Data and Knoledge Engineering, 25:29--53 , 1998. (bibtex entry)

12. C.T. Yu and W. Meng. Principles of Database Query Processing for Advanced Applications, chapter 8 - Multidimensional Search Structures, pages 267--294. Morgan Kaufmann Publishers, 1998. ISBN: 1-55860-434-0 . (bibtex entry)

1. W. G. Aref and H. Samet. Efficient window block retrieval in quadtree-based spatial databases. GeoInformatica, 1(1):59--91, April 1997. (http://www.cs.umd.edu/~hjs/pubs.html ) (bibtex entry)

2. P.M. Bober and M.J. Carey. Indexing for Multiversion Locking: Alternatives and Performance Evaluation. IEEE Transactions on Knowledge and data Engineering, 9(1):68--84 , Jan/Fev 1997. (bibtex entry)

3. T. Bozkaya and M. Ozsoyoglu. Distance-Based Indexing for High-Dimensional Metric Spaces. SIGMOD Record, 26(2):357--368, 1997. (http://erciyes.ces.cwru.edu/bozkaya/ ) (bibtex entry)

4. M. de Marsicoi, L. Cinque, and S. Levialdi. Indexing pictorial documents by their content: a survey of current techniques. Image and Vision Computing, 15:119--141 , 1997. (bibtex entry)

5. J. Gray and G. Graefe. The Five-Minute Rule Ten Years Later, and Ohter Computer Storage Rules of Thumb. SIGMOD Record, 26(4):63--68 , Dec. 1997. (bibtex entry)

6. O. Günther and V. Gaede. Oversize Shelves: A Storage Management Technique for Large Spatial Data Objects. International Journal on Geographic Information Science, 11(1 ), 1997. (bibtex entry)

7. C. Herley, Z. Xiong, and M.T. Ramchandran, K. and Orchard. Joint Space-Frequency Segmentation Using Balanced Wavelet Packet Trees for Least-Cost Image Representation. IEEE Transactions on Image Processing, 6(9):1213--1230 , Sept. 1997. (bibtex entry)

8. D.J. Jackson, W. Mahmoud, and P.T. Stapleton, A. and Gaughan. Faster fractal image compression using quadtree recomposition. Image and Vision Computing, 15:759--767 , 1997. (bibtex entry)

9. Tsong-Wuu Lin. Set operations on Constant Bit-Lenght Linear Quadtrees. Pattern Recognition, 30(7):1239--1249 , 1997. (bibtex entry)

10. Tsong-Wuu Lin. Compressed quadtree representations for storing similar images. Image and Vision Computing, 15(11):833--843 , 1997. (bibtex entry)

11. D. Lomet and B. Salzberg. Concurrency and recovery for index trees. VLDB Journal, 6(3):224--240, Aout 1997. Springer Verlag . (bibtex entry)

12. F.A. Schreiber and R.C. Wolfler. Use of Neural Networks to Estimate the Number of Nodes of an Edge Quadtree. Graphical Models and image Processing, 59(2):61--72 , 1997. (bibtex entry)

13. G. Sheikholeslami, J. Guo, and E. Zhang, A. and Remias. Image Decomposition and Representation in Large Image Database Systems. The Journal of Visual Comm. and Image Repres., 8(2):167--181 , June 1997. (bibtex entry)

14. N. Shivakumar and H. Garcia-Molina. Wave-Indices: Indexing Evolving Databases. SIGMOD Record, 26(2):381--392, 1997 . (bibtex entry)

15. Du-Ming Tsai. An improved generalized Hough transform for the recognition of overlapping objects. Image and Vision Computing, 15:877--888 , 1997. (bibtex entry)

16. P.J. Varman and R.M. Verma. An Efficient Multiversion Access Structure. IEEE Transactions on Knowledge and Data Engineering, 9(3):391--409 , May/June 1997. (bibtex entry)

1. B. Becker, S. Gshwind, T. Olher, B. Seeger, and P. Widmayer. An asymptotically optimal multiversion B-tree. The Very Large DataBases (VLDB) Journal, 5(4):264--275, Dec. 1996. Springer Verlag . (bibtex entry)

2. C.H. Goh, H. Lu, B-C. Ooi, and K-L. Tan. Indexing temporal data using existing $B^+$-trees. Data and Knowledge Engineering, 18:147--165 , 1996. (bibtex entry)

3. M. Scholl, A. Voisard, L. Peloux, J-P. and Raynal, and P. Rigaux. SGBD Géographiques - Spécificités, chapter 4 - Index Spatiaux, pages 73--108 . Thomson Publishing, 1996. (bibtex entry)

4. M.D. Swanson and H. Tewfik. A Binary Wavelet Decomposition of Binary Images. IEEE Transactions on image Processing, 5(12):1637--1650 , Dec. 1996. (bibtex entry)

5. P. Wang and W.E. Weihl. Scalable Concurrent B-Trees Using Multi-Version Memory. Journal of Parallel and Distributed Computing, 32(1):28--48 , Jan. 1996. (bibtex entry)

6. C. Zou and B. Salzberg. On-line Reorganisation of Sparsely-populated B$^+$-trees. SIGMOD RECORD, 25(2):115--124 , Juin 1996. (bibtex entry)

1. G.M. Landau, J.P. Schmidt, and V.J. Tsotras. Historical Queries Along Multiple Lines of Time Evolution. VLDB Journal, 4:703--726 , 1995. (bibtex entry)

2. J-P. Peloux, G. Reynal de St Michel, and M. Scholl. Evaluation of Spatial Indices Implemented with the O$_2$. Ingénierie des Systèmes d'Information, 3(4), 1995. (ftp://sikkim.cnam.fr/pub/Reports/VersoReport-069.ps.gz ) (bibtex entry)

3. H. Samet and W. G. Aref. Modern Database Systems: The Object Model, Interoperability, and Beyond, chapter Spatial data models and query processing, pages 338--360. Addison-Wesley/ACM Press, 1995. (http://www.cs.umd.edu/~hjs/pubs.html ) (bibtex entry)

4. V.J. Tsotras, B. Gopinath, and G.W. Hart. Efficient Management of Time-Evolving Databases. IEEE Transactions on Knowledge and Data Engineering, 7(4):591--608 , Aou 1995. (bibtex entry)

5. M. Vassilakopoulos and Y. Manolopoulos. A random model for analysing region quadtrees. Pattern Recognition Letters, 16:1137--1145 , 1995. (bibtex entry)

6. M. Vassilakopoulos and Y. Manolopoulos. Dynamic Inverted Quadtrees - a Structure for Pictorial Databases. Information Systems, Special Issue on Multimedia Information Systems, 20(6):483--500 , 1995. (bibtex entry)

7. M. Vassilakopoulos, Y. Manolopoulos, and B. Kroell. Efficiency Analysis of Overlapped Quadtrees. Nordic Journal on Computing, 2(1):70--84 , 1995. (bibtex entry)

1. K-I. Lin, H.V. Jagadish, and C. Faloutsos. The TV-Tree: An Index Structure for High-Dimensional Data. VLDB Journal, 3(4):517--542 , 1994. (bibtex entry)

2. Y. Manolopoulos. B-trees with Lazy Parent Split. Information Sciences, 79, Juin 1994. (bibtex entry)

3. E. Shusterman and M. Feder. Image Compression via Improved Quadtree Decomposition Algorithms. IEEE Transactions on Image Processing, 3(2):207--215 , mars 1994. (bibtex entry)

4. G.J. Sullivan and R.L. Baker. Efficient Quadtree Coding of Images and Video. IEEE Transactions on Image Processing, 3(3):327--331 , mai 1994. (bibtex entry)

1. R. Elmasri, G.T.J. Wuu, and V. Kouramajian. Temporal Databases Theory, design, and implementation, chapter 18 - The Time Index and the Monotonic B$^+$-tree, pages 433--456. Tansel, Clifford, Gadia, Jojodia, Segev, Snodgrass, 1993. The Benjamin Cummings Publishing, ISBN : 0-8053-2413-5 . (bibtex entry)

2. C.P. Kolvson. Temporal Databases Theory, design, and implementation, chapter 17 - Indexing Techniques for Historical Databases, pages 418--432. Tansel, Clifford, Gadia, Jojodia, Segev, Snodgrass, 1993. The Benjamin Cummings Publishing, ISBN : 0-8053-2413-5 . (bibtex entry)

3. D. Lomet and B. Salzberg. Temporal Databases Theory, design, and implementation, chapter 16 - Transaction Time Databases, pages 388--417. Tansel, Clifford, Gadia, Jojodia, Segev, Snodgrass, 1993. The Benjamin Cummings Publishing, ISBN : 0-8053-2413-5 . (bibtex entry)

4. J.M. Shapiro. Embedded Image Coding Using Zerotrees of Wavelet Coefficients. IEEE Transactions on Image Processing, 41(12):3445--3462 , Dec. 1993. (bibtex entry)

5. M. Vassilakopoulos, Y. Manolopoulos, and K. Economou. Overlapping Quadtrees for the Representation of Similar Images. Image and Vision Computing, 11(5):257--262 , june 1993. (bibtex entry)

1. Y. Manolopoulos and S Christodoulakis. File Organizations with Shared Overflow Blocks for Variable Length Objects. Information Systems, 17(6):491--509 , Nov. 1992. (bibtex entry)

1. E. Mays, S. Lanka, B. Dionne, and R. Weida. A persistent Store for Large Shared Knowledge Bases. IEEE Transactions on Knowledge and Data Engineering, 3(1):33--41 , mars 1991. (bibtex entry)

2. Fangju Wang. Relational-Linear Quadtree Approach for Two-Dimensional Spatial Representation and Manipulation. IEEE Transaction on Knowledge and Data Engineering, 3(1):118--122 , Mars 1991. (bibtex entry)

1. F.W. Burton, J.G. Kollias, and V.G. Matsakis, D.G. and Kollias. Implementation of overlapping B-trees for time and space efficient representation of collections of similar files. The Computer Journal, 33(3):279--280 , June 1990. (bibtex entry)

2. C.A. Shaffer, H. Samet, and R.C. Nelson. QUILT: a geographic information systems based on quad-trees. Int. J. Geographical Information Systems, 4(2):103--131 , 1990. (bibtex entry)

1. M.J. Carey, D.J. DeWitt, and E.J. Richardson, J.E. and Shekita. Object-Oriented Concepts, Databases, and Applications, chapter 14 - Storage Management for Objects in EXODUS, pages 341--369 . Addison Wesley - ACM Press, 1989. (bibtex entry)

2. J.R. Driscoll, N. Sarnak, and R.E. Sleator, D.D. and Tarjan. Making Data Structures Persistent. Journal of Computer and System Sciences, 38:86-124 , 1989. (bibtex entry)

1. H. Samet. Hierarchical representations of collections of small rectangles. ACM Computing Surveys (CSUR), 20(4):271--309, Dec. 1988. (bibtex entry)

1. F.W. Burton and J.G. Kollias. Functional Programming with Quadtrees. IEEE Software, 6(1):90--97 , 1986. (bibtex entry)

2. I.P. Stewart. Quadtrees: Storage and Scan Conversion. The Computer Journal, 29(1):60--75 , Feb. 1986. (bibtex entry)

1. D.J. Abel. Some Elemental Operations on linear Quadtrees for Geographic Information Systems. The Computer journal, 28(1):73--77 , 1985. (bibtex entry)

2. F.W. Burton, M.M. Huntbach, and J.Y.G. Kollias. Multiple Generation Text Files Using Overlapping Tree Structures. The Computer Journal, 28(4):414--416 , Aug. 1985. (bibtex entry)

1. D.J. Abel. A B+tree Structure for Large Quadtrees. Computer Vision, Graphics and Image Processing, 27(1):19--31 , 1984. (bibtex entry)

2. H. Samet. The Quadtree and Related Hierarchical Structures. ACM Computing Surveys, 16(2 ):187--260, 1984. (bibtex entry)

1. I. Gargantini. an Effective Way to Represent Quadtrees. Communications of ACM, 25(12):905--910 , 1982. (bibtex entry)

1. J.K. Mullin. Change area B-Trees : A technique tp aid error recovery. The Computer Jounal, 24(4):367--372 , 1981. (bibtex entry)

1. A.N.C. Kang, R.C.T. Lee, Chin-Liang Chang, and Shi-Kuo Chang. Storage Reduction Through Minimal Spanning Trees and Spanning Forests. IEEE Transactions on Computers, c-26(5):425--435 , mai 1977. (bibtex entry)

1. C.A.R. Hoare. Recursive Data Structures. International Journal of Computer and Information Sciences, 4(2):105--132 , 1975. (bibtex entry)

1. R. Bayer and C. McCreight. Organisation and Maintenance of Large Ordered Indexes. Acta Informatica, 1(3):173--179 , 1972. (bibtex entry)

BACK TO INDEX