The DR-tree: A main memory data structure for complex multi-dimensional objects
From MaRDI portal
Recommendations
Cited in
(11)- An efficient method to estimate the number of node accesses in R^*-trees for window queries
- scientific article; zbMATH DE number 1945906 (Why is no real title available?)
- scientific article; zbMATH DE number 1953853 (Why is no real title available?)
- scientific article; zbMATH DE number 1961032 (Why is no real title available?)
- scientific article; zbMATH DE number 1875355 (Why is no real title available?)
- Analysis and optimization for Boolean expression indexing
- scientific article; zbMATH DE number 2036384 (Why is no real title available?)
- scientific article; zbMATH DE number 1756666 (Why is no real title available?)
- Analysis of two-step index structure for complex spatial objects
- The study of multidimensional R-tree-based index scalability in multicore environment
- Spatial Indexing Based on the Semi-approximation Scheme of MBR
This page was built for publication: The DR-tree: A main memory data structure for complex multi-dimensional objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2744809)