检索结果-内蒙古大学图书馆

Hierarchical simultaneous vertical fragmentation and allocation using modified Bond Energy Algorithm in distributed databases

引用

Applied Computing and Informatics 2018年第2期14卷 127-133页

作者： Rahimi, Hossein Parand, Fereshteh-Azadi Riahi, Davoud Math and Computer Science Department Allameh Tabataba'i University Ahmad Ghasir St. Beheshti Av. Tehran Iran

Designing an efficient distributed database system (DDBS) is considered as one of the most challenging problems because of multiple interdependent factors which are affecting its performance. Allocation and fragmentation are two processes which their efficiency and correctness influence the performance of DDBS. Therefore, efficient data fragmentation and allocation of fragments across the network sites are considered as an important research area in distributed database design. This paper presents an approach which simultaneously fragments data vertically and allocates the fragments to appropriate sites across the network. Bond Energy Algorithm (BEA) is applied with a better affinity measure that improves the generated clusters of attributes. The algorithm simultaneously generates clusters of attributes, calculates the cost of allocating each cluster to each site and allocates each cluster to the most appropriate site. Results show more efficient clustering and allocation which gives better performance. © 2015 The Authors

关键词： Bond Energy Algorithm Clustering Data allocation and fragmentation distributed database system

来源：评论

学校读者我要写书评

暂无评论

A New distributed Mining Association Rules Algorithm in distributed database system

A New Distributed Mining Association Rules Algorithm in Dist...

引用

International Conference on Smart Materials and Intelligent systems

作者： Gao, Shutao School of Service Outsourcing Hunan Foreign Economic Relations and Trade College China

ISBN: (纸本)9780878492237

The traditional algorithms create the local candidate sets firstly, and then determine whether the local frequent item sets is the global frequent item sets by the traffic between the nodes. The most different between the proposed algorithm and the traditional algorithms is that it firstly generates all the local frequent item sets at each node and then communicates to the top point. At the top point, there are four cases to deal with all the local frequent item sets. For the fastest case, the determination could be made by the completion of round-trip communications. At the same time, all the operations of this algorithm are completed not by traditional data storage but by a new data storage in which the item is considered as the keyword. The method can save storage space, especially for sparse data. So the support can be calculated by the intersection of the transaction sets, which is much easier than by accessing to the database. Finally, the association rules in the distributed database are mined.

关键词： mining association rules distributed database system algorithm

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Taxonomy of Fragmentation and Allocation Techniques in distributed database Design

引用

ACM COMPUTING SURVEYS 2018年第1期51卷 12-12页

作者： Nashat, Dalia Amer, Ali A. Assiut Univ Fac Sci Dept Math Assiut Egypt Taiz Univ Fac Sci Dept Math Taizi Yemen

The need to design an optimally distributed database is increasingly important with the growth of information technology and computer networks. However, designing a distributed database is an extremely complex process due to a large number of geographically distributed sites and database relations. Moreover, decreasing communication costs and query response time should be taken into consideration. There are three main techniques applied to design a distributed database, namely Fragmentation, Data allocation, and Replication. It is notable that these techniques are often treated separately and rarely processed together. Some available allocation methods are applied regardless of how the fragmentation technique is performed or replication process is adopted. In contrast, other fragmentation techniques do not consider the allocation or the replication techniques. Therefore, the first and foremost step for designing an optimal database is to develop a comprehensive understanding of the current fragmentation, replication, and allocation techniques and their disadvantages. This article presents an attempt to fulfill this step by proposing a comprehensive taxonomy of the available fragmentation and allocation techniques in distributed database design. The article also discusses some case studies of these techniques for a deeper understanding of its achievements and limitations.

关键词： Allocation distributed database system horizontal fragmentation hybrid fragmentation replication vertical fragmentation

来源：评论

学校读者我要写书评

暂无评论

Empirical Evaluation of Threshold and Time Constraint Algorithm for Non-replicated Dynamic Data Allocation in distributed database systems 1

引用

International Congress on Information and Communication Technology (ICICT)

作者： Singh, Arjan Punjabi Univ Patiala 147002 Punjab India

ISBN: (数字)9789811007552

ISBN: (纸本)9789811007552;9789811007545

Data allocation plays a significant role in the design of distributed database systems. Data transfer cost is a major cost of executing a query in a distributed database system. So the performance of distributed database systems is greatly dependent on allocation of data between the different sites of the network. The performance of static data allocation algorithms decreases as the retrieval and update access frequencies of queries from different sites to fragments changes. So, selecting a suitable method for allocation in the distributed database system is a key design issue. In this paper, the data allocation framework for non-replicated dynamic distributed database system using threshold and time constraint algorithm (TTCA) is developed and the performance of TTCA is evaluated against the threshold algorithm on the basis of total cost of reallocation and the number of migrations of fragments from one site to another site.

关键词： distributed database system Static allocation and dynamic allocation

来源：评论

学校读者我要写书评

暂无评论

A multi-colony ant algorithm for optimizing join queries in distributed database systems

引用

KNOWLEDGE AND INFORMATION systemS 2014年第1期39卷 175-206页

作者： Golshanara, Ladan Rankoohi, Seyed Mohammad Taghi Rouhani Shah-Hosseini, Hamed Shahid Beheshti Univ Fac Elect & Comp Engn GC Tehran Iran

distributed database systems provide a new data processing and storage technology for decentralized organizations of today. Query optimization, the process to generate an optimal execution plan for the posed query, is more challenging in such systems due to the huge search space of alternative plans incurred by distribution. As finding an optimal execution plan is computationally intractable, using stochastic-based algorithms has drawn the attention of most researchers. In this paper, for the first time, a multi-colony ant algorithm is proposed for optimizing join queries in a distributed environment where relations can be replicated but not fragmented. In the proposed algorithm, four types of ants collaborate to create an execution plan. Hence, there are four ant colonies in each iteration. Each type of ant makes an important decision to find the optimal plan. In order to evaluate the quality of the generated plan, two cost models are used-one based on the total time and the other on the response time. The proposed algorithm is compared with two previous genetic-based algorithms on chain, tree and cyclic queries. The experimental results show that the proposed algorithm saves up to about 80 % of optimization time with no significant difference in the quality of generated plans compared with the best existing genetic-based algorithm.

关键词： Query optimization distributed database system Ant colony optimization Join queries Cost model

来源：评论

学校读者我要写书评

暂无评论

Incremental Data Migration for Multi-database systems Based on MySQL with SPIDER Storage Engines

引用

INTERNATIONAL JOURNAL OF NETWORKED AND distributed COMPUTING 2015年第2期3卷 119-127页

作者： Miyamoto, Naoyuki Higuchi, Ken Tsuji, Tatsuo Univ Fukui Grad Sch Engn 3-9-1 Bunkyo Fukui 9108507 Japan

In this paper, an incremental data migration technique is evaluated in the multi-database system based on MySQL with SPIDER storage engine and the improvement of the turn-around times of other operations is proved in this systems. In this method, a large data migration is divided into small data migrations and other operations are inserted between these small data migrations. This technique is easy to implement in the multi-database system.

关键词： distributed database system multi-database system data migration incremental data migration

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Three Phase Commit Protocol (3PC) Algorithm

Design and Implementation of Three Phase Commit Protocol (3P...

引用

International Conference on Optimization, Reliabilty, and Information Technology (ICROIT)

作者： Kumar, Nitesh Sahoo, Laxman Kumar, Ashish KIIT Univ Sch Comp Engn Bhubaneswar Orissa India

ISBN: (纸本)9781479929955

Transaction Management plays the key role in any type of database system. In order to make the Application Query, many protocols have been designed. In this paper, we have developed very efficient and enhanced the Three Phase Commit Protocol (3PC), after studying the drawback of 2PC. In 2PC, we observed that if two side transaction will perform in 2PC (i. e., one side called sender and other side called a receiver). When sender side communicates with the receiver side in the form of performing initial values prepare for commit or abort message. They have the some possibilities both sides that are, case 1-if the sender side sends the commit data to receiver side that may commit both sides. Case 2-if the sender side sends the data but data will abort to the sender side and the receiver side also data will abort. Case 3-if the sender side sends the commit data to receiver side but receiver side data will abort. Case 4-if the sender side sends the commit data but receiver side, will not ensure that at a time data will commit or abort. Overall, according to all possibilities, we have four cases which are applied. We investigated that data is not sure from both side (sender side and receiver side). In this paper we also observed that if 3PC will use such type of cases then it will avoid blocking problems, because after abort/failed the data of2PC protocol. Data are blocked and reduced the blocking problem through 3PC techniques. It has one active data for backup, if failed/abort the data to both sides. It has stored and adds multiple sites for decision pays for committing not for abort. It is called pre-commit decision process and record of the data are stored in multiple sites (i. e., K sites), and we also implemented 3PC Algorithm in this paper.

关键词： database system distributed database system Transaction Management Two Phase Three Phase Algorithm Implementation

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Three Phase Commit Protocol (3PC) Directory Structure through Remote Procedure Call (RPC) Application

Design and Implementation of Three Phase Commit Protocol (3P...

引用

International Conference on Information Communication and Embedded systems (ICICES)

作者： Kumar, Nitesh Kumar, Ashish Giri, Soumyajit KIIT Univ Sch Comp Engn Bhubaneswar Orissa India

ISBN: (纸本)9781479938346

Transaction is a set of/unit of sequential operations, which is used for a purpose of Technological, Organizational, programming languages, and operating systems. It examines the performance of the transaction manager with the help of Remote Procedure Calls (RPC) Applications. Remote Procedure Call is a distributed application for constructing the distributed database system. When it communicates between the sender side (client side) and receiver side (server side). It executes the ensure atomicity protocols. Simple optimization of Two Phase Commit Protocol (2PC) reduces non-blocking commit, logging activity, multi-threading design, and improved throughput, reduce multicasting, and reduces the variance of distributed commit protocol. It is totally based on Three Phase Commit Protocol (3PC) in a communication network infrastructure environment such as (LAN, WAN, MAN, etc.), and the performance of the transaction mechanism such as RPC Techniques depends upon the client and server performance. In this paper, we provide a detail examination of the design and performance of the transaction manager of the RPC Applications and we also compile the code and it's create a file, then after that it will execute the code step by step.

关键词： Transaction Management system Three Phase Commit Protocol distributed database system Remote Procedure Call Application

来源：评论

学校读者我要写书评

暂无评论

RC-OCP: Reverse Coordinated Optimized Commit Protocol

RC-OCP: Reverse Coordinated Optimized Commit Protocol

引用

International Conference on Information systems and Computer Networks (ISCON)

作者： Chauhan, Ganpat Singh Gupta, Mukesh Kumar Khunteta, Ajay SKIT Comp Engn Jaipur Rajasthan India PCE Comp Engn Jaipur Rajasthan India

ISBN: (纸本)9781479929818

With the growth of trends in computing and requirement for developing a reliable computing environment the need for performing tasks in distributed manner has gained much importance. Atomic commit protocols (ACP) are used to preserve the ACID property in distributed systems. Two-Phase Commit (2PC) is most widely used but the blocking of sites is undesirable as these sites may be holding locks on the resources. As alternative, non-blocking ACP has been suggested: This non-blocking protocol is Three-Phase Commit (3PC) protocol which requires an extra phase (pre-commit) to remove blocking state. The existing protocols require so many messages transfer from the coordinator to participants and vice versa during different phases and corresponding increase communication and time complexity and hold the locks acquire by different participants till the end of last phase, forcing other transactions also to be blocked just because of the objects that are locked. All the existing protocols give the same performance for both deferred and immediate consistency constraints databases. Lots of protocols are being proposed and mainly the concentration was to make the 2PC protocol non-blocking or to minimize the blocking possibilities in 2PC. There has been a renewed interest in developing and optimization of more efficient ACPs. This paper is an effort to propose a new technique to optimize atomic commit protocols by optimizing voting phase based on deferred and immediate consistency constraints. Also an attempt has been made to propose reduction in communication complexity which will require less number of messages to be shared between coordinator and participants, the cost of execution as well as time delays.

关键词： distributed database system Two Phase Commit Protocol (2PC) Three Phase Commit Protocol (3PC) Non-Blocking Commit Protocol Deferred and Immediate consistency constraints

来源：评论

学校读者我要写书评

暂无评论

IOCP: Implementation of Optimized Commit Protocol

IOCP: Implementation of Optimized Commit Protocol

引用

IEEE International Conference on Recent Advances and Innovations in Engineering (ICRAIE)

作者： Chauhan, Ganpat Singh Gupta, Mukesh Kumar Khunteta, Ajay PCE Comp Engn Jaipur Rajasthan India SKIT Comp Engn Jaipur Jaipur Rajasthan India

ISBN: (纸本)9781479940400

Atomic Commit Protocols (ACP) are used to maintain atomicity in distributed systems. There are protocols available to minimize the overhead between the coordinator and participants, some are to minimize blocking while some to release the locks acquire by different participants. Optimized Two phase Commit (O-2PC) Protocol has been proposed to optimize the performance of 2PC based of deferred and immediately consistency constraints by overlapping the voting phase where initiation of protocol is done from participant side. But no simulator is currently available. This paper Implementation of Optimized Commit Protocol (IOCP) is an effort to allow simulating the performance of O-2PC empirically to consider the indirect costs that is not possible to calculate analytically. The simulator is developed using Java Network Programming. This simulation tool also provides facility to compare different commit protocols based on some performance parameters.

关键词： distributed database system Two Phase Commit Protocol (2PC) Optimized Two Phase Commit Protocol (O-2PC) Three Phase Commit Protocol (3PC) Non-Blocking Commit Protocol Deferred and Immediate consistency constraints

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：