Skip to main content
SpringerLink
Log in

The aditi deductive database system

  • Special Issue on Prototypes of Deductive Database Systems
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

Deductive databases generalize relational databases by providing support for recursive views and non-atomic data. Aditi is a deductive system based on the client-server model; it is inherently multi-user and capable of exploiting parallelism on shared-memory multiprocessors. The back-end uses relational technology for efficiency in the management of disk-based data and uses optimization algorithms especially developed for the bottom-up evaluation of logical queries involving recursion. The front-end interacts with the user in a logical language that has more expressive power than relational query languages. We present the structure of Aditi, discuss its components in some detail, and present performance figures.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Balbin, I., Port, G., Ramamohanarao, K., and Meenakshi, K. Efficient bottom-up computation of queries on stratified databases.Journal of Logic Programming, 11(3/4):295–345, 1991.

    Google Scholar 

  • Balbin, I. and Ramamohanarao, K. A generalization of the differential approach to recursive query evaluation.Journal of Logic Programming, 4(3):259–262, 1987.

    Google Scholar 

  • Bancilhon, F., Maier, D., Sagiv, Y., and Ullman, J. Magic sets and other strange ways to implement logic programs.Proceedings of the Fifth Symposium on Principles of Database Systems, Washington, DC, 1986.

  • Beeri, C. and Ramakrishnan, R. On the power of magic.Proceedings of the Sixth ACM Symposium on Principles of Database Systems, San Diego, CA, 1987.

  • 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.

  • Carey, M., DeWitt, D., Richardson, J., and Shekita, E. Object and file management in the EXODUS extensible database system.Proceedings of the Twelfth International Conference on Very Large Databases, Kyoto, Japan, 1986.

  • Chimenti, D., O'Hare, T., Krishnamurthy, R., Naqvi, S., Tsur, S., West, C., and Zaniolo, C. An overview of the LDL system.IEEE Data Engineering, 10(4):52–62, 1987.

    Google Scholar 

  • Freeston, M. Grid files for efficient Prolog clause access. In: Gray, P. and Lucas, R., eds.,Prolog and Databases, Chicester, England: Ellis Horwood, 1988, pp. 188–211.

    Google Scholar 

  • Harland, J., Kemp, D.B., Leask, T.S., Ramamohanarao, K., Shepherd, J.A., Somogyi, Z., Stuckey, P.J., and Vaghani, J. Aditi-Prolog language manual. Technical Report 92/27, Department of Computer Science, University of Melbourne, Australia, November 1992a.

    Google Scholar 

  • Harland, J., Kemp, D.B., Leask, T.S., Ramamohanarao, K., Shepherd, J.A., Somogyi, Z., Stuckey, P.J., and Vaghani, J. Aditi user's guide. Technical Report 92/26, Department of Computer Science, University of Melbourne, Australia, November 1992b.

    Google Scholar 

  • Harland, J. and Ramamohanarao, K. Experiences with a flights database. Technical Report 92/28, Department of Computer Science, University of Melbourne, Australia, 1992.

    Google Scholar 

  • Harland, J. and Ramamohanarao, K. Constraint propagation for linear recursive rules.Proceedings of the Tenth International Conference on Logic Programming, Budapest, Hungary, 1993.

  • Kemp, D.B. and Stuckey, P. Analysis-based constraint query optimization.Proceedings of the the Tenth International Conference on Logic Programming, Budapest, Hungary, 1993.

  • Kemp, D.B., Ramamohanarao, K., Balbin, I., and Meenakshi, K. Propagating constraints in recursive deductive databases.Proceedings of the First North American Conference on Logic Programming, Cleveland, OH, 1989.

  • Kemp, D.B., Ramamohanarao, K., 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, Australia, 1990.

  • Kemp, D.B., Stuckey, P.J., and Srivastava, D. Magic sets and bottom-up evaluation of well-founded models.Proceedings of the 1991 International Logic Programming Symposium, San Diego, CA, 1991.

  • Kemp, D.B., Stuckey, P.J., and Srivastava, D. Query restricted bottom-up evaluation of normal logic programs.Proceedings of the Joint International Conference and Symposium on Logic Programming, Washington, DC, 1992.

  • Knuth, D.E. Sorting and searching. Vol. 3, Chapter 5.4.1,The Art of Computer Programming, Reading, MA: Addison-Wesley, 1973.

    Google Scholar 

  • Leask, T.S., Ramamohanarao, K., and Stuckey, P.J. Exploiting parallelism in bottom-up computation in Aditi.Proceedings of the ILPS Workshop on Deductive Databases, San Diego, CA, 1991.

  • Linderman, J. Theory and practice in the construction of a working sort routine.Bell Laboratories Technical Journal, 63(8(part 2)):1827–1843, 1984.

    Google Scholar 

  • Mohan, C., Haderle, D., Lindsay, B., Pirahesh, H., and Schwarz, P. ARIES: A transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging.ACM Transactions on Database Systems, 17(1):94–162, 1992.

    Google Scholar 

  • Morris, K., Naughton, J.F., Saraiya, Y., Ullman, J.D., and Gelder, A.V. YAWN! (yet another window on NAIL).IEEE Data Engineering, 10(4):28–43, 1987.

    Google Scholar 

  • Morris, K., Ullman, J.D., and Gelder, A.V. Design overview of the NAIL! system.Proceedings of the Third International Conference on Logic Programming, London, 1986.

  • Mumick, I.S., Finkelstein, S.J., Pirahesh, H., and Ramakrishnan, R. Magic conditions.Proceedings of the Ninth Symposium on the Principles of Database Systems, Nashville, TN, 1990.

  • Nakayama, M., Kitsuregawa, M., and Takagi, M. Hash-partitioned join method using dynamic destaging strategy.Proceedings of the Fourteenth Conference on Very Large Databases, Los Angeles, 1988.

  • Naqvi, S. and Tsur, S.A Logical Language for Data and Knowledge Bases. New York: Computer Science Press, 1989.

    Google Scholar 

  • Ousterhout, J.K.Tcl and the Tk Toolkit. Reading, MA: Addison-Wesley Publishers, 1994.

    Google Scholar 

  • Phipps, G., Derr, M., and Ross, K. Glue-Nail: A deductive database system.Proceedings of the Tenth ACM Symposium on Principles of Database Systems, Denver, CO, 1991.

  • Port, G., Balbin, I., and Ramamohanarao, K. A new approach to supplementary magic optimisation.Proceedings of the First Far-East Workshop on Future Database Systems, Melbourne, Australia, 1990.

  • Ramakrishnan, R., Srivastava, D., and Sudarshan, S. Rule ordering in bottom-up fixpoint evaluation of logic programs.Proceedings of the Sixteenth International Conference on Very Large Databases, Brisbane, Australia, 1990.

  • Ramakrishnan, R., Srivastava, D., and Sudarshan, S. CORAL: A deductive database programming language.Proceedings of the Eighteenth International Conference on Very Large Databases, Vancouver, Canada, 1992.

  • Ramamohanarao, K. and Shepherd, J. A superimposed codeword indexing scheme for very large Prolog databases.Proceedings of the Third International Conference on Logic Programming, London, 1986.

  • Ramamohanarao, K. and Shepherd, J. Partial match retrieval for dynamic files using superimposed codeword indexing. In: Balaguruswamy, E. and Sushila, B., eds.,Computer Systems and Applications: Recent Trends. New Dehli, India: McGraw-Hill, 1990.

    Google Scholar 

  • Ramamohanarao, K., Shepherd, J., Balbin, I., Port, G., Naish, L., Thom, J., Zobel, J., and Dart, P. The NU-Prolog deductive database system. In: Gray, P. and Lucas, R., eds.Prolog and Databases, Chicester, England: Ellis Horwood, 1988, pp. 212–250.

    Google Scholar 

  • Sacca, D. and Zaniolo, C. The generalized counting method for recursive logic queries.Proceedings of the International Conference on Database Theory, Rome, 1986.

  • Sacca, D. and Zaniolo, C. Implementation of recursive queries for a data language based on pure horn logic.Proceedings of the Fourth International Conference on Logic Programming, Melbourne, Australia, 1987.

  • Somogyi, Z., Kemp, D.B., Harland, J., and Ramamohanarao, K. Subsumption-free bottom-up evaluation of logic programs with partially instantiated data structures.Proceedings of the Fourth International Conference on Extending Database Technology, Cambridge, England, 1994.

  • Tham, J. Duplicate removal and parallel join algorithms. Technical Report/Honours Report, Department of Computer Science, University of Melbourne, Australia, 1993.

    Google Scholar 

  • Thom, J.A. and Zobel, J.A. NU-Prolog reference manual, Version 1.3. Technical Report, Department of Computer Science, University of Melbourne, Australia, 1988.

    Google Scholar 

  • Ullman, J.D. Implementation of logical query languages for databases.ACM Transactions on Database Systems, 10(3):289–321, 1985.

    Google Scholar 

  • Vaghani, J., Ramamohanarao, K., Kemp, D.B., Somogyi, Z., and Stuckey, P.J. Design overview of the Aditi deductive database system.Proceedings of the Seventh International Conference on Data Engineering, Kobe, Japan, 1991.

  • Vieille, L. Recursive query processing: Fundamental algorithms and the DedGin system. In: Gray, P. and Lucas, R., eds.,Prolog and Databases. Chicester, England: Ellis Horwood, 1988.

    Google Scholar 

  • Vieille, L., Bayer, P., Küchenhoff, V., and Lefebvre, A. EKS-V1: A short overview.Proceedings of the AAAI Workshop on Knowledge Base Systems, Boston, MA, 1990.

Download references

Author information

Authors and Affiliations

  1. Collaborative Information Technology Research Institute, Department of Computer Science, University of Melbourne and RMIT, 3052, Parkville, Victoria, Australia

    Jayen Vaghanl BSc (hons) (Systems Programmer), Kotagiri Ramamohanarao Ph.D. (Professor), David B. Kemp Ph.D. (Postdoctoral Research Fellow), Zoltan Somogyi Ph.D. (Lecturer), Peter J. Stuckey Ph.D. (Senior Lecturer), Tim S. Leask BSc (hons) (Systems Programmer) & James Harland Ph.D. (Lecturer)

Authors
  1. Jayen Vaghanl BSc (hons)
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kotagiri Ramamohanarao Ph.D.
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David B. Kemp Ph.D.
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zoltan Somogyi Ph.D.
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Peter J. Stuckey Ph.D.
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Tim S. Leask BSc (hons)
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. James Harland Ph.D.
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vaghanl, J., Ramamohanarao, K., Kemp, D.B. et al. The aditi deductive database system. VLDB Journal 3, 245–288 (1994). https://doi.org/10.1007/BF01228882

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01228882

Key words

Search

Navigation