Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
