Window query processing in linear quadtrees
From MaRDI portal
Recommendations
- Overlapping linear quadtrees and spatio-temporal query processing
- Optimal window queries on line segments using the trapezoidal search DAG
- Decomposing a window into maximal quadtree blocks
- An optimal algorithm for decomposing a window into maximal quadtree blocks
- Fixed partial match queries in quadtrees
- scientific article; zbMATH DE number 3986653
- Linear time distance transforms for quadtrees
- An efficient method to estimate the number of node accesses in R^*-trees for window queries
Cited in
(8)- An optimal algorithm for decomposing a window into maximal quadtree blocks
- Decomposing a window into maximal quadtree blocks
- Overlapping linear quadtrees and spatio-temporal query processing
- A generalized comparison of linear representations of thematic layers
- SP-quadtree: an approach of data structuring for parallelization of spatial data
- On sampling regional data
- Wavelet-based cost estimation for spatial queries. (Extended abstract)
- Optimal window queries on line segments using the trapezoidal search DAG
This page was built for publication: Window query processing in linear quadtrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4794425)