Checking chase termination cyclicity analysis and rewriting techniques +91-9994232214,8144199666, ieeeprojectchennai@gmail.com, www.projectsieee.com, www.ieee-projects-chennai.com IEEE PROJECTS 2015-2016 ----------------------------------- Contact:+91-9994232214,+91-8144199666 Email:ieeeprojectchennai@gmail.com Support: ------------- Projects Code Documentation PPT Projects Video File Projects Explanation Teamviewer Support

1. Checking Chase Termination: Cyclicity Analysis and Rewriting
Techniques
Abstract:
The aim of this paper is to present more general criteria and techniques for
chase termination. We first present extensions of the well-known
stratification criterion and introduce a new criterion, called local
stratification, which generalizes both super-weak acyclicity and
stratification-based criteria (including the class of constraints which are
inductively restricted). Next, the paper presents a rewriting algorithm
transforming the original set of constraints S into an “equivalent” set Sa
and verifying the structural properties for chase termination on Sa. The
rewriting of constraints allows us to recognize larger classes of constraints
for which chase termination is guaranteed. In particular, we show that if S
satisfies chase termination conditions T , then the rewritten set Sa satisfies
T as well, but the vice versa is not true, that is there are significant classes
of constraints for which Sa satisfies T and S does not. A more general
rewriting algorithm producing as output an equivalent set of dependencies
and a Boolean value stating whether a sort of cyclicity has been detected is
also proposed. The new rewriting technique and the checking of acyclicity
allow us to introduce the class of acyclic constraints, which generalizes

2. local stratification and guarantees that all chase sequences are finite with a
length polynomial in the size of the input database.
Existing System:
The problem recently investigated, known as chase termination, consists in
the identification of sufficient conditions, based on structural properties of
the input set of constraints, guaranteeing that the chase fix point
terminates, independently from the database instance. Several criteria for
chase termination have been defined.
Proposed System:
Despite recent efforts and the growing interest in the management of
inconsistent data and use of the chase algorithm for the repair of
inconsistent data and the computation of consistent answers to queries,
there are still large classes of constraints for which the chase is not
applicable as termination cannot be statically established.
Thus, the aim of this work is the definition of more general criteria and
techniques for checking chase termination.
Hardware Requirements:
• System : Pentium IV 2.4 GHz.
• Hard Disk : 40 GB.

3. • Floppy Drive : 1.44 Mb.
• Monitor : 15 VGA Colour.
• Mouse : Logitech.
• RAM : 256 Mb.
Software Requirements:
• Operating system : - Windows XP.
• Front End : - JSP
• Back End : - SQL Server
Software Requirements:
• Operating system : - Windows XP.
• Front End : - .Net
• Back End : - SQL Server