Declarative specifications of complex transactions

E.O. de Brock
Additional contact information
E.O. de Brock: Groningen University

No 98A41, Research Report from University of Groningen, Research Institute SOM (Systems, Organisations and Management)

Abstract: While specifications of queries are usually of a declarative nature (since the work of Codd in the early seventies), specifications of transactions are still mainly of an operational and descriptive nature. Especially descriptions of complex transactions (such as cascading deletes) tend to be very operational. Often these descriptions turn out to be nondeterministic as well. A problematic consequence is that the semantics of transactions and of several related notions are often unclear or even ambiguous. For a database designer this surely is not a good starting point for building applications. Another tendency we recognize is that the current literature on transactions is mainly driven by technical solutions offered by research prototypes and commercial systems and not so much by advanced specification requirements from a user's or database designer's point of view. In our opinion, the research questions should (also) include what kind of complex transactions (advanced) users would like to specify (and not only what e.g. the expressive power of a given technical solution is), and how these specifications can be translated to implementations in the currently available (advanced) databasemanagementsystems. And, moreover, wasn't it our purpose (with the introduction of 4GL's and the like) to become declarative instead of operational, concentrating on the "what" instead of the "how"? This paper offers a general framework for declarative specifications of transactions, including complex ones. We also take the influence of static and dynamic constraints on the alleged transactions into account. The paper introduces sharp (deterministic) definitions of (and distinctions between) compound transactions and a sequence of transactions. Basic set theory is our main vehicle. Applications of our theory include the provision of a formal semantics of SQL's DML-statements (which include restricted deletes), the declarative specification of cascading deletes, and the distinction between allowable and available transitions. Keywords: Transactions, declarative specifications, constraints (static and dynamic), transitions (allowable versus available), compound transactions versus a sequence of transactions, deletes (restricted and cascading), formal semantics of DML-statements.

Date: 1998
References: Add references at CitEc
Citations:

Downloads: (external link)
http://irs.ub.rug.nl/ppn/174867816 (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found (http://irs.ub.rug.nl/ppn/174867816 [302 Found]--> https://irs.ub.rug.nl/ppn/174867816 [302 Found]--> https://www.rug.nl/research/portal/publications/pub(311d1482-a7bd-4474-a042-78989795a2b8).html [301 Moved Permanently]--> https://research.rug.nl/en/publications/pub(311d1482-a7bd-4474-a042-78989795a2b8).html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gro:rugsom:98a41

Access Statistics for this paper

More papers in Research Report from University of Groningen, Research Institute SOM (Systems, Organisations and Management) Contact information at EDIRC.
Bibliographic data for series maintained by Hanneke Tamling ().