Safety of datalog queries over infinite databases
- 29 March 1989
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 160-171
- https://doi.org/10.1145/73721.73738
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- SYGRAF: implementing logic programs in a database styleIEEE Transactions on Software Engineering, 1988
- A framework for testing safety and effective computability of extended datalogPublished by Association for Computing Machinery (ACM) ,1988
- Data functions, datalog and negationPublished by Association for Computing Machinery (ACM) ,1988
- ON SAFETY, DOMAIN INDEPENDENCE, AND CAPTURABILITY OF DATABASE QUERIES* (Preliminary Report)*Research sponsored in part by the NSF grant DCR-8603676.Published by Elsevier ,1988
- Implementation of logical query languages for databasesACM Transactions on Database Systems, 1985
- On computing restricted projections of representative instancesPublished by Association for Computing Machinery (ACM) ,1985
- On the foundations of the universal relation modelACM Transactions on Database Systems, 1984
- On compiling queries in recursive first-order databasesJournal of the ACM, 1984
- Weakly Definable Relations and Special AutomataPublished by Elsevier ,1970
- Generalized finite automata theory with an application to a decision problem of second-order logicTheory of Computing Systems, 1968