|
|
Registro Completo |
Biblioteca(s): |
Embrapa Agricultura Digital. |
Data corrente: |
26/11/1997 |
Data da última atualização: |
19/12/2007 |
Autoria: |
NASCIMENTO, M. A.; DUNHAM, M. H. |
Título: |
Using parallel B+ - trees as a practical alternative to the classical R-tree. |
Ano de publicação: |
1996 |
Fonte/Imprenta: |
In: SIMPÓSIO BRASILEIRO DE BANCO DE DADOS, 11., 1996, São Carlos, SP. Anais... São Carlos: USP-ICMSC, 1996. |
Páginas: |
p. 187-200. |
Idioma: |
Inglês Português |
Notas: |
SBBD'96. Editado por Teresa Pires Vieira e Agma Juci Machado Traina. |
Conteúdo: |
In this paper we address the problem of indexing two-dimensional rectangles. Instead of a structure based on the R-tree, we propose the use of two B++ -trees (potentially parallelizable), where each of them indexes the projected sides of the indexed rectangles. The proposed approach is shown to outperform the classical R-tree, in terms of both the size of the index and the number of I / Os to process a rectangle overlap type of query. In addition, the use of B++ -trees renders the approach to be straightforward to be implemented in existing commercial DBMSs. |
Palavras-Chave: |
B+-trees; Banco de dados; Indexacao de retangulos bidimensionais; Parallel indexing; R-trees. |
Thesaurus Nal: |
databases. |
Categoria do assunto: |
-- |
Marc: |
LEADER 01317naa a2200229 a 4500 001 1005400 005 2007-12-19 008 1996 bl uuuu u00u1 u #d 100 1 $aNASCIMENTO, M. A. 245 $aUsing parallel B+ - trees as a practical alternative to the classical R-tree. 260 $c1996 300 $ap. 187-200. 500 $aSBBD'96. Editado por Teresa Pires Vieira e Agma Juci Machado Traina. 520 $aIn this paper we address the problem of indexing two-dimensional rectangles. Instead of a structure based on the R-tree, we propose the use of two B++ -trees (potentially parallelizable), where each of them indexes the projected sides of the indexed rectangles. The proposed approach is shown to outperform the classical R-tree, in terms of both the size of the index and the number of I / Os to process a rectangle overlap type of query. In addition, the use of B++ -trees renders the approach to be straightforward to be implemented in existing commercial DBMSs. 650 $adatabases 653 $aB+-trees 653 $aBanco de dados 653 $aIndexacao de retangulos bidimensionais 653 $aParallel indexing 653 $aR-trees 700 1 $aDUNHAM, M. H. 773 $tIn: SIMPÓSIO BRASILEIRO DE BANCO DE DADOS, 11., 1996, São Carlos, SP. Anais... São Carlos: USP-ICMSC, 1996.
Download
Esconder MarcMostrar Marc Completo |
Registro original: |
Embrapa Agricultura Digital (CNPTIA) |
|
Biblioteca |
ID |
Origem |
Tipo/Formato |
Classificação |
Cutter |
Registro |
Volume |
Status |
URL |
Voltar
|
|
Registros recuperados : 55 | |
Registros recuperados : 55 | |
|
Nenhum registro encontrado para a expressão de busca informada. |
|
|