A new framework for addressing temporal range queries and some preliminary results
From MaRDI portal
Publication:1770382
DOI10.1016/j.tcs.2004.10.013zbMath1070.68029OpenAlexW2087547152MaRDI QIDQ1770382
Publication date: 6 April 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.013
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
- Algorithms for three-dimensional dominance searching in linear space.
- Overlapping Linear Quadtrees and Spatio-Temporal Query Processing
- Fast Algorithms for Finding Nearest Common Ancestors
- Lower bounds for orthogonal range searching: I. The reporting case
- Lower bounds for orthogonal range searching: part II. The arithmetic model
- Priority Search Trees
- Filtering Search: A New Approach to Query-Answering
- A unifying look at data structures
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
- GENERALIZED INTERSECTION SEARCHING PROBLEMS