This paper extends the query‐mapping method for top‐k retrieval in a relational DB. Top‐k retrieval finds a small set of approximate results for user specified values. Query‐mapping involves converting a top‐k query into a range query. Proposed method incorporates data skewness in cost‐based query‐mapping. Experiments show improved efficiency and robustness across parameters.
