Colored top-\(K\) range-aggregate queries
From MaRDI portal
Publication:2445248
DOI10.1016/j.ipl.2013.07.013zbMath1284.68239OpenAlexW2052023370MaRDI QIDQ2445248
Prosenjit Gupta, Subhashis Majumder, Biswajit Sanyal
Publication date: 14 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.07.013
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Information storage and retrieval of data (68P20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A technique for adding range restrictions to generalized searching problems
- Making data structures persistent
- Efficient Top-k Queries for Orthogonal Ranges
- Efficient Colored Orthogonal Range Counting
- New upper bounds for generalized intersection searching problems
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Space-Efficient Framework for Top-k String Retrieval Problems
This page was built for publication: Colored top-\(K\) range-aggregate queries