A data structure for dynamic range queries

DOI10.1016/0020-0190(82)90119-3zbMath0511.68080OpenAlexW2068870365MaRDI QIDQ1838844

Dan E. Willard, George S. Lueker

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://escholarship.org/uc/item/9k40c7jc

zbMATH Keywords

data structuressearchingrange queriesfile organizationdata base managementbounded balance trees

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (7)

An algorithm for handling many relational calculus queries efficiently. ⋮ Dynamic Euclidean minimum spanning trees and extrema of binary functions ⋮ Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems ⋮ A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time ⋮ An optimal time and minimal space algorithm for rectangle intersection problems ⋮ A deterministic skip list for \(k\)-dimensional range search ⋮ An application of $m$-ary trees to the design of data structures for geometric searching problems

Cites Work

• Unnamed Item
• Multidimensional divide-and-conquer
• Decomposable searching problems
• New Data Structures for Orthogonal Range Queries
• Adding range restriction capability to dynamic data structures
• Quintary trees
• A Lower Bound on the Complexity of Orthogonal Range Queries
• Binary Search Trees of Bounded Balance

This page was built for publication: A data structure for dynamic range queries