Recherche

Afficher tous les résultats pour

Accueil

Personne

Anastasia Ailamaki

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (179)

SLICC: Self-Assembly of Instruction Cache Collectives for OLTP Workloads

Anastasia Ailamaki, Pinar Tözün

Online transaction processing (OLTP) is at the core of many data center applications. OLTP workloads are known to have large instruction footprints that foil existing L1 instruction caches resulting in poor overall performance. Prefetching can reduce the i ...

2012

Automated Physical Designers: What You See is (Not) What You Get

Anastasia Ailamaki, Ioannis Alagiannis, Renata Borovica-Gajic

The explosion of available data in the last few years has increased the importance of physical database design, since the selection of proper physical structures (e.g. indices, partitions and materialized views) may improve query execution performance by s ...

ACM2012

Toward Dark Silicon in Servers

Anastasia Ailamaki, Babak Falsafi, Michael Ferdman

Server chips will not scale beyond a few tens to low hundreds of cores, and an increasing fraction of the chip in future technologies will be dark silicon that we cannot afford to power. Specialized multicore processors, however, can leverage the underutil ...

Institute of Electrical and Electronics Engineers2011

PLP: Page Latch-free Shared-everything OLTP

Anastasia Ailamaki, Frederick Ryan Johnson, Pinar Tözün, Ippokratis Pandis

Scaling the performance of shared-everything on-line transaction processing to highly-parallel multicore hardware remains a great challenge for database system designers. Developments in OLTP technology remove locking and logging from being scalability bot ...

2011

Challenges and Opportunities in Self-Managing Scientific Databases

Anastasia Ailamaki, Farhan Tauheed, Ioannis Alagiannis, Thomas Heinis, Renata Borovica-Gajic, Miguel Sérgio De Oliveira Branco

Advances in observation instruments and abundance of computational power for simulations encourage scientists to gather and produce unprecedented amounts of increasingly complex data. Organizing data automatically to enable efficient and unobstructed acces ...

2011

A Data-oriented Transaction Execution Engine and Supporting Tools

Anastasia Ailamaki, Frederick Ryan Johnson, Pinar Tözün, Ippokratis Pandis, Danica Porobic, Dimitrios Karampinas, Miguel Sérgio De Oliveira Branco

Conventional OLTP systems assign each transaction to a worker thread and that thread accesses data, depending on what the transaction dictates. This thread-to-transaction work assignment policy leads to unpredictable accesses. The unpredictability forces e ...

2011

MaSM: Efficient Online Updates in Data Warehouses

Anastasia Ailamaki, Radu Ioan Stoica, Manoussos Gavriil Athanassoulis

Data warehouses (DW) have been traditionally optimized for readonly query performance, allowing only offline updates at night, essentially trading off data freshness for performance. The need for 24x7 operations in global markets and the rise of online and ...

2011

Optimal service pricing for a cloud cache

Grégory François, Anastasia Ailamaki, Debabrata Dash, Sofia Kyriakopoulou

Cloud applications that offer data management services are emerging. Such clouds support caching of data in order to provide quality query services. The users can query the cloud data, paying the price for the infrastructure they use. Cloud management nece ...

2011

Optimal service pricing for a cloud cache

Grégory François, Anastasia Ailamaki, Debabrata Dash, Sofia Kyriakopoulou

Institute of Electrical and Electronics Engineers2011

CoPhy: A Scalable, Portable, and Interactive Index Advisor for Large Workloads

Anastasia Ailamaki, Debabrata Dash

Index tuning, i.e., selecting the indexes appropriate for a workload, is a crucial problem in database system tuning. In this paper, we solve index tuning for large problem instances that are common in practice, e.g., thousands of queries in the workload, ...

2011

Making Address-Correlated Prefetching Practical

Anastasia Ailamaki, Babak Falsafi, Michael Ferdman

Despite a decade of research demonstrating its efficacy, address-correlated prefetching has never been implemented in a shipping processor because it requires megabytes of metadata—too large to store practically on chip. New storage-, latency-, and bandwid ...

2010

Aether: A scalable approach to logging

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

The shift to multi-core hardware brings new challenges to database systems, as the software parallelism determines performance. Even though database systems traditionally accommodate simultaneous requests, a multitude of synchronization barriers serialize ...

2010

Data-Oriented Transaction Execution

Anastasia Ailamaki, Frederick Ryan Johnson, Ippokratis Pandis

While hardware technology has undergone major advancements over the past decade, transaction processing systems have remained largely unchanged. The number of cores on a chip grows exponentially, following Moore's Law, allowing for an ever-increasing numbe ...

2010

Adaptive query execution for data management in the cloud

Anastasia Ailamaki, Debabrata Dash, Adrian Daniel Popescu

A major component of many cloud services is query processing on data stored in the underlying cloud cluster. The traditional techniques for query processing on a cluster are those offered by parallel DBMS. These techniques however, cannot guarantee high pe ...

ACM Press2010

Flash in a DBMS: Where and How?

Anastasia Ailamaki, Radu Ioan Stoica, Manoussos Gavriil Athanassoulis

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

Decoupling contention management from scheduling

Anastasia Ailamaki, Radu Ioan Stoica, Frederick Ryan Johnson

Many parallel applications exhibit unpredictable communication between threads, leading to contention for shared objects. The choice of contention management strategy impacts strongly the performance and scalability of these applications: spinning provides ...

2010

Near-Optimal Cache Block Placement with Reactive Nonuniform Cache Architectures

Anastasia Ailamaki, Babak Falsafi, Michael Ferdman

The growing core counts and caches of modern processors result in data access latency becoming a function of the data's physical location in the cache. Thus, the placement of cache blocks determines the cache's performance. Reactive nonuniform cache archit ...

2010

Spatio-Temporal Memory Streaming

Anastasia Ailamaki, Babak Falsafi

Recent research advocates memory streaming techniques to alleviate the performance bottleneck caused by the high latencies of off-chip memory accesses. Temporal memory streaming replays previously observed miss sequences to eliminate long chains of depende ...

2009

Practical Off-chip Meta-data for Temporal Memory Streaming

Anastasia Ailamaki, Babak Falsafi, Michael Ferdman

Prior research demonstrates that temporal memory streaming and related address-correlating prefetchers improve performance of commercial server workloads though increased memory level parallelism. Unfortunately, these prefetchers require large on-chip meta ...

2009

Shore-MT: A Scalable Storage Manager for the Multicore Era

Anastasia Ailamaki, Babak Falsafi, Frederick Ryan Johnson, Ippokratis Pandis

Database storage managers have long been able to efficiently handle multiple concurrent requests. Until recently, however, a computer contained only a few single-core CPUs, and therefore only a few transactions could simultaneously access the storage manag ...

ACM2009

Page 8 sur 9