Skip to main content
SpringerLink
Log in

Verso: A database machine based on nested relations

  • Part I System Design
  • Conference paper
  • First Online:
Nested Relations and Complex Objects in Databases (NF2 1987)

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

Abstract

Verso is a database management system developed at INRIA. The main characteristics of the system are the following:

  1. •

    on-the-fly filtering is used for both unary (selection, projection), binary operations, and for updates. The filter is realized by a finite state automaton-like device.

  2. •

    data is organized hierarchically to take advantage of the power of the filter.

  3. •

    the user interface is based on a non-first-normal-form relational model. An algebraic language, and a screen interface are proposed.

This three aspects are closely tied. They form the basis for the originality and the performance of the Verso database system. The version of the system discussed in the present paper has been implemented in Pascal and C under Unix on an SM90 computer. Performance studies are briefly mentioned.

This research was partially supported by the french agency ADI under contract 84077 and was part of the french joint research program on databases (PRC-BD3).

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.

8 References

  1. Abiteboul S., Bidoit N., “Non First Normal Form Relations to Represent Hierarchically Organized Data”, Proc. of ACM-SIGMOD Conf. on Principles of Database Systems, Atlanta, 1984, pp. 191–200, in Journal of Computer Science and Systems, December 86.

    Google Scholar 

  2. Abiteboul, S., C. Beeri. “On the Power of Languages for the Manipulation of Complex Objects”, INRIA Research Report, No 846, 78153 Le Chesnay, France, May 1988.

    Google Scholar 

  3. Abiteboul, S., R. Hull, “IFO: a Formal Semantic Database Model”, Proc. of ACM-SIGMOD Conf. on Principles of Database Systems, Waterloo, 1984.

    Google Scholar 

  4. Bancilhon F. et al, “VERSO: A Relational Back End Data Base Machine”, Proc. of the 2nd International Workshop on Database Machines, San Diego, September 1982, also in “Advanced Database Machine Architecture”, D.K. Hsiao Editor, Prentice-Hall 1983, pp. 1–18.

    Google Scholar 

  5. Bancilhon et al, “FAD, a Powerfull and Simple Database Language”, Proc. Inter. Conf on Very Large Data Bases, Brighton, 1987.

    Google Scholar 

  6. Babb E., “Implementing a Relational Database by Means of Specialized Hardware”, ACM Trans. on Database Syst., Vol. 6, no 2, 1981

    Google Scholar 

  7. Boral H., DeWitt D.J., “Database Machines: An Idea whose Time has passed? A Critique of the future of Database Machines”, in “Database Machines”, H.O. Leilich and M. Missikoff editors, Springer-Verlag, 1983 pp 166–187.

    Google Scholar 

  8. Bidoit N., “Un Modèle de Données Relationnel Non Normalisé: Algèbre et Interprétation” Thèse 3e cycle, Université Paris-Sud, 1984.

    Google Scholar 

  9. Bitton D. et Al., “Benchmarking Database Systems: A Systematic Approach”, Computer Science Department, Technical Report no 526, University of Wisconsin, December 1983.

    Google Scholar 

  10. Bancilhon F., Richard P., Scholl M., “On Line Processing of Compacted Relations”, Proc. Inter. Conf. on Very Large Data Bases, Mexico, 1982.

    Google Scholar 

  11. Bancilhon F., Scholl M., “Design of a Backend Processor for a Database Machine”, Proc. ACM-SIGMOD, Santa Monica, May 1980.

    Google Scholar 

  12. Copeland G.P., Lipovski G.J., Su S.Y., “The Architecture of CASSM: A Cellular system for Non-numeric Processing”, Proc. 1st Annual Symposium on Computer Architecture, Dec. 1973, pp. 121–128.

    Google Scholar 

  13. Delebarre V., Richard P., Scholl M., “Filtrage des données dans les SGBD Relationnels: L'expérience Verso”, in Nouvelles perspectives des Bases de Données, Eyrolles, 1986.

    Google Scholar 

  14. El Masri A., Rohmer J. et Tusera D., “A Machine for Information Retrieval”, Proc. 4th Workshop on Comp. Arch. for Non-numerical Processing, Syracuse, New York, August 1978.

    Google Scholar 

  15. Fisher, P., S. Thomas, “Operators for Non-First-Normal-Form Relations”, Proc. of the 7th International Comp. Soft. Applications Conf., Chicago, 1983.

    Google Scholar 

  16. Furtado A., L. Kerschberg, “An Algebra of Quotient Relations”, Proc. of SIGMOD, Toronto, 1977.

    Google Scholar 

  17. Gamerman S., “Où l'on découvre que les performances des Filtres dans les Machines Bases de Données ne sont pas celles que l'on croyait”, Thèse de 3e cycle, Université de Paris-Sud, Juin 1984.

    Google Scholar 

  18. Gamerman S., Scholl M., “Hardware versus Software Data Filtering: The Verso Experience”, Proc. of the Fourth International Workshop on Database Machines, Grand Bahama Island, March 6–8, 1985, pp. 112–136.

    Google Scholar 

  19. Hull, R., C. Yap, “The Format Model: A Theory of Database Organization”, Journal of the Assoc. for Comp. Machinary, 1984.

    Google Scholar 

  20. Jaeschke, G., Schek, H.J., “Remarks on the Algebra of Non First Normal Form Relations”, Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, Los Angeles, Ca., March 1982, pp124–138.

    Google Scholar 

  21. Verso Jules, “Verso: a Database Machine Based on N1NF Relations”, INRIA internal report, No 523, May 1986.

    Google Scholar 

  22. Mainguenaud M., “Immersion de Primitives d'accès à un SGBD dans un langage de haut niveau”, Mémoire d'ingénieur IIE, Juin 1985.

    Google Scholar 

  23. Makinouchi A., “A Consideration on Normal Form of Not-Necessarily-Normalized Relations in the Relational Model”, Proc. Inter. Conf on Very Large Data Bases, Tokyo, 1977.

    Google Scholar 

  24. Mostardi T., “Un Indice Compatto per una Machina per Basi di Dati Relazionali Progetto ed Implementazione”, Proc. of annual Conf. AICA, Florence, October 1985.

    Google Scholar 

  25. Ozkarahan E.A., Schuster S.A., Smith K.C.,: “RAP — An Associative Processor for Data Base Management”, Proc. 1975 NCC, Vol. 45, AFIPS Press, Montvale, N.J., 1975, pp 379–387.

    Google Scholar 

  26. Pauthe P., “EVER, un Editeur de V-Relations”, Thèse de troisième cycle, Université de Paris-Sud, 1985.

    Google Scholar 

  27. Plateau D., “A Pruned Trie to Index A Sorted File and Its Evaluation”, Information Systems, Vol.9, No 2, pp. 157–165, 1984.”

    Google Scholar 

  28. Robert D.C.,: “A Specialized Computer Architecture for Text Retrivial”, Proc. 4th Workshop on Comp. Arch. for Non-numerical Processing, Syracuse, New York, August 1978.

    Google Scholar 

  29. Schek, H.-J., P. Pistor, “Data Structures for an Integrated Database Management and Information Retrieval System”, Proc. Inter. Conf. on Very Large Data Bases, 1982.

    Google Scholar 

  30. Scholl M., “Architecture pour le Filtrage dans les Bases de Données Relationnelles”, Thèse d'Etat, INPG, Grenoble, 1985.

    Google Scholar 

  31. Schweppe H. et al. “RDBM — A dedicated Multiprocessor System for Database Management”, Proc. of the 2nd International Workshop on Database Machines, San Diego, September 1982; also in “Advanced Database Machine Architecture”, D.K. Hsiao Editor, Prentice-Hall 1983, pp.36–86.

    Google Scholar 

  32. Scholl M., Delebarre V., “Verso, un système relationnel N1NF à filtrage séquentiel: mesures et bilan”, Technique et Science Informatiques, November 1987.

    Google Scholar 

  33. Shemer J.L., Necks P.M., “The Genesis of a Database Computer”, in Computers, November 1984, pp42–56.

    Google Scholar 

  34. Slotnick D.L., “Logic per track devices”, in “Advances in Computer”, Vol. 10, Academic Press, New York, 1970, pp. 291–296.

    Google Scholar 

  35. Schek H.J., Scholl M.H., “The Relational Model with Relation-valued Attributes”, Information Systems, 1986.

    Google Scholar 

  36. Stonebraker M.R, Wong E., Kreps P., “The Design and Implementation of INGRES”, ACM-TODS vol 1, no 3, Sept 1976.

    Google Scholar 

  37. Thomas S.J., Fischer P.C., “Nested Relational Structures”, in “The Theory of Databases” JAI Press, P. Kannelakis editor, 1983.

    Google Scholar 

  38. Verroust A., “Characterization of Well-Behaved Databases Schematas and their Update Semantics”, Proc. Inter. Conf. on Very Large Data Bases, Florence, 1983.

    Google Scholar 

  39. “Verso user manual”, Verso internal report, 1986.

    Google Scholar 

  40. Zloof, M., “Query-by-example: A Database Language”, IBM Systems Journal 16, 1977,pp 324–343.

    Google Scholar 

Download references

Author information

Author notes

  1. F. Bancilhon, S. Gamerman, D. Plateau & P. Richard

    Present address: GIP Altair, 78153, Le Chesnay, Cedex, France

  2. N. Bidoit

    Present address: LRI, Université Paris Sud, 91405, Orsay Cedex, France

  3. A. Verroust

    Present address: ENS, 45 rue d'Ulm, 75230, Paris Cedex 05

Authors and Affiliations

  1. Institut National de Recherche en Informatique et Automatique, 78153, Le Chesnay, Cedex, France

    M. Scholl, S. Abiteboul, F. Bancilhon, N. Bidoit, S. Gamerman, D. Plateau, P. Richard & A. Verroust

Authors
  1. M. Scholl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Abiteboul
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. F. Bancilhon
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. N. Bidoit
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. S. Gamerman
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. D. Plateau
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. P. Richard
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. A. Verroust
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. Abiteboul P. C. Fischer H. -J. Schek

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Scholl, M. et al. (1989). Verso: A database machine based on nested relations. In: Abiteboul, S., Fischer, P.C., Schek, H.J. (eds) Nested Relations and Complex Objects in Databases. NF2 1987. Lecture Notes in Computer Science, vol 361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51171-7_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-51171-7_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51171-7

  • Online ISBN: 978-3-540-46175-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation