A Survey of Top-k Query Processing Techniques in Relational Database Systems

A Survey of Top-k Query Processing Techniques in Relational Database Systems

October 2008 | IHAB F. ILYAS, GEORGE BESKALES, and MOHAMED A. SOLIMAN
This survey by Ihab F. Ilyas, George Beskales, and Mohamed A. Soliman from the University of Waterloo provides an in-depth analysis of top-k query processing techniques in relational database systems. The authors discuss the importance of efficient top-k processing in various domains such as web search, multimedia, and distributed systems, highlighting its impact on performance. They classify top-k processing techniques based on different design dimensions, including query models, data access methods, implementation levels, data and query certainty, and supported scoring functions. The survey also covers top-k queries in XML domains and their connections to relational approaches. The authors present a taxonomy to categorize these techniques and provide detailed descriptions of several algorithms, such as the Threshold Algorithm (TA), Combined Algorithm (CA), No Random Access (NRA), Stream-Combine, and Upper and Pick algorithms. The survey emphasizes the impact of each design dimension on the underlying top-k processing techniques, offering insights into the trade-offs and optimizations available in different scenarios.This survey by Ihab F. Ilyas, George Beskales, and Mohamed A. Soliman from the University of Waterloo provides an in-depth analysis of top-k query processing techniques in relational database systems. The authors discuss the importance of efficient top-k processing in various domains such as web search, multimedia, and distributed systems, highlighting its impact on performance. They classify top-k processing techniques based on different design dimensions, including query models, data access methods, implementation levels, data and query certainty, and supported scoring functions. The survey also covers top-k queries in XML domains and their connections to relational approaches. The authors present a taxonomy to categorize these techniques and provide detailed descriptions of several algorithms, such as the Threshold Algorithm (TA), Combined Algorithm (CA), No Random Access (NRA), Stream-Combine, and Upper and Pick algorithms. The survey emphasizes the impact of each design dimension on the underlying top-k processing techniques, offering insights into the trade-offs and optimizations available in different scenarios.
Reach us at info@study.space