Responsibility Analysis for Lineages of Conjunctive Queries with Inequalities
Abstract
This paper investigates the problem of efficiently computing responsibility for lineages of conjunctive
queries with inequalities on databases. We classify the lineages of a class of queries with inequalities,
called IQ queries, into path and composite lineages. We first compile path lineages into lineage graphs
and transform lineage graphs into matrices. Then we reduce the problem of computing responsibility for
path lineages to the shortest path problem, which can be solved by the dynamic programming algorithm
in PTIME. We further prove composite lineages can be decomposed into path lineages for computing
responsibility. Thus, our first main result shows it is in PTIME to compute responsibility for lineages of IQ
queries. We generalize the previous results on dichotomy of responsibility analysis for lineages of
conjunctive queries with equalities, now in the presence of inequalities. After decomposing composite
lineages into path lineages, the data population needed for computing responsibility decreases more
than one order of magnitude. Thus, our algorithm can efficiently compute responsibility for composite
lineages. In order to compute responsibility for lineages in general, we introduce a greedy algorithm,
consisting of a reduction to the set cover problem. Finally, we demonstrate the benefits of the proposed
algorithms with extensive experimental results.
Existing system
This paper investigates the problem of efficiently computing responsibility for lineages of conjunctive
queries with inequalities on databases. We classify the lineages of a class of queries with inequalities,
called IQ queries, into path and composite lineages. We first compile path lineages into lineage graphs
and transform lineage graphs into matrices. Then we reduce the problem of computing responsibility for
path lineages to the shortest path problem, which can be solved by the dynamic programming algorithm
in PTIME.
Proposed system
We further prove composite lineages can be decomposed into path lineages for computing
responsibility. Thus, our first main result shows it is in PTIME to compute responsibility for lineages of IQ
queries. We generalize the previous results on dichotomy of responsibility analysis for lineages of
conjunctive queries with equalities, now in the presence of inequalities. After decomposing composite
lineages into path lineages, the data population needed for computing responsibility decreases more
than one order of magnitude. Thus, our algorithm can efficiently compute responsibility for composite
Further Details Contact: A Vinay 9030333433, 08772261612
Email: takeoffstudentprojects@gmail.com | www.takeoffprojects.com
lineages. In order to compute responsibility for lineages in general, we introduce a greedy algorithm,
consisting of a reduction to the set cover problem. Finally, we demonstrate the benefits of the proposed
algorithms with extensive experimental results.
SYSTEM CONFIGURATION:HARDWARE CONFIGURATION: Processor
 Speed
-
Pentium –IV
1.1 Ghz
 RAM
-
256 MB(min)
 Hard Disk
-
20 GB
 Key Board
-
Standard Windows Keyboard
 Mouse
-
 Monitor
Two or Three Button Mouse
-
SVGA
SOFTWARE CONFIGURATION:-
 Operating System
: Windows XP
 Programming Language
: JAVA
 Java Version
: JDK 1.6 & above.
Further Details Contact: A Vinay 9030333433, 08772261612
Email: takeoffstudentprojects@gmail.com | www.takeoffprojects.com