A Visual Approach to Multilinear Recursion

  • Tiziana Catarci
  • Giuseppe Santucci
Conference paper
Part of the Workshops in Computing book series (WORKSHOPS COMP.)


The problem of expressing complex queries in a friendly way is particularly relevant due to the growing diffusion of databases. However, the most significant proposals for extending the expressive power of the relational query languages are based on the logical paradigm. In particular, an extension of the Horn clause queries, i.e. the so-called stratified Datalog, yields stratified queries, that are a proper subset of fixpoint queries. It is a general opinion that logic is not a friendly interfacing medium for a casual user. As a consequence, other types of query languages, i.e. visual query languages, have been proposed, some of them having an expressive power higher than the relational algebra. Up to now, no visual query language has been proved to provide the expressive power of stratified Datalog. In this paper, we present QBD**, a visual query language, and show that it is able to express all stratified queries.


Query Language Transitive Closure Expressive Power Relational Algebra Horn Clause 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aho A.V., Ullman J.D. Universality of Data Retrieval Language. In: Proc. of the 6th ACM SIGACT-SIPLAN Symposium on Principles of Programming Languages, 1979, pp. 110 - 120.Google Scholar
  2. 2.
    Angelaccio, M. Catarci T., Santucci G. QBD*: A Graphical Query Language with Recursion IEEE Transactions on Software Engineering, 1990, 16, 10: 1150 - 1163.CrossRefGoogle Scholar
  3. 3.
    Angelaccio, M. Catarci T., Santucci G. QBD*: A Fully Visual Query System. Journal on Visual Languages and Computing, 1990, 1, 2: 255 - 273.CrossRefGoogle Scholar
  4. 4.
    Bancilhon F., Ramakrishnan R. An Amateurs Introduction to Recursive Query Processing Strategies. In: Proc. of the 1986 ACM-SIGMOD Conference on the Management of Data, 1986.Google Scholar
  5. 5.
    Batini C., Catarci T., Costabile, M.F. Levialdi S. Visual Query Systems. Technical Report N.04. 91, Dipartimento di Informatica e Sistemistica, Università di Roma La Sapienza, 1991.Google Scholar
  6. 6.
    Catarci T. On the Expressive Power of Graphical Query Languages. In: Proc. of the 2nd IFIP W.G. 2. 6 Working Conference on Visual Databases, North-Holland, 1991, pp. 411 - 421.Google Scholar
  7. 7.
    Catarci T., Cruz I.F. On Expressing Stratified Datalog. In: Proc. of the ICLP94 (International Conference on Logic Programming) Workshop on Deductive Databases And Logic Programming, 1994.Google Scholar
  8. 8.
    Chandra A.K. Theory of Database Queries. In: Proc. Symp. Principles of Database Systems, 1988.Google Scholar
  9. 9.
    Chandra A.K., Harel D. Horn Clause Queries and Generalizations. Journal of Logic Programming, 1985, 1, 1: 1 - 15.MathSciNetCrossRefGoogle Scholar
  10. 10.
    Chen P.P. The Entity-Relationship Model toward a Unified View of Data. ACM Transactions on Data Base Systems, 1976, 1, 1.CrossRefGoogle Scholar
  11. 11.
    Codd E. F. A Relational Model for Large Shared Data Banks. Communication of the ACM, 1970, 13, 6.CrossRefGoogle Scholar
  12. 12.
    Codd E.F. Relational completeness of database sub-languages. In: R.Rustin (ed.): Data Base Systems, Prentice Hall, Englewood Cliffs, 1972, pp. 65 - 98.Google Scholar
  13. 13.
    Consens M., Mendelzon A.O. Graphlog: A Visual Formalism for Real Life Recursion. In: Proc. of the ACM Symp. on Principles of Database Systems, 1990, pp. 404 - 416.Google Scholar
  14. 14.
    Cook S.A. A taxonomy of problems with fast parallel algorithms. Information and Control, 1985, 64: 2 - 22.MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Cruz I.F. DOODLE: A Visual Language for Object-Oriented Databases. In: Proc. of the ACM SIGMOD Conf. on Management of Data, 1992.Google Scholar
  16. 16.
    Cruzl.F., Mendelzon A.O., Wood P.T. G+: Recursive Queries Without Recursion. In: Proc. of the 2nd International Conference on Expert Database Systems, 1988, pp. 355 - 368.Google Scholar
  17. 17.
    Gallaire H., Minker J., Nicolas J.M. Logic and Databases: A Deductive Approach. ACM Computing Surveys, 1984, 16, 2: 153 - 185.CrossRefMATHGoogle Scholar
  18. 18.
    Henschen L.J., Naqvi S.A. On compiling Queries in Recursive First-order Databases. Journal of the ACM, 1984, 31, 1: 47 - 85.MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Ioannidis Y.I., Wong E. Towards an Algebraic theory of Recursion. Journal of the ACM, 1991, 38, 2: 329 - 381.MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    Kanellakis P.C. Elements of Relational Theory. In: J.van Leuween (ed.): Handbook of Theoretical Computer Science, Elsevier Science Pub, 1990.Google Scholar
  21. 21.
    Kolaitis P.J. The Expressive Power of Stratified Logic Programs. Information and Computation, 1991, 50 - 66.Google Scholar
  22. 22.
    Paredaens J., Peelman P., Tanca L. G-Log: A Declarative Graphical Query Language. In: Proc. of the Second International Conference DOOD'91, 1991, pp. 108 - 128.Google Scholar
  23. 23.
    Rundensteiner E.A., Bic L. Set Operations in Object-Based Data Models. IEEE Transactions on Knowledge and Data Engineering, 1992, 4, 4: 382 - 398.CrossRefGoogle Scholar
  24. 24.
    Santucci G., Sottile P. A. Query By Diagram: a Visual Environment for Querying Databases. Software Practice and Experience, 1993, 23, 3.CrossRefGoogle Scholar
  25. 25.
    Sippu S., Soisalon-Soininen E. A Generalized Transitive Closure for Relational Queries. In: Proc. of the International Conference on Principle of Database Systems, 1988.Google Scholar
  26. 26.
    Shneiderman B. Direct Manipulation: A Step beyond Programming Languages. IEEE Computer, 1983, 16: 57 - 69.CrossRefGoogle Scholar
  27. 27.
    Ullman J.D. Principles of Database and Knowledge-Base Systems, vol. I. Computer Science Press, Rockville, MD, 1988.Google Scholar
  28. 28.
    Zhang W., Yu C.T., Troy D. Necessary and Sufficient Conditions to Linearize Doubly Recursive Programs in Logic Databases. ACM Transactions on Database Systems, 1990, 15, 3: 459 - 482.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag London 1995

Authors and Affiliations

  • Tiziana Catarci
    • 1
  • Giuseppe Santucci
    • 1
  1. 1.Dipartimento di Informatica e SistemisticaUniversità degli Studi di Roma “La Sapienza”RomaItaly

Personalised recommendations