Sciweavers

30 search results - page 1 / 6
» Optimized Implementation of Extendible Hashing to Support La...
Sort
View
CLUSTER
2003
IEEE
13 years 10 months ago
Optimized Implementation of Extendible Hashing to Support Large File System Directory
Extendible hashing is a kind of fast indexing technology; it provides with a way of storing structural data records so that each of them can be gotten very quickly. In this paper,...
Rongfeng Tang, Dan Meng, Sining Wu
ALGORITHMICA
2010
153views more  ALGORITHMICA 2010»
13 years 5 months ago
Confluently Persistent Tries for Efficient Version Control
We consider a data-structural problem motivated by version control of a hierarchical directory structure in a system like Subversion. The model is that directories and files can b...
Erik D. Demaine, Stefan Langerman, Eric Price
VLDB
1999
ACM
151views Database» more  VLDB 1999»
13 years 9 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross
CLUSTER
2008
IEEE
13 years 12 months ago
Towards an understanding of the performance of MPI-IO in Lustre file systems
—Lustre is becoming an increasingly important file system for large-scale computing clusters. The problem, however, is that many data-intensive applications use MPI-IO for their ...
Jeremy Logan, Phillip M. Dickens
VLDB
2004
ACM
92views Database» more  VLDB 2004»
13 years 10 months ago
Write-Optimized B-Trees
Large writes are beneficial both on individual disks and on disk arrays, e.g., RAID-5. The presented design enables large writes of internal B-tree nodes and leaves. It supports b...
Goetz Graefe