An efficient disk organization is proposed. The basic idea is to store the first part of the file in the index (inode) block, instead of just storing pointers there. Empirical data are presented to show that this method offers better performance under certain circumstances than traditional methods. Copyright © 1984 John Wiley & Sons, Lt
Summarization: Recently, technological advances have resulted in the wide availability of commercial...
Most file organizations for on-line econdary key retrieval consist of two subcomponents - a structu...
File systems store data in files and organize these files in directories. Over decades, file systems...
Small file performance in most file systems is limited by slowly improving disk access times, even t...
file performance in most file systems is limited by slowly improving disk access times, even though ...
This paper presents a new technique for disk storage management called a log-structured file system....
A versatile variant of Heapsort, adapted for external disk sorting, is presented. On a single proces...
When the UNIX operating system was first introduced, the UNIX wizard himself Ken Thompson wrote the ...
Includes bibliographical references (page 83)A method of file organization which combines fast acces...
Abstract: "In many computer systems today, users don't have enough disk space and would welcome a me...
Library records and their utilization are described and the various types of file organization avail...
Disk drives are the bottleneck in the processing of large amounts of data used in almost all common ...
Multilevel indexes have long been used for accessing records in sorted files. Given the access cost ...
This paper presents a novel disk storage architecture called DCD, Disk Caching Disk, for the purpose...
The growing amount of on-line data demands efficient parallel and distributed indexing mechanisms to...
Summarization: Recently, technological advances have resulted in the wide availability of commercial...
Most file organizations for on-line econdary key retrieval consist of two subcomponents - a structu...
File systems store data in files and organize these files in directories. Over decades, file systems...
Small file performance in most file systems is limited by slowly improving disk access times, even t...
file performance in most file systems is limited by slowly improving disk access times, even though ...
This paper presents a new technique for disk storage management called a log-structured file system....
A versatile variant of Heapsort, adapted for external disk sorting, is presented. On a single proces...
When the UNIX operating system was first introduced, the UNIX wizard himself Ken Thompson wrote the ...
Includes bibliographical references (page 83)A method of file organization which combines fast acces...
Abstract: "In many computer systems today, users don't have enough disk space and would welcome a me...
Library records and their utilization are described and the various types of file organization avail...
Disk drives are the bottleneck in the processing of large amounts of data used in almost all common ...
Multilevel indexes have long been used for accessing records in sorted files. Given the access cost ...
This paper presents a novel disk storage architecture called DCD, Disk Caching Disk, for the purpose...
The growing amount of on-line data demands efficient parallel and distributed indexing mechanisms to...
Summarization: Recently, technological advances have resulted in the wide availability of commercial...
Most file organizations for on-line econdary key retrieval consist of two subcomponents - a structu...
File systems store data in files and organize these files in directories. Over decades, file systems...
DOI
Add to ORKG