Query-driven indexing in large-scale distributed systems

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.

We propose novel techniques that exploit data and computation sharing to improve the performance of complex stateful parallel computations, like agent-based simulations. Parallel computations are translated into behavioral equations, a novel formalism laye ...

Accurate human trajectory prediction is crucial for applications such as autonomous vehicles, robotics, and surveillance systems. Yet, existing models often fail to fully leverage the non-verbal social cues human subconsciously communicate when navigating ...

Disaggregated memory provides many cost savings and resource provisioning benefits for current datacenters, but software systems enabling disaggregated memory access result in high performance penalties. These systems require intrusive code changes to port ...

Cloud function (CF) services, such as AWS Lambda, have been applied as the new computing infrastructure in implementing analytical query engines. For bursty and sparse workloads, CF-based query engine is more elastic than the traditional query engines runn ...

Analytical engines rely on in-memory data caching to avoid storage accesses and provide timely responses by keeping the most frequently accessed data in memory. Purely frequency- and time-based caching decisions, however, are a proxy of the expected query ...

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 ...

Modern data center fabrics open the possibility of microsecond distributed applications, such as data stores and message queues. A challenging aspect of their development is to ensure that, besides being fast in the common case, these applications react fa ...

The Python library ms3 makes scores (symbolic representations of music) operational for computational approaches by representing their contents as sets of tabular files. Music scores represent relations between sounding events by graphical means. The Free ...

Database workloads have significantly evolved in the past twenty years. Traditional database systems that are mainly used to serve Online Transactional Processing (OLTP) workloads evolved into specialized database systems that are optimized for particular ...

Micro-architectural behavior of traditional disk-based online transaction processing (OLTP) systems has been investigated extensively over the past couple of decades. Results show that traditional OLTP systems mostly under-utilize the available micro-archi ...

Computer systems designers are building cache hierarchies with higher capacity to capture the ever-increasing working sets of modern workloads. Cache hierarchies with higher capacity improve system performance but shift the performance bottleneck to addres ...

The growing demand for data-intensive decision support and the migration to multi-tenant infrastructures put databases under the stress of high analytical query load. The requirement for high throughput contradicts the traditional design of query-at-a-time ...

Analytical engines rely on in-memory caching to avoid disk accesses and provide timely responses by keeping the most frequently accessed data in memory. Purely frequency- & time-based caching decisions, however, are a proxy of the expected query execution ...

Previous research reported that corvids preferentially cache food in a location where no food will be available or cache more of a specific food in a location where this food will not be available. Here, we consider possible explanations for these prospect ...

Information retrieval (IR) systems such as search engines are important for people to find what they need among the tremendous amount of data available in their organization or on the Internet. These IR systems enable users to search in a large data collec ...

Pedestrians, like drivers, generally dislike congestion. This is true for most pedestrian environments: trains stations, airports, or shopping malls. Furthermore, pedestrian congestion also influences the attractiveness of public transportation networks. T ...

Internet ranking algorithms play a crucial role in information technologies and numerical analysis due to their efficiency in high dimensions and wide range of possible applications, including scientometrics and systemic risk in finance (SinkRank, DebtRank ...

Applications such as large-scale sparse linear algebra and graph analytics are challenging to accelerate on FPGAs due to the short irregular memory accesses, resulting in low cache hit rates. Nonblocking caches reduce the bandwidth required by misses by re ...

In the celebrated coded caching problem studied by Maddah-Ali and Niesen, the peak-traffic network load is to be reduced by first caching some information about contents into individual memories of end users during the off-peak hours and then upon user req ...

The safety of existing bridges may be assessed using data from monitoring. The fatigue damage induced during observation period is extrapolated to the total service duration of a structure, and the reserve capacity is estimated. However, due to the randomn ...

Query-driven indexing in large-scale distributed systems

Chat with Graph Search

Using Process Calculus for Optimizing Data and Computation Sharing in Complex Stateful Parallel Computations

Social-Transmotion: Promptable Human Trajectory Prediction

Using Local Cache Coherence for Disaggregated Memory Systems

Using Cloud Functions as Accelerator for Elastic Data Analytics

HPCache: memory-efficient OLAP through proportional caching revisited

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

uKharon: A Membership Service for Microsecond Applications

ms3: A parser for MuseScore files, serving as data factory for annotated music corpora

Micro-architectural Analysis of Database Workloads

Micro-architectural analysis of in-memory OLTP: Revisited

Rebooting Virtual Memory with Midgard

Scalable Multi-Query Execution using Reinforcement Learning

HPCache: Memory-Efficient OLAP Through Proportional Caching

Testing two competing hypotheses for Eurasian jays' caching for the future

Graph Embedding for Retrieval

Dynamic control strategies for managing pedestrian flows

Information Retrieval Under Network Uncertainty: Robust Internet Ranking

Request, Coalesce, Serve, and Forget: Miss-Optimized Memory Systems for Bandwidth-Bound Cache-Unfriendly Applications on FPGAs

Successive Refinement to Caching for Dynamic Requests

Quantification of influence of monitoring duration on measured traffic action effects on fatigue of RC deck slabs of road bridges