Affiliation:
1. Univ. of Twente, Enschede, The Netherlands
Abstract
The problem of allocating the data of a database to the sites of a communication network is investigated. This problem deviates from the well-known file allocation problem in several aspects. First, the objects to be allocated are not known a priori; second, these objects are accessed by schedules that contain transmissions between objects to produce the result. A model that makes it possible to compare the cost of allocations is presented; the cost can be computed for different cost functions and for processing schedules produced by arbitrary query processing algorithms.
For minimizing the total transmission cost, a method is proposed to determine the fragments to be allocated from the relations in the conceptual schema and the queries and updates executed by the users.
For the same cost function, the complexity of the data allocation problem is investigated. Methods for obtaining optimal and heuristic solutions under various ways of computing the cost of an allocation are presented and compared.
Two different approaches to the allocation management problem are presented and their merits are discussed.
Publisher
Association for Computing Machinery (ACM)
Cited by
128 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Netherite;Proceedings of the VLDB Endowment;2022-04
2. 60 Years of Databases (part three);PROBLEMS IN PROGRAMMING;2022-03
3. Bibliography;Storage Systems;2022
4. Database parallelism, big data and analytics, deep learning;Storage Systems;2022
5. Robust Partitioning Scheme for Accelerating SQL Database;2021 IEEE International Conference on Emergency Science and Information Technology (ICESIT);2021-11-22