Mining approximate interval-based temporal dependencies

DOI10.1007/s00236-015-0246-xzbMath1350.68088OpenAlexW1732718201WikidataQ62612980 ScholiaQ62612980MaRDI QIDQ329410

Carlo Combi, Pietro Sala

Publication date: 21 October 2016

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-015-0246-x

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15)

Related Items (1)

Unnamed Item

Uses Software

• TANE

Cites Work

• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• Approximate inference of functional dependencies from relations
• On the complexity of inferring functional dependencies
• Some simplified NP-complete graph problems
• Minimal-change integrity maintenance using tuple deletions
• Interval-based temporal functional dependencies: specification and verification
• Encyclopedia of Database Systems
• Tableaux for Logics of Subinterval Structures over Dense Orderings
• A Modal Logic for Chopping Intervals
• Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies
• Algorithms for inferring functional dependencies from relations
• Complete and Terminating Tableau for the Logic of Proper Subinterval Structures Over Dense Orderings
• Why is it Hard to Obtain a Dichotomy for Consistent Query Answering?
• The Undecidability of the Logic of Subintervals

This page was built for publication: Mining approximate interval-based temporal dependencies