Efficient range searching for categorical and plain data
From MaRDI portal
Publication:2943571
DOI10.1145/2543924zbMath1321.68235OpenAlexW1994664542MaRDI QIDQ2943571
Publication date: 3 September 2015
Published in: ACM Transactions on Database Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2543924
Related Items (7)
I/O-optimal categorical 3-sided skyline queries ⋮ Ranked Document Retrieval in External Memory ⋮ Absent Subsequences in Words ⋮ Adaptive data structures for 2D dominance colored range counting ⋮ Unnamed Item ⋮ Data structures for categorical path counting queries ⋮ Succinct Color Searching in One Dimension
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multidimensional divide-and-conquer
- Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
- Making data structures persistent
- On data structures and asymmetric communication complexity
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- Efficient external memory structures for range-aggregate queries
- Sorted Range Reporting
- Time-space trade-offs for predecessor search
- External Memory Orthogonal Range Reporting with Fast Updates
- Data Structures for Approximate Orthogonal Range Counting
- Priority Search Trees
- Design and implementation of an efficient priority queue
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Adaptive and Approximate Orthogonal Range Counting
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- External Memory Range Reporting on a Grid
- Fully Dynamic Orthogonal Range Reporting on RAM
- Algorithms – ESA 2005
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
- Algorithms for generalized halfspace range searching and other intersection searching problems
This page was built for publication: Efficient range searching for categorical and plain data
