Sciweavers

88 search results - page 1 / 18
» Improved Bounds and Schemes for the Declustering Problem
Sort
View
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 4 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
PODS
2004
ACM
128views Database» more  PODS 2004»
14 years 5 months ago
Replicated Declustering of Spatial Data
The problem of disk declustering is to distribute data among multiple disks to reduce query response times through parallel I/O. A strictly optimal declustering technique is one t...
Hakan Ferhatosmanoglu, Aravind Ramachandran, Ali S...
ALGORITHMICA
1998
81views more  ALGORITHMICA 1998»
13 years 4 months ago
The List Update Problem: Improved Bounds for the Counter Scheme
We consider the problem of dynamic reorganization of a linear list, where requests for the elements are generated randomly with fixed, unknown probabilities. The objective is to ...
Hadas Shachnai, Micha Hofri
WDAS
1998
13 years 6 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
CP
2005
Springer
13 years 10 months ago
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter