Results 1 
5 of
5
An Objective Function for Vertically Partitioning Relations in Distributed Databases and its Analysis
, 1992
"... The design of distributed databases is an optimization problem requiring solutions to several interrelated problems including: data fragmentation, allocation, and local optimization. Each problem can be solved with several different approaches thereby making the distributed database design a very di ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
The design of distributed databases is an optimization problem requiring solutions to several interrelated problems including: data fragmentation, allocation, and local optimization. Each problem can be solved with several different approaches thereby making the distributed database design a very difficult task. Although there is a large body of work on the design of data fragmentation, most of them are either ad hoc solutions or formal solutions for special cases (e. g., binary vertical partitioning). In this paper, we address the general vertical partitioning problem formally. We first provide a comparison of work in the area of data clustering and distributed databases to highlight the thrust of this work. We derive an objective function that generalizes and subsumes earlier work on vertical partitioning in databases. The objective function developed in this paper provides a basis for developing heuristic algorithms for vertical partitioning. The objective function also facilitates ...
A Formal Approach to the Vertical Partitioning Problem in Distributed Database Design
 In Technical Report. CIS Dept, Univ. of
, 1993
"... The design of distributed databases is an optimization problem requiring solutions to several interrelated problems: data fragmentation, allocation, and local optimization. Each problem can be solved with several different approaches thereby making the distributed database design a very difficult ta ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
(Show Context)
The design of distributed databases is an optimization problem requiring solutions to several interrelated problems: data fragmentation, allocation, and local optimization. Each problem can be solved with several different approaches thereby making the distributed database design a very difficult task. Although there is a large body of work on the design of data fragmentation, most of them are either ad hoc solutions or formal solutions for special cases (e. g., binary vertical partitioning). In this paper, we address the problem of nary vertical partitioning problem and derive an objective function that generalizes and subsumes earlier work. The objective function derived in this paper is being used for developing heuristic algorithms that can be shown to satisfy the objective function. The objective function is also being used for comparing previously proposed algorithms for vertical partitioning. We first derive an objective function that is suited to distributed transaction proces...
Efficient incremental view maintenance in data warehouses
 In CIKM ’01: Proceedings of the tenth international conference on Information and knowledge management
, 2001
"... In the data warehouse environment, the concept of a materialized view is nowadays common and important in an objective of efficiently supporting OLAP query processing. Materialized views are generally derived from selectprojectjoin of several base relations. These materialized views need to be up ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
In the data warehouse environment, the concept of a materialized view is nowadays common and important in an objective of efficiently supporting OLAP query processing. Materialized views are generally derived from selectprojectjoin of several base relations. These materialized views need to be updated when the base relations change. Since the propagation of updates to the views may impose a significant overhead, it is very important to update the warehouse views efficiently. Though various view maintenance strategies have been discussed so far, they typically require too much access to base relations, resulting in the performance degradation. In this paper we propose an efficient incremental view maintenance strategy called delta propagation that can minimize the total size of base relations accessed by analyzing the properties of base relations. We first define the delta expression and a delta propagation tree which are core concepts of the strategy. Then, a dynamic programming algorithm that can find the optimal delta expression are proposed. We also present various experimental results that show the usefulness and efficiency of the strategy.
Vertical partitioning impact on performance and manageability of distributed database systems (A Comparative study of some vertical partitioning algorithms)
 18TH NATIONAL COMPUTER CONFERENCE
, 2006
"... Users of distributed database systems often observe performance problems such as unexpectedly low throughput or high latency. Determining the cause of the performance problems can be very hard task. Bottlenecks can occur in any of the components through which the data flows: the applications, the op ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Users of distributed database systems often observe performance problems such as unexpectedly low throughput or high latency. Determining the cause of the performance problems can be very hard task. Bottlenecks can occur in any of the components through which the data flows: the applications, the operating systems, the network interfaces and hardware. Horizontal and vertical partitioning are important aspects of physical design in relational database system that has a significant impact on performance. The distribution design involves making decisions on the fragmentation and the allocation of data across the sites of a computer network. In this paper we address the fragmentation phase of distributed database systems. In this paper, vertical partitioning problem during the design of distributed databases is discussed by conducting a comparative study for different vertical partitioning algorithms to reach the most efficient vertical fragmentation scheme that leads to a proper data allocation and replication.
Advisor A Data Cache That Learns to Fetch
, 1991
"... This paper describes Fido, a predictive cache [palmer 1990] that anticipates access by employing an associative memory to recognize regularities in access pattern for each isolated access context over time. Continual training adapts the associative memory contents to database and access pattern chan ..."
Abstract
 Add to MetaCart
This paper describes Fido, a predictive cache [palmer 1990] that anticipates access by employing an associative memory to recognize regularities in access pattern for each isolated access context over time. Continual training adapts the associative memory contents to database and access pattern changes, allowing online access predictions for prefetcbing. We discuss two salient components of Fido MLP, a replacement policy for managing prefetched objects, and Estimating Prophet, the component that recognizes patterns and predicts access. We tben present some early simulation results which suggest that predictive caching worlcs well and conr:lude that it is a promising method. 1