I’ve just presented the paper “Adapting The Secretary Hiring Problem for Optimal Hot-Cold Tier Placement under Top-K Workloads” at DBDM, CCGrid hereĀ in Larnaca, Cyprus.
The paper examines analytic solutions to optimization problems related to tiered/hierarchical storage under Top-K queries with HASTE, and its relation to the classic discrete optimization ‘Secretary Hiring Problem’.