• DocumentCode
    282631
  • Title

    Extensible transaction management in Papyrus

  • Author

    Neimat, Marie-Anne ; Wilkinson, Kevin

  • Author_Institution
    Hewlett-Packard Lab., Palo Alto, CA, USA
  • Volume
    ii
  • fYear
    1990
  • fDate
    2-5 Jan 1990
  • Firstpage
    503
  • Abstract
    The authors describe the extensible transaction management architecture of Papyrus and its motivation. In Papyrus, persistent data are encapsulated in data servers, which provide a collection of methods that clients may use to access and update the data. The Papyrus architecture allows data servers to specify their own concurrency-control algorithms. A data server can present its clients with a choice of concurrency-control algorithms. Upon beginning a transaction, the client specifies a particular concurrency-control algorithm for each data server it will access. Using serialization rules supplied by each data server, the Papyrus lock manager serializes transactions over all data servers
  • Keywords
    concurrency control; transaction processing; Papyrus; Papyrus lock manager; concurrency-control algorithm; concurrency-control algorithms; data servers; extensible transaction management architecture; persistent data; serialization rules; Concurrency control; Data models; Database systems; Iris; Laboratories; Milling machines; Pressing; Probes; Proposals; Transaction databases;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    System Sciences, 1990., Proceedings of the Twenty-Third Annual Hawaii International Conference on
  • Conference_Location
    Kailua-Kona, HI
  • Type

    conf

  • DOI
    10.1109/HICSS.1990.205224
  • Filename
    205224