Search Results for "btree++"
Sort By:
Showing 10 open source projects for "btree++"
View related business solutions-
Boost application security and continuity with SKUDONET ADC, our Open Source Load Balancer, that maximizes IT infrastructure flexibility. Additionally, save up to $470 K per incident with AI and SKUDONET solutions, further enhancing your organization’s risk management and cost-efficiency strategies.
-
Whether natural disaster, cyberattack, or plain-old human error, data can disappear in the blink of an eye. ConnectWise BCDR (formerly Recover) delivers reliable and secure backup and disaster recovery backed by powerful automation and a 24/7 NOC to get your clients back to work in minutes, not days.
-
1
GoDS
Implementation of various data structures and algorithms in Go
GoDS, which means "Go Data Structures", is an implementation of various data structures and algorithms in Go. It provides a wide variety of containers (Sets, Lists, Stacks, Maps, Trees), sets (HashSet, TreeSet, LinkedHashSet), lists (ArrayList, SinglyLinkedList, DoublyLinkedList), stacks (LinkedListStack, ArrayStack), maps (HashMap, TreeMap, HashBidiMap, TreeBidiMap, LinkedHashMap), trees (RedBlackTree, AVLTree, BTree, BinaryHeap), comparators, and iterators. Containers are either ordered... -
2
pfs
a file system driver for linux
PFS is a try to design a filesytem by myself, it's designed depend on inode , and ensure the consistency of the filesystem. The first version, pfs is a application program for linux, now it's a driver for linux. pfs isn't depend on bit map or btree, it also don't support log. At the first version, i try to deal with the dependency of filesystem to make sure the consistency for filesystem.now, i want to improve the measure, so the driver for linux don't ensure the consistency fo filesystem(i... -
3
A better btree library
A small, sane btree lib, derived from the old berkeley db 1.85 code
A small, sane btree library, derived from the old berkeley db 1.85 code base. - as fast and simple as a sequential text file for sequential writes - easy to use, difficult to abuse - large data values and large key values that actually work - a cache management that tries to avoid any btree corruption: - if a page is evicted, all dirty pages are flushed to the underlying fd - signals are blocked in the critical section. - low space conditions are checked before entry... -
4
Big Sack
Big Sack: A lightweight Java Key/Value store with undo and disk cache.
Big Sack is a Java persistence mechanism that allows storage of key value pairs following the popular Big Data paradigms. Its a very simple and straightforward way to bridge the gap between in-memory data structures and long-term storage. It has the convenience of Java SDK TreeMap and TreeSet classes and is used the same easy way, but it includes rollback through undo logging to checkpoint data so it does not wind up in an unknown state regardless of failures. Data storage in the exabyte... -
BrightGauge, a ConnectWise solution, was started in 2011 to fill a missing need in the small-to-medium IT Services industry: a better way to manage data and provide the value of work to clients. BrightGauge Software allows you to display all of your important business metrics in one place through the use of gauges, dashboards, and client reports. Used by more than 1,800 companies worldwide, BrightGauge integrates with popular business solutions on the market, like ConnectWise, Continuum, Webroot, QuickBooks, Datto, IT Glue, Zendesk, Harvest, Smileback, and so many more. Dig deeper into your data by adding, subtracting, multiplying, and dividing one metric against another. BrightGauge automatically computes these formulas for you. Want to show your prospects how quick you are to respond to tickets? Show off your data with embeddable gauges on public sites.
-
5
Cheetah Database System
Small, Fast, dBase/FoxPro compatible database library (Cheetah4.dll)
xBase database library. Creates traditional dBase III Plus and FoxPro database files. Unique dual btree indexes allow multiple indexes in each disk file. Small disk/memory footprint (81K). Ability to interface to multiple programming languages. Cheetah is an extremely fast, old school, traditional record manager. Cheetah can be used with any compiler that can link to a standard Windows DLL. -
6
B-Tree implemented in Common Lisp. Stores key/value pairs onto disk based data structure. Current implementation has been tested with SBCL. Project was originally at alien-consader.org but is now made available at SourceForge.
-
7
NitroCache
Extremely fast, scalable, concurrent, pure Java In-memory cache
One of the fastest, 100% Pure Java In-memory cache. Its aimed at providing very fast, light, highly scalable cache with high concurrency. The fetch operation from cache are always in constant time, O(c), irrespective of the number of threads accessing the cache or cache size. NitroCache uses unique custom algorithm inspired by Btree, skiplist and hashing to deliver a constant time cache with lock-less fetches. For details on using NitroCache, please visit wiki section Note... -
8
Object pascal library (TurboPascal, Delphi, Free Pascal Compiler). Btree indexes, DBF database files, tools for user interface and more.
-
9
Cross platform indexed file btree implementation in C#, java and Python: Commit/abort transactions, localized unicode string order, recovery of damaged files, and configurable memory footprint, hashing, prefixing, and object serialization.
-
Chat with your business data with Looker. More than just a modern business intelligence platform, you can turn to Looker for self-service or governed BI, build your own custom applications with trusted metrics, or even bring Looker modeling to your existing BI environment.
-
10
This is a full implementation of a B+Tree disk based system written in C, suitable for use in most any applications that requires a BTree type index. It is intended for use on all versions of Unix operating systems and portable to Windows OS
- Previous
- You're on page 1
- Next