Skip to main content
SpringerLink
Log in

The LOGIDATA+ prototype system

  • Part V: Prototypes
  • Chapter
  • First Online:
LOGIDATA+: Deductive Databases with Complex Objects

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 701))

  • 121 Accesses

Abstract

In this paper we present a prototype system based on the LOGIDATA+ model, hence supporting a rule based language on a data model with structured data types, object identity and sharing. The system has an interactive user interface, with a units interaction composed by LOGIDATA+ programs, that can extract information from the knowledge base and/or modify the schema. A program consists of a set of rules written in the LOGIDATA+ language, and of additional directives to handle the data output and/or updates to the schema. The intermediate results and the updates to the schema, affect a temporary working environment connected to the working session, but can also be saved in a (user or global) permanent environment. The system uses LOA (LOGIDATA+ Object Algebra) as an intermediate internal language. User programs are compiled, with a set of transformations that includes rewriting and stratification, and then translated into LOA programs, i.e. sequences of fixpoint systems of algebraic equations. The object oriented schema is mapped into a relational schema, and the database is actually managed by a relational DBMS, that provides the basic support for the permanent storage of data as well as for concurrency control and recovery. The object algebra expressions can then be mapped into relational algebra expressions, thus relying on the efficiency of the RDBMS for the access to mass storage structures and the efficient execution of set-oriented operations. Moreover a main memory database has been included in the architecture, to improve the performance in the evaluation of the fixpoint systems, by keeping in main memory the intermediate results.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul and P. Kanellakis. Object identity as a query language primitive. In ACM SIGMOD International Conf. on Management of Data, pages 159–173, 1989.

    Google Scholar 

  2. S. Abiteboul and V. Vianu. Procedural and declarative database update languages. In Seventh ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, 1988.

    Google Scholar 

  3. P. Atzeni, F. Cacace, S. Ceri, and L. Tanca. The LOGIDATA+ model. Rapporto LOGIDATA+ 5/20, Progetto Finallizzato Sistemi Informatici e Calcolo Parallelo, 1990.

    Google Scholar 

  4. P. Atzeni and L. Tanca. The LOGIDATA+ Rule Language. Rapporto LOGIDATA+, Politecnico di Milano e IASI-CNR, Roma, 1990. Presented at the Workshop “Information Systems “90”, Kiev.

    Google Scholar 

  5. F. Bancilhon et al. The design and implementation of O 2 an object-oriented database system. In Advances in Object-Oriented Database Systems, Proc. Second Int. Workshop on Object-Oriented Database Syst., K. Dittrich, Ed., Bad Munster, FRG, 1988.

    Google Scholar 

  6. F. Bancilhon and R. Ramakrishnan. An amateur'ss introduction to recursive query processing strategies. In ACM SIGMOD International Conf. on Management of Data, pages 16–52, 1986.

    Google Scholar 

  7. F. Cacace, S. Ceri, S. Crespi-Reghizzi, L. Tanca, and R. Zicari. Integrating object oriented data modelling with a rule-based programming paradigm. In ACM SIGMOD International Conf. on Management of Data, pages 225–236, 1990.

    Google Scholar 

  8. S. Ceri, G. Gottlob, and Tanca L. Logic Programming and Databases. Springer-Verlag, Berlin, 1990.

    Google Scholar 

  9. A.K. Chandra. Theory of database queries. In Seventh ACM SIGACT-SIGMOD-sSIGART Symp. on Principles of Database Systems, pages 1–9, 1988.

    Google Scholar 

  10. A.K. Chandra and D. Harel. Horn clauses and generalization. Journal of Logic Programming, 2(1):320–340, 1985.

    Google Scholar 

  11. Y. Gurevich and S. Shelah. Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic, 32:265–280, 1986. Also in Proceedings Int. Conf. on Foundations of Computer Science, pp. 346–353, 1985.

    Google Scholar 

  12. T. Ibaraki and T. Kameda. On the optimal nesting order for computing n-relational joins. ACM Trans, on Database Syst., 9(3):483–502, 1984.

    Google Scholar 

  13. P.G. Kolaitis and C. Papadimitriou. Why not negation by fixpoint. In Seventh ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems, pages 231–239, 1988.

    Google Scholar 

  14. T. J. Lehman and M. J. Carey. Query processing in main memory database management systems. In ACM SIGMOD International Conf. on Management of Data, 1986.

    Google Scholar 

  15. T. J. Lehman and M. J. Carey. A study of index structures for main memory database management systems. In Twelfth International Conference on Very Large Data Bases, Kyoto, pages 294–303, 1986.

    Google Scholar 

  16. U. Nanni, S. Salza, and M. Terranova. An algebraic approach to the manipulation of complex objects. In 25-th Hawaii International Conference on System Sciences, IEEE Press, January 1992.

    Google Scholar 

  17. U. Nanni, S. Salza, and M. Terranova. LOA: the LOGIDATA+ Object Algebra. Technical Report 5/23, Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo, 1990.

    Google Scholar 

  18. S. Salza and M. Terranova. Efficient Implementation of Object-oriented Databases on Relational Systems. Technical Report, IASI-CNR, 1991.

    Google Scholar 

  19. E.J. Shekita and M.J. Carey. A performance evaluation of pointer-based joins. In ACM SIGMOD International Conf. on Management of Data, pages 300–311, 1990.

    Google Scholar 

  20. J.D. Ullman. Principles of Database and Knowledge Base Systems. Volume 1, Computer Science Press, Potomac, Maryland, second edition, 1982.

    Google Scholar 

  21. S. B. Yao. Approximating block accesses in database organizations. Communications of the ACM, 20(4):260–261, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica Pura ed Applicata, Univetsità de L'Aquila, Coppito, L’Aquila, Italy

    Umberto Nanni

  2. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, via Salaria 113, I-00198, Roma, Italy

    Silvio Salza

  3. Consiglio Nazionale delle Ricerche, Istituto di Analisi dei Sistemi ed Informatica, viale Manzoni 30, I-00185, Roma, Italy

    Silvio Salza & Mario Terranova

Authors
  1. Umberto Nanni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Silvio Salza
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mario Terranova
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paolo Atzeni

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Nanni, U., Salza, S., Terranova, M. (1993). The LOGIDATA+ prototype system. In: Atzeni, P. (eds) LOGIDATA+: Deductive Databases with Complex Objects. Lecture Notes in Computer Science, vol 701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021899

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56974-9

  • Online ISBN: 978-3-540-47844-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation