G.S. Brodal. Partially Persistent Data Structures of Bounded Degree with Constant Update Time. Nordic Journal of Computing, 3(3):238-255, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Optimal Finger Search Trees in the Pointer Machine (Extended.. - Brodal, al. (2002) (Correct)
....and we conclude at Section 7 with some nal remarks. We must note that we left many technical details for a future journal version. 2. THE COMPONENTS The technique of components is based on an idea previously used in the work of Brodal on making worst case partially persistent data structures ([2]) Components de ne a logical partition over the set of non leaf nodes of the nger search tree into connected subtrees that dictate the position of the rebalancing operations. We assume that we are given a height balanced search tree T and a component A over the nodes of T , where A is a subtree ....
G.S. Brodal. Partially Persistent Data Structures of Bounded Degree with Constant Update Time. Nordic Journal of Computing, 3(3):238-255, 1996.
Exploiting the Multi-Append-Only-Trend Property of.. - Li, Agrawal, Abbadi, .. (2003) (Correct)
....Multiversion data structures typically support queries and updates at the same asymptotic cost as if the single instances were maintained separately. At the same time the storage overhead per insertion is constant. Stated differently, using multiversion constructions like the one by Brodal [3] or Becker et al. 1] we can reduce the storage requirement of our technique to O( Delta mem(d Gamma 2; N) Similarly update costs are O( Delta upd(d Gamma 2; N) i.e. asymptotically identical to the update cost upd(d Gamma 2; N) on a single instance of the g dimensional (recall that g = ....
G. S. Brodal. Partially persistent data structures of bounded degree with constant update time. Nordic Journal of Computing, 3(3):238--255, 1996.
Efficient Processing of Spatiotemporal Queries in.. - Zimbrao, de Souza.. (2000) (Correct)
....to traverse large intervals of time. Their experiments focus on discretely moving points (i.e. points standing at a specific location for a time period and then moving instantaneously , and so on and so forth) The Temporal R Tree, or TR Tree, is a partially persistent RTree [G84] According to [B94], a partially persistent data structure is a data structure in which old versions are remembered and can always be searched However only the latest version of the data structure can be modified. R Trees and its variants are the most popular structures for indexing spatial data due its simplicity ....
G. S. Brodal: "Partially Persistent Data Structures of Bounded Degree with Constant Update Time". In Nordic Journal of Computing, volume 3(3), pages 238-255, 1996.
Optimal Finger Search Trees in the Pointer - Machine Gerth Stlting Self-citation (Brodal) (Correct)
No context found.
G.S. Brodal. Partially Persistent Data Structures of Bounded Degree with Constant Update Time. Nordic Journal of Computing, 3(3):238-255, 1996.
Optimal Finger Search Trees in the Pointer Machine - Brodal, Lagogiannis.. Self-citation (Brodal) (Correct)
....and we conclude at Section 7 with some final remarks. We must note that we left many technical details for a future journal version. 2 The components The technique of components is based on an idea previously used in the work of Brodal on making worst case partially persistent data structures ([2]) Components define a logical partition over the set of non leaf nodes of the finger search tree into connected subtrees that dictate the position of the rebalancing operations. We assume that we are given a heightbalanced search tree T and a component A over the nodes of T , where A is a subtree ....
G.S. Brodal. Partially Persistent Data Structures of Bounded Degree with Constant Update Time. Nordic Journal of Computing, 3(3):238-255, 1996.
Finger Search Trees with Constant Insertion Time - Brodal (1997) (1 citation) Self-citation (Brodal) (Correct)
....and applications of this lemma we refer to the thesis of Raman [16] Our approach is, in contrast, a local bottom up approach based on a functional implementation of binary counting to select the 2 nodes to split in a search tree. A weakly related bottom up approach has been presented by Brodal [1] to remove the amortization from the partial persistence technique of Driscoll et al. 5] The structure of this paper is as follows. Section 2 describes the basic idea of the construction, Section 3 describes how to maintain ancestor pointers in a tree by using a functional stack implementation, ....
Gerth Stlting Brodal. Partially persistent data structures of bounded degree with constant update time. Nordic Journal of Computing, 3(3):238--255, 1996.
Persistent data structures Haim Kaplan - Tel Aviv University (Correct)
No context found.
G. S. Brodal. Partially persistent data structures of bounded degree with constant update time. Nordic Journal of Computing, 3(3):238-255, 1996.
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