NDLI: Responsibility Analysis for Lineages of Conjunctive Queries with Inequalities

Content Provider	IEEE Xplore Digital Library
Author	Biao Qin Shan Wang Xiaofang Zhou Xiaoyong Du
Copyright Year	1989
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.
Sponsorship	IEEE IEEE Comput. Soc. Tech. Committee on Data Eng IEEE Computer Society
Starting Page	1532
Ending Page	1543
Page Count	12
File Size	1453619
File Format	PDF
ISSN	10414347
Volume Number	26
Issue Number	6
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Databases Algorithm design and analysis Heuristic algorithms Dynamic programming Equations Linear matrix inequalities Shortest path problem greedy algorithm Lineage responsibility conjunctive queries with inequalities dynamic programming algorithm
Content Type	Text
Resource Type	Article
Subject	Information Systems Computational Theory and Mathematics Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Quantization of FIR filters under a total integer cost constraint

Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons

Alphabet Partitioning Techniques for Semiadaptive Huffman Coding of Large Alphabets

Shortest Path Tree Computation in Dynamic Graphs

Race Logic: Abusing Hardware Race Conditions to Perform Useful Computation

Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms

Regular Queries on Graph Databases

Dynamic Shortest Path Algorithms for Hypergraphs

An efficient algorithm to find next-to-shortest path on permutation graphs

Responsibility Analysis for Lineages of Conjunctive Queries with Inequalities

Similar Documents

Quantization of FIR filters under a total integer cost constraint

Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons

Alphabet Partitioning Techniques for Semiadaptive Huffman Coding of Large Alphabets

Shortest Path Tree Computation in Dynamic Graphs

Race Logic: Abusing Hardware Race Conditions to Perform Useful Computation

Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms

Regular Queries on Graph Databases

Dynamic Shortest Path Algorithms for Hypergraphs

An efficient algorithm to find next-to-shortest path on permutation graphs

Responsibility Analysis for Lineages of Conjunctive Queries with Inequalities