Efficient dynamic range searching using data replication
From MaRDI portal
Publication:293421
DOI10.1016/S0020-0190(98)00128-8zbMath1339.68054OpenAlexW2095496769MaRDI QIDQ293421
K. V. Ravi Kanth, Ambuj K. Singh
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001288?np=y
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (2)
Efficient dynamic range searching using data replication ⋮ Dynamic orthogonal range queries in OLAP.
Cites Work
- Unnamed Item
- Efficient dynamic range searching using data replication
- The design of dynamic data structures
- Efficient worst-case data structures for range searching
- Worst-case optimal insertion and deletion methods for decomposable searching problems
- Dynamic multi-dimensional data structures based on quad- and k-d trees
- Divided \(k-d\) trees
- Decomposable searching problems I. Static-to-dynamic transformation
- Multidimensional binary search trees used for associative searching
This page was built for publication: Efficient dynamic range searching using data replication
