<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Horizons of Composability (Keynote Talk)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Orri Erling</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Software Engineer</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Meta Inc.</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>Composability is coming up for many parts of the data management stack. At the same time, data volumes keep growing and AI is becoming the main customer of data. Data management and accelerators have been on the table for years. Are we approaching an inflection point where data management becomes cost competitive on accelerators? What about colocating it with GPUs already used for AI? Composability, on its side, is maybe best established in query optimization with Calcite and coming to execution with projects like Arrow, Velox and Tril. How does composability address the inflections in data center architectures, AI and workloads? We discuss the composability eforts at Meta, including Velox, and Velox Wave, a new approach for portable, composable hardware acceleration for query. We briefly cover Verax, an early concept for a query optimizer companion for Velox. We point out interesting research outcomes and future/ongoing collaborations for strengthening the composability field, as in file formats and abstracting query engine design. Drawing on our experience and insight into workloads and the evolution of the data center, we outline wins, challenges and opportunities for the composability movement. Speaker Biography: Erling co-founded the Velox composable query execution project at Meta. Prior to this, he worked on Google's F1 and before then created OpenLink Virtuoso, a relational/graph store, best known for its applications in linked data and knowledge graphs. Research interests include benchmarking and generalizing query processing to fuse with neighboring graph, AI and HPC domains. The mission is to create a line of components from execution to query optimization to distributed computing.</p>
      </abstract>
    </article-meta>
  </front>
  <body />
  <back>
    <ref-list />
  </back>
</article>