In this talk, I will summarize our work on in-database solvers for relational machine learning and artificial intelligence. We implement a declarative query language that offers support for model (or instance) finding. The capability is used to express predictive and prescriptive analytics. The presentation gives an overview of the platform and the language. In particular, it focuses on the use... Read More

Applications have had an interesting evolution as they have moved into the distributed and scalable world. Similarly, storage and its cousin databases have changed side by side with applications. Many times, the semantics, performance, and failure models of storage and applications do a subtle dance as they change in support of changing business requirements and environmental challenges. Adding scale to... Read More

Widespread digital transformation and the explosion of the Internet of Things has led to a dramatic increase in the volume, complexity and unpredictability of data. This has created a need for converged solutions that require a new combination of processing capabilities that are not met by traditional OLTP and OLAP implementation approaches. The challenge set by modern enterprise is to... Read More

Andy will regale everyone with stories from the summer and CMU-DB research plans for the next year. Read More

The increasing need for real-time data processing has triggered the rapid evolution of distributed Stream Processing Engines (dSPEs). In a dSPE, data are processed as soon as they become available and queries execute continuously. Low operational cost and timely processing can become a challenge for a dSPE, considering the volatile and uncharted nature of input streams. This calls for adaptable... Read More

Read More

We present the Succinct Range Filter (SuRF), a fast and compact data structure for approximate membership tests. Unlike traditional Bloom filters, SuRF supports both single-key lookups and common range queries: open-range queries, closed-range queries, and range counts. SuRF is based on a new data structure called the Fast Succinct Trie (FST) that matches the point and range query performance of state-of-the-art order-preserving... Read More

The first step towards an autonomous database management system (DBMS) is the ability to model the target application’s workload. This is necessary to allow the system to anticipate future workload needs and select the proper optimizations in a timely manner. Previous forecasting techniques model the resource utilization of the queries. Such metrics, however, change whenever the physical design of the... Read More

SPDK has been successful in enabling a large class of high performance user mode storage applications and appliance. SPDK provides direct access to local NVMe SSDs as well as access to remote storage targets using NVMeoF. SPDK provides a highly concurrent and asynchronous runtime with no locking in the I/O path. High throughput and low latency is realized by directly... Read More

Oracle Database In-Memory dual format was first introduced in 12c in 2013, it optimizes both analytics and mixed workload OLTP, delivering outstanding performance for transactions while simultaneously supporting real-time analytics, business intelligence, and reports. In this talk, I will go over different features in Oracle Database In-Memory, and describe how we accelerate joins and aggregations on In-Memory Database. Read More