Current transaction systems for geo-distributed datastores either have high transaction processing latencies or are unable to support general transactions with dependent operations. In this paper, we introduce CrossStitch, an efficient transaction processing framework that reduces latency by restructuring each transaction into a chain of state transitions, where each state consists of a key ope...

In the current electronic-commerce literature, a commercial transaction is commonly viewed as an exchange between two autonomous principals operating under a contract between them— which needs to be formalized and enforced. But the situation can be considerably more complex in the case of inter-enterprise (also called business-to-business, or B2B) commerce. The participants in a B2B transaction...

A business to business (B2B) e-marketplace is an Internet-based inter-organizational system that facilitates online businesses. It provides two basic functions: search and transaction. Accordingly, organizational usage of B2B e-marketplaces varies across these two functions. The previous research mainly applies the Diffusion of Innovation (DOI) theory to predict the usage of B2B e-marketplaces,...

Transactional Memory (TM) provides a strong abstraction to tackle the challenge of synchronizing concurrent tasks that access shared state. Yet, most TMs do not allow a single transaction to contain parallel code. We propose an efficient parallel nesting algorithm to explore existing latent parallelism within a transaction. If this intra-transaction parallelism has reduced conflict probability ...

In current mainframe architectures, extended memory is used as a pageaddressable main memory extension to improve I/O performance. If made non-volatile, extended memory can significantly increase transaction processing performance. In this paper, we study how locally distributed transaction systems may use shared extended memory to support high transaction rates and short response times. We out...

The multi-agent resource allocation problem corresponds to the negotiation of m resources among n autonomous agents, in order to maximize a social welfare function. Contrary to some former studies, the purpose is neither here to simply determine a socially optimal resource allocation nor to prove the existence of a transaction sequence leading to this optimum, but to find a practical transactio...

The multi-agent resource allocation problem corresponds to the negotiation of m resources among n autonomous agents in order to maximize a social welfare. Contrary to some former studies, the purpose is neither here to simply determine a socially optimal resource allocation nor to prove the existence of a transaction sequence leading to this optimum, but to find a practical transaction sequence...

Reliability and clear semantics in the presence of errors are of key importance for automated execution of business processes. Consequently, transaction support is a major ingredient for business process automation in a Service-Oriented Computing (SOC) environment. As automated business processes become more complex, different parts of business processes have different transaction requirements....

We propose a new kind of sequential pattern which we call Generalized Sequential Pattern, and we introduce the problem of mining generalized sequential patterns over temporal databases. A classical sequential pattern consists of a sequence of itemsets. This kind of pattern can be discovered in a database of customer transactions where each transaction consists of a transaction-id, transaction t...