Optimal multidisk partial match file designs (Q1111781)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1111781 |
scientific article; zbMATH DE number 4076688
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal multidisk partial match file designs |
scientific article; zbMATH DE number 4076688 |
Statements
Optimal multidisk partial match file designs (English)
0 references
1988
0 references
Addressed here is the problem of assigning buckets of a file to multiple independently accessible disks so that all partial match queries are answered with as much parallelism exploited as possible. We consider how much redundancy is necessary and sufficient to have these so-called optimal assignments.
0 references
multidisk file design
0 references
partial match queries
0 references
redundancy
0 references
0.8390875458717346
0 references
0.8179163336753845
0 references
0.816317617893219
0 references
0.7945857048034668
0 references
0.7818399667739868
0 references
