EFFICIENT INDEXING OF TEMPORAL DATABASES VIA B+-TREES

AUTOR(ES)

Mario Antonio do Nascimento

FONTE

IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia

DATA DE PUBLICAÇÃO

09/08/1996

RESUMO

Temporal 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, particularly valid time ranges. We call this approach MAP21. Our research shows 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.

ASSUNTO(S)

ciencia da computacao temporal databases indexing

Documentos Relacionados

• UMLS Concept Indexing for Production Databases: A Feasibility Study
• UMLS Concept Indexing for Production Databases: A Feasibility Study
• Population groups: indexing, coverage, and retrieval effectiveness of ethnically related health care issues in health sciences databases.
• Virtual layering and efficient merging in non-cooperative multicast trees
• Indexing Theory, Indexing Methods and Search Devices