A record and file partitioning model

Abstract

One of the main objectives in the design of a file system is the reduction of storage and data transfer costs. This paper presents a model in which several requests access the Ble system, and each request requires information from one or more variable length dataitems. The probabilities of access and the distribution of each data-item's length are assumed to be known, and to be mutually independent. The file system uses one or more storage devices, and each record may be partitioned into subrecords that are stored on different devices. One of the suhrecords is designated as the primary record; when a request for a record is made, the primary record is first accessed, and other subrecords are accessed only if the pertinent information is not stored in the primary record. The model that is presented in this paper, both as a nonlinear programming model and a mixed integer programming model, is a very general one; several types of file systems may be derived from it by an appropriate selection of its parameters. This model has already been used in the optimization of library routines' storage at a large scale operating system.

An Objective Function for Dividing Class Family in NoSQL Database

“…Hoffer [8] developed a non-linear, zero-one program which minimizes a linear combination of storage, retrieval and update costs, with capacity constraints for each file. Babad [9] formulated a less restrictive vertical partitioning problem for variable length attributes as a nonlinear zero-one program. Hammer and Niamir [10] use a file design cost estimator and a heuristic to arrive at a "bottom up" partitioning scheme.…”

A Practical Approach to Selecting Record Access Paths

“…Techniques for segregating and transferring data items with a high probability of usefulness fall into this category. They have been analyzed by Babad [2], Eisner [13], Hoffer [20], and March [30]. They have been observed to reduce system operating overhead by as much as 65 percent [30].…”

A Threshold Based Dynamic Data Allocation Algorithm-A Markov Chain Model Approach

“…Studies on vertical fragmentation (Babad, 1977;Ceri el aL., 1989;Hoffer, 1976;Navatbe el aL., 1984), horizontal fragmentation (Ceri et aL., 1983) and mixed fragmentalion (Chang and Cheng, 1980;Cheng el aL., 2002;March, I 983;Sacca and Wieder ho1d, 1985;Sacco, 1986;Zhang and Orlowska, 1994) were conducted. The aııocation of the fragments is also studied extensively (Ahmad el aL., 2002;Apers, 1988;Bakker, 2000;Chang, 2002;Kwokeıal., 1996;So el aL., 1999;Zhoueıal., 1999;Gorawski el aL., 2005).…”