The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Supporting top-k join queries in relational databases
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
Access path selection in a relational database management system
Selinger, P. G., Astrahan, M. M., Chamberlin, D. D., Lorie, R. A., & Price, T. G. (1979) · Proceedings of the 1979 ACM SIGMOD international conference on Management of data - SIGMOD '79 · doi:10.1145/582095.582099 · Cited by 2,188
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
Optimal aggregation algorithms for middleware
Fagin, R., Lotem, A., & Naor, M. (2003) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(03)00026-6 · Cited by 942
Spearman's Footrule as a Measure of Disarray
Diaconis, P., & Graham, R. L. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01624.x · Cited by 640
Ripple joins for online aggregation
Haas, P. J., & Hellerstein, J. M. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304208 · Cited by 369
Automatically Extracting Structure from Free Text Addresses.
Borkar, V., Deshmukh, K., & Sarawagi, S. (2000) · Cited by 313
Top- k selection queries over relational databases: Mapping strategies and performance evaluation
Bruno, N., Chaudhuri, S., & Gravano, L. (2002) · ACM Transactions on Database Systems · doi:10.1145/568518.568519 · Cited by 244
Optimization of parallel query execution plans in XPRS
Hong, W., & Stonebraker, M. R. (1993) · Distributed and Parallel Databases · doi:10.1007/bf01277518 · Cited by 195
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
Self-citationManaging uncertainty and vagueness in description logics for the Semantic Web
Lukasiewicz, T., & Straccia, U. (2008) · Journal of Web Semantics · doi:10.1016/j.websem.2008.04.001 · Cited by 473
KATARA: A Data Cleaning System Powered by Knowledge Bases and Crowdsourcing
Chu, X., Morcos, J., Ilyas, I. F., Ouzzani, M., Papotti, P., Tang, N., & Ye, Y. (2015) · Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2723372.2749431 · Cited by 279
Self-citationFairness in package-to-group recommendations
Serbos, D., Qi, S., Mamoulis, N., Pitoura, E., & Tsaparas, P. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052612 · Cited by 107
Metadata
- Authors
- Ilyas, I., Aref, W., & Elmagarmid, A.
- Venue
- The VLDB Journal
- Published
- 2004-09
- Volume
- 13
- Issue
- 3
- ISSN
- 0949-877X (ISSN-L)
- 1066-8888
- OpenAlex
- W2143682328
- Cited by
- 385
- References
- 8
- FWCI
- 36.92
- 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: Supporting top-k join queries in relational databases. https://app.cochat.ai/papers/10.1007/s00778-004-0128-2
- The paper
- Ilyas, I., Aref, W., & Elmagarmid, A. (2004). Supporting top-k join queries in relational databases. The VLDB Journal. https://doi.org/10.1007/s00778-004-0128-2
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.