Thumbnail
Access Restriction
Subscribed

Author Ilyas, Ihab F. ♦ Beskales, George ♦ Soliman, Mohamed A.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2008
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Top-k ♦ Rank aggregation ♦ Rank-aware processing ♦ Voting
Abstract Efficient processing of $top-\textit{k}$ queries is a crucial requirement in many interactive environments that involve massive amounts of data. In particular, efficient $top-\textit{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-\textit{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-\textit{k}$ queries in XML domain, and show their connections to relational approaches.
ISSN 03600300
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2008-10-01
Publisher Place New York
e-ISSN 15577341
Journal ACM Computing Surveys (CSUR)
Volume Number 40
Issue Number 4
Page Count 58
Starting Page 1
Ending Page 58


Open content in new tab

   Open content in new tab
Source: ACM Digital Library