An Executor for Multidatabase Transactions which Achieves Maximal Parallelism

TitleAn Executor for Multidatabase Transactions which Achieves Maximal Parallelism
Publication TypeConference Proceedings
Year of Publication1991
AuthorsE. J. Cameron, L. A. Ness, Amit Sheth
Conference Name1st International Workshop on Interoperability in Multidatabase Systems (IMS 1991)
Pagination288 - 291
Date Published04/1991
PublisherIEEE
Conference LocationKyoto, Japan
Keywordscircuits, clocks, database theory, distributed databases, dynamic scheduling, dynamic subtransaction scheduling, executor, hardware, interleaved codes, L.0, logically parallel language, maximal parallelism, multidatabase transactions, parallel languages, parallel programming, petri nets, proposals, Semantics, transaction databases, transaction processing
Abstract

The authors concisely specify a executor in the logically parallel language, L.0, for a particular extended transaction model called multidatabase transactions. An executor is a program, which takes as input the data defining any particular multidatabase transaction, dynamically schedules the sub-transactions, and determines whether the multidatabase transaction succeeded or failed. In the program presented, the parallelism is the maximal amount permitted by the semantics of the multidatabase transaction. A refinement of this program could restrict the parallelism to the amount permitted by the systems executing the sub-transactions

DOI10.1109/IMS.1991.153723