4 citations · 14 across the 11 of their papers we have counts for
11 papers
Indexing Join Inputs for Fast Queries and Maintenance
Wenhui Lyu, Goetz Graefe
In database systems, joins are often expensive despite many years of research producing numerous join algorithms. Precomputed and materialized join views deliver the best query per…
Transactions Make Debugging Easy
Qian Li, Peter Kraft, Michael Cafarella +6
We propose TROD, a novel transaction-oriented framework for debugging modern distributed web applications and online services. Our critical insight is that if applications store al…
Offset-value coding in database query processing
Goetz Graefe, Thanh Do
Recent work shows how offset-value coding speeds up database query execution, not only sorting but also duplicate removal and grouping (aggregation) in sorted streams, order-preser…
Robust and Efficient Sorting with Offset-Value Coding
Thanh Do, Goetz Graefe
Sorting and searching are large parts of database query processing, e.g., in the forms of index creation, index maintenance, and index lookup; and comparing pairs of keys is a subs…
Apiary: A DBMS-Integrated Transactional Function-as-a-Service Framework
Peter Kraft, Qian Li, Kostis Kaffes +16
Developers increasingly use function-as-a-service (FaaS) platforms for data-centric applications that perform low-latency and transactional operations on data, such as for microser…
Efficient sorting, duplicate removal, grouping, and aggregation
Thanh Do, Goetz Graefe, Jeffrey Naughton
Database query processing requires algorithms for duplicate removal, grouping, and aggregation. Three algorithms exist: in-stream aggregation is most efficient by far but requires…