Horizontal partitioning method for test verification in parallel database systems

  title={Horizontal partitioning method for test verification in parallel database systems},
  author={Feras Hanandeh},
  journal={Int. J. Adv. Intell. Paradigms},
  • Feras Hanandeh
  • Published 2017
  • Computer Science
  • Int. J. Adv. Intell. Paradigms
In parallel database systems the partitioning methods considered in current researches are static. This research paper presents a partitioning method to divide the database relations into dynamic horizontal partitions. Every partition contains some tuples of the database relation. These partitions will be checked using the subtests generated from the integrity constraints during the test verification process. Furthermore, the integrity of these partitions will be enforced by the generated… 

Tables from this paper


Simplified approach for generating integrity tests in distributed database systems
A new algorithm to generate simplified integrity tests which could be used to automatically verify that database updates does not introduce any violation of integrity.
Ranking and selecting integrity tests in a distributed database
A technique to rank and to select the suitable test to be evaluated given several alternative tests, which uses the amount of data transferred across the network, the number of sites involved, and the amounts of data accessed as the parameters in deciding the most suitable test.
Automated partitioning design in parallel database systems
This paper presents a partitioning advisor that recommends the best partitioning design for an expected workload and its techniques are deeply integrated with the underlying parallel query optimizer, which results in more accurate recommendations in a shorter amount of time.
Integrity Constraint Enforcement through Transaction Modification
A mechanism for integrity constraint handling based on transaction modification is proposed, which conforms to the complete transaction model, complying with transaction atomicity and serializability.
Design and implementation of an extendible integrity subsystem
A powerful integrrty subsystem, which is implemented in the SABRE database system, is presented, which handles referential dependency and temporal assertions and an efficient method is described for processing assertions involving aggregates.
Constraint optimization for a system of relational databases
This paper proposes architecture for optimizing constraint checking process in distributed databases which exploits techniques of parallelism, compile time constraint checking, localized constraint checking and history of constraint violations and designs an algorithm which acts as a backbone to the architecture.
Advanced Techniques for Efficient Data Integrity Checking
This work develops a procedure aimed at producing incremental checks whose satisfaction guarantees data integrity and extends the applicability of simplification to a number of different contexts, such as recursive databases, concurrent database systems, data integration systems and XML document collections, and provides a performance evaluation of the proposed model.
Clustering-based fragmentation and data replication for flexible query answering in distributed databases
  • L. Wiese
  • Computer Science
    Journal of Cloud Computing
  • 2014
It is shown that the data replication problem can be expressed as a special Bin Packing Problem and can hence be solved by an off-the shelf solver for integer linear programs.
Constraint satisfaction in XML temporal databases
This paper presents a tool that connects the theoretical results to practical considerations, by producing the appropriate static rules in order to address the ramification problem in temporal setting and providing a friendly enviroment which produces the indirect effects after the execution of an xquery in XML temporal databases.
A framework for global constraint checking involving aggregates in multidatabases using granular computing
This paper complements the constraint checker with algorithms for checking global constraints involving aggregates in the presence of updates, which take as input an update statement, a list of global constraints including aggregates, and granulizes each global constraint into sub constraint granules.