P. K. Agarwal, L. Arge, O. Procopiuc, and J. S. Vitter. A Framework for Index Bulk Loading and Dynamization. In Proc. of ICALP, p. 115--127, 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....# trees essentially employ a kind of local rebuilding in the form of forced re insertion simply strengthens our argument. In the remaining part of this paper, we will prove that our intuition is correct. Here, we must note that the logarithmic method was independently to this work employed in [12] in order to dynamize wp trees,a secondary memory generalization of kd trees, quad trees, BBD trees and the like, i.e. internal memory structures that are built by a recursive decomposition of the space into subspaces. The results presented in [12] involved: i) a pagination step, during which ....

....was independently to this work employed in [12] in order to dynamize wp trees,a secondary memory generalization of kd trees, quad trees, BBD trees and the like, i.e. internal memory structures that are built by a recursive decomposition of the space into subspaces. The results presented in [12] involved: i) a pagination step, during which the nodes of the static, inmemory structures are transferred (bulk loaded) to the disk using a top down, breadth first like traversal; and (ii) the dynamization step, which transforms the static structure into a dynamic one; for this, they proposed ....

[Article contains additional citation context not shown here]

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.

No context found.

P. K. Agarwal, L. Arge, O. Procopiuc, and J. S. Vitter. A framework for index bulk loading and dynamization. In Proc. International Colloquium on Automata, Languages, and Programming, pages 115--127, 2001.

....of height , using the counts in the grid matrix; d) Distribute input into sets, corresponding to the leaves; 3) Build the bottom levels either in main 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 of the algorithm are outlined in Figure 2 (right column) As before, the first step is to sort the input on both coordinates. Then (in Step 2) we build ....

P. K. Agarwal, L. Arge, O. Procopiuc, and J. S. Vitter. A framework for index bulk loading and dynamization. In Proc. Intl. Colloq. Automata, Languages and Programming, pages 115--127, 2001.

.... supports updates in O( log B N log B log B N ) memory transfers [8] If only linear space is used, O( T B) is a lower bound on the number of transfers needed to answer a query, and these bounds are obtained by the kd B tree [25] The kd B tree can be constructed in O(Sort(N) N ) I Os [1, 2], the number of I Os needed to sort N elements, and using the logarithmic method [15] this leads to an O( B log M B N B N) update algorithm. Refer to recent surveys for further I O model and hierarchical memory model results [6, 26] Frigo et al. 22] developed cache oblivious algorithms for ....

....van Emde Boas layout [12] and exponential search trees [11, 5] To make the structure dynamic, we use the logarithmic method [15] and a new algorithm for cache obliviously constructing a kd tree in O(Sort(N) memory transfers. The construction algorithm uses ideas from a recent I O model algorithm [1]. In Section 3 we develop a cache oblivious version of a twodimensional range tree. The structure answers queries in the optimal O(log B N T B) memory transfers but uses 2 N) space. The central part of the structure is an O(N log 2 N) space structure for answering two dimensional three sided ....

[Article contains additional citation context not shown here]

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, pages 115--127, 2001.

....dynamization method. Given a static index with certain properties, it produces a dynamic structure consisting of a set of smaller static indexes of geometrically increasing sizes. We implemented the external memory versions of this method, as proposed by Arge and Vahrenhold [8] and Agarwal et al. [2]. More details on the implementation can be found in [17] K D B tree. The K D B tree [18] combines the properties of the kd tree [11] and the B tree to handle multidimensional points in an external memory setting. Our implementation supports insertion, deletion, point query, range query and bulk ....

P. K. Agarwal, L. Arge, O. Procopiuc, and J. S. Vitter. A framework for index bulk loading and dynamization. In Proc. 28th Intl. Colloq. Automata, Languages and Programming (ICALP), 2001.

....structures are broadly classified into two types, namely space driven structures (like quad trees and grid files) which partition the embedded space containing the data points and data driven structures (like kd B trees and R trees) which partition the data points themselves. Agarwal et al. [9] describe a general framework for efficient construction and updating of many of the above structures. As mentioned above, we often want to be able to answer a very diverse set of queries, like halfspace range queries, general polygon range queries, and point location queries, on a single data ....

.... block oriented part of TPIE is integration with the stream oriented part, and together the two parts have been used to implement I O efficient algorithms for R trees construction [21] based on the buffer technique, to implement an I O efficient algorithms for constriction and updating of kd tree [8, 9], as well as to implement the recently developed structures for range counting [6] Other external data structures currently being implemented includes persistent B trees, structures for planar point location, and the external priority search tree. 9 Conclusions In this paper we have discussed ....

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.

No context found.

P. K. Agarwal, L. Arge, O. Procopiuc, and J. S. Vitter. A Framework for Index Bulk Loading and Dynamization. In Proc. of ICALP, p. 115--127, 2001.

No context found.

P. K. Agarwal, L. Arge, O. Procopiuc, and J. S. Vitter. A Framework for Index Bulk Loading and Dynamization. In Proc. of ICALP, p. 115--127, 2001.

No context found.

P. Agarwal, L. Arge, O. Procopiuc, and J. Vitter. A framework for index bulk loading and dynamization. In International Colloquium on Automata, Languages, and Programming, pages 115--127, 2001.

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