4,681 research outputs found
Efficient Database Distribution Using Local Search Algorithm
A problem in railway database is identied. Focus of the problem is to reduce the average response
time for all the read and write queries to the railway database. One way of doing this is by opening
more than one database servers and distributing the database across these servers to improve the
performance. In this work we are proposing an ecient distribution of the database across these
servers considering read and write request frequencies at all locations.
The problem of database distribution across dierent locations is mapped to the well studied
problem called Uncapacitated Facility Location(UFL) problem. Various techniques such as greedy
approach, LP rounding technique, primal-dual technique and local search have been proposed to
tackle this problem. Of those, we are using local search technique in this work. In particular, poly-
nomial version of the local search approximation algorithm is used to solve the railway database
problem. Distributed database is implemented using postgresql database server and jboss appli-
cation server is used to manage the global transaction. On this architecture, database is distributed
using the local optimal solution obtained by local search algorithm and it is compared with other
solutions in terms of the average response time for the read and write requests
On hierarchical clustering-based approach for RDDBS design
Distributed database system (DDBS) design is still an open challenge even after decades of research, especially in a dynamic network setting. Hence, to meet the demands of high-speed data gathering and for the management and preservation of huge systems, it is important to construct a distributed database for real-time data storage. Incidentally, some fragmentation schemes, such as horizontal, vertical, and hybrid, are widely used for DDBS design. At the same time, data allocation could not be done without first physically fragmenting the data because the fragmentation process is the foundation of the DDBS design. Extensive research have been conducted to develop effective solutions for DDBS design problems. But the great majority of them barely consider the RDDBS\u27s initial design. Therefore, this work aims at proposing a clustering-based horizontal fragmentation and allocation technique to handle both the early and late stages of the DDBS design. To ensure that each operation flows into the next without any increase in complexity, fragmentation and allocation are done simultaneously. With this approach, the main goals are to minimize communication expenses, response time, and irrelevant data access. Most importantly, it has been observed that the proposed approach may effectively expand RDDBS performance by simultaneously fragmenting and assigning various relations. Through simulations and experiments on synthetic and real databases, we demonstrate the viability of our strategy and how it considerably lowers communication costs for typical access patterns at both the early and late stages of design
Solving Large Scale Instances of the Distribution Design Problem Using Data Mining
In this paper we approach the solution of large instances of the distribution design problem. The traditional approaches do not consider that the instance size can significantly reduce the efficiency of the solution process. We propose a new approach that includes compression methods to transform the original instance into a new one using data mining techniques. The goal of the transformation is to condense the operation access pattern of the original instance to reduce the amount of resources needed to solve the original instance, without significantly reducing the quality of its solution. In order to validate the approach, we tested it proposing two instance compression methods on a new model of the replicated version of the distribution design problem that incorporates generalized database objects. The experimental results show that our approach permits to reduce the computational resources needed for solving large instances by at least 65%, without significantly reducing the quality of its solution. Given the encouraging results, at the moment we are working on the design and implementation of efficient instance compression methods using other data mining techniques
Tunable Security for Deployable Data Outsourcing
Security mechanisms like encryption negatively affect other software quality characteristics like efficiency. To cope with such trade-offs, it is preferable to build approaches that allow to tune the trade-offs after the implementation and design phase. This book introduces a methodology that can be used to build such tunable approaches. The book shows how the proposed methodology can be applied in the domains of database outsourcing, identity management, and credential management
A Methodology for Vertically Partitioning in a Multi-Relation Database Environment
Vertical partitioning, in which attributes of a relation are assigned to partitions, is aimed at improving database performance. We extend previous research that is based on a single relation to multi-relation database environment, by including referential integrity constraints, access time based heuristic, and a comprehensive cost model that considers most transaction types including updates and joins. The algorithm was applied to a real-world insurance CLAIMS database. Simulation experiments were conducted and the results show a performance improvement of 36% to 65% over unpartitioned case.
Application of our method for small databases resulted in partitioning schemes that are comparable to optimal.Facultad de Informátic
- …