| |
|
|
| Registros recuperados : 895 | |
| Registros recuperados : 895 | |
|
|
|
 | Acesso ao texto completo restrito à biblioteca da Embrapa Agricultura Digital. Para informações adicionais entre em contato com cnptia.biblioteca@embrapa.br. |
Registro Completo
|
Biblioteca(s): |
Embrapa Agricultura Digital. |
|
Data corrente: |
23/12/1998 |
|
Data da última atualização: |
20/01/2020 |
|
Autoria: |
NASCIMENTO, M. A. |
|
Afiliação: |
CNPTIA. |
|
Título: |
A two-stage B+-tree based approach to index transaction time. |
|
Ano de publicação: |
1998 |
|
Fonte/Imprenta: |
In: BIENNIAL WORLD CONFERENCE ON INTEGRATED DESIGN AND PROCESS TECHNOLOGY, 3., 1998. Proceedings... [S.l.]: Society for Design and Process Science, 1998. |
|
Volume: |
v. 2 |
|
Páginas: |
p. 513-520. |
|
Idioma: |
Inglês |
|
Notas: |
Editores: Tamer Ozsu, Asuman Dogac, Ozgur Ulusoy. |
|
Conteúdo: |
We 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. |
|
Palavras-Chave: |
Árvores B+-; Simulation. |
|
Thesagro: |
Simulação. |
|
Categoria do assunto: |
X Pesquisa, Tecnologia e Engenharia |
|
Marc: |
LEADER 01399nam a2200181 a 4500
001 1006878
005 2020-01-20
008 1998 bl uuuu u00u1 u #d
100 1 $aNASCIMENTO, M. A.
245 $aA two-stage B+-tree based approach to index transaction time.$h[electronic resource]
260 $aIn: BIENNIAL WORLD CONFERENCE ON INTEGRATED DESIGN AND PROCESS TECHNOLOGY, 3., 1998. Proceedings... [S.l.]: Society for Design and Process Science$c1998
300 $ap. 513-520. v. 2
490 $vv. 2
500 $aEditores: Tamer Ozsu, Asuman Dogac, Ozgur Ulusoy.
520 $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.
650 $aSimulação
653 $aÁrvores B+-
653 $aSimulation
Download
Esconder MarcMostrar Marc Completo |
|
Registro original: |
Embrapa Agricultura Digital (CNPTIA) |
|
|
Biblioteca |
ID |
Origem |
Tipo/Formato |
Classificação |
Cutter |
Registro |
Volume |
Status |
Fechar
|
| Nenhum registro encontrado para a expressão de busca informada. |
|
|
