Efficient range searching for categorical and plain data
From MaRDI portal
(Redirected from Publication:2943571)
Recommendations
- Efficient data structures for range searching on a grid
- scientific article; zbMATH DE number 1947378
- Approximate range searching in higher dimension
- Computing and Combinatorics
- Opportunistic data structures for range queries
- Data structures for range-aggregation over categories
- Range searching on uncertain data
- scientific article; zbMATH DE number 1182924
- Approximate range searching
- Range search in parallel using distributed data structures
Cites work
- scientific article; zbMATH DE number 5764825 (Why is no real title available?)
- scientific article; zbMATH DE number 1947378 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- scientific article; zbMATH DE number 910894 (Why is no real title available?)
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Adaptive and approximate orthogonal range counting
- Algorithms for generalized halfspace range searching and other intersection searching problems
- Algorithms – ESA 2005
- Data structures for approximate orthogonal range counting
- Design and implementation of an efficient priority queue
- Efficient external memory structures for range-aggregate queries
- External Memory Range Reporting on a Grid
- External memory orthogonal range reporting with fast updates
- Fully Dynamic Orthogonal Range Reporting on RAM
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- Making data structures persistent
- Multidimensional divide-and-conquer
- On data structures and asymmetric communication complexity
- Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
- Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
- Priority Search Trees
- Range selection and median: tight cell probe lower bounds and adaptive data structures
- Sorted range reporting
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
- Time-space trade-offs for predecessor search
- Top-\(K\) color queries for document retrieval
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Cited in
(18)- Conditional lower bounds for dynamic geometric measure problems
- Conditional lower bounds for dynamic geometric measure problems
- Faster path queries in colored trees via sparse matrix multiplication and min-plus product
- Data structures for range-aggregation over categories
- scientific article; zbMATH DE number 1947378 (Why is no real title available?)
- Ranked Document Retrieval in External Memory
- Optimal color range reporting in one dimension
- Adaptive data structures for 2D dominance colored range counting
- Data structures for categorical path counting queries
- scientific article; zbMATH DE number 7561469 (Why is no real title available?)
- Absent Subsequences in Words
- I/O-optimal categorical 3-sided skyline queries
- Range (Rényi) entropy queries and partitioning
- Significant-presence range queries in categorical data.
- Near-optimal range reporting structures for categorical data
- Succinct color searching in one dimension
- The edit distance to k-subsequence universality
- On approximate colored path counting
This page was built for publication: Efficient range searching for categorical and plain data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943571)
