The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
An end-to-end learning-based cost estimator
Open accessAbstract
Cost and cardinality estimation is vital to query optimizer, which can guide the query plan selection. However traditional empirical cost and cardinality estimation techniques cannot provide high-quality estimation, because they may not effectively capture the correlation between multiple tables. Recently the database community shows that the learning-based cardinality estimation is better than the empirical methods. However, existing learning-based methods have several limitations. Firstly, they focus on estimating the cardinality, but cannot estimate the cost. Secondly, they are either too heavy or hard to represent complicated structures, e.g., complex predicates. To address these challenges, we propose an effective end-to-end learning-based cost estimation framework based on a tree-structured model, which can estimate both cost and cardinality simultaneously. We propose effective feature extraction and encoding techniques, which consider both queries and physical operations in feature extraction. We embed these features into our tree-structured model. We propose an effective method to encode string values, which can improve the generalization ability for predicate matching. As it is prohibitively expensive to enumerate all string values, we design a patten-based method, which selects patterns to cover string values and utilizes the patterns to embed string values. We conducted experiments on real-world datasets and experimental results showed that our method outperformed baselines.
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
Caruana, R. (1997) · Machine Learning · doi:10.1023/a:1007379606734 · Cited by 6,636
Probabilistic counting algorithms for data base applications
Flajolet, P., & Nigel Martin, G. (1985) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(85)90041-8 · Cited by 1,269
How good are query optimizers, really?
Leis, V., Gubichev, A., Mirchev, A., Boncz, P. A., Kemper, A., & Neumann, T. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2850583.2850594 · Cited by 730
HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm
Flajolet, P., Fusy, É., Gandouet, O., & Meunier, F. (2007) · Discrete Mathematics & Theoretical Computer Science · doi:10.46298/dmtcs.3545 · Cited by 695
Automating string processing in spreadsheets using input-output examples
Gulwani, S. (2011) · ACM SIGPLAN Notices · doi:10.1145/1925844.1926423 · Cited by 581
Automating string processing in spreadsheets using input-output examples
Gulwani, S. (2011) · Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1926385.1926423 · Cited by 446
The History of Histograms (abridged)
Ioannidis, Y. (2003) · Elsevier eBooks · doi:10.1016/b978-012722442-8/50011-2 · Cited by 417
Neo: a learned query optimizer
Marcus, R., Negi, P., Mao, H., Zhang, C., Alizadeh, M., Kraska, T., Papaemmanouil, O., & Tatbul, N. (2019) · Proceedings of the VLDB Endowment · doi:10.14778/3342263.3342644 · Cited by 389
Predicting Multiple Metrics for Queries: Better Decisions Enabled by Machine Learning
Ganapathi, A., Kuno, H., Umeshwar Dayal, B., Wiener, J. L., Fox, A., Jordan, M. I., & Patterson, D. A. (2009) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.2009.130 · Cited by 322
An End-to-End Automatic Cloud Database Tuning System Using Deep Reinforcement Learning
Zhang, J., Liu, Y., Zhou, K., Li, G., Xiao, Z., Cheng, B., Xing, J., Wang, Y., Cheng, T., Liu, L., et al. (2019) · Proceedings of the 2019 International Conference on Management of Data · doi:10.1145/3299869.3300085 · Cited by 318
Self-citation
Cited by
Data-centric Artificial Intelligence: A Survey
Zha, D., Bhat, Z. P., Lai, K.-H., Yang, F., Jiang, Z., Zhong, S., & Hu, X. (2025) · ACM Computing Surveys · doi:10.1145/3711118 · Cited by 334
QTune: a query-aware database tuning system with deep reinforcement learning
Li, G., Zhou, X., Li, S., & Gao, B. (2019) · Proceedings of the VLDB Endowment · doi:10.14778/3352063.3352129 · Cited by 257
Self-citation
Metadata
- Authors
- Sun, J., & Li, G.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2019-11
- Volume
- 13
- Issue
- 3
- Pages
- 307-319
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2998249308
- Cited by
- 256
- References
- 18
- FWCI
- 13.49
- Type
- journal article
- Language
- en
- Open access
- green
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: An end-to-end learning-based cost estimator. https://app.cochat.ai/papers/10.14778/3368289.3368296
- The paper
- Sun, J., & Li, G. (2019). An end-to-end learning-based cost estimator. Proceedings of the VLDB Endowment. https://doi.org/10.14778/3368289.3368296
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.