Performance evaluation of grid based multi-attribute record declustering methods

Himatsingka, B.; Srivastava, Jaideep

doi:10.1109/icde.1994.283051

Cited by 9 publications

(7 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Solution 5 of the initial population partitions the relation into two fragments: [1,5,8,9,10] and [2,3,4,6,7]. The costs (number of disk accesses) and access path selections for each transaction are summarized in Table 5.…”

Section: Discussionmentioning

confidence: 99%

“…On the second iteration, the genetic algorithm suggested repartitioning fragment 1 into [1,5] and [2,7,8], and fragment 2 into [3,4,9] and [6,10]. As a result, the number of disk accesses was decreased to 59.…”

Section: Casementioning

confidence: 99%

“…Data fragmentation has been applied to central databases, distributed databases multiprocessor parallel databases and parallel disk I/O subsystems [2,3,4,5]. For example, in a distributed database system, the relations are partitioned horizontally and/or vertically, and are then allocated to the network sites supporting the database.…”

Section: Introductionmentioning

confidence: 99%

“…In a parallel I/O subsystem, fragments are assigned to multiple disks in order to improve the disk I/O performance of the database. Even with improved disk performance, disk I/O remains a bottleneck in many database environments [5].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Genetic Algorithm for Vertical Fragmentation and Access Path Selection

Song¹,

Gorla²

2000

The Computer Journal

View full text Add to dashboard Cite

Vertical fragmentation and access path selection are interdependent techniques in physical database design used to enhance performance in database systems. While vertical fragmentation in relational databases deals with assignment of attributes to physical files, access path selection deals with searching efficiently the physical location of data records. Vertical fragmentation is a combinatorial optimization problem that is NP-hard in most cases. We propose a genetic algorithm approach for the vertical fragmentation problem while addressing access path selection. The effectiveness and efficiency of the genetic algorithm are illustrated through several database design problems, ranging from 10 attributes/5 transactions to 30 attributes/18 transactions. In most cases, our design solutions match the global optimum solutions obtained from an exhaustive enumeration. Compared to unpartitioned databases, our design solution results in substantial savings (up to 80%) in the number of disk accesses.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Casementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Genetic Algorithm for Vertical Fragmentation and Access Path Selection

Song¹,

Gorla²

2000

The Computer Journal

View full text Add to dashboard Cite

show abstract

“…al [7,18,11,351. We note that no methods can achieve strict optimality for all query-sets [7,18,351. For example, no method can be strictly optimal for all range queries if the number of disks is greater than 5 [18, 351.…”

Section: Definitionmentioning

confidence: 99%

Partitioning similarity graphs: A framework for declustering problems

Liu

Shekhar

1996

Information Systems

View full text Add to dashboard Cite

Declustering problems are well-known in the databases for parallel computing environments.In this paper, we propose a new similarity-based technique for declustering data. The proposed method can adapt to the available information about query distribution (e.g. size, shape and frequency) and can work with alternative atomic data-types.Furthermore, the proposed method is flexible and can work with alternative data distributions, data sizes and partition-size constraints. The method is based on max-cut partitioning of a similarity graph defined over the given set of data, under constraints on the partition sizes. It maximizes the chances that a pair of atomic data-items that are frequently accessed together by queries are allocated to distinct disks. We describe the application of the proposed method to parallelizing Grid Files at the data page level. Detailed experiments in this context show that the proposed method adapts to query distribution and data distribution, and that it outperforms traditional mapping-function-based methods for many interesting query distributions as well for several non-uniform data distributions.

show abstract

Tutorial on parallel database systems

Weikum

1995

Database Theory — ICDT '95

View full text Add to dashboard Cite

Performance evaluation of grid based multi-attribute record declustering methods

Cited by 9 publications

References 18 publications

A Genetic Algorithm for Vertical Fragmentation and Access Path Selection

A Genetic Algorithm for Vertical Fragmentation and Access Path Selection

Partitioning similarity graphs: A framework for declustering problems

Tutorial on parallel database systems

Contact Info

Product

Resources

About