Sciweavers

15 search results - page 2 / 3
» Replicated declustering for arbitrary queries
Sort
View
ICDCS
2008
IEEE
14 years 2 days ago
Multi-Site Retrieval of Declustered Data
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Recently, replication based approaches were proposed to furth...
Ali Saman Tosun
ICDT
2005
ACM
124views Database» more  ICDT 2005»
13 years 11 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken
WDAS
1998
13 years 7 months ago
Data Replication and Delay Balancing in Heterogeneous Disk Systems
Declustering and replication are well known techniques used to improve response time of queries in parallel disk environments. As data replication incurs a penalty for updates, da...
Doron Rotem, Sridhar Seshadri, Luis M. Bernardo
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 5 months ago
Improved Bounds and Schemes for the Declustering Problem
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
Benjamin Doerr, Nils Hebbinghaus, Sören Werth
ICDE
2010
IEEE
379views Database» more  ICDE 2010»
14 years 5 months ago
Osprey: Implementing MapReduce-Style Fault Tolerance in a Shared-Nothing Distributed Database
In this paper, we describe a scheme for tolerating and recovering from mid-query faults in a distributed shared nothing database. Rather than aborting and restarting queries, our s...
Christopher Yang, Christine Yen, Ceryen Tan, Samue...