Jisho

×
直列化可能性
Links
Wikipedia definition
1. Serializability​In concurrency control of databases, transaction processing (transaction management), and various transactional applications, both centralized and distributed, a transaction schedule is serializable if its outcome (e.g. , the resulting database state) is equal to the outcome of its transactions executed serially, i.e. , sequentially without overlapping in time. Transactions are normally executed concurrently (they overlap), since this is the most efficient way.
Read “Serializability” on English Wikipedia
Read “直列化可能性” on Japanese Wikipedia
Read “Serializability” on DBpedia

Discussions

to talk about this word.