Capa do livro de Hilbert R-tree
Título do livro:

Hilbert R-tree

R-tree, Space-filling curve, Hilbert curve

Culp Press (2011-08-08 )

Books loader

Omni badge Apto para vale
ISBN- 1 3:

978-613-6-50432-2

ISBN- 1 0:
6136504324
EAN:
9786136504322
Idioma do livro:
Inglês
Anotações e citações/ texto breve:
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Hilbert R-tree, an R-tree variant, is an index for multidimensional objects like lines, regions, 3-D objects, or high dimensional feature-based parametric objects. It can be thought of as an extension to B+-tree for multidimensional objects. The performance of R-trees depends on the quality of the algorithm that clusters the data rectangles on a node. Hilbert R-trees use space-filling curves, and specifically the Hilbert curve, to impose a linear ordering on the data rectangles. There are two types of Hilbert R-tree, one for static database and one for dynamic databases. In both cases, space filling curves and specifically the Hilbert curve are used to achieve better ordering of multidimensional objects in the node. This ordering has to be ‘good’, in the sense that it should group ‘similar’ data rectangles together, to minimize the area and perimeter of the resulting minimum bounding rectangles. Packed Hilbert R-trees are suitable for static databases in which updates are very rare or in which there are no updates at all.
Editora:
Culp Press
Website:
http://www.alphascript-publishing.com
Editado por:
Nethanel Willy
Número de páginas:
72
Publicado em:
2011-08-08
Stock:
Disponível
Categoria:
Tecnologia
Preço:
29 €
Palavras chave:
Multidimensional, Dimensional, Performance, Data, Algorithm, dimensional, Datamining, Algorithmen

Books loader

Boletim informativo

Adyen::amex Adyen::mc Adyen::visa Adyen::cup Adyen::unionpay PayPal Transferência Bancária

  0 produtos no carrinho
Editar carrinho
Loading frontend
LOADING