There are the trends that the users hope to retrieve information among lots of individual databasesystems distributed in lots of virtual organizations. To connect all these individual databasesystems into a virtual ...
详细信息
There are the trends that the users hope to retrieve information among lots of individual databasesystems distributed in lots of virtual organizations. To connect all these individual databasesystems into a virtual databasesystem is a significant issue. This paper presents VIRGO_DDBMS, a framework of distributed database system based on virtual hierarchical tree Grid organizationsfVIRGO) P2P network. The table space are classified as hierarchical domains like DNS. The servers hosting databasesystems joins several groups of VIRGO network according to the owned tables' domains. VIRGO_DDBMS is effective for data update and retrieve by using distributed SQL statements. We use the policies which cache the host machines' addresses of databasesystems to avoid the overload of traffic of root nodes in tree structure. The proposal presented here can construct a virtual distributed database system which can manages huge volumes of data by connecting all databasesystems together which are owned by the individual virtual organizations.
The benefit of using indexes for processing conjunctive queries in a databasesystem is well known. The use of indexes in distributed database systems is equally justified. In a distributeddatabase environment a rela...
详细信息
The benefit of using indexes for processing conjunctive queries in a databasesystem is well known. The use of indexes in distributed database systems is equally justified. In a distributeddatabase environment a relation may be horizontally partitioned across the nodes of the system and indexes may be created for the fragment of the relation that resides at each node. However, as an alternative, one might construct each index on the entire relation, i.e., global indexes, and then partition each index between the nodes. An approach is presented for processing such an index partitioning scheme in response to a conjunctive range query. The performance of these schemes is evaluated in terms of the response time of a query and the utilization of processors, disk, and communication network while varying the number of nodes and query mix.
The processing of a join query in a distributed environment exacts the usage of both the network and its computational facilities. A formulation that accounts for both, and felicitously constructed as an integer linea...
详细信息
The processing of a join query in a distributed environment exacts the usage of both the network and its computational facilities. A formulation that accounts for both, and felicitously constructed as an integer linear program, is proposed. Information disseminated among the sites of a distributedsystem is to be amalgamated and presented to a user, in response to his request. From all possible strategies by which this might be achieved, one necessitating the smallest usage of system resources is to be chosen. The data transferal resources of the network are usually presumed to be of greatest significance, and therefore, an optimal strategy is most often defined to be one which minimizes the total transmission cost. One model conforming to this philosophy, appearing in [1), expediently takes the form of a linear integer program, and so forms the basis for further refinement. In the omission of processing costs, the various processor elements of the network are treated homologously;dissimilarities in processing ability are also ignored. By analyzing the nature of join computations at a single processor, the minimal transmission cost model can be hybridized to incorporate the cost of such computations and differences in processing power.
We present a methodology for structured database decomposition based on the relational data model. It is argued that in the distributeddatabase environment, structured database decomposition is attractive both for ef...
详细信息
We present a methodology for structured database decomposition based on the relational data model. It is argued that in the distributeddatabase environment, structured database decomposition is attractive both for efficiency and for database security considerations. Techniques for parallel processing and hashed access of structurally decomposed database are presented. Techniques for structured database decomposition to support multiple user views are also described. Structured database decomposition is most advantageous in a query only database environment with stable user views, although dynamic updates can also be handled using techniques described in this paper.
Transaction Management plays the key role in any type of databasesystem. In order to make the Application Query, many protocols have been designed. In this paper, we have developed very efficient and enhanced the Thr...
详细信息
ISBN:
(纸本)9781479929955
Transaction Management plays the key role in any type of databasesystem. 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.
This thesis described the integration of the real-time motion control network with switch high-speed Ethernet technology and distributeddatabase technology. An application is introduced at the end.
ISBN:
(纸本)7312012035
This thesis described the integration of the real-time motion control network with switch high-speed Ethernet technology and distributeddatabase technology. An application is introduced at the end.
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...
详细信息
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.
Dynamic map system is one of key elements for autonomous driving (AD) car. Semi-dynamic data and semi-static data of Dynamic Map are locally collected and used. Volume of these is some Megabytes, and the time-life of ...
详细信息
ISBN:
(纸本)9781728194417
Dynamic map system is one of key elements for autonomous driving (AD) car. Semi-dynamic data and semi-static data of Dynamic Map are locally collected and used. Volume of these is some Megabytes, and the time-life of these is sub second to several minutes. A concept of such localized data transfer system is proposed. An effect of Vehicle to Vehicle communication (V2V) using wide range communication technology for Vehicle to Network communication (V2N) is estimated and an effect of off-loading cloud computing to edge computing and vehicle computing is estimated. Require for data base system of these data transfer system realization is proposed.
This paper presents a formal analysis of the concurrency control strategy of SDD-1. SDD-1, a system for distributeddatabases, is a prototype distributed database system being developed by Computer Corporation of Amer...
详细信息
In this paper, an incremental data migration technique is evaluated in the multi-databasesystem based on MySQL with SPIDER storage engine and the improvement of the turn-around times of other operations is proved in ...
详细信息
In this paper, an incremental data migration technique is evaluated in the multi-databasesystem 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-databasesystem.
暂无评论