| |
|
|
| Registros recuperados : 1 | |
| Registros recuperados : 1 | |
|
|
|
 | 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: |
15/02/2002 |
|
Data da última atualização: |
05/09/2006 |
|
Autoria: |
NASCIMENTO, M. A.; SILVA, J. R. O.; THEODORIDIS, Y. |
|
Afiliação: |
EMBRAPA-CNPTIA; UNICAMP; NATIONAL TECHNICAL UNIVERSITY OF ATHENS. |
|
Título: |
Access structures for moving points. |
|
Ano de publicação: |
1998 |
|
Fonte/Imprenta: |
Campinas: UNICAMP, 1998. |
|
Páginas: |
23 p. |
|
Série: |
Relatorio Tecnico IC-98-34). |
|
Idioma: |
Inglês |
|
Conteúdo: |
Several applications require management of data which is spatially dynamic, e.g., tracking of battle ships or moving cells in a blood sample. The capability of handling the temporal aspect, i.e., the history of such type of data, is also important. This paper presents and evaluates three temporal extensions of the R-tree, the 3D R-tree, the 2+3 R-tree and the HR-tree, wich are capable of indexing spatiotemporal data. Our experiments have shown that the while the HR-tree was the larger structure, its query processing cost was over 50% smaller then the ones yielded by the 3D R-tree and the 2+3 R-tree. Also compared to the (non-practical) approach of storing one R-tree for each of the spatial database states it offered the same query processing cost, saving around one third of storage space. |
|
Palavras-Chave: |
Structures for moving points. |
|
Categoria do assunto: |
-- |
|
Marc: |
LEADER 01241nam a2200169 a 4500
001 1008044
005 2006-09-05
008 1998 bl uuuu t 00u1 u #d
100 1 $aNASCIMENTO, M. A.
245 $aAccess structures for moving points.
260 $aCampinas: UNICAMP$c1998
300 $a23 p.
490 $aRelatorio Tecnico IC-98-34).
520 $aSeveral applications require management of data which is spatially dynamic, e.g., tracking of battle ships or moving cells in a blood sample. The capability of handling the temporal aspect, i.e., the history of such type of data, is also important. This paper presents and evaluates three temporal extensions of the R-tree, the 3D R-tree, the 2+3 R-tree and the HR-tree, wich are capable of indexing spatiotemporal data. Our experiments have shown that the while the HR-tree was the larger structure, its query processing cost was over 50% smaller then the ones yielded by the 3D R-tree and the 2+3 R-tree. Also compared to the (non-practical) approach of storing one R-tree for each of the spatial database states it offered the same query processing cost, saving around one third of storage space.
653 $aStructures for moving points
700 1 $aSILVA, J. R. O.
700 1 $aTHEODORIDIS, Y.
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. |
|
|
