ADAM goes Relational

Random Access

The development of Random Access data files using hash keys by Patrick Shackleton, followed by the Linked Random concept he developed shortly afterwards, made ADAM for many years the most efficient data handling technique for transaction processing available.

Recently, the combination of B-tree indexing ( proposed by Knuth, implemented by Patrick ) and ODBC capability have transformed ADAM into a relational database without losing its original speed capability.

SQL

This breakthrough, developed by AIA's system team, enables typical client programs such as forms or spreadsheets to access ADAM on the server relationally, using the full power of SQL, joins and so on. However, programs resident on the server can either access ADAM using SQL, or directly using the Linked Random technique for high speed.

In addition to increasing the power and flexibility of ADAM per se, this breakthrough enables ADAM to co-exist with other relational databases such as Oracle or Informix, enabling the client software to access data across all environments.

A further variant of the client / server relationship is discussed on the Thin Client page.

---