Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Atomicity (database systems)

Known as: Transaction, Atomic update, Atomic transaction 
In database systems, atomicity (or atomicness; from Greek atomos, undividable) is one of the ACID transaction properties. An atomic transaction is an… Expand
Wikipedia

Related topics

Related topics

49 relations
ACIDAtomic commitCompare-and-swapComposability
Expand

Broader (1)

Transaction processing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Better I/O through byte-addressable, persistent memory
Modern computer systems have been built around the assumption that persistent storage is accessed via a slow, block-based… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
CTrigger: exposing atomicity violation bugs from their hiding places
Multicore hardware is making concurrent programs pervasive. Unfortunately, concurrent programs are prone to bugs. Among different… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Velodrome: a sound and complete dynamic atomicity checker for multithreaded programs
Atomicity is a fundamental correctness property in multithreaded programs, both because atomic code blocks are amenable to… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Optimizing memory transactions
Atomic blocks allow programmers to delimit sections of code as 'atomic', leaving the language's implementation to enforce… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
We introduce simple methods to convert a cryptographic algorithm into an algorithm protected against simple side-channel attacks… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
On The Move to Meaningful Internet Systems 2003: OTM 2003 Workshops
It is believed that transactions belong to key services of componentbased middleware. However, surprisingly, there is no general… Expand
  • figure 11
  • figure 12
  • table 5
  • table 5
  • table 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
On implementing MPI-IO portably and with high performance
We discuss the issues involved in implementing MPI-IO portably on multiple machines and file systems and also achieving high… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Algorithms for scalable synchronization on shared-memory multiprocessors
Busy-wait techniques are heavily used for mutual exclusion andbarrier synchronization in shared-memory parallel programs… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The transaction concept: virtues and limitations
A transaction is a transformation of state which has the properties of atomicity (all or nothing), durability (effects survive… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1976
Highly Cited
1976
Database Management Systems
From the Publisher: Database Management Systems (DBMS) is a must for any course in database systems or file organization. DBMS… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE