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). Access Path Selection in a Relational Database Management System. Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data, 23-34.
Cited by¶
3 citations across 3 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Complexity (Time/Space)
- The practical difference (30 vs 10⁹ operations) is constant-factor overhead, but determines whether queries complete in seconds or hours
This sourceSystem R cost-based access-path/query optimization — table-scan vs index-based access — supports the data-warehouse example at D30-146. Verified existing and supporting.
- The practical difference (30 vs 10⁹ operations) is constant-factor overhead, but determines whether queries complete in seconds or hours
- Equivalence-Preserving Rewriting
- Database query optimisation: relational-algebra rewrites — selection push-down, join reordering, predicate rewriting — transform a declarative query into operationally different but result-equivalent plans, and the optimiser picks the lowest estimated cost.
This sourceFoundational cost-based query optimization: relational-algebra-equivalent plans generated by rewrite rules and ranked by an estimated-cost model.
- Database query optimisation: relational-algebra rewrites — selection push-down, join reordering, predicate rewriting — transform a declarative query into operationally different but result-equivalent plans, and the optimiser picks the lowest estimated cost.
- Index
- The prime's design discipline is what the index makes askable: selectivity governs whether the index helps at all — indexing a boolean
is_activecolumn where half the rows match is nearly useless, because the index still points at 500,000 rows, whereaslast_nameis highly selective.This sourceEstablishes selectivity as the determinant of whether an index pays off — a low-selectivity key points at too many rows to beat a scan.
- The prime's design discipline is what the index makes askable: selectivity governs whether the index helps at all — indexing a boolean
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. Neither this nor any other of the 3 citations of this work carries a recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:0e0d49ff91f6 · see in the full table