Kim S. Larsen  Home/Search
Context
Related
Links: ACM | imada.ou.dk/pub/papers/pp19...29.ps.gz 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: fermivista.math...ftp.imada.ou.dk (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: When balanced binary search trees are made partially persistent using the node-copying method, updating remains efficient and the possibility of searching efficiently for information in the past is added to the system. However, in database applications, it is often necessary or desirable to produce whole transcripts of information change over time. If we wish to obtain a transcript of information related to some key k from version number v 1 to v 2 , this can be obtained by independent search... (Update)
Similar documents (at the sentence level):
63.3%: Partially Persistent Search Trees with Transcript Operations - Larsen (1999) (Correct)
Active bibliography (related documents): More All
0.5: First-Order Logical Formalization of Dialogue Models for.. - Izumi, Takamatsu, al. (Correct)
0.3: A Functional Perspective of Array Primitives - Chuang (1996) (Correct)
0.3: Simulating complex SCI topologies - Horn, Bothner, Linge, Kristiansen.. (Correct)
Similar documents based on text: More All
0.1: Letter-Sequence Dialogues - David Novick (1994) (Correct)
0.1: ASR Satisficing: The effects of ASR accuracy on speech.. - Stark, Whittaker.. (2000) (Correct)
0.1: Several geometric data structures for objects in the plane .. - Describe And Analyze (Correct)
BibTeX entry: (Update)
@techreport{ larsen97partially,
author = "Kim S. Larsen",
title = "Partially Persistent Binary Search Trees with Transcript Operations",
number = "PP-1997-29",
month = "27,",
year = "1997",
url = "citeseer.ist.psu.edu/132922.html" }
Citations (may not include all citations):124 A Dichromatic Framework for Balanced Trees (context) - Guibas, Sedgewick - 1978 DBLP
55 Randomized Search Trees (context) - Aragon, Seidel - 1989 DBLP
44 volume 1 of Data Structures and Algorithms (context) - Mehlhorn, Searching - 1986
33 Making Data Structures Persistent (context) - Driscoll, Sarnak et al. - 1989 ACM DBLP
33 Binary Search Trees of Bounded Balance (context) - Nievergelt, Reingold - 1973 ACM DBLP
23 An Algorithm for the Organisation of Information (context) - Adel'son-Vel'skii, Landis - 1962
17 the Average Number of Rebalancing Operations in Weight-Balan.. (context) - Blum, Mehlhorn - 1980
15 Improving Partial Rebuilding by Using Simple Balance Criteri.. - Andersson - 1989 ACM DBLP
11 Scapegoat Trees (context) - Galperin, Rivest - 1993 ACM DBLP
3 Self-Adjusting Binary Trees (context) - Sleator, Tarjan - 1983 ACM DBLP
2 Cummings Publishing Company (context) - Weiss, Structures et al. - 1995
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.imada.ou.dk.html): More
Regular Expressions with Nested Levels of Back Referencing Form a .. - Larsen (1997) (Correct)
Optimal Rebalancing of Binary Search Trees - Fagerberg (1996) (Correct)
Digit-Set Conversions: Generalizations and Applications - Kornerup (1995) (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