Summary form only given. Four aspects of information security on database systems are discussed: confidentiality (ensuring information is not subject to unauthorized disclosure); integrity (ensuring information is not...
详细信息
Summary form only given. Four aspects of information security on database systems are discussed: confidentiality (ensuring information is not subject to unauthorized disclosure); integrity (ensuring information is not subject to unauthorized and undetected modification); inference (ensuring information cannot be deduced from observable); and authentication (ensuring that the invokee of the message knows the invoker's identity). These four aspects specific to distributed database systems are discussed for both message in the communication channel and data in the distributed databases.< >
Electronic Health Records (EHRs) are aggregated, combined and analyzed for suitable treatment planning and safe therapeutic procedures of patients. Integrated EHRs facilitate the examination, diagnosis and treatment o...
详细信息
Electronic Health Records (EHRs) are aggregated, combined and analyzed for suitable treatment planning and safe therapeutic procedures of patients. Integrated EHRs facilitate the examination, diagnosis and treatment of diseases. However, the existing EHRs models are centralized. There are several obstacles that limit the proliferation of centralized EHRs, such as data size, privacy and data ownership consideration. In this paper, we propose a novel methodology and algorithm to handle the mining of distributed medical data sources at different sites (hospitals and clinics) using Association Rules. These medical data resources cannot be moved to other network sites. Therefore, the desired global computation must be decomposed into local computations to match the distribution of data across the network. The capability to decompose computations must be general enough to handle different distributions of data and different participating nodes in each instance of the global computation. In the proposed methodology, each distributed data source is represented by an agent. The global association rule computation is then performed by the agent either exchanging some minimal summaries with other agents or travelling to all the sites and performing local tasks that can be done at each local site. The objective is to perform global tasks with a minimum of communication or travel by participating agents across the network, this will preserve the privacy and the security of the local data. The proposed association rule mining methodology will be used for heart disease prediction using real heart disease data. These real data exist at different clinics and cannot be moved to a central site. The proposed model protects the patient data privacy and achieves the same results as if the data are moved and joined at a central site. We also validate the extracted association rules from all the data providers using an independent test datasets.
An optimistic scheme, called ODL, that uses dummy locks to test the validity of a transaction for concurrency control in distributed database systems is suggested. The dummy locks are long-term locks; however, they do...
详细信息
An optimistic scheme, called ODL, that uses dummy locks to test the validity of a transaction for concurrency control in distributed database systems is suggested. The dummy locks are long-term locks; however, they do not conflict with any other lock. By the use of long-term dummy locks, the need for the information about the write sets of validated transactions is eliminated, and during the validation test only the related sites are checked. Also, the transactions to be aborted are immediately recognized before the validation test, and therefore the cost of restarts is reduced. The usual read and write locks are used as short-term locks during the validation test. This use of short-term locks eliminates the need for the systemwide critical section and results in a distributed and parallel validation test.< >
Query caching has been utilized efficiently to improve query processing in distributed database environments. Most prior caching techniques are based on single-level caching of previous query results. This is basicall...
详细信息
Query caching has been utilized efficiently to improve query processing in distributed database environments. Most prior caching techniques are based on single-level caching of previous query results. This is basically to avoid accessing the underlying databases each time a user submits the same query. In this paper, we propose a new methodology that allows caching a combination of both plans and results of prior queries in a multi-level caching architecture. The objective is to reduce the response time of distributed query processing and hence increase the system throughput.
Specialization and generalization are complementary concepts of inheritance. The authors illustrate the use of these concepts in intelligent SQL to model complex real-world relationships, as well as to present a globa...
详细信息
Specialization and generalization are complementary concepts of inheritance. The authors illustrate the use of these concepts in intelligent SQL to model complex real-world relationships, as well as to present a global view of data, through bottom-up integration of existing, heterogeneous SQL databases. Intelligent SQL is the access language for an intelligent database engine under development.< >
The process of allocating fragments into the appropriate sites is a crucial step in the design of Peerto- Peer distributed databases. Accessibility of data influences the Quality of Service for requests. This paper pr...
详细信息
ISBN:
(纸本)9781634396226
The process of allocating fragments into the appropriate sites is a crucial step in the design of Peerto- Peer distributed databases. Accessibility of data influences the Quality of Service for requests. This paper proposes a methodology for fragment reallocation by using Hungarian Assignment algorithm of optimization principle. The objective of the work is to reduce the number of un-successful queries that are forwarded to other sites of the network. The results show that re-allocation of fragments to suitable sites cause significant part in the communication cost while transaction.
In this paper, we propose an Enhanced *** et al.'s Scheme (EMHS) for privacy-preserving association rules mining on horizontally distributed databases. EMHS is based on the *** et al.'s Scheme (MHS) proposed i...
详细信息
In this paper, we propose an Enhanced *** et al.'s Scheme (EMHS) for privacy-preserving association rules mining on horizontally distributed databases. EMHS is based on the *** et al.'s Scheme (MHS) proposed in 2008 and improves privacy and performance when increasing the number of sites. EMHS uses two servers, Initiator and Combiner, combined with MFI approach to generate candidate set and homomorphic Paillier cryptosystem to compute global supports. Experimental results show that the performance of EMHS is better than MHS in specific databases when increasing the number of sites. A second scheme is also proposed for the other databases.
A checkpointing algorithm is presented that does not interfere with transaction processing. The correctness of the algorithm is shown, and the robustness of the algorithm and the recovery procedures associated with it...
详细信息
A checkpointing algorithm is presented that does not interfere with transaction processing. The correctness of the algorithm is shown, and the robustness of the algorithm and the recovery procedures associated with it are discussed. The algorithm provides a practical solution to the problem of checkpointing and recovery in distributed database systems.< >
Deferred updates propagation enhances update performance and reduces transaction response time for software-based replication in distributed databases. However, it may also result in concurrency anomalies if not handl...
详细信息
Deferred updates propagation enhances update performance and reduces transaction response time for software-based replication in distributed databases. However, it may also result in concurrency anomalies if not handled properly. In this paper, we investigate the replication models and propose one vector-based atomic broadcast protocol for deferred updates, which is superior to the global sequencer-based atomic broadcast protocol in robustness and efficiency. The strategy for dealing with the processing of the deferred updates and the strategy for determining the establishment of update stability are put forward. Two practical examples are also given to further exemplify the main ideas. Finally, the reach of consensus through group communication is discussed in brief. With the new approach, group members can detect and recover from communication failures and establish update stability. The research results are beneficial to other similar projects.
暂无评论