A survey of top- <i>k</i> query processing techniques in relational database systems

Abstract

Efficient processing of top- k queries is a crucial requirement in many interactive environments that involve massive amounts of data. In particular, efficient top- k processing in domains such as the Web, multimedia search, and distributed systems has shown a great impact on performance. In this survey, we describe and classify top- k processing techniques in relational databases. We discuss different design dimensions in the current techniques including query models, data access methods, implementation levels, data and query certainty, and supported scoring functions. We show the implications of each dimension on the design of the underlying techniques. We also discuss top- k queries in XML domain, and show their connections to relational approaches.