| |
|
|
| Registros recuperados : 812 | |
| Registros recuperados : 812 | |
|
|
|
Registro Completo
|
Biblioteca(s): |
Embrapa Informática Agropecuária. |
|
Data corrente: |
20/10/1997 |
|
Data da última atualização: |
21/02/2011 |
|
Autoria: |
NASCIMENTO, M. A. |
|
Afiliação: |
MARIO A. NASCIMENTO, UNICAMP, CNPTIA. |
|
Título: |
A B+-tree based approach to index transaction time. |
|
Ano de publicação: |
1997 |
|
Fonte/Imprenta: |
Campinas: UNICAMP-IC, 1997. |
|
Páginas: |
24 f. |
|
Série: |
(Relatório Técnico IC-97-09). |
|
Idioma: |
Inglês |
|
Conteúdo: |
Transaction time of a record is the time interval when the record is stored in the database. In this paper we present an approach which provides efficient indexing of such kind of temporal data. The approach makes use of two standard B+-trees with trivially modified node split policies - which yield a usage ratio of virtually 100% in each tree. We compare the proposed approach, which we name Two-Stage, to the Monotonic B+-tree (by Elmasri et al). Our simulations show that the Two-Stage approach yields a structure up to 75% smaller than the Monotonic B+-tree, and in all but one of the several investigated scenarios, the Two-Stage approach provides faster (or comparable) query processing time. Our main contribution, however, lies in the fact that the Two-Stage approach does not require novel data structures but well-known B+-trees. As such, and unlike all previous techniques for tackling this problems, it can be implemented using facilitites existing on most commercial DBMSs. |
|
Palavras-Chave: |
Árvore B+-; Dados temporais; Simulation. |
|
Thesagro: |
Simulação. |
|
Thesaurus NAL: |
Databases. |
|
Categoria do assunto: |
X Pesquisa, Tecnologia e Engenharia |
|
Marc: |
LEADER 01483nam a2200193 a 4500
001 1005014
005 2011-02-21
008 1997 bl uuuu t 00u1 u #d
100 1 $aNASCIMENTO, M. A.
245 $aA B+-tree based approach to index transaction time.
260 $aCampinas: UNICAMP-IC$c1997
300 $a24 f.
490 $a(Relatório Técnico IC-97-09).
520 $aTransaction time of a record is the time interval when the record is stored in the database. In this paper we present an approach which provides efficient indexing of such kind of temporal data. The approach makes use of two standard B+-trees with trivially modified node split policies - which yield a usage ratio of virtually 100% in each tree. We compare the proposed approach, which we name Two-Stage, to the Monotonic B+-tree (by Elmasri et al). Our simulations show that the Two-Stage approach yields a structure up to 75% smaller than the Monotonic B+-tree, and in all but one of the several investigated scenarios, the Two-Stage approach provides faster (or comparable) query processing time. Our main contribution, however, lies in the fact that the Two-Stage approach does not require novel data structures but well-known B+-trees. As such, and unlike all previous techniques for tackling this problems, it can be implemented using facilitites existing on most commercial DBMSs.
650 $aDatabases
650 $aSimulação
653 $aÁrvore B+-
653 $aDados temporais
653 $aSimulation
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. |
|
|
