DeepRead
Cover of Foundations of multidimensional and metric data structures

Foundations of multidimensional and metric data structures

Hanan Samet · 2006

Programming and computer science › Databases and distributed data

#3,699 most recommended

About the book

A reference on data structures for multidimensional point and spatial data, covering quadtrees, k-d trees, R-trees and related hierarchical structures, along with metric trees for data where only distances between objects are known. It is organised around the search and query operations these structures support, such as range and nearest-neighbour search. The book treats the many spatial and metric indexing structures as variations on a small set of shared principles, mainly recursive decomposition of space or of a set of objects and the pruning of search based on bounding regions or distances. It presents these principles systematically so that a reader can compare structures and choose or adapt one for a given application. It also gives detailed attention to implementation and to the analysis of how these structures behave in practice.

Written by Claude from what it knows of this book.

What Hacker News says 100% recommend · 0% critical

02420092015202020262024 peak · 3
This bookAverage book in Databases and distributed data

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 1 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
2006
ISBN
9780123694461
Editions known
2 at Open Library
Open Library
OL4793824W

AlgorithmesAlgoritmos e estruturas de dadosComputer algorithmsData structures (Computer science)Data structures (computer science)Estruturas de dadosStructures de données (Informatique)

Explore in the mosaic

Read next: its neighbours on the mosaic