Trust in general, is an important factor in many social interactions, involving uncertainty and dependency. Trust is central to any economic transaction, whether conducted in a retail outlet in the real offline world or over the Internet, by means of a website. However, trust is even more important in an online situation (Riegelsberger, Sasse, & McCarthy, 2005; Walczuch & Lundgren, 2004). One r...

This paper describes a scheduling technique for parallel database systems to obtain high performance, both in terms of response time and throughput. The technique enables both intra-and inter-transaction paralMism while controlling concurrency between transactions correctly. Scheduling is performed dynamically at transaction execution time, taking into account dynamic aspects of the execution a...

The global inter-site constraints is to describe the integrity constraints associated with data items in diierent local databases, which specify the global connguration of the data that are considered semantically correct. Locally consistent transactions may generate global inconsistencies with the existence of global integrity constraints. Hence, we need the global transaction manager that ens...

The collaborative business process can be unreliable when business partners collaborate in a peer-to-peer fashion without central control. Therefore, an important issue that needs to be dealt with for any generic solution to manage collaborative business transaction is reliability verification. In this paper, we propose a novel Choreographical Business Transaction Net (CoBTx-Net) to specify col...

This paper integrates theoretical concepts from transaction cost economics, organization theory and political economy to develop a conceptual framework to guide research on inter-organizational coordination strategies, particularly those that explicitly leverage IT capabilities. We outline research directions and approaches to bridge the requirements of theory building and theory testing. A Fra...

We have proposed an improved concurrency control protocol for nested transactions based on speculation. In the proposed speculative nested locking (SNL) protocol, whenever a sub-transaction finishes work with a data object (produces after-image), it's parent inherits the lock. The waiting sub-transaction carries out speculative executions by accessing both beforeand after-images of preceding su...

In computing system capacity planning, transaction inter-arrival times are assumed to be exponentially distributed. Said another way, given bunch of samples with the average inter-arrival time of 10ms, more of the samples will have an inter-arrival times less then 10ms than greater than 10ms. With a normal distribution you’re likely to see just as many samples greater than and also less than th...