OLTP in Wonderland -- Where do cache misses come from in major OLTP components?

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Analytical workloads are evolving as the number of users surges and applications that submit queries in batches become popular. However, traditional analytical databases that optimize-then-execute each query individually struggle to provide timely response ...

Machine learning and data processing algorithms have been thriving in finding ways of processing and classifying information by exploiting the hidden trends of large datasets. Although these emerging computational methods have become successful in today's ...

A method for optimizing memory access for database operations is provided. The method may include performing a first database operation by at least executing a first instruction stream associated with the first database operation. The first database opera ...

Cycles are one of the fundamental subgraph patterns and being able to enumerate them in graphs enables important applications in a wide variety of fields, including finance, biology, chemistry, and network science. However, to enable cycle enumeration in r ...

Embedded systems confront two opposite goals: low-power operation and high performance. The current trend to reach these goals is toward heterogeneous platforms, including multi-core architectures with heterogeneous cores and hardware accelerators. The lat ...

Most modern in-memory online transaction processing (OLTP) engines rely on multi-version concurrency control (MVCC) to provide data consistency guarantees in the presence of conflicting data accesses. MVCC improves concurrency by generating a new version o ...

Finding cycles in directed graphs enables important applications in various domains such as finance, biology, chemistry, and network science. However, as the size of graph datasets continues to grow, it becomes increasingly difficult to discover cycles wit ...

Systems and methods for monitoring penile tumescence are provided that overcome the drawbacks of previously known systems by providing a wearable formed of a flexible and elastic tube having a plurality of sensors disposed on or embedded within it, the wea ...

Dataflow programming is a methodology that enables the development of high-level, parametric programs that are independent of the underlying platform. This approach is particularly useful for heterogeneous platforms, as it eliminates the need to rewrite ap ...

OLTP in Wonderland -- Where do cache misses come from in major OLTP components?

Chat with Graph Search

Efficient Concurrent Analytical Query Processing using Data and Workload-conscious Sharing

2D Nanosystems: Applications of 2D Semiconductors for In-Memory Computing

Determining an optimum quantity of interleaved instruction streams of defined coroutines

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-constrained Cycles

Acceleration of Control Intensive Applications on Coarse-Grained Reconfigurable Arrays for Embedded Systems

One-shot Garbage Collection for In-memory OLTP through Temporality-aware Version Storage

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Tumescense monitoring system for diagnosing erectile dysfunction and methods of use

Design Space Exploration for Partitioning Dataflow Program on CPU-GPU Heterogeneous System