Skip to main content
SpringerLink
Log in

Evolution of Intelligent Database Systems: A Personal Perspective

  • Conference paper
Book cover Incompleteness and Uncertainty in Information Systems

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

With the need driven by next-generation applications such as computer aided design, VLSI, satellite image data analysis, genomic databases, there has been considerable research into extending databases into knowledge-bases. One approach to knowledge-bases that has evolved from database research is based on deductive databases. (See Ceri, et. al. [8] and Ullman [40, 41] for excellent introductions to the subject. See Ceri, et. al. [7] for a quick informal introduction and a discussion of the fundamental concepts needed.) Deductive databases represent a significant extension to the more traditional relational databases in bringing in important concepts of rule based programming, modular development, and recursion from the field of logic programming. In terms of expressive power alone, deductive databases constitute a non-trivial extension to relational databases. The following example illustrates the basic concepts in deductive databases.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, P. Kanellakis, and G. Grahne. On the representation and querying of sets of possible worlds. Theoretical Computer Science, 78: 159–187, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  2. J. Biskup. A foundation of codd’s relational maybe operations. ACM Transactions on Database Systems, 8, 4:608–636., Dec. 1983.

    Google Scholar 

  3. A.J. Bonner, L.T. McCarty, and K. Vadaparty. Expressing database queries with intuitionistic logic. In Proc. North American Conf. on Logic Programming, October 1989.

    Google Scholar 

  4. A.J. Bonner. A logic for hypothetical reasoning. Technical Report DCSTR-230,Rutgers University, March 1991. (Preliminary version appeared in Proc. AAAI 1987.).

    Google Scholar 

  5. F. Bancilhon and R. Ramakrishnan. An amateur’s introduction to recursive query-processing strategies. In Proc. ACM SIGMOD International Conference on Management of Data, pages 16–52, 1986.

    Google Scholar 

  6. U.S. Chakravarthy, J. Grant, and J. Minker. Logic based approach to semantic query optimization. ACM Trans. on Database Systems, pages 162–207, June 1990.

    Google Scholar 

  7. S. Ceri, G. Gottlob, and L. Tanca. What you always wanted to know about datalog (and never dared to ask. IEEE Transactions on Knowledge and Data Engineering, 1 (1), March 1989.

    Google Scholar 

  8. S. Ceri, G. Gottlob, and L. Tanca. Logic programming and Databases. Berlin, New York: Springer-Verlag, c1990, 1990.

    Google Scholar 

  9. D.et al. Chimenti. The ldl system prototype. IEEE Trans. on Knowledge and Data Eng., 2 (1): 76–90, 1989.

    Google Scholar 

  10. W. Chen, M. Kifer, and D. S. Warren. A foundation for higher-order logic programming. Technical report, SUNY at Stony Brook, 1990.

    Google Scholar 

  11. E.F. Codd. Further normalization of the database relational model. In R. Rustin, editor, Database Systems, pages 33–64, Englewood Cliffs, NJ, 1972. Prentice Hall.

    Google Scholar 

  12. R. Demolombe and L.F.D. Cerro. An algebraic evaluation method for deduction in incomplete data bases. Journal of Logic Programming, 5: 183–205, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  13. Fangqing Dong and Laks V. S. Lakshmanan. Modeling deductive databases with incomplete information. In Proc. Workshop on Formal Methods in Databases and Software Engineering Montreal, Quebec, May 1992. Springer Verlag, London.

    Google Scholar 

  14. Fangqing Dong and Laks V. S. Lakshmanan. Deductive databases with incomplete information. In Joint Int. Conf. and Symp. on Logic Programming, Washington, D.C., Nov 1992. (extended version available as Technical Report, Concordia University, Montreal, 1993 ).

    Google Scholar 

  15. Fangqing Dong and Laks V. S. Lakshmanan. A deductive approach to hypothetical query answering. In Int. Symp. on Logic Programming, Van Couver, BC, Oct. 1993.

    Google Scholar 

  16. Fangqing Dong and Laks V.S. Lakshmanan. Intuitionistic interpretation of deductive databases with incomplete information. Theoretical Computer Science, October 1994. to appear.

    Google Scholar 

  17. L. Giordano and A. Martelli. Structuring logic programs: A modal approach, 1994.

    Google Scholar 

  18. G. G. Hillebrand, H. G. Mairson, and M. Y. Vardi. Tools for datalog boundedness. In Proc. ACM Symp. PODS, pages 1–12, 1991.

    Google Scholar 

  19. T. Imielinski and W. Lipski. Incomplete information in relational databases. Journal of the ACM, 31 (4), October 1984.

    Google Scholar 

  20. V.S. Lakshmanan. Query evaluation with null values: How complex is completeness? In Proc. 9th Int. Conf. Foundations of Software Technology and Theoretical Computer Science Bangalore, India, Dec. 1989. Lecture Notes in Computer Science, vol. 405, pp. 204–222.

    Google Scholar 

  21. V.S. Laks Lakshmanan, editor. ILPS Workshop on Deductive Databases,San Diego, CA, October 1991. in conjunction with Int. Logic Programming Symposium.

    Google Scholar 

  22. Laks V. S. Lakshmanan and Fangqing Dong. On the power of deductive databases with null values. Technical report, Concordia University, Montreal, Canada, July 1993.

    Google Scholar 

  23. W. Lipski. On semantic issues connected with incomplete information databases. ACM Transactions on Database Systems, 4 (3), Sept 1979.

    Google Scholar 

  24. Y. Liu. Null values in definite programs. In Proc. North American Conf. on Logic Programming, pages 273–288, Austin, TX, Nov. 1990.

    Google Scholar 

  25. L.V.S. Lakshmanan, Ashraf Karima, and Han Jiawei. Homomorphic tree embeddings and their applications to recursive program optimization. In Eight Annual IEEE Symposium on Logic in Computer Science, pages 344353, 1993.

    Google Scholar 

  26. D. Miller. A logical analysis of modules in logic programming. Journal of Logic Programming, pages 79–108., 1989.

    Google Scholar 

  27. Inderpal Singh Mumick, editor. ACM SIGMOD Workshop on Combining Declarative and Object-Oriented Databases Washington, DC, May 1993. in cooperation with ACM SIGMOD.

    Google Scholar 

  28. K. Morris, J.D. Ullman, and A. Van Gelder. Design overview of the nail! system. In Proc. 3rd Int. Conf. on Logic Programming, pages 554–568, 1986.

    Google Scholar 

  29. J. Naughton and R. Ramakrishnan. Bottom-up evaluation of logic programs. Journal of Logic Programming, 1992.

    Google Scholar 

  30. G. Phipps, M. Derr, and K.A. Ross. Gluenail: A deductive database system. In Proc. ACM-SIGMOD Int. Conf. on Management of Data, 1991.

    Google Scholar 

  31. R. Ramakrishnan, editor. ILPS Workshop on Programming with Logic Databases, Vancouver, BC, October 1993. in conjunction with Int. Logic Programming Symposium.

    Google Scholar 

  32. R. Reiter. On closed world databases. In H. Gallaire and J. Minker, editors, Logic and Databases, pages 55–76. Plenum Press, 1978.

    Google Scholar 

  33. R. Reiter. Towards a logical reconstruction of relational database theory. In M. L. Brodie, J. Myoploulos, and J. W. Schmidt, editors, On Conceptual Modelling. Springer-Verlag, New York, 1984.

    Google Scholar 

  34. R. Reiter. A sound and sometimes complete query evaluation algorithm for relational databases with null values. Journal of the ACM, 33: 349–370, April 1986.

    Article  MathSciNet  Google Scholar 

  35. R. Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32: 57–95, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  36. K. Ramamohanarao, J. Harland, and G. Dong, editors. JICSLP Workshop on Deductive Databases Washington, DC, November 1992. in conjunction with Joint Int. Conf. and Symp. on Logic Programming.

    Google Scholar 

  37. R. Ramakrishnan, D. Srivastava, and S. Sudarshan. Coral: Control, relations, and logic. In Proc. Int. Conf. on Very Large Databases, 1992.

    Google Scholar 

  38. R. Ramakrishnan, Y. Sagiv, J. D. Ullman, and M. Vardi. Proof-tree transformation theorems and their applications. In Proc. 8TH ACM Symp. PODS, pages 172–181, 1989.

    Google Scholar 

  39. Tsur S. Deductive databases in action. In ACM Principles of Databases Systems, pages 142–153, 1991.

    Google Scholar 

  40. J. D. Ullman. Principles of Database and Knowledge-Base Systems, volume I. Computer Science Press, Maryland, 1989.

    Google Scholar 

  41. J. D. Ullman. Principles of Database and Knowledge-Base Systems, volume II. Computer Science Press, Maryland, 1989.

    Google Scholar 

  42. M. Y. Vardi. Querying logical databases. In Proceedings of the Fourth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pages 57–65, 1985.

    Chapter  Google Scholar 

  43. J. Vaghani, K. Ramamohanarao, D.B. Kemp, Z. Somogyi, and P.J. Stuckey. Design overview of the Aditi deductive database system. In Proc. IEEE Int. Conf. on Data Engineering, Kobe, Japan, April 1991.

    Google Scholar 

  44. C. Zaniolo. Database relations with null values. Journal of Computer and System Sciences, 28: 142–166, 1984.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Concordia University, Montreal, Canada

    Laks V. S. Lakshmanan

Authors
  1. Laks V. S. Lakshmanan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Concordia University, 1455 de Maisonneuve Blvd. West, Montreal, Quebec, H3G 1M8, Canada

    V. S. Alagar PhD , S. Bergler PhD  & F. Q. Dong PhD ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1994 British Computer Society

About this paper

Cite this paper

Lakshmanan, L.V.S. (1994). Evolution of Intelligent Database Systems: A Personal Perspective. In: Alagar, V.S., Bergler, S., Dong, F.Q. (eds) Incompleteness and Uncertainty in Information Systems. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3242-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3242-4_15

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19897-0

  • Online ISBN: 978-1-4471-3242-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation