This note considers the application of electronic cash to transactions in which many small amounts must be paid to the same payee and in which it is not possible to just pay the total amount afterwards. The most notable example of such a transaction is payment for phone calls. If currently published electronic cash systems are used and a full payment protocol is executed for each of the small a...

In Bitcoin system, transactions are prioritized according to attributes such as the remittance amount and transaction fees, and transactions with low priority are likely to wait for confirmation. Because the demand of micro payment in Bitcoin is expected to increase due to low remittance cost, it is important to quantitatively investigate how the priority mechanism of Bitcoin affects the transa...

This paper presents a formal model for studying the computation complexity of scheduling a whole set of transactions simultaneously in a transaction system with predeclared writesets. Our study clearly shows that there exists a fundsmental tradeoff between the amount of concurrency achieved and the computation overhead necessary to achieve that amount of concurrency. However, it is suggested th...

In this Chapter, we have characterized the bus traffic generated by the SPECweb96 benchmark in a four-processor SMP system with NT/4 operating system. We observe that the benchmark is very network intensive, in terms of computation and bandwidth consumption. The study shows that the transactions across the four processors are well balanced and do not have any long-range dependencies. There is a...

This paper proposes a multiversion concurrency control algorithm for real-time databases. Based on a priority cognitive algorithm commonly used in real-time processing, the algorithm resolves data connicts among connict-ing transactions in favor of the urgent transactions, i.e., those with higher priority. Our algorithm is expected to minimize the transactions missing those deadlines and increa...

One of the most difficult tasks in the design of information systems is how to control the behaviour of the back-end storage engine, usually a relational database. As the load on the database increases, the longer issued transactions will take to execute, mainly because the presence of a high number of locks required to provide isolation and concurrency. In this paper we present MIDAS, a middle...

A best e€ort approach to data scheduling, such as optimistic concurrency control in real-time database systems (RTDBS), imposes a heavy burden on the systems by restarting con ̄icting transactions. The restarted transactions themselves may miss their deadlines and the resources consumed by them may be wasted. Hence it can be better to schedule transactions such that only con ̄ict free transaction...