Approximate Interval-Based Temporal Dependencies: The Complexity Landscape

Temporal functional dependencies (TFDs) add valid time to classical functional dependencies (FDs) in order to express data integrity constraints over the flow of time. If the temporal dimension adopted is an interval, we have to deal with interval-based temporal functional dependencies (ITFDs for short), which consider different interval relations between valid times of related tuples. The related approximate problem is when we want to check if our data satisfy, without any constraint for the schema, a given ITFD under a given error threshold 0 ≤ d ≤ 1. This can be rephrased as: given a relation instance r, is it possible to delete at most c · |r| tuples from it in such a way that the resulting instance satisfies the given ITFD? This optimization problem, ITFD-Approx for short, may represent a way to discover (data mining) important dependencies among attribute values in a database as well as a way to control data consistency. In this paper we analyze the complexity of problem ITFD-Approx restricting ourselves to Allen's interval relations: we will see how the complexity of such a problem may significantly change, depending on the considered interval relation.

[1]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[2]  Heikki Mannila,et al.  Algorithms for Inferring Functional Dependencies from Relations , 1994, Data Knowl. Eng..

[3]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[4]  Hannu Toivonen,et al.  TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies , 1999, Comput. J..

[5]  Heikki Mannila,et al.  Approximate Inference of Functional Dependencies from Relations , 1995, Theor. Comput. Sci..

[6]  Heikki Mannila,et al.  On the Complexity of Inferring Functional Dependencies , 1992, Discret. Appl. Math..

[7]  Phokion G. Kolaitis,et al.  Repair checking in inconsistent databases: algorithms and complexity , 2009, ICDT '09.

[8]  Gaëlle Fontaine,et al.  Why is it Hard to Obtain a Dichotomy for Consistent Query Answering? , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[9]  Pietro Sala,et al.  Interval-based temporal functional dependencies: specification and verification , 2013, Annals of Mathematics and Artificial Intelligence.

[10]  Angelo Montanari,et al.  A Uniform Framework for Temporal Functional Dependencies with Multiple Granularities , 2011, SSTD.

[11]  Yde Venema,et al.  A Modal Logic for Chopping Intervals , 1991, J. Log. Comput..

[12]  Jan Chomicki,et al.  Minimal-change integrity maintenance using tuple deletions , 2002, Inf. Comput..

[13]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[14]  llsoo Ahn,et al.  Temporal Databases , 1986, Computer.

[15]  Pietro Sala,et al.  Temporal Functional Dependencies Based on Interval Relations , 2011, 2011 Eighteenth International Symposium on Temporal Representation and Reasoning.

[16]  Laks V. S. Lakshmanan,et al.  On approximating optimum repairs for functional dependency violations , 2009, ICDT '09.

[17]  Hannu Toivonen,et al.  Efficient discovery of functional and approximate dependencies using partitions , 1998, Proceedings 14th International Conference on Data Engineering.

[18]  Sushil Jajodia,et al.  Time Granularities in Databases, Data Mining, and Temporal Reasoning , 2000, Springer Berlin Heidelberg.

[19]  Ronald Fagin,et al.  Database Theory - ICDT 2009, 12th International Conference, St. Petersburg, Russia, March 23-25, 2009, Proceedings , 2009, ICDT.