In this paper we present the graphical interface of the system VHDBS, which has been jointly developed by an industrial research project at the Technology Center of the German Telekom and at the Fraunhofer ISST. The V...
详细信息
In this paper we present the graphical interface of the system VHDBS, which has been jointly developed by an industrial research project at the Technology Center of the German Telekom and at the Fraunhofer ISST. The VHDBS system enables the integration and interoperation of existing distributed and heterogeneous databases, which were developed independently. The graphical interface FGRAPH of VHDBS provides uniform access to distributed and heterogeneous data. The interface is based on a sophisticated design, which enables browsing on both schema and object level, and allows both query and browsing of objects. In particular, the user can move back and forth freely between query and browsing activities. Cooperative access to the data in various underlying databases is supported and platform, location and data model transparency is provided to the user.
Views are used in databasesystems to present data to different applications in a form reflecting their individual needs. The view mechanism contributes to data protection, independence, and isolation. In this paper w...
详细信息
Given a distributed multimedia database system and a set of queries as well as their frequencies from each site, the objective of a data allocation algorithm is to locate the multimedia data objects (MDOs) at differen...
详细信息
Given a distributed multimedia database system and a set of queries as well as their frequencies from each site, the objective of a data allocation algorithm is to locate the multimedia data objects (MDOs) at different sites so as to minimize the total data transfer cost incurred in executing the queries. The data allocation problem, however, is NP-complete, and thus requires fast heuristics to generate efficient solutions. In this paper we propose three data allocation algorithms which are based on a genetic technique, an evolutionary process, and neural networks. We have implemented and evaluated these algorithms on our distributed multimedia database system test-bed. A comparison of the algorithms reveals trade-offs between their solution quality and time-complexity.
In a distributeddatabase environment, when the coordinator site (root node or process) is not working, the environment needs to choose or elect a new one in order to perform the transactional tasks. The elected coord...
详细信息
ISBN:
(纸本)9781467348065
In a distributeddatabase environment, when the coordinator site (root node or process) is not working, the environment needs to choose or elect a new one in order to perform the transactional tasks. The elected coordinator takes the lead to perform the activities as well and continues the functioning. If the previous (crashed) site is recovered from the failures then again it leads the system by taking the responsibility. In this paper, a recovery instance based on bi-directional ring election algorithm for the crashed coordinator was brought up. The new algorithm for the recovered site quickly brings the state back by sending messages in parallel instances. This work shows that how the algorithm makes the recovered site faster and takes less time to make the system quickly to handle transactions normally.
Reliability deserves utmost position in processing the transaction effectively in distributed environment. Conservatively, the problems of consensus, Byzantine Agreement, and interactive consistency are studied in a f...
详细信息
Reliability deserves utmost position in processing the transaction effectively in distributed environment. Conservatively, the problems of consensus, Byzantine Agreement, and interactive consistency are studied in a fully connected network with multi nodes (processors) in malicious failure only. Such problematic instances are re–examined with the assumption of malicious faults on the side of both the nodes. The proposed ONBAP protocol use the minimum number of message exchanges and can endure the maximum number of allowable faulty components to make each fault-free processor reach a common agreement for the cases of processor failure to reach a goal effectively.
ECA (event/condition/action) rules have been developed for central active databasesystems. In distributed active databasesystems the problem of inaccessibility of partial systems raises and thus the undecidability o...
详细信息
distributed database systems require a commit process to preserve the ACID property of transactions executed on a number of system sites. With the appearance of main memory database system, the database processing tim...
详细信息
distributed database systems require a commit process to preserve the ACID property of transactions executed on a number of system sites. With the appearance of main memory database system, the database processing time has been reduced in the order of magnitude, since the database access does not incur any disk access at all. However, when it comes to distributed main memory databasesystems, the distributed commit process is still very slow since the disk logging at several sites has to precede the transaction commit. In this paper, we re-evaluate various distributed commit protocols and come up with a causal commit protocol suitable for distributed main memory databasesystems. To evaluate the performance of the proposed commit protocol, extensive simulation study has been performed. The simulation results confirm that the new protocol greatly reduces the time to commit the distributed transactions without any consistency problem.
In a distributed real-time database system (DRTDBS), a commit protocol is required to ensure transaction failure atomicity, If data conflicts occur between executing and committing transactions, the performance of the...
详细信息
In a distributed real-time database system (DRTDBS), a commit protocol is required to ensure transaction failure atomicity, If data conflicts occur between executing and committing transactions, the performance of the system may be greatly affected, In this paper, we propose a new protocol, called deadline-driven conflict resolution (DDCR), which integrates concurrency control and transaction commitment management for resolving executing and committing data conflicts amongst firm real-time transactions, With the DDCR, a higher degree of concurrency can be achieved, as many data conflicts of such kind can be alleviated, and executing transactions can access data items which are being held by committing transactions in conflicting modes, Also, the impact of temporary failures which occurred during the commitment of a transaction on other transactions, and the dependencies created due to sharing of data items is much reduced by reversing the dependencies between the transactions, A simulation model has been developed and extensive simulation experiments have been performed to compare the performance of the DDCR with other protocols such as the Opt [1], the Healthy-Opt [2], and the base protocol, which use priority inheritance and blocking to resolve the data conflicts, The simulation results show that the DDCR can significantly improve the system performance under different workload and workload distributions. Its performance is consistently better than the base protocol and the Opt protocols in both main-memory resident and disk-resident DRTDBS.
Providing the ability to elastically use more or fewer servers on demand (scale out and scale in) as the load varies is essential for database management systems (DBMSes) deployed on today's distributed computing ...
详细信息
Providing the ability to elastically use more or fewer servers on demand (scale out and scale in) as the load varies is essential for database management systems (DBMSes) deployed on today's distributed computing platforms, such as the cloud. This requires solving the problem of dynamic (online) data placement, which has so far been addressed only for workloads where all transactions are local to one sever. In DBMSes where ACID transactions can access more than one partition, distributed transactions represent a major performance bottleneck. Scaling out and spreading data across a larger number of servers does not necessarily result in a linear increase in the overall system throughput, because transactions that used to access only one server may become distributed. In this paper we present Accordion, a dynamic data placement system for partition-based DBMSes that support ACID transactions (local or distributed). It does so by explicitly considering the affinity between partitions, which indicates the frequency in which they are accessed together by the same transactions. Accordion estimates the capacity of a server by explicitly considering the impact of distributed transactions and affinity on the maximum throughput of the server. It then integrates this estimation in a mixed-integer linear program to explore the space of possible configurations and decide whether to scale out. We implemented Accordion and evaluated it using H-Store, a shared-nothing in-memory DBMS. Our results using the TPC-C and YCSB benchmarks show that Accordion achieves benefits compared to alternative heuristics of up to an order of magnitude reduction in the number of servers used and in the amount of data migrated.
This paper addresses a distributed approach for medical image databasesystems and its implementation. Compared with a centralized approach, a distributed strategy has the advantage of fault-tolerance, ease of integra...
详细信息
ISBN:
(纸本)0818654708
This paper addresses a distributed approach for medical image databasesystems and its implementation. Compared with a centralized approach, a distributed strategy has the advantage of fault-tolerance, ease of integration, lower network traffic and faster system response. Various practical aspects of the system design with respect to data storage hierarchy, image format, system communication and resource sharing are discussed. An implementation example which incorporates cardiac MR, CT and Nuclear Medicine imaging systems is presented. The system is based on a Novell and TC/PIP local area network. It has also been further integrated into a Hospital Information System which controls the patient registration and resource allocation.
暂无评论