A database value as of a point in time. With asOf, you can reuse existing queries and rules to ask questions about points in time other than the present.
Something that can be said about an entity . An attribute has a name, e.g.
:firstName, and a value type, e.g.
:db.type/long, and a cardinality.
An entity identifier that refers to an attribute.
A backup URI is a per-database URI specifying a backup location on a local filesytem path with
file://full/path/to/backup-directory@@html: </code>@@ or an S3 path with
The database t that is the basis for the current database, i.e. the most recent point-in-time that this database has seen.
Property of an attribute that specifies how many values of the attribute can be associated with a single reference entity. Possible values are
Nodes use a variety of caches
closed world assumption
Assumption that truth is what the database knows. Databases that intend to store data of record typically make the closed world assumption. Datomic adheres to the closed world model.
See component .
Client object that provides access to a database. Programs can use a connection to submit transactions and queries.
A covering index contains (rather than points to) the data. Datomic indexes are covering indexes.
Information used to authenticate for a particular task. In accordance
with the principle of least privilege, Datomic allows separate
credentials for each different activity performed by a running system.
A database is a set of datoms.
A Unique Resource Identifier pointing to a specific Datomic database. URI syntax is described in the datomic.api/connect doc string.
A function installed in a database, i.e. an attribute value whose type is :db/fn.
An atomic fact in a database, composed of entity/attribute/value/transaction/added. Pronounced like "datum", but pluralizes as datoms.
A deductive query system, typically consisting of:
A database of facts
A set of rules for deriving new facts from existing facts
a query processor that, given some partial specification of a fact or rule: finds all instances of that specification implied by the database and rules, i.e. all the matching facts
Datomic's built-in query is an implementation of Datalog.
an attribute used to model something in your application domain.
The extensible data notation is used by Datomic and other applications as a data transfer format.
Encrypted form of credentials. Datomic encrypts credentials in places
like EC2 user data to reduce the threat generic exploits.
The first component of a datom , specifying who or what the datom is about. Also the collection of datoms associated with a single entity, as in the Java type, Entity.
An opaque identifier assigned by Datomic that uniquely identifies an entity. Entity ids are integers for efficiency, but application programs should treat them as opaque ids.
a value that identifies an entity. Can be an entity id, an ident, or a lookup ref.
an instantiated set of all the resources need to run an application.
a unique identifier external to Datomic. Typical external key types are email address, UUID, and URI. External key attributes should be declared as
Period of time bounded by writing index to storage. During an epoch, indexing is done in memory. At epoch boundaries, the in-memory index is merged with the persistent index, and a new persistent index is written to the storage service (without blocking the system).
The complete removal of a set of datoms matching a predicate. Excision should be a very infrequent operation, and should not be used to correct erroneous data.
See datom .
Fressian is an extensible binary format that is used everywhere data is serialized by Datomic: on the wire, at rest, and in caches. Fressian is designed to be:
simple to implement and consume
compact and fast
friendly to dynamic and static languages
compressible in domain-specific ways
Data type representing a name, e.g.
A value of type
:db/ident that uniquely identifies an entity .
Sorted collection of datoms. Indexes are named by the order in which datom components are used for sort, e.g. An index that sorts first by entity , then attribute , then value , then tx is called EAVT.
The set of all environments for an application.
A list containing a unique attribute and a value that identifies an entity.
Statistics used to measure the health of a running system. By default, Datomic records metrics using Amazon's CloudWatch.
Prefix portion of a keyword used to make the keyword globally unique. Namespaces serve a similar function to table names in a relational store, without imposing any obligations or limitations, e.g. an entity can have attributes from more than one namespace.
Nodes maintain an on-heap cache of segments containing the most recently used datoms.
named slots for application configuration data.
A logical grouping of entities in a database. Partitions have unique qualified names. Every entity belongs to a partition that is assigned when the entity is created. Partitions act as a storage hint, so that larger systems can plan ahead for better locality of reference for entities that are frequently accessed together. Partitions are typically coarser grained than relational tables. Partitioning is invisible to the query system, and therefore has no impact on the code you write to access the database.
A process that uses the Datomic library to interact with a system, and obtain connections to interact with one or more databases . Peers have in-memory access to database values, and an integrated Datalog query engine. There can be many kinds of peers, with capabilities varying by platform and need.
a declarative way to make hierarchical selections of information about entities
An attribute that refers to another entity. References always have the value type
See reference .
Generic name for transactor/peer/persistence service., e.g. "The process claims the transactor role by placing a well-known value in SDB upon startup." Used in the config tools
A named group of query constraints, to allow re-use of logic across queries.
The set of possible attributes that can be associated with entities. Only defines the characteristics of the attributes themselves, not which attributes can be associated with which entities.
a built-in attribute used to define schema, e.g. all attributes are named by
Indexes store datoms as a tree of segments, where the leaf nodes contain a few thousand datoms each.
A cache that stores fressian -serialized data, e.g. in memcached. A segment cache takes much less memory than equivalent data in the object cache , but is slower to access. Peer and transactor processes use both object caches and segment caches.
The durable elements managed by a Datomic system.
Subsystem responsible for persistence and nothing else. Datomic is designed so that the persistence layer is pluggable, and so that other functions traditionally associated with persistence are handled elsewhere. In particular, storage is provisioned separately from query and transaction capabilities
A complete Datomic installation, consisting of storage resources, a primary compute stack, and optional query groups.
Data structure that can be resolved to a point in time in a database. Can be a database t, a tx, or a date.
A point in time in a database. Every transaction is assigned a numeric t value greater than any previous t in the database, and all processes see a consistent succession of ts.
An entity representing a transaction . Every datom in a Datomic database includes the tx that created it, allowing recovery of the entire history of the database. Transactions are automatically associated with wall-clock time, but are otherwise ordinary entities. In particular, application code can make additional assertions about transactions.
An atomic unit of work in a database. All Datomic writes are transactional, fully serialized, and ACID (Atomic, Consistent, Isolated, and Durable).
a function that runs inside a transaction, taking the current database value plus user arguments and expanding into data to be added by the transaction.
an accumulate-only log of all transactions, stored in DynamoDB.
A process with the ability to commit transactions for a given
database. At any moment in time, a running database has exactly one transactor,
but any number of peers .
An ordered list of elements. Datomic queries return sets
=db.unique/value=: attempts to assert a duplicate value will fail
=db.unique/identity=: attempts to assert a duplicate identity will upsert
Either insert or update an entity , depending on whether the unique entity already exists.
An SSD-backed cache of segments. Valcache is similar in performance to memcached but durable and capacious.
sorted for indexing
represented in a programming language type