01399nam a2200181 a 450000100080000000500110000800800410001910000220006024500890008226001570017130000210032849000090034950000540035852007570041265000160116965300170118565300150120210068782020-01-20       1998    bl uuuu     u00u1 u    #d1 aNASCIMENTO, M. A.  aA two-stage B+-tree based approach to index transaction time.h[electronic resource]  aIn: BIENNIAL WORLD CONFERENCE ON INTEGRATED DESIGN AND PROCESS TECHNOLOGY, 3., 1998. Proceedings... [S.l.]: Society for Design and Process Sciencec1998  ap. 513-520. v. 2  vv. 2  aEditores: Tamer Ozsu, Asuman Dogac, Ozgur Ulusoy.  aWe present an approach which provides efficient indexing for transaction time ranges, or, more generally, ranges that behave like transaction time ranges, e.g., records for telephone calls. The approach makes use of two standard B+-trees with trivially specialized node split polices - which yield high node utilization ratios. We compare the proposed approach, which we name 2S, to the Monotonic B+-tree (Elmasri et al., 1992). Our simulations show that the 2S approach yields a much smaller structure, and in all but one of the several investigate scenarios, it also provided comparable (or faster) query processing time. The main contribution, however, lies in the fact the 2S approach does not require novel data structures but well-known B+-trees.  aSimulação  aÁrvores B+-  aSimulation