Topic
Write–write conflict
About: Write–write conflict is a research topic. Over the lifetime, 20 publications have been published within this topic receiving 207 citations. The topic is also known as: lost update.
Papers
1 Jan 1998
TL;DR: This paper will focus on the second aspect of speciication languages for knowledge-based systems, which is an issue considered to be unsolved and surveyed existing approaches in related areas of research.
Abstract: During the last years, a number of formal speciication languages for knowledge-based systems have been developed. Characteristic for knowledge-based systems are a complex knowledge base and an inference engine which uses this knowledge to solve a given problem. Speciication languages for knowledge-based systems have to cover both aspects: they have to provide means to specify a complex and large amount of knowledge and they have to provide means to specify the dynamic reasoning behaviour of a knowledge-based system. This paper will focus on the second aspect, which is an issue considered to be unsolved. For this purpose, we have surveyed existing approaches in related areas of research. We have taken approaches for the speciication of information systems (i.e., Language for Conceptual Modelling and Troll), approaches for the speciication of database updates and the dynamics of logic programs (Transaction Logic and Dynamic Database Logic), and the approach of Abstract State Machines.
56 citations
Patent•
NEC1
TL;DR: In this article, a method is presented of matching distributed transactions from a plurality of clients working cooperatively in a network-based information system, so that semantics conflicts submitted by user applications are resolved for each network application in the network server.
Abstract: A method is presented of matching distributed transactions from a plurality of clients working cooperatively in a network-based information system, so that semantics conflicts submitted by user applications are resolved for each network application in the network server. Transactions manager 122 in the network server 100 executes parallel processing of transactions submitted by clients 200. Semantics conflict detection section 111 in an network application 110 in the network server 100 inspects for conflicts. When an accessing conflict arises among a number of clients 200, the semantics conflict detection section 111 forwards a processing routine having a resolving method consistent with the contents of the semantics conflict to the transactions manager 122, which executes the processing routine to resolve the semantics conflict in transactions.
12 citations
Patent•
26 Aug 2009TL;DR: In this article, the authors describe a system for detecting and avoiding logical conflicts between long duration transactions using conflict queries that operate on data being manipulated to return a conflict key to be associated with the transaction.
Abstract: Systems, methods, and other embodiments associated with detecting and avoiding logical conflicts between long duration transactions are described. One example method includes generating conflict keys for long transactions using conflict queries that operate on data being manipulated to return a conflict key to be associated with the transaction. The conflict keys may be used to detect or avoid logical conflicts that occur in long duration transactions running concurrently.
12 citations
1 Jan 1996
TL;DR: A stock trading system that allows customers to make their orders of the stocks, each customer may set a deadline for the completion of the order transaction, and the commission of the company is a percent of the dealed stock price for each transaction.
Abstract: represent its worthiness if it is completed before the deadline. For example, consider a stock trading system of an investment consulting company that allows customers to make their orders of the stocks, each customer may set a deadline for the completion of the order transaction. The commission of the company is a percent (say 3%) of the dealed stock price for each transaction. From the standpoint of a broker, this commission is the value of the transaction. The performance goal of such a system is to maximize the revenues received from the dealed order transactions. Abstract
12 citations
8 Sep 1997
TL;DR: This paper proposes an approach, called deadline driven conflict resolution (DDCR), which integrates concurrency control and commitment management in resolving data conflicts between executing and committing transactions, while at the same time maintaining the schedules to be serializable.
Abstract: In a distributed real-time database system, if data conflicts occur between executing and committing transactions, the performance can be severely affected. In this paper, we propose an approach, called deadline driven conflict resolution (DDCR), which integrates concurrency control and commitment management in resolving data conflicts between executing and committing transactions, while at the same time maintaining the schedules to be serializable. With DDCR, many of the data conflicts can be alleviated, and concurrent execution of transactions is allowed to access data items being held by committing transactions. The impact of temporary failures occurred during the commitment of a transaction on other transactions is reduced by reversing the dependencies between the transactions. Simulation experiments have been performed and the results show that DDCR can significantly improve the system performance especially when the duration for the voting phase is long.
10 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2012 | 1 |
| 2011 | 1 |
| 2010 | 1 |
| 2009 | 1 |
| 2005 | 1 |
| 2004 | 2 |