Processing Top N and Bottom N Queries.
Michael J. Carey, Donald Kossmann · 1997
this paper addresses the question of how top N and bottom N queries can be processed efficiently; moreover, we address the question of how such support can be provided as a natural extension of existing relational query processing architectures. In a nutshell, our goal is to evaluate such queries with as little wasted work