Truly Non-Relational (NoSQL) with full Transactional DBMS Technology

Non-relational DBMS

For over 35 years, FairCom has been working with unstructured data. c-treeACE is built as an advanced key-value store.

Key-Value Store

Our key-value store is built on our mature ISAM technology which has been developed over 35 years.

ACID-Compliant Transactions

c-treeACE provides full transaction support for both SQL and non-relational data access, concurrently.

Seamless SQL integration

FairCom gives you a full SQL engine on top of your unstructured data.

An Advanced Key-Value Store Offers Indexing and Footprint Advantages

FairCom’s c‑treeACE database is an advanced, ACID-compliant, key-value store based on our traditional ISAM engine. What makes our technology unique is that we give you direct API access to our low-level key-value engine. This can all be done in a code footprint ⅓ the size of a full SQL engine.

FairCom’s technology provides utmost flexibility with your data architecture by allowing data of any type to be stored within your record structure, without dictionary-managed, pre-defined schemas or field definitions. Comprehensive indexing flexibility allows multiple indexes over any portion of data, or any type of data. Together, these features afford advanced performance-driven data search capabilities.

no_plus_sql

Full Transaction Support

Non-relational ACID Transaction Processing

A feature unique to c‑treeACE is the ability to offer industrial quality on-line transaction processing (OLTP) features in our key-value store. These features guarantee full ACID (atomicity, consistency, isolation, durability) compliance on all transactions. Multiple save/restore points are supported, ensuring maximum flexibility and integrity of your data. Rollback and restore to any portion of a transaction without abandoning the entire transaction.

Smart Performance

Advanced Indexing Techniques

FairCom’s extremely flexible indexing technology empowers the application developer to drive performance by fine tuning their indexes using features such as:

Full-Text Search – the ability to index all the individual words in a text field
Conditional Indexing – essentially a sophisticated index-level filter
Deferred Indexing – enables non-relational record Adds, Deletes, and Updates to delay key insert/delete operations on individual index file(s) for potentially sizeable performance gains
Temporary Indexing – the ability to dynamically add temporary indexes which can be removed automatically when the file is closed or (optionally) persisted to disk for future use

Data Partitioning

A partitioned file logically appears to be one file (and its associated index files). It is actually a set of files whose contents are partitioned by the value of a partition key. Data within a defined range of partition key values can be rapidly purged or archived without having to delete, record by record, each record within this range. Ideal for creating a database shard.

Data Filtering

Allows developers to access a qualified set of records specified by a conditional statement. It temporarily restricts access to records that meet the filter criteria, substantially reducing network traffic because only the records that satisfy the filter condition are returned.

Data Sets

You can define a portion of the index to work over only a subset of the defined index. You have the benefit of more flexible indexes without the overhead of creating additional indexes that must be maintained for every database operation.

Non-Relational DBMS