• DocumentCode
    2277883
  • Title

    Recursive functions in Iris

  • Author

    De Smedt, Philippe ; Ceri, Stefano ; Neimat, Marie-Anne ; Shan, Ming-Chien ; Ahmed, Rafi

  • Author_Institution
    Hewlett-Packard Lab., Palo Alto, CA, USA
  • fYear
    1993
  • fDate
    19-23 Apr 1993
  • Firstpage
    145
  • Lastpage
    154
  • Abstract
    A complete and efficient implementation of linear, one-side recursive queries in Iris, an object-oriented database management system, is described. It is shown that recursion can be easily and efficiently added to a large class of existing database management systems. A B-tree type access path called the B++ tree that has been implemented to support the computation of recursive functions in Iris is also described. The perforamnce of B++ trees is reviewed
  • Keywords
    database theory; object-oriented databases; query processing; recursive functions; tree data structures; B++ tree; B-tree type access path; Iris; linear, one-side recursive queries; object-oriented database management system; perforamnce; recursive functions; Data models; Database languages; Database systems; Deductive databases; Ear; Iris; Laboratories; Logic programming; Milling machines; Object oriented databases;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Engineering, 1993. Proceedings. Ninth International Conference on
  • Conference_Location
    Vienna
  • Print_ISBN
    0-8186-3570-3
  • Type

    conf

  • DOI
    10.1109/ICDE.1993.344068
  • Filename
    344068
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2277883