Faster access than browser!
27 relations: ACID, Compare-and-swap, Consistency (database systems), Data consistency, Database, Database transaction, Deadlock, Durability (database systems), Fetch-and-add, Greek language, Hyper-threading, Isolation (database systems), Journaling file system, Linearizability, Load-link/store-conditional, Long-running transaction, Memory barrier, Metadata, Multiprocessing, Operating system, Orthogonality, POSIX, POSIX Threads, Read-copy-update, System call, Test-and-set, Transaction processing.
ACID
In computer science, ACID (Atomicity, Consistency, Isolation, Durability) is a set of properties of database transactions intended to guarantee validity even in the event of errors, power failures, etc.
New!!: Atomicity (database systems) and ACID · See more »
Compare-and-swap
In computer science, compare-and-swap (CAS) is an atomic instruction used in multithreading to achieve synchronization.
New!!: Atomicity (database systems) and Compare-and-swap · See more »
Consistency (database systems)
Consistency in database systems refers to the requirement that any given database transaction must change affected data only in allowed ways.
New!!: Atomicity (database systems) and Consistency (database systems) · See more »
Data consistency
Data consistency refers to the usability of data.
New!!: Atomicity (database systems) and Data consistency · See more »
Database
A database is an organized collection of data, stored and accessed electronically.
New!!: Atomicity (database systems) and Database · See more »
Database transaction
A transaction symbolizes a unit of work performed within a database management system (or similar system) against a database, and treated in a coherent and reliable way independent of other transactions.
New!!: Atomicity (database systems) and Database transaction · See more »
Deadlock
In concurrent computing, a deadlock is a state in which each member of a group is waiting for some other member to take action, such as sending a message or more commonly releasing a lock.
New!!: Atomicity (database systems) and Deadlock · See more »
Durability (database systems)
In database systems, durability is the ACID property which guarantees that transactions that have committed will survive permanently.
New!!: Atomicity (database systems) and Durability (database systems) · See more »
Fetch-and-add
In computer science, the fetch-and-add CPU instruction (FAA) atomically increments the contents of a memory location by a specified value.
New!!: Atomicity (database systems) and Fetch-and-add · See more »
Greek language
Greek (Modern Greek: ελληνικά, elliniká, "Greek", ελληνική γλώσσα, ellinikí glóssa, "Greek language") is an independent branch of the Indo-European family of languages, native to Greece and other parts of the Eastern Mediterranean and the Black Sea.
New!!: Atomicity (database systems) and Greek language · See more »
Hyper-threading
Hyper-threading (officially called Hyper-Threading Technology or HT Technology, and abbreviated as HTT or HT) is Intel's proprietary simultaneous multithreading (SMT) implementation used to improve parallelization of computations (doing multiple tasks at once) performed on x86 microprocessors.
New!!: Atomicity (database systems) and Hyper-threading · See more »
Isolation (database systems)
In database systems, isolation determines how transaction integrity is visible to other users and systems.
New!!: Atomicity (database systems) and Isolation (database systems) · See more »
Journaling file system
A journaling file system is a file system that keeps track of changes not yet committed to the file system's main part by recording the intentions of such changes in a data structure known as a "journal", which is usually a circular log.
New!!: Atomicity (database systems) and Journaling file system · See more »
Linearizability
In concurrent programming, an operation (or set of operations) is atomic, linearizable, indivisible or uninterruptible if it appears to the rest of the system to occur at once without being interrupted.
New!!: Atomicity (database systems) and Linearizability · See more »
Load-link/store-conditional
In computer science, load-link and store-conditional (LL/SC) are a pair of instructions used in multithreading to achieve synchronization.
New!!: Atomicity (database systems) and Load-link/store-conditional · See more »
Long-running transaction
Long-running transactions (also known as the saga interaction pattern) are computer database transactions that avoid locks on non-local resources, use compensation to handle failures, potentially aggregate smaller ACID transactions (also referred to as atomic transactions), and typically use a coordinator to complete or abort the transaction.
New!!: Atomicity (database systems) and Long-running transaction · See more »
Memory barrier
A memory barrier, also known as a membar, memory fence or fence instruction, is a type of barrier instruction that causes a central processing unit (CPU) or compiler to enforce an ordering constraint on memory operations issued before and after the barrier instruction.
New!!: Atomicity (database systems) and Memory barrier · See more »
Metadata
Metadata is "data that provides information about other data".
New!!: Atomicity (database systems) and Metadata · See more »
Multiprocessing
Multiprocessing is the use of two or more central processing units (CPUs) within a single computer system.
New!!: Atomicity (database systems) and Multiprocessing · See more »
Operating system
An operating system (OS) is system software that manages computer hardware and software resources and provides common services for computer programs.
New!!: Atomicity (database systems) and Operating system · See more »
Orthogonality
In mathematics, orthogonality is the generalization of the notion of perpendicularity to the linear algebra of bilinear forms.
New!!: Atomicity (database systems) and Orthogonality · See more »
POSIX
The Portable Operating System Interface (POSIX) is a family of standards specified by the IEEE Computer Society for maintaining compatibility between operating systems.
New!!: Atomicity (database systems) and POSIX · See more »
POSIX Threads
POSIX Threads, usually referred to as pthreads, is an execution model that exists independently from a language, as well as a parallel execution model.
New!!: Atomicity (database systems) and POSIX Threads · See more »
Read-copy-update
In computer science, read-copy-update (RCU) is a synchronization mechanism based on mutual exclusion.
New!!: Atomicity (database systems) and Read-copy-update · See more »
System call
In computing, a system call is the programmatic way in which a computer program requests a service from the kernel of the operating system it is executed on.
New!!: Atomicity (database systems) and System call · See more »
Test-and-set
In computer science, the test-and-set instruction is an instruction used to write 1 (set) to a memory location and return its old value as a single atomic (i.e., non-interruptible) operation.
New!!: Atomicity (database systems) and Test-and-set · See more »
Transaction processing
Transaction processing is information processing in computer science that is divided into individual, indivisible operations called transactions.
New!!: Atomicity (database systems) and Transaction processing · See more »
Redirects here:
Atomic transaction, Atomic update.
References
[1] https://en.wikipedia.org/wiki/Atomicity_(database_systems)
