On Bounded Database Schemes and Bounded Horn-Clause Programs

DOI10.1137/0217001MaRDI QIDQ3777438zbMATH OpenOpenAlexFDO

Authors Yehoshua Sagiv

Publication date 1988

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0217001

zbMATH Keywords

first-order logicHorn-clause programsimplicational dependencieslossless database schemenonrecursive programqueryrelational algebrarepresentative instancetableau mapping

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Data structures (68P05) Information storage and retrieval of data (68P20) Abstract data types; algebraic specification (68Q65)

Recommendations

• On characterizing boundedness of database schemes with bounded dependencies
• Undecidable boundedness problems for datalog programs
• A class of bounded functions, a database language and an extended lambda calculus
• scientific article; zbMATH DE number 219219
• scientific article; zbMATH DE number 2090546
• Containment of monadic Datalog programs via bounded clique-width
• On bounded query machines
• On generating database schemes bounded or constant-time-maintainable by extensibility
• A declarative extension of horn clauses, and its significance for Datalog and its applications

Cited in

(5)

• Systolic algorithms for computational geometry problems - a survey
• On characterizing boundedness of database schemes with bounded dependencies
• Horn clause queries and generalizations
• scientific article; zbMATH DE number 4058918 (Why is no real title available?)
• scientific article; zbMATH DE number 4080889 (Why is no real title available?)

This page was built for publication: On Bounded Database Schemes and Bounded Horn-Clause Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777438)