Processing of Top-k Selection Queries in Relational Database System
Neha Singh, Piyush Pandey · IOSR Journal of Computer Engineering · 2014
In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return.Instead, the result to such queries is typically a rank of the top-k tuples that best match the given attribute values.Focusing on the top-k items according to a ranking criterion constitutes an important functionality in many different query answering scenarios.The idea is to read only the necessary information mostly from secondary storage with the ultimate goal to achieve low latency.In this paper, we study the advantages and limitations of processing a top-k query by translating it into a single range query that traditional relational database management systems can process efficiently.In this work, we also consider processing such top-k queries under the constraint that the result items are members of a specific set, which is provided at query time it is also known as set-defined selection criterion.