Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Entity–attribute–value model wikipedia , lookup
Data Protection Act, 2012 wikipedia , lookup
Operational transformation wikipedia , lookup
Data center wikipedia , lookup
Asynchronous I/O wikipedia , lookup
Data analysis wikipedia , lookup
Forecasting wikipedia , lookup
Information privacy law wikipedia , lookup
Data/hora: 09/06/2017 07:19:42 Biblioteca(s): Embrapa Informática Agropecuária. Data corrente: 08/04/1998 Data da última atualização: 21/02/2011 Autoria: NASCIMENTO, M. A.; DUNHAM, M. H. Afiliação: MARIO A. NASCIMENTO, CNPTIA; MARGARET H. DUNHAM, Southern Methodist University. Título: Using B+-trees in a two disk-single processor architecture to efficiently process inclus'ion spatial queries. Ano de publicação: 1997 Fonte/Imprenta: Campinas: UNICAMP-IC, 1997. Páginas: 16 p. Série: (Relatório Técnico IC-97-23). Idioma: Inglês Conteúdo: In this paper we address the problem of indexing spatial data, in particular two dimensional rectangles. We propose an approach which uses two B+-trees, each of them indexing the project sides of the given rectangles. The approach, which we name 2dMAP21, can also be easily parallelized using two disks - but still a single processor each holding the trees indexing the projected sides on either axes. We focus on queries of the type "find all rectangles included within another (reference) rectangle". Nevertheless, 2dMAP21 can processe other types of queries as well. We compare our approach to the R*-tree, known as the most efficient R-tree derivative. Our investigation shows that, if the queries have the same spatial distribution of the data, the non-parallel 2dMAP21 may be a competitive alternative to the R*-tree in some cases, whereas the parallelized version of 2dMAP21 outperforms that structure virtually always. 2dMAP21 may consume a little more or less storage space than the R*-tree, depending primarily on the spatial distribution on the indexed MBRs. The use of B+-trees renders our approach to be actually implementable using commercial DBMSs. Palavras-Chave: Algoritmos; Árvores B+-; Indexação de dados espaciais. Thesaurus NAL: Algorithms; Spatial data. Categoria do assunto: X Pesquisa, Tecnologia e Engenharia Registro original: Embrapa Informática Agropecuária (CNPTIA) Exemplares: CNPTIA - (6900-1) - UPC - RT - PP - - - 1998.00001 - DIS