Allocating Variable Length Data Records to Disk Storage

Tetsuo MIZOGUCHI

Allocating Variable Length Data Records to Disk Storage

Tetsuo MIZOGUCHI

Full Text Views

0

Cite this

Summary :

Given a set of n data records with L_i, data length and P_i, access frequency of data record R_i (1in), each data record is allocated in one of buckets, whose size is L, minimizing the access delay D,
DP_i・P_j・d_ij
d_ij: distance from allocated data record R_i to R_j, while satisfying the constraint that the size of data records in each bucket does not exceed L. The property of optimal allocation is investigated and an allocation heuristic is given whose slight modification gives the optimal allocation for the data records of up to 2 unit data length.

Publication: IEICE TRANSACTIONS on transactions Vol.E60-E No.2 pp.77-78

Publication Date: 1977/02/25

Publicized

Online ISSN

DOI

Type of Manuscript: LETTER

Category: Computers

Authors

Tetsuo MIZOGUCHI

Keyword

Cite this

Copy

Tetsuo MIZOGUCHI, "Allocating Variable Length Data Records to Disk Storage" in IEICE TRANSACTIONS on transactions, vol. E60-E, no. 2, pp. 77-78, February 1977, doi: .
Abstract: Given a set of n data records with L_i, data length and P_i, access frequency of data record R_i (1in), each data record is allocated in one of buckets, whose size is L, minimizing the access delay D,
DP_i・P_j・d_ij
d_ij: distance from allocated data record R_i to R_j, while satisfying the constraint that the size of data records in each bucket does not exceed L. The property of optimal allocation is investigated and an allocation heuristic is given whose slight modification gives the optimal allocation for the data records of up to 2 unit data length.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e60-e_2_77/_p

Copy

@ARTICLE{e60-e_2_77,
author={Tetsuo MIZOGUCHI, },
journal={IEICE TRANSACTIONS on transactions},
title={Allocating Variable Length Data Records to Disk Storage},
year={1977},
volume={E60-E},
number={2},
pages={77-78},
abstract={Given a set of n data records with L_i, data length and P_i, access frequency of data record R_i (1in), each data record is allocated in one of buckets, whose size is L, minimizing the access delay D,
DP_i・P_j・d_ij
d_ij: distance from allocated data record R_i to R_j, while satisfying the constraint that the size of data records in each bucket does not exceed L. The property of optimal allocation is investigated and an allocation heuristic is given whose slight modification gives the optimal allocation for the data records of up to 2 unit data length.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - Allocating Variable Length Data Records to Disk Storage
T2 - IEICE TRANSACTIONS on transactions
SP - 77
EP - 78
AU - Tetsuo MIZOGUCHI
PY - 1977
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E60-E
IS - 2
JA - IEICE TRANSACTIONS on transactions
Y1 - February 1977
AB - Given a set of n data records with L_i, data length and P_i, access frequency of data record R_i (1in), each data record is allocated in one of buckets, whose size is L, minimizing the access delay D,
DP_i・P_j・d_ij
d_ij: distance from allocated data record R_i to R_j, while satisfying the constraint that the size of data records in each bucket does not exceed L. The property of optimal allocation is investigated and an allocation heuristic is given whose slight modification gives the optimal allocation for the data records of up to 2 unit data length.
ER -