Accepted Papers

  • The Case for ML-Enhanced High-Dimensional Indexes. Rong Kang (Tsinghua University, China); Wentao Wu (Microsoft Research); Chen Wang (Tsinghua University, China); Ce Zhang (ETH); Jianmin Wang (Tsinghua University, China) [paper]

  • Finding Label and Model Errors in Perception Data With Learned Observation Assertions. Daniel Kang (Stanford University); Nikos Arechiga (Toyota Research Institute); Sudeep Pillai (TRI); Peter D Bailis (Stanford University); Matei Zaharia (Stanford and Databricks) [paper]

  • ASET: Ad-hoc Structured Exploration of Text Collections. Benjamin Hättasch (TU Darmstadt); Jan-Micha Rainer Bodensohn (Technische Universität Darmstadt); Carsten Binnig (TU Darmstadt) [paper]

  • Cardinality Estimation: Is Machine Learning a Silver Bullet? Beibin Li (University of Washington); Yao Lu (Microsoft Research); Chi Wang (Microsoft Research); Srikanth Kandula (Microsoft Research) [paper]

  • When Are Learned Models Better Than Hash Functions? Ibrahim Sabek (MIT); Kapil Vaidya (MIT); Dominik Horn (TUM); Andreas Kipf (MIT); Tim Kraska (MIT) [paper]

  • Towards Practical Learned Indexing. Mihail M Stoian (TUM); Andreas Kipf (MIT); Ryan C Marcus (MIT); Tim Kraska (MIT) [paper]

  • Defeating duplicates: A re-design of the LearnedSort algorithm. Ani Kristo (Brown University); Kapil Vaidya (MIT); Tim Kraska (MIT) [paper]

  • Bounding the Last Mile: Efficient Learned String Indexing. Benjamin Spector (MIT); Andreas Kipf (MIT); Kapil Vaidya (MIT); Chi Wang (Microsoft Research); Umar Farooq Minhas (Microsoft Research); Tim Kraska (MIT) [paper]

  • Machine Learning-based Selection of Graph Partitioning Strategy Using the Characteristics of Graph Data and Algorithm. YoungJoon Park (Seoul National University); Dongkyu Lee (Seoul National University); Tien-Cuong Bui (Seoul National University) [paper]