Efficient dynamic range searching using data replication

DOI10.1016/S0020-0190(98)00128-8MaRDI QIDQ293421zbMATH OpenOpenAlexFDO

Authors K. V. Ravi Kanth, Ambuj 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

zbMATH Keywords

computational geometryrange searchingdynamic data structures

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Space efficient dynamic orthogonal range reporting
• Space efficient dynamic orthogonal range reporting
• Orthogonal Range Searching in Linear and Almost-Linear Space
• Dynamic orthogonal range searching on the RAM, revisited
• Orthogonal range searching in linear and almost-linear space

Cites work

• scientific article; zbMATH DE number 3887061 (Why is no real title available?)
• Decomposable searching problems I. Static-to-dynamic transformation
• Divided \(k-d\) trees
• Dynamic multi-dimensional data structures based on quad- and k-d trees
• Efficient dynamic range searching using data replication
• Efficient worst-case data structures for range searching
• Multidimensional binary search trees used for associative searching
• The design of dynamic data structures
• Worst-case optimal insertion and deletion methods for decomposable searching problems

Cited in

(5)

• Multidimensional segment trees can do range updates in poly-logarithmic time
• scientific article; zbMATH DE number 3864511 (Why is no real title available?)
• Dynamic orthogonal range queries in OLAP.
• Efficient dynamic range searching using data replication
• Surpassing the information theoretic bound with fusion trees

This page was built for publication: Efficient dynamic range searching using data replication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293421)