Sciweavers

3531 search results - page 353 / 707
» Virtualizing Disk Performance
Sort
View
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
16 years 8 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
16 years 8 months ago
SNAP: Efficient Snapshots for Back-in-Time Execution
SNAP is a novel high-performance snapshot system for object storage systems. The goal is to provide a snapshot service that is efficient enough to permit "back-in-time" ...
Liuba Shrira, Hao Xu
ICDE
1999
IEEE
111views Database» more  ICDE 1999»
16 years 8 months ago
Storage of Multidimensional Arrays Based on Arbitrary Tiling
Storage management of multidimensional arrays aims at supporting the array model needed by applications and insuring fast execution of access operations. Current approaches to sto...
Paula Furtado, Peter Baumann
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
185
Voted
CCGRID
2009
IEEE
16 years 1 months ago
Improving Parallel Write by Node-Level Request Scheduling
In a cluster of multiple processors or cpu-cores, many processes may run on each compute node. Each process tends to issue contiguous I/O requests for snapshot, checkpointing or s...
Kazuki Ohta, Hiroya Matsuba, Yutaka Ishikawa