Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter  Home/Search
Context Related
| duke.edu/~large/Papers/gendyn.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: duke.edu/~large/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced partitioning trees (or wp-trees) for indexing a set of points in R d . Well-known examples of wp-trees include kd- trees, BBD-trees, pseudo-quad-trees, and BAR-trees. Given an efficient external wp-tree construction algorithm, we present a general framework for automatically obtaining a dynamic external data structure. Using ... (Update)
Context of citations to this paper: More
...memory or by recursing step (2) Fig. 2. Two algorithms for bulk loading a kd tree An improved bulk loading method was proposed in [1]. Instead of constructing one level at a time, this algorithm constructs an entire height subtree of the kd tree at a time. The major steps...
Cited by: More
Hierarchical Graph Indexing - James Abello Dimacs (Correct)
The Priority R-Tree: A Practically Efficient and.. - Arge, de Berg.. (2004) (Correct)
iWalk: Interactive Out-of-Core Rendering of Large Models - Corrêa, Klosowski, Silva (2002) (Correct)
Similar documents (at the sentence level):
42.0%: A Framework for Index Bulk Loading and Dynamization - Agarwal, Arge, Procopiuc (2001) (Correct)
Active bibliography (related documents): More All
0.8: External Memory Data Structures - Arge (2000) (Correct)
0.2: Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs - Duncan, al. (1998) (Correct)
0.2: Efficient External-Memory Data Structures and Applications - Arge (1996) (Correct)
Similar documents based on text: More All
0.5: Scalable Sweeping-Based Spatial Join - Arge, Procopiuc, Ramaswamy, Suel.. (1998) (Correct)
0.5: Cache-Oblivious Priority Queue and Graph Algorithm.. - Arge, Bender.. (2002) (Correct)
0.5: Theory and Practice of I/O-Efficient Algorithms.. - Arge, Procopiuc.. (1998) (Correct)
Related documents from co-citation: More All
7: Tree: A Search Structure for Large Multidimensional Dynamic Indexes (context) - Robinson - 1981
5: trees: A dynamic index structure for spatial searching (context) - Guttman - 1984
5: Multidimensional binary search trees used for associative searching (context) - Bentley - 1975
BibTeX entry: (Update)
P. K. Agarwal, L. Arge, O. Procopiuc, and J. S. Vitter. A framework for index bulk loading and dynamization. In Proc. Annual International Colloquium on Automata, Languages, and Programming, 2001. http://citeseer.ist.psu.edu/agarwal01framework.html More
@article{ agarwal01framework,
author = "Pankaj K. Agarwal and Lars Arge and Octavian Procopiuc and Jeffrey Scott Vitter",
title = "A Framework for Index Bulk Loading and Dynamization",
journal = "Lecture Notes in Computer Science",
volume = "2076",
pages = "115--??",
year = "2001",
url = "citeseer.ist.psu.edu/agarwal01framework.html" }
Citations (may not include all citations):346 Multidimensional binary search trees used for associative se.. (context) - Bentley - 1975
266 An optimal algorithm for approximate nearest neighbor search.. - Arya, Mount et al. - 1998
262 Multidimensional access methods - Gaede, Gunther - 1998
250 volume 3 of The Art of Computer Programming (context) - Knuth, Searching - 1998
198 Organization and maintenance of large ordered indexes (context) - Bayer, McCreight - 1972
144 symmetric multikey file structure (context) - Nievergelt, Hinterberger et al. - 1984
130 tree: A search structure for large multidimensional dynamic .. (context) - Robinson - 1981
109 inputoutput complexity sorting and related problem (context) - Vitter, output et al. - 1988
92 The Design of Dynamic Data Structures (context) - Overmars - 1983
88 The hB-tree: A multiattribute indexing method with good guar.. (context) - Lomet, Salzberg - 1990
62 Optimal dynamic interval management in external memory - Arge, Vitter - 1996
48 range tree: A new data structure for range searching in seco.. (context) - Subramanian, Ramaswamy - 1995
46 Decomposable searching problems (context) - Bentley - 1979
37 External memory algorithms and data structures - Vitter - 1999
33 External memory data structures - Arge - 2001
33 The buddy-tree: An efficient and robust access method for sp.. (context) - Seeger, Kriegel - 1990
30 On two-dimensional indexability and optimal range search ind.. - Arge, Samoladas et al. - 1999
22 Balanced aspect ratio trees: Combining the advantages of k-d.. - Duncan, Goodrich et al. - 1999
20 Efficient cross-trees for external memory - Grossi, Italiano - 1999
18 The Design and Analyses of Spatial Data Structures (context) - Samet - 1990
14 Efficient bulk operations on dynamic R-trees - Arge, Hinrichs et al. - 1999
13 Optimal dynamic range searching in nonreplicating index stru.. - Kanth, Singh - 1999
7 Paging binary trees with external balancing (context) - Henrich, Six et al. - 1989
7 efficient dynamic planar point location (context) - Arge, Vahrenhold et al. - 2000
5 trees with low stabbing number (context) - de Berg, Gudmundsson et al. - 2000
4 Average case analysis of region search in balanced k-d trees (context) - Filho - 1979
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.duke.edu/~large/): More
The Buffer Tree: A New Technique for Optimal I/O-Algorithms.. - Arge (Correct)
I/O-Efficient Dynamic Planar Point Location (Extended Abstract) - Arge, Vahrenhold (1999) (Correct)
I/O-Efficient Algorithms for Problems on Grid-based Terrains.. - Arge, al. (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