2009 | OriginalPaper | Buchkapitel
Spoilt for Choice: Full First-Order Hierarchical Decompositions
verfasst von : Sebastian Link
Erschienen in: Logic, Language, Information and Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Database design aims to find a database schema that permits the efficient processing of common types of queries and updates on future database instances. Full first-order decompositions constitute a large class of database constraints that can provide assistance to the database designer in identifying a suitable database schema.
We establish a finite axiomatisation of full first-order decompositions that reflects best database design practice: an inference engine derives all potential candidates of a database schema, but the final choice remains with the database designer.