~/talk

Automating Index Selection Using Constraint Programming

Talkat PGCon 2023 · 2023-05-30..06-02· [databases]
links:none on file
slides:none on file

An open source constraint programming model converts PG stat statements workloads into per-table scans, uses hypoPG to get hypothetical planner costs and estimates an index write overhead metric, then lexically optimizes two goals (minimize cost, then overhead). The demo Rust CLI picks 1–3 indexes on demand, shows cost shifting from ~6000 to ~6400 while reducing overhead from 0.31 to 0.20, accepts a strictness 0.9 tradeoff, handles multi-column index permutations but notes GIN costing and partitioning as open problems.

AI-written summary · about

  1. 0:00Introduction to the problem
  2. 1:41Defining index selection
  3. 9:37Constraint programming model
  4. 27:26Practical implementation demo
  5. 38:17PostgreSQL integration tips
  6. 42:40Q&A and closing remarks
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.