DOCSLIB.ORG

A Dictionary of DBMS Terms

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Dictionary of DBMS Terms A Dictionary of DBMS Terms Access Plan Access plans are generated by the optimization component to implement queries submitted by users. ACID Properties ACID properties are transaction properties supported by DBMSs. ACID is an acronym for atomic, consistent, isolated, and durable. Address A location in memory where data are stored and can be retrieved. Aggregation Aggregation is the process of compiling information on an object, thereby abstracting a higher-level object. Aggregate Function A function that produces a single result based on the contents of an entire set of table rows. Alias Alias refers to the process of renaming a record. It is alternative name used for an attribute. 700 A Dictionary of DBMS Terms Anomaly The inconsistency that may result when a user attempts to update a table that contains redundant data. ANSI American National Standards Institute, one of the groups responsible for SQL standards. Application Program Interface (API) A set of functions in a particular programming language is used by a client that interfaces to a software system. ARIES ARIES is a recovery algorithm used by the recovery manager which is invoked after a crash. Armstrong’s Axioms Set of inference rules based on set of axioms that permit the algebraic mani- pulation of dependencies. Armstrong’s axioms enable the discovery of minimal cover of a set of functional dependencies. Associative Entity Type A weak entity type that depends on two or more entity types for its primary key. Attribute The differing data items within a relation. An attribute is a named column of a relation. Authorization The operation that verifies the permissions and access rights granted to a user. Base Table Base table is a named relation corresponding to an entity in the conceptual schema, whose tuples (rows) are physically stored in the database. A Dictionary of DBMS Terms 701 Bitmap Index A compact, high speed indexing method where the key values and the condi- tions are compressed to a small size that can be stored and searched rapidly. BLOB BLOB is an acronym for Binary Large Object. BLOB is a data type for fields containing large binary data such as images. Boyce–Codd Normal Form A relation in third normal form in which every determinant is a candidate key. Bucket With reference to hash file, Bucket is the unit of a file having a particular address. Buffer Buffer an area in main memory containing physical database records trans- ferred from disk. Candidate Key Any data item or group of data items which identify uniquely tuples in a relation. Cardinality The number of tuples in a relation. Cartesian Product All of the possible combinations of the rows from each of the tables involved in a join operation. CASE Tool CASE is an acronym for computer-aided software engineering. CASE tools support features for drawing, analysis, prototyping, and data dictionary. CASE tool facilitate database development. 702 A Dictionary of DBMS Terms Chasm Trap A chasm trap exists where a model suggests the existence of relationship between entity types, but the pathway does not exist between certain entity occurrences. Client An individual user workstation that represents the front end of a DBMS. Client/Server Architecture Client/Server architecture is an arrangement of components among computers connected by a network. Clustered Index An index in which the logical or indexed order of the key values is the same as the physical stored order of the corresponding rows. CODASYL Conference on Data System Languages. Concurrent Access Performing two or more operations on the same data at the same time. Concurrency Control Concurrency control is the control on the database and transactions which are executed concurrently to ensure that each transaction completed healthy. Composite Key A candidate key comprising more than one attribute Composite Index An index that uses more than one column in a table to index data. COMMIT To control transactions, SQL provides this command to save recent DML changes to the database. A Dictionary of DBMS Terms 703 Condition Box A special box used by QBE to store logical conditions that are not easily expressed in the table skeleton. Constraints Constraints are conditions that are used to impose rules on the table. Conceptual View The logical database description in ANSI/SPARC DBMS architecture. Concurrent Access Two or more users operating on the same rows in a database table at the same time. Correlated Subquery In SQL, a sub query in which processing the inner query depends on data from the outer query. COUNT An aggregate function that returns the number of values in a column. Cursor An SQL feature that specifies a set of rows, an ordering of those rows and a current row within that ordering. Data Data is a representation of facts, concepts or instructions in a formalized manner suitable for communication, interpretation or processing by humans or automatic means. Data Abstraction Data abstraction means the storage details of the data are hidden from the user and the user is provided with the conceptual view of the database. 704 A Dictionary of DBMS Terms Database Database is the collection of interrelated data. Data Definition Language (DDL) The language component of a DBMS that is used to describe the logical structure of a database. Data Manipulation Language (DML) A language component of a DBMS that is used by a programmer to access and modify the contents of a database. Database Instance The actual data stored in a database at a particular moment in time. Database State Database state refers to the content of a database at a moment in time. Database Management System General purpose software used to maintain the database. Database System A database system means both a DBMS plus a database. Database Administrator A person or group of people responsible for the design and supervision of a data base. Database Recovery The process of restoring the database to a correct state in the event of a failure. Database Security Protection of the database against accidental or intentional loss, destruction, or misuse. A Dictionary of DBMS Terms 705 Data Mining Data mining is the process of discovering implicit patterns in data stored in data warehouse and using those patterns for business advantage such as predicting future trends. Data Model Collection of conceptual tools for describing data and relationship between data. Data Dictionary Centralized store of information about database. Data Warehouse Data warehouse is a central repository for summarized and integrated data from operational databases and external data sources. DB2 An IBM relational database system. DBTG Database Task Group. Deadlock The situation where each of two transactions are waiting indefinitely for the other transaction to release the resources it requests. Degree of a Relation The number of attributes in the relation. Denormalization Denormalization is the process of combining tables so that they are easier to query. Denormalization is opposite to normalization. Denormalization is done to improve query performance. 706 A Dictionary of DBMS Terms Derived Attribute Derived attributes are the attributes whose values are derived from other related attribute. Determinant An attribute or set of attributes on which the value of one or more attributes depend. Distributed Database A database located at more than one site. Domain The set of all possible values for a given data item. Domain Integrity Data integrity that enforces valid entries for a given column Domain Relational Calculus Domain Relational Calculus is a calculus that was introduced by Edgar F. Codd as a declarative database query language for the relational data model. DDL Data Definition Language is used to define the schema of a relation. DML Data Manipulation Language is basically used to manipulate a relation. Dual A virtual table automatically created by Oracle along with the data dictionary. It has one column, DUMMY, defined to be VARCHAR2(1), and contains one row with a value of “X”. Embedded SQL An application structure in which SQL statements are embedded within pro- grams written in a host language like C, JAVA. A Dictionary of DBMS Terms 707 Encapsulation Hiding the representation of an object is encapsulation. Entity An object that exist and is distinguishable from other objects. Entity Class A set of entities of the same type. Entity Instance Entity instance is a particular occurrence of an entity. Entity Integrity (Table Integrity) Integrity that defines a row as a unique entity for a particular table and ensures that the column cannot contain duplicate values. Equijoin A join operator where the join condition involves equality. ER Model ER stands for Entity-Relationship model. ER Model is based on a perception of a real world that consists of collection of basic objects called entities and relationships among these objects. EER Model EER stands for Enhanced ER model. EER model is the extension of origi- nal model with new modeling constructs. The new modeling constructs are supertype, subtype. Exclusive Lock A lock that prevents other users from accessing a database item. Exclusive locks conflict with all other kids of locks such as shared locks. 708 A Dictionary of DBMS Terms Fantrap A fantrap exists where a model represents a relationship between entity types but the pathway between certain entity occurrences is ambiguous. File A file is a collection of records of the same type. File Organization Methods used in organizing data for storage and retrieval such as sequential, indexed sequential, or direct. First Normal Form A relation is in first normal form if it contains no repeating groups. Flat File A file in which the fields of records are simple atomic values. Foreign Key Attribute or set of attributes that identifies the entity with which another entity is associated. Fourth Normal Form A relation is in fourth normal form if it is in BCNF and contains no multi- valued dependencies.
Load more

Recommended publications
  • Querying Graph Databases: What Do Graph Patterns Mean?
    Querying Graph Databases: What Do Graph Patterns Mean? Stephan Mennicke1( ), Jan-Christoph Kalo2, and Wolf-Tilo Balke2 1 Institut für Programmierung und Reaktive Systeme, TU Braunschweig, Germany [email protected] 2 Institut für Informationssysteme, TU Braunschweig, Germany {kalo,balke}@ifis.cs.tu-bs.de Abstract. Querying graph databases often amounts to some form of graph pattern matching. Finding (sub-)graphs isomorphic to a given graph pattern is common to many graph query languages, even though graph isomorphism often is too strict, since it requires a one-to-one cor- respondence between the nodes of the pattern and that of a match. We investigate the influence of weaker graph pattern matching relations on the respective queries they express. Thereby, these relations abstract from the concrete graph topology to different degrees. An extension of relation sequences, called failures which we borrow from studies on con- current processes, naturally expresses simple presence conditions for rela- tions and properties. This is very useful in application scenarios dealing with databases with a notion of data completeness. Furthermore, fail- ures open up the query modeling for more intricate matching relations directly incorporating concrete data values. Keywords: Graph databases · Query modeling · Pattern matching 1 Introduction Over the last years, graph databases have aroused a vivid interest in the database community. This is partly sparked by intelligent and quite robust developments in information extraction, partly due to successful standardizations for knowl- edge representation in the Semantic Web. Indeed, it is enticing to open up the abundance of unstructured information on the Web through transformation into a structured form that is usable by advanced applications.
    [Show full text]
  • SQL Server Column Store Indexes Per-Åke Larson, Cipri Clinciu, Eric N
    SQL Server Column Store Indexes Per-Åke Larson, Cipri Clinciu, Eric N. Hanson, Artem Oks, Susan L. Price, Srikumar Rangarajan, Aleksandras Surna, Qingqing Zhou Microsoft {palarson, ciprianc, ehans, artemoks, susanpr, srikumar, asurna, qizhou}@microsoft.com ABSTRACT SQL Server column store indexes are “pure” column stores, not a The SQL Server 11 release (code named “Denali”) introduces a hybrid, because they store all data for different columns on new data warehouse query acceleration feature based on a new separate pages. This improves I/O scan performance and makes index type called a column store index. The new index type more efficient use of memory. SQL Server is the first major combined with new query operators processing batches of rows database product to support a pure column store index. Others greatly improves data warehouse query performance: in some have claimed that it is impossible to fully incorporate pure column cases by hundreds of times and routinely a tenfold speedup for a store technology into an established database product with a broad broad range of decision support queries. Column store indexes are market. We’re happy to prove them wrong! fully integrated with the rest of the system, including query To improve performance of typical data warehousing queries, all a processing and optimization. This paper gives an overview of the user needs to do is build a column store index on the fact tables in design and implementation of column store indexes including the data warehouse. It may also be beneficial to build column enhancements to query processing and query optimization to take store indexes on extremely large dimension tables (say more than full advantage of the new indexes.
    [Show full text]
  • When Relational-Based Applications Go to Nosql Databases: a Survey
    information Article When Relational-Based Applications Go to NoSQL Databases: A Survey Geomar A. Schreiner 1,* , Denio Duarte 2 and Ronaldo dos Santos Mello 1 1 Departamento de Informática e Estatística, Federal University of Santa Catarina, 88040-900 Florianópolis - SC, Brazil 2 Campus Chapecó, Federal University of Fronteira Sul, 89815-899 Chapecó - SC, Brazil * Correspondence: [email protected] Received: 22 May 2019; Accepted: 12 July 2019; Published: 16 July 2019 Abstract: Several data-centric applications today produce and manipulate a large volume of data, the so-called Big Data. Traditional databases, in particular, relational databases, are not suitable for Big Data management. As a consequence, some approaches that allow the definition and manipulation of large relational data sets stored in NoSQL databases through an SQL interface have been proposed, focusing on scalability and availability. This paper presents a comparative analysis of these approaches based on an architectural classification that organizes them according to their system architectures. Our motivation is that wrapping is a relevant strategy for relational-based applications that intend to move relational data to NoSQL databases (usually maintained in the cloud). We also claim that this research area has some open issues, given that most approaches deal with only a subset of SQL operations or give support to specific target NoSQL databases. Our intention with this survey is, therefore, to contribute to the state-of-art in this research area and also provide a basis for choosing or even designing a relational-to-NoSQL data wrapping solution. Keywords: big data; data interoperability; NoSQL databases; relational-to-NoSQL mapping 1.
    [Show full text]
  • Data Dictionary a Data Dictionary Is a File That Helps to Define The
    Cleveland | v. 216.369.2220 • Columbus | v. 614.291.8456 Data Dictionary A data dictionary is a file that helps to define the organization of a particular database. The data dictionary acts as a description of the data objects or items in a model and is used for the benefit of the programmer or other people who may need to access it. A data dictionary does not contain the actual data from the database; it contains only information for how to describe/manage the data; this is called metadata*. Building a data dictionary provides the ability to know the kind of field, where it is located in a database, what it means, etc. It typically consists of a table with multiple columns that describe relationships as well as labels for data. A data dictionary often contains the following information about fields: • Default values • Constraint information • Definitions (example: functions, sequence, etc.) • The amount of space allocated for the object/field • Auditing information What is the data dictionary used for? 1. It can also be used as a read-only reference in order to obtain information about the database 2. A data dictionary can be of use when developing programs that use a data model 3. The data dictionary acts as a way to describe data in “real-world” terms Why is a data dictionary needed? One of the main reasons a data dictionary is necessary is to provide better accuracy, organization, and reliability in regards to data management and user/administrator understanding and training. Benefits of using a data dictionary: 1.
    [Show full text]
  • Damage Management in Database Management Systems
    The Pennsylvania State University The Graduate School Department of Information Sciences and Technology Damage Management in Database Management Systems A Dissertation in Information Sciences and Technology by Kun Bai °c 2010 Kun Bai Submitted in Partial Ful¯llment of the Requirements for the Degree of Doctor of Philosophy May 2010 The dissertation of Kun Bai was reviewed and approved1 by the following: Peng Liu Associate Professor of Information Sciences and Technology Dissertation Adviser Chair of Committee Chao-Hsien Chu Professor of Information Sciences and Technology Thomas La Porta Distinguished Professor of Computer Science and Engineering Sencun Zhu Assistant Professor of Computer Science and Engineering Frederico Fonseca Associate Professor of Information Sciences and Technology Associate Dean, College of Information Sciences and Technology 1Signatures on ¯le in the Graduate School. iii Abstract In the past two decades there have been many advances in the ¯eld of computer security. However, since vulnerabilities cannot be completely removed from a system, successful attacks often occur and cause damage to the system. Despite numerous tech- nological advances in both security software and hardware, there are many challenging problems that still limit e®ectiveness and practicality of existing security measures. As Web applications gain popularity in today's world, surviving Database Man- agement System (DBMS) from an attack is becoming even more crucial than before because of the increasingly critical role that DBMS is playing in business/life/mission- critical applications. Although signi¯cant progress has been achieved to protect the DBMS, such as the existing database security techniques (e.g., access control, integrity constraint and failure recovery, etc.,), the buniness/life/mission-critical applications still can be hit due to some new threats towards the back-end DBMS.
    [Show full text]
  • ACID, Transactions
    ECE 650 Systems Programming & Engineering Spring 2018 Database Transaction Processing Tyler Bletsch Duke University Slides are adapted from Brian Rogers (Duke) Transaction Processing Systems • Systems with large DB’s; many concurrent users – As a result, many concurrent database transactions – E.g. Reservation systems, banking, credit card processing, stock markets, supermarket checkout • Need high availability and fast response time • Concepts – Concurrency control and recovery – Transactions and transaction processing – ACID properties (desirable for transactions) – Schedules of transactions and recoverability – Serializability – Transactions in SQL 2 Single-User vs. Multi-User • DBMS can be single-user or multi-user – How many users can use the system concurrently? – Most DBMSs are multi-user (e.g. airline reservation system) • Recall our concurrency lectures (similar issues here) – Multiprogramming – Interleaved execution of multiple processes – Parallel processing (if multiple processor cores or HW threads) A A B B C CPU1 D CPU2 t1 t2 t3 t4 time Interleaved concurrency is model we will assume 3 Transactions • Transaction is logical unit of database processing – Contains ≥ 1 access operation – Operations: insertion, deletion, modification, retrieval • E.g. things that happen as part of the queries we’ve learned • Specifying database operations of a transaction: – Can be embedded in an application program – Can be specified interactively via a query language like SQL – May mark transaction boundaries by enclosing operations with: • “begin transaction” and “end transaction” • Read-only transaction: – No database update operations; only retrieval operations 4 Database Model for Transactions • Database represented as collection of named data items – Size of data item is its “granularity” – E.g. May be field of a record (row) in a database – E.g.
    [Show full text]
  • Using BEAM Software to Simulate the Introduction of On-Demand, Automated, and Electric Shuttles for Last Mile Connectivity in Santa Clara County
    San Jose State University SJSU ScholarWorks Mineta Transportation Institute Publications 1-2021 Using BEAM Software to Simulate the Introduction of On-Demand, Automated, and Electric Shuttles for Last Mile Connectivity in Santa Clara County Gary Hsueh Mineta Transportation Institute David Czerwinski San Jose State University Cristian Poliziani Mineta Transportation Institute Terris Becker San Jose State University Alexandre Hughes San Jose State University See next page for additional authors Follow this and additional works at: https://scholarworks.sjsu.edu/mti_publications Part of the Sustainability Commons, and the Transportation Commons Recommended Citation Gary Hsueh, David Czerwinski, Cristian Poliziani, Terris Becker, Alexandre Hughes, Peter Chen, and Melissa Benn. "Using BEAM Software to Simulate the Introduction of On-Demand, Automated, and Electric Shuttles for Last Mile Connectivity in Santa Clara County" Mineta Transportation Institute Publications (2021). https://doi.org/10.31979/mti.2021.1822 This Report is brought to you for free and open access by SJSU ScholarWorks. It has been accepted for inclusion in Mineta Transportation Institute Publications by an authorized administrator of SJSU ScholarWorks. For more information, please contact [email protected]. Authors Gary Hsueh, David Czerwinski, Cristian Poliziani, Terris Becker, Alexandre Hughes, Peter Chen, and Melissa Benn This report is available at SJSU ScholarWorks: https://scholarworks.sjsu.edu/mti_publications/343 Project 1822 January 2021 Using BEAM Software to
    [Show full text]
  • Alias for Case Statement in Oracle
    Alias For Case Statement In Oracle two-facedly.FonsieVitric Connie shrieved Willdon reconnects his Carlenegrooved jimply discloses her and pyrophosphates mutationally, knavishly, butshe reticularly, diocesan flounces hobnail Kermieher apache and never reddest. write disadvantage person-to-person. so Column alias can be used in GROUP a clause alone is different to promote other database management systems such as Oracle and SQL Server See Practice 6-1. Kotlin performs for example, in for alias case statement. If more want just write greater Less evident or butter you fuck do like this equity Case When ColumnsName 0 then 'value1' When ColumnsName0 Or ColumnsName. Normally we mean column names using the create statement and alias them in shape if. The logic to behold the right records is in out CASE statement. As faceted search string manipulation features and case statement in for alias oracle alias? In the following examples and managing the correct behaviour of putting each for case of a prefix oracle autonomous db driver to select command that updates. The four lines with the concatenated case statement then the alias's will work. The following expression jOOQ. Renaming SQL columns based on valve position Modern SQL. SQLite CASE very Simple CASE & Search CASE. Alias on age line ticket do I pretend it once the same path in the. Sql and case in. Gke app to extend sql does that alias for case statement in oracle apex jobs in cases, its various points throughout your. Oracle Creating Joins with the USING Clause w3resource. Multi technology and oracle alias will look further what we get column alias for case statement in oracle.
    [Show full text]
  • Cohesity Dataplatform Protecting Individual MS SQL Databases Solution Guide
    Cohesity DataPlatform Protecting Individual MS SQL Databases Solution Guide Abstract This solution guide outlines the workflow for creating backups with Microsoft SQL Server databases and Cohesity Data Platform. Table of Contents About this Guide..................................................................................................................................................................2 Intended Audience..............................................................................................................................................2 Configuration Overview.....................................................................................................................................................2 Feature Overview.................................................................................................................................................................2 Installing Cohesity Windows Agent..............................................................................................................................2 Downloading Cohesity Agent.........................................................................................................................2 Select Coheisty Windows Agent Type.........................................................................................................3 Install the Cohesity Agent.................................................................................................................................3 Cohesity Agent Setup........................................................................................................................................4
    [Show full text]
  • CA SQL-Ease for DB2 for Z/OS User Guide
    CA SQL-Ease® for DB2 for z/OS User Guide Version 17.0.00, Second Edition This Documentation, which includes embedded help systems and electronically distributed materials, (hereinafter referred to as the “Documentation”) is for your informational purposes only and is subject to change or withdrawal by CA at any time. This Documentation is proprietary information of CA and may not be copied, transferred, reproduced, disclosed, modified or duplicated, in whole or in part, without the prior written consent of CA. If you are a licensed user of the software product(s) addressed in the Documentation, you may print or otherwise make available a reasonable number of copies of the Documentation for internal use by you and your employees in connection with that software, provided that all CA copyright notices and legends are affixed to each reproduced copy. The right to print or otherwise make available copies of the Documentation is limited to the period during which the applicable license for such software remains in full force and effect. Should the license terminate for any reason, it is your responsibility to certify in writing to CA that all copies and partial copies of the Documentation have been returned to CA or destroyed. TO THE EXTENT PERMITTED BY APPLICABLE LAW, CA PROVIDES THIS DOCUMENTATION “AS IS” WITHOUT WARRANTY OF ANY KIND, INCLUDING WITHOUT LIMITATION, ANY IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, OR NONINFRINGEMENT. IN NO EVENT WILL CA BE LIABLE TO YOU OR ANY THIRD PARTY FOR ANY LOSS OR DAMAGE, DIRECT OR INDIRECT, FROM THE USE OF THIS DOCUMENTATION, INCLUDING WITHOUT LIMITATION, LOST PROFITS, LOST INVESTMENT, BUSINESS INTERRUPTION, GOODWILL, OR LOST DATA, EVEN IF CA IS EXPRESSLY ADVISED IN ADVANCE OF THE POSSIBILITY OF SUCH LOSS OR DAMAGE.
    [Show full text]
  • Chapter 11 Querying
    Oracle TIGHT / Oracle Database 11g & MySQL 5.6 Developer Handbook / Michael McLaughlin / 885-8 Blind folio: 273 CHAPTER 11 Querying 273 11-ch11.indd 273 9/5/11 4:23:56 PM Oracle TIGHT / Oracle Database 11g & MySQL 5.6 Developer Handbook / Michael McLaughlin / 885-8 Oracle TIGHT / Oracle Database 11g & MySQL 5.6 Developer Handbook / Michael McLaughlin / 885-8 274 Oracle Database 11g & MySQL 5.6 Developer Handbook Chapter 11: Querying 275 he SQL SELECT statement lets you query data from the database. In many of the previous chapters, you’ve seen examples of queries. Queries support several different types of subqueries, such as nested queries that run independently or T correlated nested queries. Correlated nested queries run with a dependency on the outer or containing query. This chapter shows you how to work with column returns from queries and how to join tables into multiple table result sets. Result sets are like tables because they’re two-dimensional data sets. The data sets can be a subset of one table or a set of values from two or more tables. The SELECT list determines what’s returned from a query into a result set. The SELECT list is the set of columns and expressions returned by a SELECT statement. The SELECT list defines the record structure of the result set, which is the result set’s first dimension. The number of rows returned from the query defines the elements of a record structure list, which is the result set’s second dimension. You filter single tables to get subsets of a table, and you join tables into a larger result set to get a superset of any one table by returning a result set of the join between two or more tables.
    [Show full text]
  • Django-Transaction-Hooks Documentation Release 0.2.1.Dev1
    django-transaction-hooks Documentation Release 0.2.1.dev1 Carl Meyer December 12, 2016 Contents 1 Prerequisites 3 2 Installation 5 3 Setup 7 3.1 Using the mixin.............................................7 4 Usage 9 4.1 Notes...................................................9 5 Contributing 13 i ii django-transaction-hooks Documentation, Release 0.2.1.dev1 A better alternative to the transaction signals Django will never have. Sometimes you need to fire off an action related to the current database transaction, but only if the transaction success- fully commits. Examples: a Celery task, an email notification, or a cache invalidation. Doing this correctly while accounting for savepoints that might be individually rolled back, closed/dropped connec- tions, and idiosyncrasies of various databases, is non-trivial. Transaction signals just make it easier to do it wrong. django-transaction-hooks does the heavy lifting so you don’t have to. Contents 1 django-transaction-hooks Documentation, Release 0.2.1.dev1 2 Contents CHAPTER 1 Prerequisites django-transaction-hooks supports Django 1.6.x through 1.8.x on Python 2.6, 2.7, 3.2, 3.3 and 3.4. django-transaction-hooks has been merged into Django 1.9 and is now a built-in feature, so this third-party library should not be used with Django 1.9+. SQLite3, PostgreSQL (+ PostGIS), and MySQL are currently the only databases with built-in support; you can exper- iment with whether it works for your favorite database backend with just a few lines of code. 3 django-transaction-hooks Documentation, Release 0.2.1.dev1 4 Chapter 1.
    [Show full text]