Publication

Approximate Probabilistic Tree Indexing for Partitionable Data

Related publications (48)

Graph Chatbot

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.

Path Processing using Solid State Storage

Manoussos Gavriil Athanassoulis

Recent advances in solid state technology have led to the introduction of Solid State Drives (SSDs). Todays SSDs store data persistently using NAND ﬂash memory. While SSDs are more expensive than hard disks when measured in dollars per gigabyte, they are s ...

2012

Reliability Analysis of Data Storage Systems

Vinodh Venkatesan

Modern data storage systems are extremely large and consist of several tens or hundreds of nodes. In such systems, node failures are daily events, and safeguarding data from them poses a serious design challenge. The focus of this thesis is on the data rel ...

EPFL2012

Flash in a DBMS: Where and How?

Anastasia Ailamaki, Manoussos Gavriil Athanassoulis, Radu Ioan Stoica

Over the past decade, new solid state storage technologies, with flash being the most mature one, have become increasingly popular. Such technologies store data durably, and can alleviate many handicaps of hard disk drives (HDDs). Nonetheless, they have ve ...

2010

Evaluating and Repairing Write Performance on Flash Devices

Anastasia Ailamaki, Frederick Ryan Johnson, Manoussos Gavriil Athanassoulis, Radu Ioan Stoica

In the last few years NAND flash storage has become more and more popular as price per GB and capacity both improve at exponential rates. Flash memory offers significant benefits compared to magnetic hard disk drives (HDDs) and DBMSs are highly likely to u ...

2009

Precise Velocity Control of a Hard Disk Drive

The ramp technology was integrated in the Hard Disk Drive a couple of years ago, this technology allows a safer parking position for the heads, but also allow the heads to fly closer from the media, increasing the data density. The Load and Unload operatio ...

2007

Issues in petabyte data indexing, retrieval and analysis

Sébastien Ponce

We propose several methods for speeding up the processing of particle physics data on clusters of PCs. We present a new way of indexing and retrieving data in a high dimensional space by making use of two levels of catalogues enabling an efficient data pre ...

EPFL2006

On Multidimensional Data and Modern Disks

Anastasia Ailamaki

With the deeply-ingrained notion that disks can efficiently access only one dimensional data, current approaches for mapping multidimensional data to disk blocks either allow efficient accesses in only one dimension, trading off the efficiency of accesses ...

USENIX Association2005

Concurrency Control for Transactional Drago

Jörg Kienzle

The granularity of concurrency control has a big impact on the performance of transactional systems. Concurrency control granu- larity and data granularity (data size) are usually the same. The e ect of this coupling is that if a coarse granularity is used ...

Springer Verlag2002

128 channel PCI-based data acquisition system for MDSplus

Basil Duval, Xavier Llobet

With the increasing demand for analogue channel acquisition on the TCV tokamak, a new PCI based acquisition has been specified, designed, built and installed into our MDSplus acquisition environment. The design criteria were to not only improve the cost/ch ...

2002

Spinouts and innovation in the disk drive industry: Do founders take static or dynamic capabilities with them?

Christopher Tucci, Andrew King

Spinouts and innovation in the disk drive industry: Do founders take static or dynamic capabilities with them? ...

2002