Space-partitioning trees in postgreSQL: Realization and performance

Proceedings - International Conference on Data Engineering

Volumn 2006, Issue , 2006, Pages 100-

  Eltabakh, Mohamed Y ^a   Eltarras, Ramy ^a   Aref, Walid G ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; HASH TABLES; QUADTREE VARIANTS; SPACE-PARTITIONING TREES;

DATA REDUCTION; DATABASE SYSTEMS; FORMAL LANGUAGES; INDEXING (OF INFORMATION);

TREES (MATHEMATICS);

EID: 33749612864     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2006.146     Document Type: Conference Paper

References (41)

1. Ibm corp.: Ibm db2 universal database application development guide, vs. 6. 1999.
2. W. G. Aref, D. Barbara, and P. Vallabhaneni. The handwritten trie: Indexing electronic ink. In SIGMOD, pages 151-162, 1995.
3. W. G. Aref and I. F. Ilyas. An extensible index for spatial databases. In SSDBM, pages 49-58, 2001.
4. W. G. Aref and I. F. Ilyas. Sp-gist: An extensible database index for supporting space partitioning trees. J. Intell. Inf. Syst., 17(2-3):215-240, 2001.
5. R. Bayer. The universal b-tree for multidimensional indexing: general concepts. In WWCA, pages 198-209, 1997.
6. R. Bayer and E. M. McCreight. Organization and maintenance of large ordered indices. Acta Inf., 1:173-189, 1972.
7. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The r* -tree: An efficient robust access method for points and rectangles. In SIGMOD Record, 19(2)., 1990.
8. J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18(9):509-517, 1975.
9. J. L. Bentley. Multidimensional binary search trees in database applications. IEEE TSE-5:333-340, 1979.
10. W. A. Burkhard. Hashing and trie algorithms for partial match retrieval. ACM Transactions Database Systems, 1(2): 175-187, 1976.
11. D. Comer. Ubiquitous b-tree. ACM Comput. Surv., 11(2):121-137, 1979.
12. A. A. Diwan, S. Rane, S. Seshadri, and S. Sudarshan. Clustering techniques for minimizing external path length. In VLDB, pages 342-353, 1996.
13. G. Evangelidis, D. B. Lomet, and B. Salzberg. The hbpi-tree: A multi-attribute index supporting concurrency, recovery and node consolidation. VLDB Journal, 6(1):1-25, 1997.
14. R. Fagin, J. Nievergelt, N. Pippenger, and H. R. Strong. Extendible hashinga fast access method for dynamic files. ACM Trans. Database Syst., 4(3):315-344, 1979.
15. R. A. Finkel and J. L. Bentley. Quad trees: A data structure for retrieval on composite keys. Acta Inf., 4:1-9, 1974.
16. E. Fredkin. Trie memory. Commun. ACM, 3(9):490-499, 1960.
17. V. Gaede and O. Gonther. Multidimensional access methods. ACM Comput. Surv., 30(2):170-231, 1998.
18. I. Gargantini. An effective way to represent quadtrees. Commun. ACM, 25(12):905-910, 1982.
19. T. M. Ghanem, R. Shah, M. E Mokbel, W. G. Aref, and J. S. Vitter. Bulk operations for space-partitioning trees. In ICDE, pages 29-40, 2004.
20. A. Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD, pages 47-57, 1984.
21. J. M. Hellerstein, J. E Naughton, and A. Pfeffer. Generalized search trees for database systems. In VLDB, pages 562-573, 1995.
22. J. M. Hellerstein and A. Pfeffer. The rd-tree: An index structure for sets. In Univ. of Wisconsin CS Technical Report 1252, 1994.
23. G. R. Hjaltason and H. Samet. Ranking in spatial databases. In SDD, pages 83-95, 1995.
24. E. G. Hoel and H. Samet. A qualitative comparison study of data structures for large line segment databases. In SIGMOD, pages 205-214, 1992.
25. N. Katayama and S. Satoh. The sr-tree: an index structure for high-dimensional nearest neighbor queries. In SIGMOD, pages 369-380, 1997.
26. G. Kedem. The quad-cif tree: A data structure for hierarchical on-line algorithms. In 19th conference on Design automation, pages 352-357, 1982.
27. M. Kornacker. High-performance extensible indexing. In VLDB, pages 699-708, 1999.
28. R. Kothuri, S. Ravada, and D. Abugov. Quadtree and r-tree indexes in oracle spatial: a comparison using gis data. In SIGMOD, pages 546-557, 2002.
29. R. K. Kothuri and S. Ravada. Efficient processing of large spatial queries using interior approximations. In SSTD, pages 404-424, 2001.
30. R. C. Nelson and H. Samet. A population analysis for hierarchical data structures. In SIGMOD, pages 270-277, 1987.
31. R. L. Rivest. Partial-match retrieval algorithms. In SIAM J. Comput., 5(1), pages 19-50, 1976.
32. J. T. Robinson. The k-d-b-tree: a search structure for large multidimensional dynamic indexes. In SIGMOD, pages 10-18, 1981.
33. H. Samet. The design and analysis of spatial data structures. In Addison-Wesley, Reading MA, 1990.
34. T. K. Sellis, N. Roussopoulos, and C. Faloutsos. The r+-tree: A dynamic index for multi-dimensional objects. In VLDB, pages 507-518, 1987.
35. T. K. Sellis, N. Roussopoulos, and C. Faloutsos. Multidimensional access methods: Trees have grown everywhere. In VLDB, pages 13-14, 1997.
36. P. Seshadri. Predator: A resource for database research. In SIGMOD Record, 27(1), pages 16-20, 1998.
37. J. Srinivasan, R. Murthy, S. Sundara, N. Agarwal, and S. De-Fazio. Extensible indexing: a framework for integrating domain-specific indexing schemes into oracle8i. In ICDE, pages 91-100, 2000.
38. M. Stonebraker. Inclusion of new types in relational data base systems. In ICDE, pages 262-269, 1986.
39. M. Stonebraker and G. Kemnitz. The postgres next generation database management system. Commun. ACM, 34(10):78-92, 1991.
40. Y. Theodoridis and T. Sellis. A model for the prediction of r-tree performance. In PODS, pages 161-171, 1996.
41. F. Wang. Relational-linear quadtree approach for two-dimensional spatial representation and manipulation. TKDE, 3(1):118-122, 1991.