LR-tree: A logarithmic decomposable spatial index method

Computer Journal

Volumn 46, Issue 3, 2003, Pages 319-331

  Bozanis, Panayiotis ^a   Nanopoulos, Alexandros ^b   Manolopoulos, Yannis ^b  

^a UNIVERSITY OF THESSALY   (Greece)

^b ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; DATA STORAGE EQUIPMENT; HEURISTIC METHODS; OPTIMIZATION; SET THEORY;

DYNAMIC MANIPULATION; SPATIAL INDEX METHOD;

DATA STRUCTURES;

EID: 0037853259     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/46.3.319     Document Type: Article

References (20)

1. Guttman, A. (1984) R-trees: a dynamic index structure for spatial searching. In Proc. 1984 ACM Int. Conf. on Management of Data (SIGMOD'84), Boston, MA, June 18-21, ACM Press, New York.
2. Manolopoulos, Y., Theodoridis, Y. and Tsotras, V. (1999) Advanced Database Indexing. Kluwer Academic Publishers, Boston, MA.
3. Beckmann, N., Kriegel, H.-P., Schneider, R. and Seeger, B. (1990) The R*-tree: an efficient and robust access method for points and rectangles. In Proc. 1990 ACM Int. Conf. on Management of Data (SIGMOD'90), Atlantic City, NJ, May 23-25, pp. 322-331. ACM Press, New York.
4. Kamel, I. and Faloutsos, C. (1994) Hilbert R-tree: an improved R-tree using fractals. In Proc. 20th Int. Conf. on Very Large Data Bases (VLDB'94), Santiago de Chile, Chile, September 12-15, pp. 500-509. Morgan Kaufmann, San Francisco.
5. Leutenegger, S., Lopez, M. and Edgigton, J. (1997) STR: a simple and efficient algorithm for R-tree packing. In Proc. 13th Int. Conf. on Data Engineering (ICDE'97), Birmingham, UK, April 7-11, pp. 497-506. IEEE Computer Society, Piscataway, NJ.
6. Bercken, J., Widmayer, P. and Seeger, B. (1997) A generic approach to bulk loading multidimensional index structures. In Proc. 23rd Int. Conf. on Very Large Data Bases (VLDB'97), Athens, Greece, August 25-29, pp. 406-415. Morgan Kaufmann, San Francisco.
7. Arge, L., Hinrichs, K., Vahrenhold, J. and Vitter, J. (1999) Efficient bulk operations on dynamic R-trees. In Proc. Int. Workshop on Algorithm Engineering and Experimentation, (ALENEX'99), Baltimore, MD, January 15-16, pp. 328-348. Springer, Berlin.
8. Berchtold, S., Böhm, C. and Kriegel, H.-P. (1998) Improving the query performance of high dimensional index structures by bulk load operations. In Proc. 6th Int. Conf. on Extending Database Technology (EDBT'98), Valencia, Spain, March 23-27, pp. 216-230. Springer, Berlin.
9. Bentley, J. L. and Saxe, J. B. (1980) Decomposable searching problems I: static-to-dynamic transformations. J. Algorithms, 1, 301-358.
10. Mehlhorn, K. and Overmars, M. H. (1981) Optimal dynamization of decomposable searching problems. Inform. Process. Lett., 12, 93-98.
11. Overmars, M. H. (1983) The Design of Dynamic Data Structures. Springer, Berlin.
12. Agarwal, P. K., Arge, L., Procopiuc, O. and Vitter, J. S. (2001) A framework for index bulk loading and dynamization. In Proc. 28th Int. Conf. on Automata, Languages and Programming (ICALP'01), Crete, Greece, July 8-12, pp. 115-127. Springer, Berlin.
13. Huang, Y.-W., Jing, N. and Rundensteiner, E. A. (1997) Spatial joins using R-trees: breadth-first traversal with global optimizations. In Proc. 23rd Int. Conf. on Very Large Data Bases (VLDB'97), Athens, Greece, August 25-29, pp. 396-405. Morgan Kaufmann, San Francisco.
14. Lang, C. A. and Singh, A. K. (2001) Modeling high-dimensional structures using sampling. In Proc. 2001 ACM Int. Conf. on Management of Data (SIGMOD'2001), Santa Barbara, CA, May 21-24, pp. 389-400. ACM Press, New York.
15. Pagel, B.-U., Six, H.-W. and Winter, M. (1995) Window query-optimal clustering of spatial objects. In Proc. 14th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS'95), San Jose, CA, May 22-25, pp. 86-94. ACM Press, New York.
16. Papadopoulos, A. and Manolopoulos, Y. (1997) Performance of nearest-neighbor queries in R-trees. In Proc. 6th Int. Conf. on Database Theory (ICDT'97), Delphi, Greece, January 8-10, pp. 394-408. Springer, Berlin.
17. Johnson, T. and Shasha, D. (1993) B-trees with inserts and deletes: why free-at-empty is better than merge-at-half. J. Comput. Syst. Sci., 47, 45-76.
18. Berchtold, S., Böhm, C., Keim, D. A. and Kriegel, H.-P. (1997) A cost model for nearest neighbor search in high-dimensional data space. In Proc. 16th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (PODS'97), Tucson, AZ, May 12-14, pp. 78-86. ACM Press, New York.
19. Clancy, M. J. and Knuth, D. E. (1997) A Programming and Problem Solving Seminar. Technical Report STAN-CS-77-606, Department of Computer Science, Stanford University, Stanford, CA.
20. Kaplan, H. and Tarjan, R. E. (1999) New Heap Data Structures. Technical Report TR-597-99, Department of Computer Science, Princeton University, Princeton, NJ.