Abstract
Chapter 6 is a continuation of Chap. 5 and is dedicated to computation systems and categorial RDB machines able to support all computations in the DB category (by translations of the arrows of the action category RA, represented by the Application Plans of the RDB machine, into the morphisms of the database category DB). The embedding of SQL into general purpose programs, synchronization process for execution of SQL statements as morphisms in the DB category, and transaction recovery are presented in a unifying categorial framework. In particular, we consider the concurrent categorial RDB machines able to support the time-shared “parallel” execution of several user programs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Reference
E. Börger, D. Rödding, Berechenbarkeit, komlexität, logik. eine einfuhrung in algorithmen, sprachen und kalküle unter besonderer berücksichtigung ihrer komplexität (F. Vieweg, Wiesbaden, 1986)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Majkić, Z. (2014). Categorial RDB Machines. In: Big Data Integration Theory. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-04156-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-04156-8_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04155-1
Online ISBN: 978-3-319-04156-8
eBook Packages: Computer ScienceComputer Science (R0)