- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
Cardinality estimation is an important research problem in modern ML-driven DBMSs. One particular technical challenge is that learned models become stale as the underlying database is updated. To address this problem, this paper adopts an online learning approach to update the model. However, the study is limited to selection queries over a single table, where there is little room for query optimization and the need for cardinality/selectivity estimation is relatively limited.
Critical strengths
S1. Adapting learned models to database updates and changes in query workloads is an important research problem.
S2. The paper is theoretically solid in the sense that it ensures the worst case regret for selectivity estimation based on both squared loss and absolute loss.
Critical weaknesses
W1. The problem setting is disconnected from practical scenarios. The paper states that selectivity estimation is a "key input to query optimizers choosing between candidate query execution plans, a central task in database management systems." However, this claim is not accurate. For single-table queries, there is only a single execution plan, or there can be multiple execution plans, but their cost difference is not large. Therefore, query plan optimization is of considerably less importance for single-table queries. Indeed, recent research on learned cardinality estimation has primarily focused on join queries, where the costs of alternative execution plans can differ substantially.
W2. The experimental evaluation is weak.
- The proposed method is not compared with data-driven SOTA approaches that learn distributions directly from database contents, such as NeuroCard, Naru, and DeepDB.
- From a practical perspective, the proposed method should also be compared with baseline methods in terms of training cost and inference performance.
Questions for authors
NA