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

作者： Zhi-yong Liu Qiao SUN Shao-wei Zhang Xu-bin Pei Lan-mei FU Jia-song SUN Beijing Guo Dian Tong Network Technology Co. Ltd. State Grid Zhejiang Electric Power Company E.E.Department Tsinghua University

In this paper, we propose one comprehensive distributed database transaction method for Infini Band transaction integrity in the distributed heterogeneous environment caused by data and application expansion. The method first integrates the functions of the standard online transaction engine and then uses the optimistic concurrency control technique to deal with the online memory allocation problem. On the one hand, it reduces the delay time of the online transaction and on the other hand, allocates the computing cost of the transaction to the server and the client. In the existing enterprise network environment using YCSB as a benchmark test shows that the different keys under the method of response speed are the fastest. The result shows that this kind of hybrid processing scheme can make full use of the advantages of remote direct memory access and fast network, which can further improve the consistency and reliability of the distributed database system.

关键词： distributed database Integrated Transaction Processing Comprehensive distributed database Management Optimistic concurrency control

来源：评论

学校读者我要写书评

暂无评论

The instrumentation of a parallel, distributed database operation, retrieve-common, for merging two large sets of records

The instrumentation of a parallel, distributed database oper...

引用

作者： Gregory Alan Hammond Naval Postgraduate School

学位级别：硕士

The Naval Postgraduate School's Laboratory for database Systems Research is the site of the multi-backend database supercomputer (MBDS). Originally, MBDS supported a prototype primary operation (retrieve-common) which merged two sets of records in a distributed, parallel database environment. This thesis presents the testing, and modification of that prototyped primary operation. First, the design rationale of the MBDS is reviewed. Specifically, this review examines the reasons for a database-oriented supercomputer, the MBDS primary processes, and the methodology of distributing a database within loosely coupled and highly parallel database stores. Then, this study explains the methodology involved in developing theories on the cause of retrieve-common's defects and bottlenecks. Finally, in validating our theories, this study relates the process of discovering and correcting these discrepancies.

关键词： distributed database Parallel database Record Merging Multi-backend

来源：评论

学校读者我要写书评

暂无评论

DYNAMICAL PROCESSING TECHNIQUE FOR DATA FRAGMENTATION IN distributed database SYSTEMS: DESIGN AND TOOL SUPPORT

引用

JOURNAL OF DYNAMICAL SYSTEMS AND GEOMETRIC THEORIES 2006年第2期4卷 103-116页

作者： Hababeh, Ismail Omar Ramachandran, Muthu Bowring, Nicholas Leeds Metropolitan Univ Sch Comp Leeds W Yorkshire England Manchester Metropolitan Univ Dept Engn & Technol Manchester Lancs England

Data fragmentation is one of the primary techniques that has been used in partitioning and developing distributed database systems (DDBs). database partitioning technique improves the performance of the system throughput and reduces the amount of irrelevant data to be accessed and transferred among different sites in DDBs. We propose a technique that splits the database relations into pair-wise disjoint fragments, which would be allocated to the DDBs sites during the process of allocation. This technique reduces the data transferred between the sites during the applications execution, minimizes the communication cost needed for processing applications, handles the database queries and meets their future needs, guarantees the ability of processing a given portion of a given transaction in all sites, and improves the applications speed and efficiency by minimizing the number of fragments to be accessed. We have also developed a fragmentation tool that is interactive, full functional and easy to use, based on our fragmentation life cycle algorithms to create the database segments and generate the minimum number of disjoint fragments. A case study and some results in tabular and graphical means will be presented to demonstrate the efficiency of the method.

关键词： distributed database Data segmentation Data fragmentation Application definition Disjoint fragments algorithms Fragment life cycle

来源：评论

学校读者我要写书评

暂无评论

An approximate method for minimizing the communications cost of the replication routing schedule for a distributed database

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS 2000年第1期83卷 73-86页

作者： Wakahara, Y Kokusai Denshin Denwa Co Ltd Res & Dev Labs Kamifukuoka Saitama 3568502 Japan

In distributed databases for general-purpose business software, such as groupware, the asynchronous replication update method is widely employed to assure coincidence in the contents of the database;the replications of other databases retained in each database are updated simultaneously according to a predetermined schedule. This article discusses the approximate scheduling in such a distributed database that minimizes the communications cost of updating the replications, More precisely, as the first step, we consider the case in which two-way concurrent transmission is allowed in each link, and the communications cost is proportional to the communication time required for the transfer. The problem of deriving the schedule to minimize the communications cost is formulated. As a practical method of solving that problem, a heuristic method that effectively derives the approximate schedule with a communications cost close to the minimum is proposed. A quantitative evaluation of the proposed method is presented, and it is shown that a schedule very close to the optimal solution is obtained if the communications cost coefficient of the links is almost the same. (C) 1999 Scripta Technica.

关键词： replication schedule distributed database groupware communications cost

来源：评论

学校读者我要写书评

暂无评论

Development of Island tourism resources based on distributed database and embedded system

引用

MICROPROCESSORS AND MICROSYSTEMS 2021年 81卷 103752-103752页

作者： Wang, Yong Hou, Guobin East China Univ Polit Sci & Law ECUPL Sch Int Law Shanghai 200042 Peoples R China

This article describes the sustainable production system made islands. distributed data resources used to produce goods for consumption and disposal. Production activities are supported by global non-critical resources, such as capital, technology and expertise in embedded systems, patents and data: analysis and business plan. Provide a case study to explain this arrangement. Understand the potential of the Island?s manufacturing sector to add value to the debate on sustainable manufacturing. This study aims to develop an embedded system as a model recognized as a highly developed modern development model, and tourism destination as a system bound essentially regional representatives with a specific development framework. Find similarities with the indispensable support of the overall product at your destination for a distributed database server. By this analogy, find a long-term development model suitable for local commercial embedded systems tourist destinations. A reasonable solution is the concept of sustainable development;the basic principle is coherent. Tourism destination management principles function.

关键词： distributed database Embedded system Tourist destination Sustainable Development Competitiveness

来源：评论

学校读者我要写书评

暂无评论

Join query optimization in the distributed database system using an artificial bee colony algorithm and genetic operators

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2019年第17期31卷 e5218-e5218页

作者： Panahi, Vahideh Navimipour, Nima Jafari Islamic Azad Univ Tabriz Branch Dept Comp Engn Tabriz Iran

As the main factor in the distributed database systems, query optimization is aimed at finding an optimal execution plan to reduce the runtime. In such systems, because of the repeated relations on various sites, the query optimization is very challenging. Moreover, the query optimization issue with large-scale distributed databases is an NP-hard problem. Therefore, in this paper, an Artificial Bee Colony Algorithm based on Genetic Operators (ABC-GO) is proposed to find a solution to join the query optimization problems in the distributed database systems. The ABC algorithm has the global-local search capabilities and genetic operators to create new candidate solutions for improving the performance of the ABC algorithm. The obtained results have shown that the cost of the query evaluation is minimized and the quality of Top-K query plans is improved for a given distributed query. Moreover, this method decreases the overhead. However, it needs a longer execution time.

关键词： artificial bee colony optimization distributed database genetic operator query plan optimization

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant Control of a distributed database System

引用

JOURNAL OF CONTROL SCIENCE AND ENGINEERING 2008年第unknown期2008卷 1-13页

作者： Wu, N. Eva Ruschmann, Matthew C. Linderman, Mark H. Binghamton Univ Dept Elect & Comp Engn Binghamton NY 13902 USA Rome Res Site US Air Force Res Labs Rome NY 13441 USA

Optimal state information-based control policy for a distributed database system subject to server failures is considered. Faulttolerance is made possible by the partitioned architecture of the system and data redundancy therein. Control actions include restoration of lost data sets in a single server using redundant data sets in the remaining servers, routing of queries to intact servers, or overhaul of the entire systemfor renewal. Control policies are determined by solvingMarkov decision problems with cost criteria that penalize system unavailability and slow query response. Steady-state system availability and expected query response time of the controlled database are evaluated with the Markov model of the database. Robustness is addressed by introducing additional states into the database model to account for control action delays and decision errors. A robust control policy is solved for the Markov decision problem described by the augmented state model. Copyright (C) 2008 N. EvaWu et al.

关键词： .queries availability data sets Markov decision Steady-state delays control policy response time Control actions NY USA Fault-Tolerant Control overhaul distributed database decision errors

来源：评论

学校读者我要写书评

暂无评论

An Enhanced University Registration Model Using distributed database Schema

引用

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2019年第7期13卷 3533-3549页

作者： Maabreh, Khaled Saleh Zarqa Univ Fac Informat Technol Zarqa Jordan

A big database utilizes the establishing network technology, and it became an emerging trend in the computing field. Therefore, there is a necessity for an optimal and effective data distribution approach to deal with this trend. This research presents the practical perspective of designing and implementing distributed database features. The proposed system has been establishing the satisfying, reliable, scalable, and standardized use of information. Furthermore, the proposed scheme reduces the vast and recurring efforts for designing an individual system for each university, as well as it is effectively participating in solving the course equivalence problem. The empirical finding in this study shows the superiority of the distributed system performance based on the average response time and the average waiting time than the centralized system. The system throughput also overcomes the centralized system because of data distribution and replication. Therefore, the analyzed data shows that the centralized system thrashes when the workload exceeds 60%, while the distributed system becomes thrashes after 81% workload.

关键词： Availability Cloud Computing distributed database Fragmentation Registration Reliability

来源：评论

学校读者我要写书评

暂无评论

Replication routing schedule with minimum update time for distributed database

引用

ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS 1999年第2期82卷 11-20页

作者： Wakahara, Y KDD Co Ltd R&D Labs Kamifukuoka Saitama 3568502 Japan

distributed databases in general-purpose business software such as groupware widely use a method for simultaneously updating the replicas of other databases owned by each database according to the replication routing schedule. In this paper, a replication routing schedule is discussed in which the time required for updating the replica is the minimum in the distributed database. Specifically, an optimization problem is first formulated for deriving the replication routing schedule with minimum update time. Next, in the cases of even and odd numbers of distributed databases, an algorithm providing a replication routing schedule as an optimum solution is presented in the even case, while a heuristic algorithm providing an approximate solution is shown for the odd case. These algorithms are extremely simple and are practical since the required amount of computational processing is small. (C) 1998 Scripta Technica, Electron Comm Jpn Pt 1, 82(2): 11-20, 1999.

关键词： routing replica schedule distributed database groupware

来源：评论

学校读者我要写书评

暂无评论

Enhanced Schemes for Data Fragmentation, Allocation, and Replication in distributed database Systems

引用

COMPUTER SYSTEMS SCIENCE AND ENGINEERING 2020年第2期35卷 99-112页

作者： Torshiz, Masood Niazi Esfaji, Azadeh Salehi Amintoosi, Haleh Islamic Azad Univ Mashhad Branch Dept Comp Engn Mashhad Razavi Khorasan Iran Ferdowsi Univ Mashhad Fac Engn Comp Engn Dept Mashhad Razavi Khorasan Iran

With the growth of information technology and computer networks, there is a vital need for optimal design of distributed databases with the aim of performance improvement in terms of minimizing the round-trip response time and query transmission and processing costs. To address this issue, new fragmentation, data allocation, and replication techniques are required. In this paper, we propose enhanced vertical fragmentation, allocation, and replication schemes to improve the performance of distributed database systems. The proposed fragmentation scheme clusters highly-bonded attributes (i.e., normally accessed together) into a single fragment in order to minimize the query processing cost. The allocation scheme is proposed to find an optimized allocation to minimize the round-trip response time. The replication scheme partially replicates the fragments to increase the local execution of queries in a way that minimizes the cost of transmitting replicas to the sites. Experimental results show that, on average, the proposed schemes reduce the round-trip response time of queries by 23% and query processing cost by 15%, as compared to the related work.

关键词： distributed database Big Data Vertical Fragmentation Allocation Replication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：