Differences between version 8 and predecessor to the previous major change of DataBase.
Other diffs: Previous Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 8 | Last edited on Saturday, June 25, 2005 8:24:26 am | by AristotlePagaltzis | Revert |
| Older page: | version 1 | Last edited on Thursday, June 19, 2003 5:31:37 pm | by CraigBox | Revert |
@@ -1,7 +1,9 @@
-A collection of data arranged for ease and speed of
search and retrieval.
+A collection of data,
arranged for uniform
search and retrieval.
-More often than not, a database is made up of
one or more 'tables'
of data, and relationships can be defined between these tables
- for instance you could have one table called contacts containing the names
of people in an address book
, and another called phones containing their various phone and fax numbers
. Both
of these tables would have to identify who
the information was about, and so would have the identifying piece
of information in common
. This commonality is known as a relationship. From this we get Relational Database Management Systems ([RDBMS])
.
+The actual form can vary wildly. FlatFile~s and [CSV]s are very simple databases. HierarchicalDataBase~s are
one of the longest
-established types
of DataBase
, with [GDBM] being a prime example
. [XMLDataBase]s are currently flavour
of the month for all sorts
of reasons
. But the most widely used form are RelationalDataBase~s and their practical offspring PostRelationalDataBase~s
.
-Examples include
[Oracle
], MySql, [PostgreSQL], [Microsoft] [SQL] Server, Informix, [Borland] Interbase, FireBird
and [IBM] DB2
.
+InformationSystem~s such as
[MG
] use InvertedIndex~es
, which serve to both compress
and index natural language text
.
-See PostgresVsMysql
+!
See also:
+* [RDBMS]
+*
PostgresVsMysql
