Efficient Top-k Queries for Orthogonal Ranges

DOI10.1007/978-3-642-19094-0_13zbMath1317.68254OpenAlexW1858509911MaRDI QIDQ3078389

Prosenjit Gupta, K. S. Rajan, Saladi Rahul, Ravi Janardan

Publication date: 20 February 2011

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19094-0_13

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (3)

Space-efficient data-analysis queries on grids ⋮ Colored top-\(K\) range-aggregate queries ⋮ Group nearest-neighbor queries in the \(L_1\) plane

Cites Work

• Unnamed Item
• Unnamed Item
• A technique for adding range restrictions to generalized searching problems
• Dynamic fractional cascading
• Making data structures persistent
• Top-k Ranked Document Search in General Text Databases
• Online Sorted Range Reporting
• Adding range restriction capability to dynamic data structures
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Binary Search Trees of Bounded Balance
• Algorithms - ESA 2003

This page was built for publication: Efficient Top-k Queries for Orthogonal Ranges