Sciweavers

3531 search results - page 149 / 707
» Virtualizing Disk Performance
Sort
View
DAWAK
2001
Springer
15 years 2 months ago
Shared Index Scans for Data Warehouses
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
Yannis Kotidis, Yannis Sismanis, Nick Roussopoulos
MM
1999
ACM
128views Multimedia» more  MM 1999»
15 years 2 months ago
Architectural considerations for next generation file systems
Integration—supporting multiple application classes with heterogeneous requirements—is an emerging trend in networks, file systems, and operating systems. In this paper, we e...
Prashant J. Shenoy, Pawan Goyal, Harrick M. Vin
HOTOS
2007
IEEE
15 years 1 months ago
Optimizing Power Consumption in Large Scale Storage Systems
Data centers are the backend for a large number of services that we take for granted today. A significant fraction of the total cost of ownership of these large-scale storage syst...
Lakshmi Ganesh, Hakim Weatherspoon, Mahesh Balakri...
EUROSEC
2008
ACM
14 years 11 months ago
A methodology for the repeatable forensic analysis of encrypted drives
In this paper we propose a sound methodology to perform the forensic analysis of hard disks protected with whole-disk encryption software, supposing to be in possession of the app...
Cory Altheide, Claudio Merloni, Stefano Zanero
DAGSTUHL
2004
14 years 11 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...