| |
|
|
| Registros recuperados : 812 | |
| Registros recuperados : 812 | |
|
|
|
Registro Completo
|
Biblioteca(s): |
Embrapa Informática Agropecuária. |
|
Data corrente: |
30/09/1996 |
|
Data da última atualização: |
30/09/1996 |
|
Autoria: |
NASCIMENTO, M. A. |
|
Afiliação: |
Embrapa-CNPTIA. |
|
Título: |
Efficient indexing of temporal databases via B+-trees. |
|
Ano de publicação: |
1996 |
|
Fonte/Imprenta: |
1996. |
|
Páginas: |
129 f. |
|
Idioma: |
Inglês |
|
Notas: |
Doctor of Philosophy Thesis - Southern Methodist University. |
|
Conteúdo: |
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, 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. |
|
Palavras-Chave: |
Access structures; B-tree; Banco de dados temporais; Base de dado; Base de dado temporal; Estruturas de acesso; Indexacacao; Indexing; Tempo de transacao; Tempo de validade; Temporal databases; Transaction time; Valid time. |
|
Thesaurus NAL: |
databases. |
|
Categoria do assunto: |
-- |
|
Marc: |
LEADER 02006nam a2200301 a 4500
001 1003655
005 1996-09-30
008 1996 bl uuuu m 00u1 u #d
100 1 $aNASCIMENTO, M. A.
245 $aEfficient indexing of temporal databases via B+-trees.
260 $a1996.$c1996
300 $a129 f.
500 $aDoctor of Philosophy Thesis - Southern Methodist University.
520 $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.
650 $adatabases
653 $aAccess structures
653 $aB-tree
653 $aBanco de dados temporais
653 $aBase de dado
653 $aBase de dado temporal
653 $aEstruturas de acesso
653 $aIndexacacao
653 $aIndexing
653 $aTempo de transacao
653 $aTempo de validade
653 $aTemporal databases
653 $aTransaction time
653 $aValid time
Download
Esconder MarcMostrar Marc Completo |
|
Registro original: |
Embrapa Informática Agropecuária (CNPTIA) |
|
|
Biblioteca |
ID |
Origem |
Tipo/Formato |
Classificação |
Cutter |
Registro |
Volume |
Status |
Fechar
|
| Nenhum registro encontrado para a expressão de busca informada. |
|
|
