Gellish Wiki

Each Gellish Database consists of one or more Gellish Database tables. Each of those Gellish Database tables has basically the same structure and is standardised and is application system independent. This is different from conventional databases that usually have proprietary data structures, and that have database tables that are all different. Each of the Gellish Database tables shall contain at least the obligatory columns of one of the subsets of columns that are defined in the Gellish Database Definition document, which is summarised below.
The content of Gellish Database tables shall be compliant with the grammar and the dictionary of the formal Gellish English language (or a Gellish variant in any other natural language). The standardised tables, combined with the formal Gellish language enables to combine an arbitrary number of Gellish Database tables into one Database. Furthermore, such a database might be centralised, but can also be a distributed database. This also enables to combine the results of a [wiki:“Querying a Gellish English database” Gellish query] to various independent data stores, which then act as a distributed database.
The various Gellish Database tables all have the same core of column definitions. Apart from that core, the tables may also have one or more of the optional columns. Preferred collections of columns are defined in standard Gellish database table subsets.

A Gellish Database may be implemented in various formats. It can be in the form of an SQL database, or in XML, or even in XLS (the form of Excel spreadsheet tables).

Conventional databases typically consist of many tables, each of which is composed of a number of columns. The definition of those tables and columns determine the storage capabilities of the database, whereas the relations between the columns define the kinds of facts that can be stored in such a database. Those columns and relations determine the database structure that defines the expression capabilities of the database. Similar rules apply for the structure of data exchange files and thus for the information that is exchanged in electronic data files. br This conventional database technology has some major constraints:

• When data was not covered during the database design and thus is not included in the data model, then such data cannot be stored in the database nor exchanged via such a data file structure.
• Different databases have different data structures, which causes that data in one database cannot be integrated with data from other databases nor exchanged between databases without dedicated data conversion.
• A database modification or extension requires redesign of the database structure, modification of software and data conversion, which makes it a relatively complicated and costly exercise.

Another characteristic of conventional databases is that there are hardy international standards available or used for the content of the databases, being the data that is entered by its users. This typically means that local conventions are applied to limit the diversity of data that may be entered in those databases. As local conventions usually differ from other local conventions this has as disadvantage that data that are entered in one database cannot be compared or integrated with data in other databases, even if those database structures are the same and even if the application domain of the databases is the same. For example, within a company there may be various implementations of the same system in various sites for the storage of data about equipment, whereas for example the performance data about the same type of equipment still cannot be compared with the performance data in another location, because the equipment types have different names and the properties are also different.

A Gellish database does not have the semantic limitations that conventional databases have, because of the flexible and open Gellish language and because of its standard universal data structure (grammar), which is simple, computer and human interpretable. A Gellish database consists of one or more database tables, each of which has the same table structure (column definitions). The fact that those Gellish Database tables are standardised and universally applicable makes a Gellish database application independent. A standardised Gellish database table is universally applicable because it enables the application of the following two fundamental principles:

1. Explicit classification of individual things or explicit specialisation of classes, with an unlimited number of classes in a dictionary.
1. The Gellish database table enables to store any kind of object; because any individual object can be introduced by specification of an explicit classification relation between the object and a class, whereas classes (kinds of objects or concepts) can be selected from the very large number of classes that are already defined in the Gellish English Dictionary and if the proper class is not available it can be added by specification of a subtype-supertype relation with a direct supertype of the new class. This is fundamentally different from conventional databases that predefine the object types (classes) about which information can be stored by defining a limited number of entity types and attribute types in a fixed data model.
1. Explicit classification of relations (facts), by an extensible unlimited number of standardised relation types.
1. The Gellish database table enables to store any kind of fact about any kind of object, because any fact is expressed by a relation, whereas those relations are explicitly classified by relation types that can be selected from the standardised relation types that are defined in the Gellish Dictionary or by relation types that are added to the dictionary as proprietary extensions. This is fundamentally different from conventional databases that predefine a fixed and limited number of relation types between the columns in the database tables (whereas unfortunately those relation types are usually defined only in an implicit way).

As a consequence, a Gellish database does not need to be modified or extended when the scope of an application changes and facts from different Gellish databases can be merged and integrated whenever required without a need for a conversion exercise. br Furthermore the content of a Gellish Database uses a common Gellish Dictionary for all its data, including for example, equipment types, property types, document types, activity types, etc.

A Gellish Database is a database that contains one or more standardised Gellish Database tables. Each such table contains the same predefined columns and is suitable for the expression of virtually any kind of fact such that is computer interpretable and system independent. The table can be implemented as an MSAccess database table, an SQL database table or simply as a standard table in a spreadsheet. The core of a Gellish Database table consists of three columns, just as is the case in RDF/Notation 3. Each row with those three columns in such a table expresses a main (binary) fact. For example, the fact that the Eiffel tower is located in Paris can be expressed as follows:

The left hand objects and the right hand objects may either be selected from the Gellish English dictionary or may be new proprietary objects that are introduced by defining them on separate lines. If such a new object is an individual thing, then it shall be defined by a classification relation with a class, as is done in the above table and if the nwe object is a class, then it shall be defined on a separate line by a specialisation relation with their direct supertype. The relation types (such as 'is located in' and 'is classified as a') shall be selected from the Gellish English dictionary, otherwise the expression cannot be called standard Gellish, but becomes a proprietary extension of Gellish English.

Furthermore, a Gellish database structure supports the simultaneous use of multiple languages. This is enabled because a Gellish database table contains a separate column for the language in which a fact is expressed (see the example table below). Thus a Gellish database supports the use of various natural language specific versions of Gellish. In principle, there is a Gellish variant language for each natural language, depending on the availability of a translation of the Gellish concepts. For example, the Gellish English Dictionary defines Gellish English, and contains partial translations to Gellish Deutsch (German) and Gellish Nederlands (Dutch). International terminology (such as most units of measure and mathematical concepts) is included as International Gellish.

A Gellish database uses a unique identifier for each thing, irrespective whether it is a user object, a concept from the Gellish dictionary, a fact or a relation type. The following Gellish database table is an extended version of the above example and includes the language in which the fact is expressed as well as the identifiers of the objects.

The unique identifiers enable the use of synonyms and homonyms and enable that a computer can automatically translate a Gellish expression in a certain language into a Gellish expression in another language. This is caused by the fact that the meaning of a Gellish expression is captured as a relation between the unique identifiers, so that the meaning is language independent. br This adds automatic translation capabilities to Gellish expressions, because a Gellish message can be created e.g. in Gellish English whereas computer software can present it in another Gellish variant, such as Gellish Dutch if a dictionary or a translation is available, such as on the third line in the above table.

A full Gellish database table has a number of additional columns that enable the expression of auxiliary facts or data about the main facts. For example, columns for:

• a textual definition of the left hand object
• the context in which a fact is valid
• a unit of measure with its UID
• the status of the fact (accepted, proposed, deleted, replaced, etc.)
• the originator of the fact
• the date of creation of the fact
• etc.

= 4. Gellish Database Table Definition =

The document '[http://sourceforge.net/project/showfiles.php?group_id=28353 The Gellish Database Definition]' defines the full set of columns in each table of a Gellish Database. It also defines a number of standardised subsets for usage in applications that do not require the full number of columns. br One of those subsets, the Business Model subset, is suitable for nearly all database contents data exchange usecases that describe knowledge and propositions. It application range includes business communication about both designs (imaginary objects) as well as real world objects (observed individual objects) during their lifecycle and about enquiries, answers, orders, confirmations, etc. This table is a superset (indicated in 'bold') of the product model table, so it can also be used for knowledge about classes of objects. br This subset consists of the following columns in the indicated sequence: br 0, 54, 71, 16, '39', 2, 44, 101, '43', '19', '18', 1, 60, 3, '42', 15, 45, 201, 65, 4, 66, 7, 14, 8, 67, 9, 10, 12, 13, 50, 68.

Each Gellish database table file has in principle a table header as illustrated in Figure 3, extended with additional columns as described in this chapter. br A Gellish database table can consist either of a complete set of columns or of one of the pre-defined subsets of columns as described above. br Each column has a column ID and a column name and has a meaning as defined below. br Note that the presence of a value in a column field implies one or more relations with values in other columns as described below. Those relations define the facts about the objects!

If the table is implemented in a spreadsheet or ASCII or Unicode file, then the table starts with a header of three lines, as follows:

• The first line contains a sequence of the following four fields A1, A2, A3 and A4, which shall contain the following text:

A1 = ’Gellish’ br A2 = ‘Version:’ br A3 = version number of the applicable Gellish dictionary br A4 = date of the release of the facts in this table (optional). br followed by free text fields.

• The second line contains the column ID’s which consists of standard numbers, although arbitrarily chosen. They allow the columns to be presented in a different sequence without loss of meaning (the numbers below correspond to those column ID’s).
• The third line contains human readable text in every column field providing a short name of the column. This name is free text.

The lines in a Gellish database table are independent of each other and thus the lines may be sorted in any sequence, without loss of semantics (meaning).

Each line (row) in the body of a Gellish database table (which in a spreadsheet starts on the fourth line) expresses a group of facts, which consists of a main fact and a number of auxiliary facts.

'Main fact.' br A main fact is expressed by a combination of the following three objects in the columns:

• A left hand object id (2), a fact id (1) and a right hand object id (15).

'Prime auxiliary facts.'

The prime auxiliary facts are expressed by the following pairs of objects (the third object that identifies the fact is left implicit, but should be made explicit in a database):

• The relation between the left hand object id (2) and the left hand object name (101).
• The relation between the right hand object id (15) and the right hand object name (201).
• The relation between the fact id (1) and the relation type id (60).
• The relation between the relation type id (60) and its name (3).

'Secondary auxiliary facts.'

The secondary auxiliary facts are expressed by the pairs of objects that form the context for the validity of the id’s and names for objects identified by their id’s:

• The relation between the main fact (1) and its validity context (18).
• The relation between the left hand object id (2) and its uniqueness context (17).
• The relation between the right hand object id (15) and its uniqueness context (52).
• The relation between the uniqueness context for the left hand name (16) and the relation between left hand object id and left hand object name (2, 101).
• The relation between the uniqueness context for the right hand name (55) and the relation between right hand object id and right hand object name (15, 201).

'Ternary auxiliary facts.'

Some ternary auxiliary facts as described in the table below.

Dependent on the type of main fact (the main relation and its relation type) slightly different auxiliary facts can be distinguished and thus slightly different conventions are used to fill in the fields on the line as indicated in the table below.

Several columns contain unique identifiers (UID’s). Each UID should preferably be represented by a 64-bit integer (8-byte, Int64 or bigint'),' whereas only positive values shall be used. It is not recommended to use an unsigned integer (which only allows positive values) because SQL only enables the bigint datatype, which is signed. br Most other columns contain character string values. For database implementations it is indicated whether they have a fixed or variable length (nvarchar of varchar) or whether the string is externally stored (data types ntext and text). In addition to that it is indicated whether the cells may contain Unicode. br Fields in columns that are indicated as optional may be left empty, in which case the indicated default value is applicable. Otherwise a field value is obligatory.

The table columns in a Gellish database table are defined as follows (the Col id numbers correspond with the column ID’s in a table):

'Continue with '[wiki:“Dictionary Extension”] —- br [http://gellish.wiki.sourceforge.net/page/edit/Gellish+Database?token=264bbd7424cde6f4705a977c96136f36#_ftnref1 [1]] See http://support.microsoft.com/kb/q180162/