PFL: An Active Functional DBPL
This chapter describes the active subsystem of PFL, a functional database programming language (DBPL). We discuss how PFL has been extended with transactions and ECA rules without compromising the confluence of expression evaluation. We describe the support for primitive and composite events, the definition and semantics of ECA rules, and the execution model. To our knowledge, this is the first time that an active subsystem has been added to a functional DBPL.
Unable to display preview. Download preview PDF.
- [PS91]A. Poulovassilis and C. Small. A Functional Approach to Deductive Databases. In G. Lohman, A. Sernadas, and R. Camps, editors, Proc. 17th VLDB, pages 479–487. Morgan-Kaufmann, 1991.Google Scholar
- [PS94]A. Poulovassilis and C. Small. Investigation of Algebraic Query Optimisation in Database Programming Languages. In J. Bocca, M. Jarke, and C. Zaniolo, editors, Proc. 20th VLDB, pages 415–426. Morgan-Kaufmann, 1994.Google Scholar
- [RPS95]S. Reddi, A. Poulovassilis, and C. Small. Extending a Functional DBPL With ECA-Rules. In T. Sellis, editor, Proc. 2nd Intl. Workshop. on Rules in Database Systems, pages 101–115. Springer-Verlag, 1995.Google Scholar
- [SP91]C. Small and A. Poulovassilis. An Overview of PFL. In P. Kanellakis and J. W. Schmidt, editors, Proc. 3rd Intl. Workshop on Database Programming Languages (DBPL-3), pages 479–487. Morgan-Kaufmann, 1991.Google Scholar
- [SS95]D. Sutton and C. Small. Extending Functional Database Languages to Update Completeness. In C. Goble and J. Keane, editors, Proc. 13th British National Conference on Databases (BNCOD-13), pages 47–63. Springer-Verlag, 1995.Google Scholar