Efficient range searching for categorical and plain data
From MaRDI portal
Publication:2943571
DOI10.1145/2543924zbMATH Open1321.68235OpenAlexW1994664542MaRDI QIDQ2943571FDOQ2943571
Authors: Yakov Nekrich 
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
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
- Multidimensional divide-and-conquer
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Time-space trade-offs for predecessor search
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Priority Search Trees
- Making data structures persistent
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
- Sorted Range Reporting
- Design and implementation of an efficient priority queue
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Data structures for approximate orthogonal range counting
- On data structures and asymmetric communication complexity
- Title not available (Why is that?)
- Algorithms for generalized halfspace range searching and other intersection searching problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fully Dynamic Orthogonal Range Reporting on RAM
- Title not available (Why is that?)
- Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
- Efficient external memory structures for range-aggregate queries
- Adaptive and Approximate Orthogonal Range Counting
- External Memory Range Reporting on a Grid
- External Memory Orthogonal Range Reporting with Fast Updates
- Algorithms – ESA 2005
Cited In (10)
- Title not available (Why is that?)
- Ranked Document Retrieval in External Memory
- Adaptive data structures for 2D dominance colored range counting
- Data structures for categorical path counting queries
- Title not available (Why is that?)
- Absent Subsequences in Words
- I/O-optimal categorical 3-sided skyline queries
- Succinct Color Searching in One Dimension
- Significant-presence range queries in categorical data.
- 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)
