Some properties of Cartesian product files

Chang, Chin‐Chen; Lee, R. C. T.; Du, H. C.

doi:10.1145/582250.582276

Cited by 23 publications

(6 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since m3 = 11 = 3 -m + 2, we have u = 3, v = 2 while t = (1 + z9=1,+3 ci)mod m = 6 mod 3 = 0. Thus no = nl = u + 1 = 4 while n2 = u = 3 and hence (no, nl , n8) = (4,4,3) z (1, 1, 0). 1, 2, 1, 0, .…”

Section: Partial Match Queries and Cartesian Product Filesmentioning

confidence: 99%

“…Under those conditions, only one bucket would need to be accessed in response to the most frequently asked queries in which the first attribute is specified. It was pointed out by Lin, Lee, and Du [4] that a Cartesian product file exhibits the property of clustering similar records into the same or similar buckets, and it was later shown by Chang, Lee, and Du [3] that the concept of Cartesian product files is effective for partial match queries.…”

Section: Partial Match Queries and Cartesian Product Filesmentioning

confidence: 99%

“…For the purposes of this paper, the file allocation problem can, therefore, be restated as follows: Given a k-attribute Cartesian product file and an m-disk system, allocate buckets among the m disks in such a way that, for all possible partial match queries, the concurrency of disk accesses is maximized (i.e., the response time is minimized). 3 the set of buckets which must be examined in response to the query (Al = *, As = a, AS = b, A4 = *), where a E DZZ and b E 0~. In this section we propose an allocation method which assigns all buckets of a file F to an m-disk system (disks labeled as units 0, 1, , .…”

Section: Partial Match Queries and Cartesian Product Filesmentioning

confidence: 99%

“…The file systems developed as a result of these efforts are largely based on Cartesian product files [4], which have been shown by Chang, Lee, and Du [3] to be very effective for partial match queries. To date, however, little effort has been devoted to the problem of allocating the resulting files among independently accessible disks in order to maximize disk access concurrency and therefore minimize the response times.…”

Section: Introductionmentioning

confidence: 99%

“…The problem of multiattribute file design can be explained by considering the file systems shown in Tables I and II [3]. In both tables, a query (A1 = a, AZ = *) denotes a query that will retrieve records with the first attribute equal to a, while the second attribute can be any key in the second attribute domain, that is, a don't-care condition.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Disk allocation for Cartesian product files on multiple-disk systems

Sobolewski

1982

ACM Trans. Database Syst.

Self Cite

148

View full text Add to dashboard Cite

Cartesian product files have recently been shown to exhibit attractive properties for partial match queries. This paper considers the file allocation problem for Cartesian product files, which can be stated as follows: Given a k-attribute Cartesian product file and an m-disk system, allocate buckets among the m disks in such a way that, for all possible partial match queries, the concurrency of disk accesses is maximis ed. The Risk Modulo (DM) allocation method is described first, and it is shown to be strict optimal under many conditions commonly occurring in practice, including all possible partial match queries when the number of disks is 2 or 3. It is also shown that although it has good performance, the DM allocation method is not strict optimal for all possible partial match queries when the number of disks is greater than 3. The General Disk Modulo (GDM) allocation method is then described, and a sufficient but not necessary condition for strict optimal&y of the GDM method for all partial match queries and any number of disks is then derived. Simulation studies comparing the DM and random allocation methods in terms of the average number of disk accesses, in response to various classes of partial match queries, show the former to be significantly more effective even when the number of disks is greater than 3, that is, even in cases where the DM method is not strict optimal. The results that have been derived formally and shown by simulation can be used for more effective design of optimal file systems for partial match queries. When considering multiple-disk systems with independent access paths, it is important to ensure that similar records are clustered into the same or similar buckets, while similar buckets should be dispersed uniformly among the disks.

show abstract

Section: Partial Match Queries and Cartesian Product Filesmentioning

confidence: 99%

Section: Partial Match Queries and Cartesian Product Filesmentioning

confidence: 99%

Section: Partial Match Queries and Cartesian Product Filesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Disk allocation for Cartesian product files on multiple-disk systems

Sobolewski

1982

ACM Trans. Database Syst.

Self Cite

148

View full text Add to dashboard Cite

show abstract

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

Chang

Lian

1987

Foundations of Data Organization

View full text Add to dashboard Cite

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

Some properties of Cartesian product files

Cited by 23 publications

References 5 publications

Disk allocation for Cartesian product files on multiple-disk systems

Disk allocation for Cartesian product files on multiple-disk systems

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

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

Contact Info

Product

Resources

About