Search Results for "hash data"

...You can run atomic operations on these types, like appending to a string; incrementing the value in a hash; pushing an element to a list; computing set intersection, union and difference; or getting the member with highest ranking in a sorted set. To achieve top performance, Redis works with an in-memory dataset. Depending on your use case, you can persist your data either by periodically dumping the dataset to disk or by appending each command to a disk-based log.

Symmetrical Mulitple Databace - Non center, auto spliting, auto backup, auto error recover, data storage and calculation distribute. For large scale web site storage and calculation. Small Server - Simply multiply thread socket server. Nodes are some servers or hosts with fixed ip-port pairs. Nodes are configed with several known friends. Every node maintains a hash table-rbtree data structure that contains the node map information.

The Open Extract Processor (OEP) is a database ETL utility capable of merging/sorting/aggregating large partitioned database extracts. Native data files can be created from text files or from the accompanying MYSQL and Oracle import/export programs.

A library providing basic building blocks for creating in-memory databases of important data. Existing components are: Linked lists; Hash tables with optional auto-resize; Memory-efficient sparse matrices built on hash tables; Red-black trees. NOTE: This project is moving to Github; https://github.com/klmitch/dbprim