Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!zaphod.mps.ohio-state.edu!uakari.primate.wisc.edu!aplcen!haven!h.cs.wvu.wvnet.edu!eichmann@h.cs.wvu.wvnet.edu
From: eichmann@h.cs.wvu.wvnet.edu (Dave Eichmann,316K,42,)
Newsgroups: comp.databases
Subject: Re: Snapshots of an Associative Space
Message-ID: <586@h.cs.wvu.wvnet.edu>
Date: 8 Dec 89 14:17:04 GMT
References: <29837@shemp.CS.UCLA.EDU>
Sender: news@h.cs.wvu.wvnet.edu
Lines: 19

From article <29837@shemp.CS.UCLA.EDU>, by ravi@maui.cs.ucla.edu:
> 
> I am trying to figure out how a snapshot of an entire B+ or other binary
> tree can be taken. The snapshot would be for the purposes of backup's etc. 
> The objective is to minimize the blocking of other readers and writers. 
> Any suggestions or references would be appreciated. 

  You might consider the B-link tree [Lehman & Yao, TODS, Dec. 81].  Since
the snapshotter is a reader, it will never be blocked.  The next question
is whether the snapshot version needs to be an *exact* copy, or whether it
is OK to just contain the same elements.  [Kung & Lehman, TODS, Sept. 80]
treats binary trees.

- Dave
------
David Eichmann
Dept. of Statistics and Computer Science
West Virginia University                  Phone: (304) 293-3607
Morgantown, WV  26506                     Email: eichmann@a.cs.wvu.wvnet.edu