Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5570890> ?p ?o }
Showing triples 1 to 67 of
67
with 100 triples per page.
- Q5570890 subject Q5898411.
- Q5570890 subject Q7011992.
- Q5570890 subject Q7285247.
- Q5570890 subject Q7352018.
- Q5570890 abstract "In concurrency control of databases, transaction processing (transaction management), and other transactional distributed applications, Global serializability (or Modular serializability) is a property of a global schedule of transactions. A global schedule is the unified schedule of all the individual database (and other transactional object) schedules in a multidatabase environment (e.g., federated database). Complying with global serializability means that the global schedule is serializable, has the serializability property, while each component database (module) has a serializable schedule as well. In other words, a collection of serializable components provides overall system serializability, which is usually incorrect. A need in correctness across databases in multidatabase systems makes global serializability a major goal for global concurrency control (or modular concurrency control). With the proliferation of the Internet, Cloud computing, Grid computing, and small, portable, powerful computing devices (e.g., smartphones), as well as increase in systems management sophistication, the need for atomic distributed transactions and thus effective global serializability techniques, to ensure correctness in and among distributed transactional applications, seems to increase.In a federated database system or any other more loosely defined multidatabase system, which are typically distributed in a communication network, transactions span multiple (and possibly distributed) databases. Enforcing global serializability in such system, where different databases may use different types of concurrency control, is problematic. Even if every local schedule of a single database is serializable, the global schedule of a whole system is not necessarily serializable. The massive communication exchanges of conflict information needed between databases to reach conflict serializability globally would lead to unacceptable performance, primarily due to computer and communication latency. Achieving global serializability effectively over different types of concurrency control has been open for several years. Commitment ordering (or Commit ordering; CO), a serializability technique publicly introduced in 1991 by Yoav Raz from Digital Equipment Corporation (DEC), provides an effective general solution for global (conflict) serializability across any collection of database systems and other transactional objects, with possibly different concurrency control mechanisms. CO does not need the distribution of conflict information, but rather utilizes the already needed (unmodified) atomic commitment protocol messages without any further communication between databases. It also allows optimistic (non-blocking) implementations. CO generalizes Strong strict two phase locking (SS2PL), which in conjunction with the Two-phase commit (2PC) protocol is the de facto standard for achieving global serializability across (SS2PL based) database systems. As a result, CO compliant database systems (with any, different concurrency control types) can transparently join existing SS2PL based solutions for global serializability. The same applies also to all other multiple (transactional) object systems that use atomic transactions and need global serializability for correctness (see examples above; nowadays such need is not smaller than with database systems, the origin of atomic transactions).The most significant aspects of CO that make it a uniquely effective general solution for global serializability are the following:Seamless, low overhead integration with any concurrency control mechanism, with neither changing any transaction's operation scheduling or blocking it, nor adding any new operation.Heterogeneity: Global serializability is achieved across multiple transactional objects (e.g., database management systems) with different (any) concurrency control mechanisms, without interfering with the mechanisms' operations.Modularity: Transactional objects can be added and removed transparently.Autonomy of transactional objects: No need of conflict or equivalent information distribution (e.g., local precedence relations, locks, timestamps, or tickets; no object needs other object's information).Scalability: With "normal" global transactions, computer network size and number of transactional objects can increase unboundedly with no impact on performance, andAutomatic global deadlock resolution.All these aspects, except the first two, are also possessed by the popular SS2PL, which is a (constrained, blocking) special case of CO and inherits many of CO's qualities.".
- Q5570890 wikiPageWikiLink Q1067690.
- Q5570890 wikiPageWikiLink Q11371.
- Q5570890 wikiPageWikiLink Q11661.
- Q5570890 wikiPageWikiLink Q1202008.
- Q5570890 wikiPageWikiLink Q1207152.
- Q5570890 wikiPageWikiLink Q1301371.
- Q5570890 wikiPageWikiLink Q1321906.
- Q5570890 wikiPageWikiLink Q1332873.
- Q5570890 wikiPageWikiLink Q137712.
- Q5570890 wikiPageWikiLink Q1427251.
- Q5570890 wikiPageWikiLink Q15260926.
- Q5570890 wikiPageWikiLink Q17084415.
- Q5570890 wikiPageWikiLink Q17141564.
- Q5570890 wikiPageWikiLink Q1771903.
- Q5570890 wikiPageWikiLink Q17737.
- Q5570890 wikiPageWikiLink Q1779327.
- Q5570890 wikiPageWikiLink Q180634.
- Q5570890 wikiPageWikiLink Q186868.
- Q5570890 wikiPageWikiLink Q21608541.
- Q5570890 wikiPageWikiLink Q2248521.
- Q5570890 wikiPageWikiLink Q22645.
- Q5570890 wikiPageWikiLink Q2290484.
- Q5570890 wikiPageWikiLink Q249999.
- Q5570890 wikiPageWikiLink Q253623.
- Q5570890 wikiPageWikiLink Q288435.
- Q5570890 wikiPageWikiLink Q2914952.
- Q5570890 wikiPageWikiLink Q37093.
- Q5570890 wikiPageWikiLink Q384871.
- Q5570890 wikiPageWikiLink Q385853.
- Q5570890 wikiPageWikiLink Q3884.
- Q5570890 wikiPageWikiLink Q4053284.
- Q5570890 wikiPageWikiLink Q4476407.
- Q5570890 wikiPageWikiLink Q4669179.
- Q5570890 wikiPageWikiLink Q46857.
- Q5570890 wikiPageWikiLink Q483639.
- Q5570890 wikiPageWikiLink Q5152903.
- Q5570890 wikiPageWikiLink Q518730.
- Q5570890 wikiPageWikiLink Q5570820.
- Q5570890 wikiPageWikiLink Q5570890.
- Q5570890 wikiPageWikiLink Q5898411.
- Q5570890 wikiPageWikiLink Q6125872.
- Q5570890 wikiPageWikiLink Q623276.
- Q5570890 wikiPageWikiLink Q627335.
- Q5570890 wikiPageWikiLink Q68.
- Q5570890 wikiPageWikiLink Q690079.
- Q5570890 wikiPageWikiLink Q7011992.
- Q5570890 wikiPageWikiLink Q727490.
- Q5570890 wikiPageWikiLink Q7285247.
- Q5570890 wikiPageWikiLink Q7352018.
- Q5570890 wikiPageWikiLink Q75.
- Q5570890 wikiPageWikiLink Q83571.
- Q5570890 wikiPageWikiLink Q844565.
- Q5570890 wikiPageWikiLink Q848010.
- Q5570890 wikiPageWikiLink Q8513.
- Q5570890 wikiPageWikiLink Q875267.
- Q5570890 wikiPageWikiLink Q912009.
- Q5570890 wikiPageWikiLink Q922437.
- Q5570890 wikiPageWikiLink Q93695.
- Q5570890 wikiPageWikiLink Q95.
- Q5570890 wikiPageWikiLink Q989016.
- Q5570890 comment "In concurrency control of databases, transaction processing (transaction management), and other transactional distributed applications, Global serializability (or Modular serializability) is a property of a global schedule of transactions. A global schedule is the unified schedule of all the individual database (and other transactional object) schedules in a multidatabase environment (e.g., federated database).".
- Q5570890 label "Global serializability".