Abstract: Embodiments include an evaluator that can receive a query containing a predicate from an application executing on a client device. The evaluator can process the predicate using a tree structure containing nodes representing objects and edges representing relationships thereof. The processing can include applying filters to attributes of the relationships to identify a first set of objects relevant to the predicate and navigating along each incoming role of a relationship and from there via an outgoing role to other objects to identify a second set of objects relevant to the predicate. An object is relevant to the predicate if at least a value of a field of the object is equal or similar to a value of the predicate. Responsive to the query, the evaluator can return identifiers associated with a united set of the first set of objects and the second set of objects to the application.

Abstract: The present invention provides a method for performing transactions on data entities in a database and a transactional database. The database comprises an ordered set of data stores with at least one static data store, wherein said static data store uses an index structure based on a non-updatable representation of an ordered set of integers according to the principle of compressed inverted indices. The method allows to generate a modifiable data store when the performed transaction comprises an insert, update or delete operation, to execute operations of the transaction on the ordered set being present at the time when the transaction has been started and, if present, on the modifiable data store and to convert data stores to a new static data store, The insert, update or delete operation are executed on the modifiable data store which is the only data store modifiable for the transaction.

Abstract: Embodiments include an evaluator that can receive a query containing a predicate from an application executing on a client device. The evaluator can process the predicate using a tree structure containing nodes representing objects and edges representing relationships thereof. The processing can include applying filters to attributes of the relationships to identify a first set of objects relevant to the predicate and navigating along each incoming role of a relationship and from there via an outgoing role to other objects to identify a second set of objects relevant to the predicate. An object is relevant to the predicate if at least a value of a field of the object is equal or similar to a value of the predicate. Responsive to the query, the evaluator can return identifiers associated with a united set of the first set of objects and the second set of objects to the application.

Abstract: The present invention provides a method for performing transactions on data entities in a database and a transactional database. The database comprises an ordered set of data stores with at least one static data store, wherein said static data store uses an index structure based on a non-updatable representation of an ordered set of integers according to the principle of compressed inverted indices. The method allows to generate a modifiable data store when the performed transaction comprises an insert, update or delete operation, to execute operations of the transaction on the ordered set being present at the time when the transaction has been started and, if present, on the modifiable data store and to convert data stores to a new static data store, The insert, update or delete operation are executed on the modifiable data store which is the only data store modifiable for the transaction.