A formal approach to the vertical partitioning problem in distributed database design

Muthuraj, Jaykumar; Chakravarthy, Sharma; Varadarajan, Ravi; Navathe, Shamkant B.

doi:10.1109/pdis.1993.253076

Cited by 5 publications

(2 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, we use the square-error criterion proposed for data clustering and modify/extend it to an objective function for vertical partitioning. Our formulation of the objective function for generating n-ary partitions consists of two components that provide the desirable behavior for minimizing transaction processing cost [17].…”

Section: II Motivationmentioning

confidence: 99%

An objective function for vertically partitioning relations in distributed databases and its analysis

Chakravarthy

Muthuraj

Varadarajan

et al. 1994

Distrib Parallel Databases

View full text Add to dashboard Cite

Abstract. Partitioning and allocation of relations is an important component of the distributed database design. Several approaches (and algorithms) have been proposed for clustering data for pattern classification and for partitioning relations in distributed databases. Most of the approaches used for classification use square-error criterion. In contrast, most of the approaches proposed for partitioning of relations are either ad hoc solutions or solutions for special cases (e.g., binary vc.r tical partitioning).In this paper, we first highlight the differences between the approaches taken for pattern classification and for distributed databases. Then an objective function for vertical partitioning of relations is derived using the square-error criterion commonly used in data clustering. The objective function derived generalizes and subsumes earlier work on vertical partitioning. Furthermore, the approach proposed in this paper is shown to be useful for comparing previously developed algorithms for vertical partitioning. The objective function has also been extended to include additional information, such as transaction types, different local and remote accessing costs and replication. Finally, we discuss the implementation of a distributed database design testbed.

show abstract

Section: II Motivationmentioning

confidence: 99%

An objective function for vertically partitioning relations in distributed databases and its analysis

Chakravarthy

Muthuraj

Varadarajan

et al. 1994

Distrib Parallel Databases

View full text Add to dashboard Cite

show abstract

“…It has been widely studied in the context of the relational model, cf. [6,10,18,19,20,21,23] and object oriented data model, cf. [3,7,11].…”

Section: Introductionmentioning

confidence: 99%

Cost-Based Vertical Fragmentation for XML

Hartmann

Schewe

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The Extensible Markup Language (XML) has attracted much attention as a data model for data exchange, data integration and rich data representation. A challenging question is how to manage native XML data in distributed databases. This leads to the problem of how to obtain a suitable distribution design for XML documents. In this paper we present a design approach for vertical fragmentation to minimise total query costs. Our approach is based on a cost model that takes the complex structure of queries on XML data into account. We show that system performance can be improved after vertical fragmentation using our approach, which is based on user access patterns.

show abstract

Cost-Based Fragmentation for Distributed Complex Value Databases

Ma¹,

Kirchberg²

2007

Conceptual Modeling - ER 2007

View full text Add to dashboard Cite

A formal approach to the vertical partitioning problem in distributed database design

Cited by 5 publications

References 23 publications

An objective function for vertically partitioning relations in distributed databases and its analysis

An objective function for vertically partitioning relations in distributed databases and its analysis

Cost-Based Vertical Fragmentation for XML

Cost-Based Fragmentation for Distributed Complex Value Databases

Contact Info

Product

Resources

About