See this document in CiteSeerX!

LR-tree: a Logarithmic Decomposable Spatial Index Method (2003)  (Make Corrections)  
Panayiotis Bozanis, Alexandros Nanopoulos, Yannis Manolopoulos



  Home/Search   Context   Related

 
View or download:
delab.csd.auth.gr/papers...BNMtcj03.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  skyblue.csd.auth.g...publications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper, we present LR-trees, a new efficient scheme for dynamic manipulation of large datasets, which combines the search performance of the bulkloaded R-trees with the updated performance of R # -trees. Experimental results provide evidence on the latter statement and illustrate the superiority of the proposed method (Update)

Active bibliography (related documents):   More   All
0.4:   Improved Methods for Signature-Tree Construction - Tousidou, Nanopoulos.. (2000)   (Correct)
0.3:   Finding Similar Images Quickly Using Object Shapes - Shen (2001)   (Correct)
0.3:   External Memory Data Structures - Arge (2000)   (Correct)

Similar documents based on text:   More   All
0.9:   Signature-based Structures for Objects with Set-valued.. - Tousidou, Bozanis.. (2002)   (Correct)
0.6:   Categorical Range Queries in Large Databases - Nanopoulos, Bozanis   (Correct)
0.6:   Finding Generalized Path Patterns for Web Log Data Mining - Nanopoulos, Manolopoulos (2000)   (Correct)

BibTeX entry:   (Update)

@misc{ bozanis-lrtree,
  author = "Panayiotis Bozanis and Alexandros Nanopoulos and Yannis Manolopoulos",
  title = "LR-tree: a Logarithmic Decomposable Spatial Index Method",
  url = "citeseer.ist.psu.edu/bozanis03lrtree.html" }
Citations (may not include all citations):
121   A cost model for nearest neighbor search in highdimensional .. (context) - Berchtold, Bohm et al. - 1997
92   The Design of Dynamic Data Structures (context) - Overmars - 1983
83   tree using fractals (context) - Kamel, Faloutsos - 1994
60   Decomposable searching problems I: static-to-dynamic transfo.. (context) - Bentley, Saxe - 1980
55   Spatial joins using R-trees: breadth-first traversal with gl.. - Huang, Jing et al. - 1997
43   STR: a simple and efficient algorithm for R-tree packing - Leutenegger, Lopez et al. - 1997
28   Improving the query performance of high dimensional index st.. - Berchtold, Bohm et al. - 1998
20   Performance of nearest-neighbor queries in R-trees (context) - Papadopoulos, Manolopoulos - 1997
19   A generic approach to bulk loading multidimensional index st.. (context) - Bercken, Widmayer et al. - 1997
14   Efficient bulk operations on dynamic R-trees - Arge, Hinrichs et al. - 1999
11   Advanced Database Indexing (context) - Manolopoulos, Theodoridis et al. - 1999
11   Window query-optimal clustering of spatial objects - Pagel, Six et al. - 1995
10   Optimal dynamization of decomposable searching problems (context) - Mehlhorn, Overmars - 1981
9   trees with inserts and deletes: why free-at-empty is better .. (context) - Johnson, Shasha - 1993
9   A framework for index bulk loading and dynamization - Agarwal, Arge et al. - 2001
7   A Programming and Problem Solving Seminar (context) - Clancy, Knuth - 1997
3   and Seeger (context) - Beckmann, Kriegel et al. - 1990
1   and Singh (context) - Lang - 2001
1   New Heap Data Structures (context) - Kaplan, Tarjan - 1999

Documents on the same site (http://skyblue.csd.auth.gr/publications.html):
A Data Mining Algorithm for Generalized Web Prefetching - Nanopoulos, Katsaros.. (2002)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC