02006nam a2200301 a 450000100080000000500110000800800410001910000220006024500590008226000160014130000110015750000650016852011940023365000140142765300220144165300110146365300290147465300170150365300260152065300250154665300160157165300130158765300230160065300220162365300230164565300210166865300150168910036551996-09-30       1996    bl uuuu  m   00u1 u    #d1 aNASCIMENTO, M. A.  aEfficient indexing of temporal databases via B+-trees.  a1996.c1996  a129 f.  aDoctor of Philosophy Thesis - Southern Methodist University.  aTemporal databases has been the object of research  for more than two decades, and a wealth of material has been published. However, the majority of papers have dealt with modelling and query languages issues, relatively little research has addressed implementation issues. In this dissertation we investigate the topic of indexing temporal databases, focusing on valid time databases (where valid time is the dimension indexed) and bitemporal databases (where both valid time and transaction time are indexed). As the first contribution of this dissertation, we propose a simple, yet effective, B+-tree based approach for indexing ranges, particulary valid time ranges. We call this approach MAP21. Our research show that MAP21 has good performance while being feasibly implementable on top of facilities provided by existing commercial database management systems. The second contribution we present is a set of indexing structures for bitemporal databases, which also use the B+-tree as a basic framework. The main idea behind the design of such structure is the trade-off between query processing time and size of the index. This trade-off is analysed via analytic performance studies.  adatabases  aAccess structures  aB-tree  aBanco de dados temporais  aBase de dado  aBase de dado temporal  aEstruturas de acesso  aIndexacacao  aIndexing  aTempo de transacao  aTempo de validade  aTemporal databases  aTransaction time  aValid time