Computing infinite relations using finite expressions: A new approach to the safety issue in relational databases
Commonly used methods to deal with the safety issue in relational databases are based on “placing constraint of finiteness” on relational calculus. This paper describes how safety can be achieved using a novel approach. A new representation is created to denote the relations defined by relational calculus. An algorithm which can symbolically handle infinite relations is designed to efficiently compute all these relations. Therefore the constraint of finiteness on relational calculus can be removed.
Unable to display preview. Download preview PDF.
- 1.C. Beeri, S. Naqvi, R. Ramakrishnan, O. shmueli, and S. Tsur: Sets and negation in a logic database language(LDL1). Proc. Sixth ACM Symp. on Principles of Database Systems, pp. 21–37, 1987Google Scholar
- 2.A. V. Gelder and W. R. Topor: Safety and correct translation of relational calculus formulas. Proc. sixth ACM Symp. on Principles of Database Systems, pp.313–327, 1987Google Scholar
- 3.G. M. Kuper G. M.: Logic programming with sets. Proc. sixth ACM Symp. on Principles of Database Systems, pp.11–20, 1987Google Scholar
- 4.R. Ramakrishnan, F. Bancilhon, and A. Sillberschatz: Safety of recursive Horn clauses with infinite relations. Proc. sixth ACM Symp. on Principles of Database Systems, pp. 328–339, 1987Google Scholar
- 5.O. Shmuel: Decidability and Expressiveness aspects of logic queries. Proc. sixth ACM Symp. on Principles of Database Systems, pp. 237–249Google Scholar
- 6.J. D. Ullmman: Database and Knowledge-base Systems vol. 1, Classical Database Systems, Computer-Science Press, 1988Google Scholar
- 7.C. Zaniolo: Safety and Compilation of Nonrecursive Horn ClausesProc. First Intl. Conf. on Expert Database Systems, BenjaminCummings, Menlo Park, CA, 1986Google Scholar