Adaptive File Allocation in Star Computer Network

In this paper, we study the allocation of files in a star network. Unlike previous algorithms which assume that files are independently accessed and independently assigned, the interaction of files during the processing of queries is directly incorporated into our cost model. We present an adaptive...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on software engineering 1985-09, Vol.SE-11 (9), p.959-965
Main Authors: Yu, C.T., Man-Keung Siu, Lam, K., Chen, C.H.
Format: Article
Language:English
Subjects:
Adaptive algorithm
Algorithms
Clustering algorithms
Communications networks
Computer engineering
Computer networks
Computer science
Costs
Distributed processing
Electric industries
Electrical engineering
File allocation
Information retrieval
Information storage
Intelligent networks
Mathematics
Optimization
Partitioning algorithms
Queries
Query processing
R&D
Research & development
Satellite communications
Software engineering
star network
Statistics
Sufficient conditions
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we study the allocation of files in a star network. Unlike previous algorithms which assume that files are independently accessed and independently assigned, the interaction of files during the processing of queries is directly incorporated into our cost model. We present an adaptive algorithm, which is much faster than existing algorithms on file allocation, obtains solutions which are on the average only 0.1 percent away from the optimal solutions, and possesses many desirable properties such as the satisfaction of some necessary and sufficient conditions for file allocation.
ISSN:0098-5589
1939-3520
DOI:10.1109/TSE.1985.232830