In a distributed database system (DDBS), the data are partitioned into smaller databases and distributed over multiple sites in a computer network. Associated with a DDBS are functions like query processing and concur...
详细信息
In a distributed database system (DDBS), the data are partitioned into smaller databases and distributed over multiple sites in a computer network. Associated with a DDBS are functions like query processing and concurrency control. Traditionally in DDBS research, the computer network has been considered a performance bottleneck, and much research effort has been directed towards the design of database operations that minimize the data transmission cost. With the development of high-speed networks, the network transmission costs go down and new algorithms that efficiently utilize the huge bandwidth available are required. In this paper, we first identify the issues involved in developing this distributed application in a high-speed environment. Then we demonstrate the inadequacy of existing database protocols in utilizing the gigabit network. And finally, we develop a new concurrency control protocol that performs better than traditional DDBS in a high-speed network. Both analytical and simulation results are presented. In this paper, we have concentrated on the concurrency control (CC) aspect of DDBS since this protocol is at the heart of the overall functioning of the distributed system.
In recent years, with the text, images, audio, video and other data doubled because of the rapid development of information technology, we have entered the era of big data. How to effectively analyze and use the data ...
详细信息
ISBN:
(纸本)9781509025350
In recent years, with the text, images, audio, video and other data doubled because of the rapid development of information technology, we have entered the era of big data. How to effectively analyze and use the data has been a hot research direction. So the research of distributed database came into being to adapt to this research requirement. Sometimes the traditional genetic algorithm can't generate the optimal query plan. Focusing on this defect of the traditional genetic algorithm, this paper presents an improved genetic search algorithm. The improved algorithm uses the FCM clustering algorithm to classify the data members firstly, and then set up the crossover and mutation probability for each category to solve the problem that the crossover and mutation rate is set too large or too small. Simulation results show that the improved algorithm can find the optimal query execution plan in a relatively short period of time and then improve the query efficiency.
Query optimization is an important part of database management system. In this paper, through the research on query optimization technology, based on a number of optimization algorithms commonly used in distributed qu...
详细信息
ISBN:
(纸本)9781424455379
Query optimization is an important part of database management system. In this paper, through the research on query optimization technology, based on a number of optimization algorithms commonly used in distributed query, a new algorithm is designed, and experiments show that this algorithm can significantly reduce the amount of intermediate result data, effectively reduce the network communication cost, to improve the optimization efficiency.
A distributed database of cloud platform for the lower-limb exoskeleton robot is developed in this paper, which is to solve the problem of large data storage when long-term monitoring of multiple exoskeleton robots. T...
详细信息
ISBN:
(纸本)9781728157153
A distributed database of cloud platform for the lower-limb exoskeleton robot is developed in this paper, which is to solve the problem of large data storage when long-term monitoring of multiple exoskeleton robots. The architecture of the cloud platform is present. In terms of the data information of the robot and human body, a distributed database is built by using MyCat and MySQL. The interface between the database and the front-end web page is developed. The experiment indicates that the database of the cloud platform is able to remotely collect the information such as the joint angles of the robot which is also displayed on the web page.
With the information expanding and network popularization, the way that accessing single database can not satisfy the demands for users. The requirement to access distributed database is increased. This paper firstly ...
详细信息
ISBN:
(纸本)9780769539300
With the information expanding and network popularization, the way that accessing single database can not satisfy the demands for users. The requirement to access distributed database is increased. This paper firstly implemented distributed database query with the grid computing architecture Alchemi which is based on .NET. Then, a distributed database searching system model was constructed by grid computing technology, while the architecture and the operation process of the model were described in detail. Finally, the model was achieved with the platform of ***. According to the analyses of the configuration information and experimental results, it is proved that, compared with the current distributed database searching system, the system that developed by Alchemi is not only easy to configure, but also able to assure the efficiency and accuracy of the query.
The material requirement planning (MRP) process is crucial when software packages, like enterprise resource planning (ERP) software, are used in the production planning for manufacturing enterprises to ensure that app...
详细信息
The material requirement planning (MRP) process is crucial when software packages, like enterprise resource planning (ERP) software, are used in the production planning for manufacturing enterprises to ensure that appropriate quantities of raw materials and Subassemblies are provided at the right time. Whereas little attention has been paid to the architectural aspects of MRP process in academic studies, in practice, reports are often made of its time consuming characteristics due to intensive interactions with databases and difficulty in real time processing. This paper proposes a grid enabled MRP process in a distributed database environment and demonstrates the performance improvement of the proposed process by a simulation study.(C) 2009 Elsevier Inc. All rights reserved.
Collecting statistics is a time-and resource-consuming operation in database *** is even more challenging to efficiently collect statistics without affecting system performance,meanwhile keeping correctness in distrib...
详细信息
Collecting statistics is a time-and resource-consuming operation in database *** is even more challenging to efficiently collect statistics without affecting system performance,meanwhile keeping correctness in distributed *** strategies usually consider one dimension during collecting statistics,which is lack of *** this paper,we propose an adaptive strategy for statistics collecting(ASC),which well balances collecting efficiency,correctness of statistics and effect to system *** formally define the procedure of collecting statistics and abstract the relationships among collecting efficiency,correctness of statistics and effect to system performance,and introduce an elastic structure(ESI)storing necessary information generated during proceeding our *** can pick appropriate time to trigger collecting action and filter unnecessary tasks,meanwhile reasonably allocating collecting tasks to appropriate executing locations with right executing models through the information stored at *** implement and evaluate our strategy in a distributed *** show that our solutions generally improve the efficiency and correctness of collecting statistics,moreover,reduce the negative effect to system performance comparing with other strategies.
This paper studies the problem of query optimization in a distributed database. Assuming a linear additive cost function (in volume of data moved), we present a fast algorithm for finding the optimal program that answ...
详细信息
This paper studies the problem of query optimization in a distributed database. Assuming a linear additive cost function (in volume of data moved), we present a fast algorithm for finding the optimal program that answers a class of common queries, called chain queries. The key to the problem formulation and to the derivation of an efficient algorithm is an elegant parameterization of the database state against which the query is to be answered. This parameterization then enables us to characterize the set of potentially optimal programs, which in turn leads to a fast dynamic programming algorithm. Since in practice the needed parameters may not be available to the database system, we also discuss how to deal with partial parameterizations of the database state.
In this paper we present a multi-key index model that enables us to search a record with more than one attribute values in distributed database systems. Indices provide fast and efficient access of data and so become ...
详细信息
In this paper we present a multi-key index model that enables us to search a record with more than one attribute values in distributed database systems. Indices provide fast and efficient access of data and so become a major aspect in centralized database systems. Most of the centralized database systems use B+ tree or other types of index structures such a., bit vector, graph structure, grid file etc. But in distributed database systems no index model is found in the literature. Therefore efficient access is a major problem in distributed databases. Our proposed index model avoids the query-flooding problem of existing system and thus optimizes network bandwidth.
Local area networks (LANs) are important for an enterprise to hold a competitive edge. Many companies have therefore converted terminal-based computing systems to LAN-based distributed data processing systems. This pa...
详细信息
Local area networks (LANs) are important for an enterprise to hold a competitive edge. Many companies have therefore converted terminal-based computing systems to LAN-based distributed data processing systems. This paper proposes a design methodology for distributed databases connected by a LAN. Two primary objectives of the methodology are: (i) to allocate data files and workload among heterogeneous servers;and (ii) to determine the number of servers to satisfy the response time required for processing each transaction. The file and workload allocation decision is formulated as a nonlinear zero-one integer programming problem. This problem is proven to be NP-complete. A heuristic is developed to solve this problem effectively. A decision support system is implemented and an example is solved to illustrate the practical usefulness of the system. (C) 2000 Elsevier Science B.V. All rights reserved.
暂无评论