On Strict Optimality Property of Allocating Binary Cartesian Product Files on Multiple Disk Systems

Chang, Chin‐Chen; Lian, Liu

doi:10.1007/978-1-4613-1881-1_13

Cited by 3 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Table 1.2 (a) and Table 1.3 (a) depict two ways of allocating the records onto a 4-disc system, the response times of all possible partial match queries are shown in Table 1.2(6) and Table 1.3(6) respectively. It can be seen that the average response time, over all possible partial match queries, is 2 for the way in Table 1.2(6) and 1 for that in Table 1.3 (6). Evidently, different allocation methods result in different average response times for partial match queries.…”

Section: a N = A N )'S Where For I ^ I ^ N A ( Is Either A Keymentioning

confidence: 83%

Symbolic Gray Code As A Data Allocation Scheme For Two-disc Systems

Chang

Chen

1992

The Computer Journal

Self Cite

View full text Add to dashboard Cite

In this paper, we are concerned with the multi-disc data allocation problem. We shall show that the symbolic Gray code can be used as a data allocation scheme for two-disc systems. We then show that this allocation method is a strictly optimal one for all possible partial match queries. There are many other interesting properties of this allocation method. For example, there is a disc-to-record transformation which can be used to determine the records stored on certain disc. In addition, all records are uniformly stored on discs if this allocation method is used. At the end of this paper, we shall point out that the resulting allocation is good for nearest neighbour searching.

show abstract

Section: a N = A N )'S Where For I ^ I ^ N A ( Is Either A Keymentioning

confidence: 83%

Symbolic Gray Code As A Data Allocation Scheme For Two-disc Systems

Chang

Chen

1992

The Computer Journal

Self Cite

View full text Add to dashboard Cite

show abstract

“…Up to now, there has been an intensive study in the designing of multi-disk data allocation for partial match retrieval [1,2,3,4,6,7,9,10,12,13,14,18]. Recently, Chang and Lu [8] showed that the multi-disk data allocation problem is NP-hard.…”

Section: Introductionmentioning

confidence: 98%

Application of principal component analysis to multi-disk concurrent accessing

Chang

1988

BIT

Self Cite

View full text Add to dashboard Cite

Abstract.This paper is concerned with the allocation of multi-attribute records on several disks so as to achieve high degree of concurrency of disk access when responding to partial match queries.An algorithm to distribute a set of multi-attribute records onto different disks is presented. Since our allocation method will use the principal component analysis, this concept is first introduced. We then use it to generate a set of real numbers which are the projections on the first principal component direction and can be viewed as hashing addresses.Then we propose an algorithm based upon these hashing addresses to allocate multi-attribute records onto different disks. Some experimental results show that our method can indeed be used to solve the multi-disk data allocation problem for concurrent accessing.

show abstract

“…The multi-disk data allocation problem for partial match queries was first introdued by Du and Sobolewski [11] and has subsequently been investigated by many researchers (Chan [1,2], Chang and Chen [3,4], Chang, Hsiao and Lin [5], Chang and Lian [6], Chang and Lu [7], Chang and Shen [8,9], Du [10], Fang, Lee and Chang [12], Yuen and Du [15]). …”

Section: Introductionmentioning

confidence: 99%