The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
A survey of top- k 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An Introduction to the Bootstrap
Efron, B., & Tibshirani, R. J. (1994) · doi:10.1201/9780429246593 · Cited by 40,500
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 9,680
Social Choice and Individual Values.
Shackle, G. L. S., & Arrow, K. J. (1951) · Economica · doi:10.2307/2549613 · Cited by 7,792
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Social Choice and Individual Values
Baumol, W. J., & Arrow, K. J. (1952) · Econometrica · doi:10.2307/1907815 · Cited by 4,699
The Theory of Committees and Elections.
Stuart, A., & Black, D. (1959) · Economica · doi:10.2307/2550498 · Cited by 2,822
Borzsony, S., Kossmann, D., & Stocker, K. (2002) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.2001.914855 · Cited by 2,266
Storing and querying ordered XML using a relational database system
Tatarinov, I., Viglas, S. D., Beyer, K., Shanmugasundaram, J., Shekita, E., & Zhang, C. (2002) · Proceedings of the 2002 ACM SIGMOD international conference on Management of data · doi:10.1145/564691.564715 · Cited by 2,235
Rank aggregation methods for the Web
Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.372165 · Cited by 1,793
Some Simple Effective Approximations to the 2-Poisson Model for Probabilistic Weighted Retrieval
Robertson, S. E., & Walker, S. (1994) · SIGIR ’94 · doi:10.1007/978-1-4471-2099-5_24 · Cited by 1,477
Cited by
Data Organisation for Efficient Pattern Retrieval: Indexing, Storage, and Access Structures
Koukaras, P., & Tjortjis, C. (2025) · Big Data and Cognitive Computing · doi:10.3390/bdcc9100258 · Cited by 3
Metadata
- Authors
- Ilyas, I. F., Beskales, G., & Soliman, M. A.
- Venue
- ACM Computing Surveys
- Published
- 2008-10
- Volume
- 40
- Issue
- 4
- Pages
- 1-58
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2009688537
- Cited by
- 825
- References
- 40
- FWCI
- 84.48
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A survey of top- k query processing techniques in relational database systems. https://app.cochat.ai/papers/10.1145/1391729.1391730
- The paper
- Ilyas, I. F., Beskales, G., & Soliman, M. A. (2008). A survey of top- k query processing techniques in relational database systems. ACM Computing Surveys. https://doi.org/10.1145/1391729.1391730
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.