See this document in CiteSeerX!

Efficient Bulk Operations on Dynamic R-trees (Extended Abstract)  (Make Corrections)  
Lars Arge, Klaus H. Hinrichs, et al.



  Home/Search   Context   Related

 
View or download:
wwwmath.unimuenster.de/cs/...rtree.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  wwwmath.unimuenster.d...research (more)
(Enter author homepages)

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

Abstract: ) Lars Arge 1? , Klaus H. Hinrichs 2 , Jan Vahrenhold 2?? , and Jeffrey S. Vitter 1??? 1 Center for Geometric Computing, Department of Computer Science, Duke University, Durham, NC 27708, USA. large@cs.duke.edu, jsv@cs.duke.edu 2 Westfalische Wilhelms-Universitat, Institut fur Informatik, 48149 Munster, Germany. khh@math.uni-muenster.de, jan@math.uni-muenster.de Abstract. We present a simple lazy buffering technique for performing bulk operations on multidimensional spatial... (Update)

Similar documents (at the sentence level):
78.5%:   Efficient Bulk Operations on Dynamic R-trees - Arge, Hinrichs, Vahrenhold.. (1999)   (Correct)

Active bibliography (related documents):   More   All
0.5:   External-Memory Algorithms with Applications in Geographic.. - Arge (1997)   (Correct)
0.4:   Scalable Sweeping-Based Spatial Join - Arge, Procopiuc, Ramaswamy, Suel.. (1998)   (Correct)
0.3:   Theory and Practice of I/O-Efficient Algorithms.. - Arge, Procopiuc.. (1998)   (Correct)

Similar documents based on text:   More   All
0.2:   Planar Point Location For Large Data Sets: To Seek Or Not To.. - Vahrenhold, Hinrichs (2000)   (Correct)
0.1:   Master-Client R-trees: A New Parallel R-tree Architecture - Schnitzer, Leutenegger (1998)   (Correct)
0.1:   A Unified Approach For Indexed and Non-Indexed Spatial.. - Arge, Procopiuc.. (2000)   (Correct)

BibTeX entry:   (Update)

@misc{ arge-efficient,
  author = "Lars Arge and Klaus H. Hinrichs and et al.",
  title = "Efficient Bulk Operations on Dynamic R-trees (Extended Abstract)",
  url = "citeseer.ist.psu.edu/329651.html" }
Citations (may not include all citations):
765   trees: A dynamic index structure for spatial searching (context) - Guttman - 1985
516   tree: An efficient and robust access method for points and r.. (context) - Beckmann, Kriegel et al. - 1990
233   tree: A dynamic index for multi-dimensional objects - Sellis, Roussopoulos et al. - 1987
198   Organization and maintenance of large ordered indexes (context) - Bayer, McCreight - 1972  ACM   DBLP
115   Partition based spatial-merge join - Patel, DeWitt - 1996
113   Output complexity of sorting and related problems (context) - Aggarwal, Vitter - 1988
90   Direct spatial search on pictorial databases using packed R-.. (context) - Roussopoulos, Leifker - 1985  ACM   DBLP
88   An asymptotically optimal multiversion B-tree - Becker, Gschwind et al. - 1996  ACM   DBLP
83   tree using fractals (context) - Kamel, Faloutsos et al. - 1994
77   Client-server paradise - DeWitt, Kabra et al. - 1994  ACM   DBLP
61   Scalable sweepingbased spatial join - Arge, Procopiuc et al. - 1998
60   The buffer tree: A new technique for optimal I/O-algorithms (context) - Arge - 1995
43   STR: A simple and efficient algorithm for R-tree packing - Leutenegger, Lopez et al. - 1997  ACM   DBLP
42   Efficient External-Memory Data Structures and Applications - Arge - 1996
38   An implementation and performance analysis of spatial data a.. (context) - Greene - 1989  ACM   DBLP
31   Cubetree: Organization of and bulk incremental updates on th.. - Roussopoulos, Kotidis et al. - 1997
31   efficient scientific computation using TPIE (context) - Vengroff, Vitter et al. - 1996
28   Improving the query performance of high-dimensional index st.. - Berchtold, Bohm et al. - 1998
27   Spatial data structures: Concepts and design choices (context) - Nievergelt, Widmayer - 1997  DBLP
26   efficiency of geometric algorithms: Distribution sweep vs (context) - Chiang, the - 1995
19   Theory and practice of I/O-efficient algorithms for multidim.. - Arge, Procopiuc et al. - 1998  ACM
18   External-memory algorithms with applications in geographic i.. - Arge - 1997
18   A transparent parallel I/O environment (context) - Vengroff - 1994
17   An intellegent information fusion system for handling the ar.. (context) - Cromp - 1993
8   A generic approachtobulk loading multidimensional index stru.. (context) - van den Bercken, Seeger et al. - 1997
7   technical documentation (context) - Line - 1992
5   Available via WWW at http://www (context) - Vengroff, Manual et al. - 1997
3   Bulk insertion in dynamic R-trees (context) - Kamel, Khalil et al. - 1996
3   Wilkes An introduction to disk drive modeling (context) - Ruemmler - 1994

Documents on the same site (http://wwwmath.uni-muenster.de/cs/u/jan/research.html):   More
I/O-Efficient Dynamic Planar Point Location (Extended Abstract) - Arge, Vahrenhold   (Correct)
Planar Point Location For Large Data Sets: To Seek Or Not To.. - Vahrenhold, Hinrichs (2000)   (Correct)
Algorithms for Performing Polygonal Map Overlay.. - Becker, Giesen..   (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