A Rule-Based Approach to Analyzing Database Schema Objects with Datalog

September 15, 2017 Β· Declared Dead Β· πŸ› International Workshop/Symposium on Logic-based Program Synthesis and Transformation

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Christiane Engels, Andreas Behrend, Stefan Brass arXiv ID 1709.05376 Category cs.PL: Programming Languages Cross-listed cs.DB, cs.LO Citations 5 Venue International Workshop/Symposium on Logic-based Program Synthesis and Transformation Last Checked 3 months ago
Abstract
Database schema elements such as tables, views, triggers and functions are typically defined with many interrelationships. In order to support database users in understanding a given schema, a rule-based approach for analyzing the respective dependencies is proposed using Datalog expressions. We show that many interesting properties of schema elements can be systematically determined this way. The expressiveness of the proposed analysis is exemplarily shown with the problem of computing induced functional dependencies for derived relations. The propagation of functional dependencies plays an important role in data integration and query optimization but represents an undecidable problem in general. And yet, our rule-based analysis covers all relational operators as well as linear recursive expressions in a systematic way showing the depth of analysis possible by our proposal. The analysis of functional dependencies is well-integrated in a uniform approach to analyzing dependencies between schema elements in general.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Programming Languages

Died the same way β€” πŸ‘» Ghosted