The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Top- k selection queries over relational databases: Mapping strategies and performance evaluation
Abstract
In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typically a rank of the "top k " tuples that best match the given attribute values. In this paper, we study the advantages and limitations of processing a top- k query by translating it into a single range query that a traditional relational database management system (RDBMS) can process efficiently. In particular, we study how to determine a range query to evaluate a top- k query by exploiting the statistics available to an RDBMS, and the impact of the quality of these statistics on the retrieval efficiency of the resulting scheme. We also report the first experimental evaluation of the mapping strategies over a real RDBMS, namely over Microsoft's SQL Server 7.0. The experiments show that our new techniques are robust and significantly more efficient than previously known strategies requiring at least one sequential scan of the data sets.
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
When Is ''Nearest Neighbor'' Meaningful?
Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_15 · Cited by 2,403
Cited by
A survey of top- k query processing techniques in relational database systems
Ilyas, I. F., Beskales, G., & Soliman, M. A. (2008) · ACM Computing Surveys · doi:10.1145/1391729.1391730 · Cited by 825
Supporting top-k join queries in relational databases
Ilyas, I., Aref, W., & Elmagarmid, A. (2004) · The VLDB Journal · doi:10.1007/s00778-004-0128-2 · Cited by 385
A Social Network-Based Inference Model for Validating Customer Profile Data1
Park, S.-H., Huh, S.-Y., Oh, W., & Han, S. P. (2012) · MIS Quarterly · doi:10.2307/41703505 · Cited by 104
Metadata
- Authors
- Bruno, N., Chaudhuri, S., & Gravano, L.
- Venue
- ACM Transactions on Database Systems
- Published
- 2002-06
- Volume
- 27
- Issue
- 2
- Pages
- 153-187
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2134195632
- Cited by
- 244
- References
- 1
- FWCI
- 21.97
- 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: Top- k selection queries over relational databases: Mapping strategies and performance evaluation. https://app.cochat.ai/papers/10.1145/568518.568519
- The paper
- Bruno, N., Chaudhuri, S., & Gravano, L. (2002). Top- k selection queries over relational databases: Mapping strategies and performance evaluation. ACM Transactions on Database Systems. https://doi.org/10.1145/568518.568519
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.