Information about Concept Oriented Model
| Database models |
|---|
| Common models |
|
Hierarchical Network Relational Object-relational Object |
| Other models |
|
Associative Concept-oriented Multi-dimensional Star schema XML database |
The fundamental principle of the concept-oriented paradigm is that objects are living in space where the space structure describes the model syntax or schema while the object structure represents its semantics. Elementary parts of the space are referred to as concepts while objects, which are concept instances are called data items. Concepts are analogous to relations or tables while items are analogous to rows or records in the relational model.
The concept-oriented model allows the database designer to describe a natural representation of data syntax and semantics, which reflects both hierarchical and multidimensional properties. Proceeding from only a small number of basic notions and principles this approach allows modeling a variety of existing methods and practical use cases such as multi-valued variables, higher level relationships, grouping and aggregation, online analytical processing (OLAP), inference, lifecycle management, complex categorization, ontologies, knowledge sharing and many other mechanisms.
Model syntax
At the syntactic level each concept is defined as a combination of its superconcepts. As a consequence a subconcept is included into each of its superconcepts simultaneously. Formally the model syntax or schema are complemented by one top concept and one bottom concepts and this structure then constitutes a lattice. The top concept is a direct or indirect parent for any other concept in the model while the bottom concept directly or indirectly includes any other concept in the model.Alternatively the concept-oriented syntax (schema) can be described in the conventional terms of dimensions and domains. Each superconcept in the definition of the concept is supposed to be a domain for the dimension associated with this pair of subconcept-superconcept. A dimension normally has a unique name within the scope of its concept. Thus each concept is defined a set of dimension names with their domains in other concepts. The database schema can be then represented as an acyclic graph where nodes are concepts and edges are dimensions leading from a concept to its domains in superconcepts. Dual to dimension is the notion of inverse dimension, which is thought of as a characteristic or attribute taking values from some subconcept (rather than superconcept). It is important that dimensions are single valued while inverse dimensions are multi-valued.
Model semantics
At the semantic level the data model is represented by its items. An item is defined as a combination of superitems taken from the superconcepts. The richness of the concept-oriented model is based on the existence of very different interpretations of its formal semantics:- A superitem can be interpreted as a characteristic of this item taken by the corresponding attribute or a coordinate of this item in the space of the superconcept. In this case the whole model can be viewed as a hierarchical multidimensional coordinate system where objects are coordinates for other objects.
- Superitem can be also interpreted as sets, groups or categories for their subitems. Thus each item in the model is included into several group superitems and itself includes its subitems.
- Each item is supposed to be an instance of some relation with respect to its superitems and on the other hand its subitems relate it to other items in the model.
- A superitem can be interpreted as a base object for its subitems and on the other hand subitems are extensions for their superitems.
Example
The diagram describes the syntactic structure of a company, which receives orders (concept Orders) consisting of a set of parts from concept OrderParts and then executing them in several operations (concept OrderOperations).
Syntactically Orders concept is characterized by two dimensions a and c with the domains in Addresses and Customers. It also has two inverse dimensions {OrderParts.o} and {OrderOperations.o} with the domains in the concepts OrderParts and OrderOperations. Notice that dimensions are always single valued and correspond to many-to-one relationship. Inverse dimensions are multi-valued and correspond to one-to-many relationship.
Many-to-many relationships are implemented via common subconcepts. For example, we might define a many-to-many relationship isOrderedBy between Products and Customers, which returns a set of customers that ordered some product using subconcepts OrderParts and Orders to implement it.
The primitive or canonical dimensionality of this model is 7 because it is the number of paths from the bottom to the top: {op.p.pg, op.p.a, op.o.a, op.o.c.a, oo.o.a, oo.o.c.a, oo.o} .
Semantically each order item consists of either a set of its parts or a set of operations to be executed for this order. Dually, it is a combination of one (delivery) address and one customer. In the canonical form each item could be represented as a combination of 7 primitive items.
Order items are interpreted as relation instances with respect to its superitems from concepts Addresses and Customers. On the other hand these very Order items are connected with other items in the model by means of subitems from OrderParts and OrderOperations interpreted as relation instances. Thus the role of order items is relative and depend on the level currently considered.
Top concept represents the problem domain at the most abstract level with no details at all. By propagating information in the upward direction we get aggregated values of all properties for the whole company. For example, we might compute the total number of orders or order operations executed in the company by using the corresponding inverse dimensions of the top concept. One inverse dimension is a path with opposite direction. The total number of order parts is computed as follows: orderCount = sum(top.{OrderParts.o.a.t}). Here top is the only top item representing the whole company, o.a.t is the path from OrderParts to this item, and sum is the aggregation function. In fact, this will return all order parts. If we need to count all order parts delivered to some address then this can be done as follows: orderCount = sum(address.{OrderParts.o.a}). Here address is some concrete item.
Bottom concept represents the problem domain at the most detailed level and is equal to the sum of all concepts with no subconcept. Normally this level includes a lot of items for which we can get a lot of properties by using their dimensions. For example, an order part is characterized by one order and one product, which in turn are characterized by their higher level properties and so on till the top concept.
See also
- Inverse dimension
- Concept-oriented programming
- Concept
- Formal concept analysis
- OLAP
- Entity-relationship model
- Object database
- Ontology
- Relational model
- Database
External links
A database model is a theory or specification describing how a database is structured and used. Several such models have been suggested.
Common models include:
..... Click the link for more information.
Common models include:
- Hierarchical model
- Network model
- Relational model
- Entity-relationship
..... Click the link for more information.
In a hierarchical data model, data are organized into a tree-like structure. The structure allows repeating information using parent/child relationships: each parent can have many children but each child only has one parent.
..... Click the link for more information.
..... Click the link for more information.
The network model is a database model conceived as a flexible way of representing objects and their relationships. Its original inventor was Charles Bachman, and it was developed into a standard specification published in 1969 by the CODASYL Consortium.
..... Click the link for more information.
..... Click the link for more information.
The relational model for database management is a database model based on predicate logic and set theory. It was first formulated and proposed in 1969 by Edgar Codd with aims that included avoiding, without loss of completeness, the need to write computer programs to
..... Click the link for more information.
..... Click the link for more information.
An object-relational database (ORD) or object-relational database management system (ORDBMS) is a relational database management system that allows developers to integrate the database with their own custom data types and methods.
..... Click the link for more information.
..... Click the link for more information.
'' In an object oriented database, information is represented in the form of objects'' as used in Object-Oriented Programming. When database capabilities are combined with object programming language capabilities, the result is an object database management system (ODBMS).
..... Click the link for more information.
..... Click the link for more information.
The associative model of data is an alternative data model for database systems. Other data models, such as the relational model and the object data model, are record-based. These models involve encompassing attributes about a thing, such as a car, in a record structure.
..... Click the link for more information.
..... Click the link for more information.
Multidimensional databases are variously (depending on the context) data aggregators which combine data from a multitude of data sources; databases which offer networks, hierarchies, arrays and other data formats difficult to model in SQL; or databases which give a high degree of
..... Click the link for more information.
..... Click the link for more information.
The star schema (sometimes referenced as star join schema) is the simplest style of data warehouse schema, consisting of a few "fact tables" (possibly only one, justifying the name) referencing any number of "dimension tables".
..... Click the link for more information.
..... Click the link for more information.
XML-enabled. These map all XML to a traditional database (such as a relational database), accepting XML as input and rendering XML as output. Native XML (NXD) The internal model of such databases depends on XML and uses XML documents as the fundamental unit of storage.
..... Click the link for more information.
..... Click the link for more information.
A data model is an abstract model that describes how data is represented and used.
The term data model has two generally accepted meanings:
..... Click the link for more information.
The term data model has two generally accepted meanings:
- A data model theory i.e. a formal description of how data may be structured and used.
..... Click the link for more information.
lattice is a partially ordered set (or poset) in which every pair of elements has a unique supremum (the elements' least upper bound; called their join) and an infimum (greatest lower bound; called their meet).
..... Click the link for more information.
..... Click the link for more information.
Order theory is a branch of mathematics that studies various kinds of binary relations that capture the intuitive notion of a mathematical ordering. This article gives a detailed introduction to the field and includes some of the most basic definitions.
..... Click the link for more information.
..... Click the link for more information.
Formal concept analysis, introduced by Rudolf Wille and his students, is a method of data analysis that takes an input matrix specifying a set of objects and the properties thereof, and finds both all the "natural" clusters of properties
..... Click the link for more information.
..... Click the link for more information.
hierarchy (in Greek: Ἱεραρχία, derived from ἱερός — hieros, 'sacred', and
..... Click the link for more information.
..... Click the link for more information.
In computer science, SYNTAX is a system used to generate lexical and syntactic analyzers (parsers) (both deterministic and non-deterministic) for all kind of context-free grammars
..... Click the link for more information.
..... Click the link for more information.
A conceptual schema, or conceptual data model is a map of concepts and their relationships. This describes the semantics of an organization and represents a series of assertions about its nature.
..... Click the link for more information.
..... Click the link for more information.
..... Click the link for more information.
Relation may refer to:
..... Click the link for more information.
- Relation, a person to whom one is related, i.e. a family member (see also Kinship)
- Relation (mathematics), a generalization of arithmetic relations, such as "=" and "<", that occur in statements, such as "5
..... Click the link for more information.
In the context of a relational database, a row—also called a record or tuple—represents a single, implicitly structured data item in a table. In simple terms, a database table can be thought of as consisting of rows and columns or fields.
..... Click the link for more information.
..... Click the link for more information.
The relational model for database management is a database model based on predicate logic and set theory. It was first formulated and proposed in 1969 by Edgar Codd with aims that included avoiding, without loss of completeness, the need to write computer programs to
..... Click the link for more information.
..... Click the link for more information.
..... Click the link for more information.
Online Analytical Processing, or OLAP (IPA: /ˈoʊlæp/), is an approach to quickly provide answers to analytical queries that are multidimensional in nature.
..... Click the link for more information.
..... Click the link for more information.
Inference is the act or process of deriving a conclusion based solely on what one already knows.
Inference is studied within several different fields.
..... Click the link for more information.
Inference is studied within several different fields.
- Human inference (i.e. how humans draw conclusions) is traditionally studied within the field of cognitive psychology.
..... Click the link for more information.
Ontology is a study of conceptions of reality and the nature of being. In philosophy, ontology (from the Greek ὤν, genitive ὄντος: of being (part.
..... Click the link for more information.
..... Click the link for more information.
lattice is a partially ordered set (or poset) in which every pair of elements has a unique supremum (the elements' least upper bound; called their join) and an infimum (greatest lower bound; called their meet).
..... Click the link for more information.
..... Click the link for more information.
Inverse dimension is produced from dimension by inverting its direction. Thus inverse dimensions identify subconcepts for a superconcept.
Inverse dimension takes values from the corresponding subconcept as a domain. However, in contrast to dimensions they are multi-valued.
..... Click the link for more information.
Inverse dimension takes values from the corresponding subconcept as a domain. However, in contrast to dimensions they are multi-valued.
..... Click the link for more information.
Concept is the main programming construct in the concept-oriented programming (CoP). Concept is defined as a pair of two classes:
..... Click the link for more information.
- Reference class and
- Object class
..... Click the link for more information.
Formal concept analysis, introduced by Rudolf Wille and his students, is a method of data analysis that takes an input matrix specifying a set of objects and the properties thereof, and finds both all the "natural" clusters of properties
..... Click the link for more information.
..... Click the link for more information.
Online Analytical Processing, or OLAP (IPA: /ˈoʊlæp/), is an approach to quickly provide answers to analytical queries that are multidimensional in nature.
..... Click the link for more information.
..... Click the link for more information.
This article is copied from an article on Wikipedia.org - the free encyclopedia created and edited by online user community. The text was not checked or edited by anyone on our staff. Although the vast majority of the wikipedia encyclopedia articles provide accurate and timely information please do not assume the accuracy of any particular article. This article is distributed under the terms of GNU Free Documentation License.
Herod_Archelaus
