fis-gtm 6.0-003-1 source package in Ubuntu
Changelog
fis-gtm (6.0-003-1) unstable; urgency=low * Initial release (Closes: #541239) -- Andreas Tille <email address hidden> Sun, 24 Nov 2013 09:26:25 +0100
Upload details
- Uploaded by:
- Debian Med
- Uploaded to:
- Sid
- Original maintainer:
- Debian Med
- Architectures:
- all amd64 i386
- Section:
- misc
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| fis-gtm_6.0-003-1.dsc | 1.6 KiB | 13249322bff3553d3fdac9d077e6b26b4ba91c7315f4e6179748f9661e1dcd2a |
| fis-gtm_6.0-003.orig.tar.gz | 4.7 MiB | e261760decab8150851639c6ddd67528513bbd9b58ef8b20bed5d52090c46dc6 |
| fis-gtm_6.0-003-1.debian.tar.gz | 17.5 KiB | 3c6047530f24f6a7e2e85a19eae6f464e5040e244305563343a73d27d1a8b4e4 |
No changes file available.
Binary packages built by this source
- fis-gtm: metapackage for the latest version of FIS-GT.M database
GT.M is a database engine with scalability proven in large real-time
transaction processing systems that have thousands of concurrent
users, individual database file sizes to the Terabyte range (with
virtually unlimited aggregate database sizes). Yet the light
footprint of GT.M allows it to also scale down for use in small
applications and software appliances (virtual machines).
.
The GT.M data model is hierarchical associative memory (i.e.,
multi-dimensional array) that imposes no restrictions on the data
types of the indexes or content - the application logic can impose
any schema, dictionary or data organization suited to its problem
domain. (Database engines that do not impose schemas, but which
allow layered application software to impose and use whatever schema
that is appropriate to the application are popularly referred to as
"document oriented", "schemaless" or "schema-free" databases.)
.
GT.M's compiler for the standard M (also known as MUMPS) scripting
language implements full support for ACID (Atomic, Consistent,
Isolated, Durable) transactions, using optimistic concurrency control
and software transactional memory (STM) that resolves the common
mismatch between databases and programming languages. Its unique
ability to create and deploy logical multi-site configurations of
applications provides unrivaled continuity of business in the face of
not just unplanned events, but also planned events, including planned
events that include changes to application logic and schema.
.
This metapackage always depends from the default fis-gtm version.
- fis-gtm-6.0-003: package for FIS-GT.M database
GT.M is a database engine with scalability proven in large real-time
transaction processing systems that have thousands of concurrent
users, individual database file sizes to the Terabyte range (with
virtually unlimited aggregate database sizes). Yet the light
footprint of GT.M allows it to also scale down for use in small
applications and software appliances (virtual machines).
.
The GT.M data model is hierarchical associative memory (i.e.,
multi-dimensional array) that imposes no restrictions on the data
types of the indexes or content - the application logic can impose
any schema, dictionary or data organization suited to its problem
domain. (Database engines that do not impose schemas, but which
allow layered application software to impose and use whatever schema
that is appropriate to the application are popularly referred to as
"document oriented", "schemaless" or "schema-free" databases.)
.
GT.M's compiler for the standard M (also known as MUMPS) scripting
language implements full support for ACID (Atomic, Consistent,
Isolated, Durable) transactions, using optimistic concurrency control
and software transactional memory (STM) that resolves the common
mismatch between databases and programming languages. Its unique
ability to create and deploy logical multi-site configurations of
applications provides unrivaled continuity of business in the face of
not just unplanned events, but also planned events, including planned
events that include changes to application logic and schema.
