Database applications often impose temporal dependencies between transactions that must be satissed to preserve data consistency. The extant correctness criteria used to schedule the execution of concurrent transactions are either time independent or use strict, diicult to satisfy real-time constraints. On one end of the spectrum, serializability completely ignores time. On the other end, deadl...

The Optimistic Concurrency Control (OCC) method has been commonly used for in-memory databases to ensure transaction serializability — a transaction will be aborted if its read set has been changed during execution. This simple criterion to abort transactions causes a large proportion of false positives, leading to excessive transaction aborts. Transactions aborted false-positively (i.e. false ...

Extensions of the traditional atomic transaction model are needed to support the development of multi system applications or work ows that ac cess heterogeneous databases and legacy applica tion systems Most extended transaction model s use conditions involving events or dependencies between transactions Intertask dependencies can serve as a uniform framework for de ning extend ed transaction m...

Calvin is a transaction scheduling and replication management layer for distributed storage systems. By first writing transaction requests to a durable, replicated log, and then using a concurrency control mechanism that emulates a deterministic serial execution of the log’s transaction requests, Calvin supports strongly consistent replication and fully ACID distributed transactions while incur...

Although powerful, the transaction model adopted in traditional database systems is found lacking in functionality and performance when used for new applications, such as CAD/CAM, and design environments. Various extensions to traditional transaction model have been proposed to address these drawbacks'. In order to analyse these ad hoc extensions and in search for a good implementation sup port...

We present an authentication and key agreement protocol to secure Voice over IP call establishment between interconnection proxies of different domains. The protocol operates on a transaction basis. Each transaction is defined as the set of operations and data required to send an authenticated message from a sender to a responder. A transaction allows a sender to either transmit a cryptographic...

Recently, dependency grammar has become quite popular in relatively free word-order languages. We encounter many structural ambiguities when parsing a sentence using dependency grammar. We use a chunking procedure to avoid constructing a mistaken dependency structure. Chunking reduces the scope of dependency relations between dependents and governors. This paper presents a method to resolve amb...

0957-4174/$ see front matter 2008 Elsevier Ltd. A doi:10.1016/j.eswa.2008.10.008 * Corresponding author. Tel.: +886 2 8212 2000 63 E-mail addresses: [email protected], d917250 Sequential pattern and inter-transaction pattern mining have long been important issues in data mining research. The former finds sequential patterns without considering the relationships between transactions in databa...

In multi-item inventory with very large number of items in retail sale stores, purchase dependency in demand amongst the items can be described by association rules mined from sale transaction data. With the knowledge of association rules, inventory replenishment policy can be designed which will result in low inventory cost and better profitability. The relevant inventory costs include the cos...