Common Properties of Some Multiattribute File Systems

Wang, Lin; Lee, R.C.T.; Du, H. C.

doi:10.1109/tse.1979.234172

Cited by 38 publications

(11 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since the Cartesian Product file concept introduced in [8,10] is identical to the MKH file concept, Du [7] in 1986 proposed a heuristic method, called the NEW allocation method, to compute a proper set of parameters V = {V[, v 2 , ..., v N } for any given N-attribute Binary Cartesian Product file. By Du's New allocation method, v } = 2> mod Io s m .…”

Section: The Relaxed Gdm Allocation Methodsmentioning

confidence: 99%

“…In [8,10], the GDM allocation method has been shown to be very effective for arranging MKH (Multiple Key Hashing) files onto multiple discs in order to facilitate PMQs. In this section, we shall introduce different kinds of file systems and the GDM allocation method, then review some optimality properties of the GDM allocation method.…”

Section: The Concept and Optimality Properties Of The Gdm Allocatmentioning

confidence: 99%

See 1 more Smart Citation

A greedy relaxed generalized disc modulo allocation method for multiple key hashing files on multi‐disc systems

Chang

Lee

1996

Journal of the Chinese Institute of Engineers

View full text Add to dashboard Cite

In this paper, we propose an efficient way for the arrangement of multiple key hashing (MKH) files onto a multiple disc system. We present a greedy strategy to find a proper set of parameters of a hashing function that determines the near "optimal" bucket distribution for facilitating the maximal concurrency of disc accesses. Some experimental results are given to show that our greedy method works well in general cases and can achieve the same performance as the previously proposed method, that can only be used in some restricted cases.

show abstract

Section: The Relaxed Gdm Allocation Methodsmentioning

confidence: 99%

Section: The Concept and Optimality Properties Of The Gdm Allocatmentioning

confidence: 99%

A greedy relaxed generalized disc modulo allocation method for multiple key hashing files on multi‐disc systems

Chang

Lee

1996

Journal of the Chinese Institute of Engineers

View full text Add to dashboard Cite

show abstract

“…The CP file organization scheme was first suggested by Lin, Lee and Du [19]. It was pointed out in [ 19] that CP files exhibit the desirable property of clustering similar records into the same or similar buckets.…”

Section: Cartesian Product Files and Disk Modulo Allocation Methodmentioning

confidence: 99%

“…It was pointed out in [ 19] that CP files exhibit the desirable property of clustering similar records into the same or similar buckets. It was shown by Chang, Lee and Du [13] that CP files are effective for partial match retrieval.…”

Section: Cartesian Product Files and Disk Modulo Allocation Methodmentioning

confidence: 99%

“…However, in view of the practical importance of designing optimal MAFs, there are still many heuristic methods that have been proposed in the past decade [1-4, 6, 8-9, 16-22]. Among the proposed file organization schemes for PMQs, the Cartesian product (CP) file concept proposed by Lin, Lee and Du [19] is one which has been shown to be very effective for PMQs [12][13]19]. Therefore, many efforts have been made in recent years to solve the problem of allocating a CP file onto a multi-disk system to best facilitate PMQs [2-3, 5-7, 10-11, 16-17, 23].…”

mentioning

confidence: 99%

See 1 more Smart Citation

Optimality criteria of the disk modulo allocation method for Cartesian product files

Chen

Lin

1991

BIT

View full text Add to dashboard Cite

Abstract.Cartesian product (CP) files have been shown to be very effective for partial match retrieval. Further the Disk Modulo (DM) allocation method has been shown to be a simple and effective method for allocating CP files onto multiple independently accessible disks to further facilitate partial match retrieval. In this paper, a useful criterion for the DM method to be the best allocation method for a given CP file is presented. The presented criterion is much more general than that suggested previously which makes the DM allocation method much more applicable for real applications.

show abstract

Performance analysis of disk allocation methods for cartesian product files by using error‐correcting codes

Ito

Kasami

Kataoka

et al. 1992

Electron Comm Jpn Pt III

View full text Add to dashboard Cite

The Cartesian product file is an efficient method of handling the partial match queries to retrieve a record from a file, which has the specified values for the specified attributes. The optimal processing efficiency for the query is realized in an environment where multiple disks with parallel access are employed by allocating the Cartesian product file among the disks in a distributed way so that the buckets which may contain the record satisfying the specified condition are read uniformly from the disks. Recently, Faloutsos and Metaxas proposed a method whereby the Cartesian product file is allocated to the multiple disks using the error‐correcting code. In this paper, using their method of allocating the Cartesian product file in the multiple disks, the following is presented: (1) the sufficient condition for the queries so that the processing efficiency is strictly optimal; 92) the necessary and sufficient condition for the code that realizes the allocation with the strictly optimal efficiency for any queries; and (3) the expression for the average response time for the query by which we can easily compute the average response time when the weight distribution of the code (or that of the dual code) is known. Through several examples, it is shown that the average processing time determined from the expression is very close to the theoretical lower bound.

show abstract

Common Properties of Some Multiattribute File Systems

Cited by 38 publications

References 9 publications

A greedy relaxed generalized disc modulo allocation method for multiple key hashing files on multi‐disc systems

A greedy relaxed generalized disc modulo allocation method for multiple key hashing files on multi‐disc systems

Optimality criteria of the disk modulo allocation method for Cartesian product files

Performance analysis of disk allocation methods for cartesian product files by using error‐correcting codes

Contact Info

Product

Resources

About