The VLDB Journal

, Volume 3, Issue 2, pp 107–122

An introduction to deductive database languages and systems

  • Kotagiri Ramamohanarao
  • James Harland
Special Issue on Prototypes of Deductive Database Systems

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S. and Grumbach, S. A rule-based language with functions and sets.ACM Transactions on Database Systems, 16(1):1–30, 1991.Google Scholar
  2. Apt, K.R., Blair, H., and Walker, A. Towards a theory of declarative knowledge. In: Minker, J., ed.,Foundations of Deductive Databases and Logic Programming Los Altos: Morgan Kaufmann, 1988, pp. 89–144.Google Scholar
  3. Balbin, I., Kemp. D., Meenakshi, K., and Ramamohanarao, K. Propagating constraints in recursive deductive databases.Proceedings of the North American Conference on Logic Programming, Cleveland, OH, 1989.Google Scholar
  4. Balbin, I., Port, G., Ramamohanarao, K., and Meenakshi, K. Efficient bottom-up computation of queries on stratified databases.Journal of Logic Programming, 11:295–345, 1991.Google Scholar
  5. Bancilhon, F., Maier, D., Sagiv, Y., and Ullman, J. Magic sets and other strange ways to implement logic programs.Proceedings of the ACM Symposium on the Principles of Database Systems, Cambridge, 1986.Google Scholar
  6. Bancilhon, F. and Ramakrishnan, R. Performance evaluation of data intensive logic programs/ In: Minker, J., ed.,Foundations of Deductive Databases and Logic Programming, Los Altos: Morgan Kaufmann, 1988.Google Scholar
  7. Beeri, C. and Ramakrishnan, R. On the power of magic.Proceedings of the ACM Symposium on the Principles of Database Systems, San Diego, CA, 1987.Google Scholar
  8. Bocca, J. MegaLog: A platform for developing knowledge base management systems.Proceedings of the Second International Symposium on Database Systems for Advanced Applications, Tokyo, 1991.Google Scholar
  9. Chandra, A. and Harel, D. Horn clause querles and generalizations.Journal of Logic Programming, 2(1):1–15, 1985.Google Scholar
  10. Consens, M. and Mendelzon, A. Hy: A hygraph-based query and visualization system.Proceedings of the ACM SIGMOD Annual Conference on Management of Data, Washington, DC, 1993.Google Scholar
  11. Clark, K. Negation as failure. In: Gallaire, H. and Minker, J., eds.Logic and Databases, New York: Plenum Press, 1978.Google Scholar
  12. Dietrich, S. Extension tables: Memo relations in logic programming.Proceedings of the Symposium on Logic Programming, San Francisco, 1987.Google Scholar
  13. Freeston, M. Advances in the design of the BANG file.Proceedings of the Third International Conference on the Foundations of Data Organization and Algorithms, Paris, 1989.Google Scholar
  14. Freitag, B., Schütz, H., and Specht, G. LOLA: A logic language for deductive databases and its implementation.Proceedings of the Second International Symposium for Advanced Applications, Tokyo, 1991.Google Scholar
  15. Gardarin, G., Cheiney, J., Kiernan, G., Pastre, D., and Stora, H. Managing complex objects in an extensible relational DBMS.Proceedings of the Fifteenth International Conference on Very Large Databases, Amsterdam, 1989.Google Scholar
  16. Gelfond, M. and Lifschitz, V. The stable model semantics for logic programming.Proceedings of the Fifth International Conference and Symposium on Logic Programming, Seattle, 1988.Google Scholar
  17. Haas, L., Chang, W., Lohman, G., McPherson, J., Wilms, P., Lapis, G., Lindsay, B., Pirahesh, H., Carey, M., and Shekita, E. Starburst mid-flight: As the dust clears.IEEE Transactions on Knowledge and Data Engineering, 2(1):143–160, 1990.Google Scholar
  18. Harland, J. and Ramamohanarao, K. Constraints for query optimisations in deductive databases.Proceedings of the Second Far East Workshop on Future Database Systems, Kyoto, 1992.Google Scholar
  19. Harland, J. and Ramamohanarao, K. Constraint propagation for linear recursive rules.Proceedings of the International Conference on Logic Programming, Budapest, 1993.Google Scholar
  20. Horsfield, T., Bocca, J., and Dahmen, M. MegaLog User Guide, Technical Report, ECRC, Munich, 1989.Google Scholar
  21. Jeusfeld, M. and Staudt, M. Query optimisation in deductive object bases. In: Vossen, G., Freytag, J., and Maier, D., eds.,Query Processing for Advanced Database Applications, Los Altos: Morgan-Kaufmann, 1993.Google Scholar
  22. Kemp, D., Ramamohanarao, R., and Somogyi, Z. Right-, left-, and multi-linear rule transformations that maintain context information,Proceedings of the Sixteenth International Conference on Very Large Data Bases, Brisbane, 1990.Google Scholar
  23. Kemp, D., Srivastava, D., and Stuckey, P. Query restricted bottom-up evaluation of normal programs.Proceedings of the Joint International Conference and Symposium on Logic Programming, Washington DC, 1992.Google Scholar
  24. Kemp, D. and Stuckey, P. Analysis based constraint query optimization.Proceedings of the International Conference on Logic Programming, Budapest, 1993.Google Scholar
  25. LeFebvre, A. and Vieille, L. On deductive query evaluation in the dedgin system.Proceedings of the First International Conference on Deductive and Object-Oriented Databases, Kyoto, 1989.Google Scholar
  26. Lloyd, J.Foundations of Logic Programming, (2nd ed.), Berlin: Springer-Verlag, 1987.Google Scholar
  27. de Maindreville, C. and Simon, E. A. production rule based approach to deductive databases.Proceedings of the Fourth IEEE International Conference on Data Engineering, Los Angeles, 1988.Google Scholar
  28. Moerkotte, G. and Lockemann, P. Reactive consistency control in deductive databases,ACM Transactions on Database Systems, 16(4):670–702, 1991.Google Scholar
  29. Mumick, I. and Pirahesh, H. Implementation of magic-sets in Starburst.Proceedings of the ACM SIGMOD International Conference on the Management of Data, Minneapolis, 1994.Google Scholar
  30. Naqvi, S. and Tsur, S.A. Logical Language for Data and Knowledge Bases. Computer Science Press, 1989.Google Scholar
  31. Przymusinski, T. On the declarative semantics of stratified deductive databases. In: Minker, J., ed.,Foundations of Deductive Databases and Logic Programming, Los Altos: Morgan Kaufmann, 1988, 193–216.Google Scholar
  32. Ramakrishnan, R. and Ullman, J. A. survey of research on deductive database systems.Journal of Logic Programming, in press.Google Scholar
  33. Ramamohanarao, K., Shepherd, J., Balbin, I., Port, G., Naish, L., Thom, J., Zobel, J. and Dart, P. The NU-Prolog deductive database system.IEEE Data Engineering, 10(4):10–19, 1987.Google Scholar
  34. Ross, K. Modular stratification and magic sets for datalog programs with negation.Proceedings of the ACM Symposium on Principles of Database Systems, Nashville, 1990.Google Scholar
  35. Sacca, D. and Zaniolo, C. The generalized counting method for recursive queries,Proceedings of the First International Conference on Database Theory, Rome, 1986.Google Scholar
  36. Sacca, D. and Zaniolo, C. Magic counting methods.Proceedings of the ACM SIGMOD International Conference on Management of Data, Nashville, 1987.Google Scholar
  37. Sagiv, Y. Is there anything better than magic?Proceedings of the North American Conference on Logic Programming, Austin, TX 1990.Google Scholar
  38. Tamaki, H. and Sato, T. OLD resolution with tabulation.Proceedings of the Third International Conference on Logic Programming, London, 1986.Google Scholar
  39. Tärnlund, S.-A. Horn clause computability.BIT, 17:215–226, 1977.Google Scholar
  40. Van Gelder, A., Ross, K., and Schlipf, J. The well-founded semantics for general logic programs.Journal of the ACM, 38(3):620–50, 1991.Google Scholar
  41. Vieille, L. Recursive axioms in deductive databases: The query-subquery approach.Proceedings of the First International Conference on Expert Database Systems, Charleston, SC, 1986.Google Scholar
  42. Vieille, L. Database complete proof procedures based on SLD-resolution.Proceedings of the Fourth International Conference on Logic Programming, Melbourne, Australia, 1987.Google Scholar
  43. Vieille, L. From QSQ towards QoSaQ: Global optimization of recursive queries.Proceedings of the Second International Conference on Expert Database Systems, Tysons Corner, VA, 1988.Google Scholar
  44. Vieille, L. Recursive query processing: The power of logic.Theoretical Computer Science, 69(1):1–53, 1989.Google Scholar
  45. Vieille, L., Bayer, P., Küchenhoff, V., and LeFebvre, A. EKS-V1, a short overview.AAAI-90 Workshop on Knowledge Based Management Systems, 1990.Google Scholar
  46. Warren, D. The XWAML: A machine that integrates Prolog and deductive database query evaluation. Technical Report 89/25, Department of Computer Science, SUNY at Stony Brook, NY, October, 1989.Google Scholar
  47. Warren, D. Memoing for logic programs.Communications of the ACM, 35(3):93–111, 1992.Google Scholar
  48. Zaniolo, C., Arni, N., and Ong, K. Negation and aggregates in recursive rules: The LDL++ approach.Proceedings of the International Conference on Deductive and Object-Oriented Databases, Phoenix, AZ, 1993.Google Scholar
  49. Zobel, J. and Ramamohanarao, K. Accessing existing databases from Prolog technical report 86/17, Department of Computer Science, University of Melbourne, 1986.Google Scholar

Copyright information

© VLDB 1994

Authors and Affiliations

  • Kotagiri Ramamohanarao
  • James Harland

There are no affiliations available

Personalised recommendations