Object–relational model¶

An object–relational database (ORD), or object–relational database management system (ORDBMS), is a database management system (DBMS) similar to a relational database, but with an object-oriented database model: objects, classes and inheritance are directly supported in database schemas and in the query language.

Version: v1 · 2026-09-28 · History
Domain-specific #: 11061
Domain group: Applied Sciences & Engineering
Origin domain: Computer Science & Software Engineering
Subdomains: Databases, Data Models → Computer Science & Software Engineering

Core Idea¶

Object–relational model is treated here as the recurring computer_science_and_information identity summarized by this source-grounded definition: An object–relational database (ORD), or object–relational database management system (ORDBMS), is a database management system (DBMS) similar to a relational database, but with an object-oriented database model: objects, classes and inheritance are directly supported in database schemas and in the query language.

An object–relational database (ORD), or object–relational database management system (ORDBMS), is a database management system (DBMS) similar to a relational database, but with an object-oriented database model: objects, classes and inheritance are directly supported in database schemas and in the query language. Also, as with pure relational systems, it supports extension of the data model with custom data types and methods. An object–relational database can be said to provide a middle ground between relational databases and object-oriented databases.

In object–relational databases, the approach is essentially that of relational databases: the data resides in the database and is manipulated collectively with queries in a query language; at the other extreme are OODBMSes in which the database is essentially a persistent object store for software written in an object-oriented programming language, with an application programming interface API for storing and retrieving objects, and little or no specific support for querying. The OOP languages call this the polymorphism principle, which briefly is defined as "one interface, many implementations". But these types of databases are not optimal for certain kinds of applications.

For Object–relational model, the abstraction is narrower than the article's general subject matter: a positive case must preserve An object–relational database (ORD), or object–relational database management system (ORDBMS), is a database management system (DBMS) similar to a relational database, but with an object-oriented database model: objects, classes and inheritance are directly supported in database schemas and in the query language. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in computer_science_and_information, which is why this identity is domain-specific rather than prime.

Structural Signature¶

Sig role-phrases:

Defining carrier — Whereas traditional RDBMS or SQL-DBMS products focused on the efficient management of data drawn from a limited set of data-types (defined by the relevant language standards), an object–relational DBMS allows software developers to integrate their own types and the methods that apply to them into the DBMS.
Constitutive relation — The isomorphism of the relational database system with a mathematical relation allows it to exploit many useful techniques and theorems from set theory.
Operating condition — An object oriented database model allows containers like sets and lists, arbitrary user-defined datatypes as well as nested objects.
Recognition evidence — Such program objects must be storable and transportable for database processing, therefore they usually are named as persistent objects.
Admissible variation — In object-oriented programming (OOP), object behavior is described through the methods (object functions).
Characteristic consequence — The methods denoted by one name are distinguished by the type of their parameters and type of objects for which they attached (method signature).
Failure boundary — Encapsulation in OOP is a visibility degree declared, for example, through the public , private and protected access modifiers.

What It Is Not¶

Not the whole field of computer_science_and_information. The node requires the specific identity stated by An object–relational database (ORD), or object–relational database management system (ORDBMS), is a database management system (DBMS) similar to a relational database, but with an object-oriented database model: objects, classes and inheritance are directly supported in database schemas and in the query language.
Not an over-broad reading. But object databases, unlike relational do not provide any mathematical base for their deep analysis.
Not an over-broad reading. But these types of databases are not optimal for certain kinds of applications.
Not an over-broad reading. However, a more popular alternative for achieving such a bridge is to use a standard relational database systems with some form of object–relational mapping (ORM) software.
Not automatically Relational database. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Object–relational model applies literally inside computer_science_and_information wherever the source-defined carrier and relation can be established. Its documented habitats include:

Overview. Whereas traditional RDBMS or SQL-DBMS products focused on the efficient management of data drawn from a limited set of data-types (defined by the relevant language standards), an object–relational DBMS allows software developers to integrate their own types and the methods that apply to them into the DBMS.
Overview. In object-oriented programming (OOP), object behavior is described through the methods (object functions).
Overview. The isomorphism of the relational database system with a mathematical relation allows it to exploit many useful techniques and theorems from set theory.
Overview. But these types of databases are not optimal for certain kinds of applications.
Overview. An object oriented database model allows containers like sets and lists, arbitrary user-defined datatypes as well as nested objects.
Overview. This brings commonality between the application type systems and database type systems which removes any issue of impedance mismatch.

Outside computer_science_and_information, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Theory or should be marked as analogy.

Clarity¶

A clear use of Object–relational model names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is An object–relational database (ORD), or object–relational database management system (ORDBMS), is a database management system (DBMS) similar to a relational database, but with an object-oriented database model: objects, classes and inheritance are directly supported in database schemas and in the query language. The strongest recognition evidence in the frozen account is: Such program objects must be storable and transportable for database processing, therefore they usually are named as persistent objects. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification But object databases, unlike relational do not provide any mathematical base for their deep analysis. so that a reader can reproduce the classification rather than infer it from topical resemblance.

Manages Complexity¶

Object–relational model compresses multiple computer_science_and_information details into a stable diagnostic relation. The source shows both the central mechanism—the isomorphism of the relational database system with a mathematical relation allows it to exploit many useful techniques and theorems from set theory.—and the practical consequence—the methods denoted by one name are distinguished by the type of their parameters and type of objects for which they attached (method signature). This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning¶

Type the carrier. Identify the computer_science_and_information entities to which the claim applies.
State the relation. Use the source-grounded identity: An object–relational database (ORD), or object–relational database management system (ORDBMS), is a database management system (DBMS) similar to a relational database, but with an object-oriented database model: objects, classes and inheritance are directly supported in database schemas and in the query language.
Check operation and conditions. An object oriented database model allows containers like sets and lists, arbitrary user-defined datatypes as well as nested objects.
Demand recognition evidence. Such program objects must be storable and transportable for database processing, therefore they usually are named as persistent objects.
Test variation. Change an implementation or setting while preserving in object-oriented programming (OOP), object behavior is described through the methods (object functions).
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Theory.

Knowledge Transfer¶

Within the home domain. Knowledge about Object–relational model transfers literally when a new case preserves the same carrier type, relation, and recognition test. Whereas traditional RDBMS or SQL-DBMS products focused on the efficient management of data drawn from a limited set of data-types (defined by the relevant language standards), an object–relational DBMS allows software developers to integrate their own types and the methods that apply to them into the DBMS. In object-oriented programming (OOP), object behavior is described through the methods (object functions).

Beyond the home domain. No canonical parent is asserted for Object–relational model. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

The basic goal for the object–relational database is to bridge the gap between relational databases and the object-oriented modeling techniques used in programming languages such as Java, C++, Visual Basic (.NET) or C#. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → An object–relational database (ORD), or object–relational database management system (ORDBMS), is a database management system (DBMS) similar to a relational database, but with an object-oriented database model: objects, classes and inheritance are directly supported in database schemas and in the query language; recognition evidence → Such program objects must be storable and transportable for database processing, therefore they usually are named as persistent objects

Applied / In Practice¶

Encapsulation in OOP is a visibility degree declared, for example, through the public , private and protected access modifiers. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → Overview; invariant → An object–relational database (ORD), or object–relational database management system (ORDBMS), is a database management system (DBMS) similar to a relational database, but with an object-oriented database model: objects, classes and inheritance are directly supported in database schemas and in the query language; boundary → the case exits the class when but object databases, unlike relational do not provide any mathematical base for their deep analysis

Structural Tensions¶

T1 — Stable identity versus admissible variation. But object databases, unlike relational do not provide any mathematical base for their deep analysis. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. But these types of databases are not optimal for certain kinds of applications. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. However, a more popular alternative for achieving such a bridge is to use a standard relational database systems with some form of object–relational mapping (ORM) software. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. The methods denoted by one name are distinguished by the type of their parameters and type of objects for which they attached (method signature). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. Whereas traditional RDBMS or SQL-DBMS products focused on the efficient management of data drawn from a limited set of data-types (defined by the relevant language standards), an object–relational DBMS allows software developers to integrate their own types and the methods that apply to them into the DBMS. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Object–relational model literally, co-instantiate Theory, or only resemble it?

T6 — Autonomy versus reduction. The isomorphism of the relational database system with a mathematical relation allows it to exploit many useful techniques and theorems from set theory. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Object–relational model distinguish that the broader parent Theory leaves together?

Structural–Framed Character¶

Object–relational model is structural-leaning. Its structural side is the repeatable organization summarized by An object–relational database (ORD), or object–relational database management system (ORDBMS), is a database management system (DBMS) similar to a relational database, but with an object-oriented database model: objects, classes and inheritance are directly supported in database schemas and in the query language. Its framed side is the computer_science_and_information vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: An object oriented database model allows containers like sets and lists, arbitrary user-defined datatypes as well as nested objects. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Theory. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. An object–relational database (ORD), or object–relational database management system (ORDBMS), is a database management system (DBMS) similar to a relational database, but with an object-oriented database model: objects, classes and inheritance are directly supported in database schemas and in the query language. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: Whereas traditional RDBMS or SQL-DBMS products focused on the efficient management of data drawn from a limited set of data-types (defined by the relevant language standards), an object–relational DBMS allows software developers to integrate their own types and the methods that apply to them into the DBMS. The isomorphism of the relational database system with a mathematical relation allows it to exploit many useful techniques and theorems from set theory. It further constrains recognition and variation through: An object oriented database model allows containers like sets and lists, arbitrary user-defined datatypes as well as nested objects. Such program objects must be storable and transportable for database processing, therefore they usually are named as persistent objects.

What is domain-bound. computer science and information supplies the operative entities, technical vocabulary, warrants, and exceptions that make Object–relational model literal. Its documented scope includes the condition that Whereas traditional RDBMS or SQL-DBMS products focused on the efficient management of data drawn from a limited set of data-types (defined by the relevant language standards), an object–relational DBMS allows software developers to integrate their own types and the methods that apply to them into the DBMS. Another bounded application condition is that In object-oriented programming (OOP), object behavior is described through the methods (object functions). These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—In object-oriented programming (OOP), object behavior is described through the methods (object functions).—and future graph densification may discover a defensible relation only if it preserves that boundary.

This entry is a kind of Relational Model.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Object–relational model. The reviewed identity is: An object–relational database (ORD), or object–relational database management system (ORDBMS), is a database management system (DBMS) similar to a relational database, but with an object-oriented database model: objects, classes and inheritance are directly supported in database schemas and in the query language. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Relationships to Other Abstractions¶

Current abstraction Object–relational model Domain-specific

Parents (1) — more general patterns this builds on

Object–relational model is a kind of Relational Model Domain-specific

The object-relational model keeps the relational model's typed-tuple-and-algebra core and adds object-oriented schema features on top.

Hierarchy path (1) — routes to 1 parentless root

Object–relational model → Relational Model → Relation

Neighborhood in Abstraction Space¶

Object–relational model sits in a moderately populated region (50^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Relational Database Theory (13 abstractions)

Nearest neighbors

Foreign key — 0.88
Relational Model — 0.87
Structured storage — 0.87
Keyspace (distributed data store) — 0.86
Entity–attribute–value model — 0.85

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Theory. The parent omits the specialist differentia. Tell: Can the case establish An object–relational database (ORD), or object–relational database management system (ORDBMS), is a database management system (DBMS) similar to a relational database, but with an object-oriented database model: objects, classes and inheritance are directly supported in database schemas and in the query language?
Relational database. A database that represents data as relations of tuples and attributes governed by keys, constraints, and relational operations. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Database schema. Specify a database’s permitted structures, relations, constraints, and object organization in the formal language of its data model or management system. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Relational transducer. A state-machine model whose input, output, memory and transition state are finite relational database instances transformed by declarative queries. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Object–relational model remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside computer_science_and_information lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Theory?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Object%E2%80%93relational_database (revision 1358614254).
Preserved source candidate: http://isddc.dot.gov/OLPFiles/FHWA/010394.pdf
Preserved source candidate: https://web.archive.org/web/20160924180745/http://isddc.dot.gov/OLPFiles/FHWA/010394.pdf
Preserved source candidate: https://www.cl.cam.ac.uk/~fms27/db/tr-98-2.pdf
Preserved source candidate: http://home.iitk.ac.in/~namansg/cs300/3C.pdf
Preserved source candidate: https://web.archive.org/web/20160304190615/http://home.iitk.ac.in/~namansg/cs300/3C.pdf
Preserved source candidate: http://savtechno.com/articles/ViewOfORDBMS.html
Preserved source candidate: https://web.archive.org/web/20120301020947/http://savtechno.com/articles/ViewOfORDBMS.html
Preserved source candidate: http://www.jpab.org/

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.