R-trees: theory and applications

DOI10.1007/978-1-84628-293-5zbMath1107.68038OpenAlexW1633222579MaRDI QIDQ1775219

Niranjan Chakravarthy

Publication date: 4 May 2005

Published in: Advanced Information and Knowledge Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-84628-293-5

zbMATH Keywords

space supportspatial access method

Mathematics Subject Classification ID

Database theory (68P15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05)

Related Items (10)

Cloud-assisted secure biometric identification with sub-linear search efficiency ⋮ Efficient solution of bimaterial Riemann problems for compressible multi-material flow simulations ⋮ Approximate range searching in external memory ⋮ Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines ⋮ Conservative interpolation between volume meshes by local Galerkin projection ⋮ Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves ⋮ Approximate Range Searching in External Memory ⋮ Unnamed Item ⋮ Cache-oblivious R-trees ⋮ Locality and bounding-box quality of two-dimensional space-filling curves

This page was built for publication: R-trees: theory and applications