Search Results for "trees"

SeaQuery is a query builder to help you construct dynamic SQL queries in Rust. You can construct expressions, queries and schema as abstract syntax trees using an ergonomic API. We support MySQL, Postgres and SQLite behind a common interface that aligns their behavior where appropriate.

Nonblonde is a key/value database. Nonblonde tables are backed by b-trees that organize their nodes as critical bit trees. It allows multiple tables per store, atomic updates, keys of unlimited size. Head and tail key compression and a variable block size reduce the database disk size. Disk blocks are never modified in place, for which the written database is always in an intended state and does not need repair or recovery.

This project is completely free and open to use under the MIT license. Keyboard navigation. Drag & Drop. Virtual Scroll to support large trees. Checkboxes, Async children load. Expand/collapse/select nodes. Events: activate, collapse, expand, focus, etc. Custom node template (string or component) Custom loading component (for async data). Custom children/name attributes. API, very basic customizable CSS. Angular Tree Component comes with a default mapping of mouse events and key events to actions. ...

Hitchhiker-Tree is a functional, immutable, off-heap, snapshottable sorted map data structure (a persistent key-value tree) designed for scalable, high-performance storage in Clojure / ClojureScript systems. It blends ideas from fractal trees and B-trees, supports lazy loading, and can persist incrementally to arbitrary backends. It is used as a backend for systems like Datahike and can support enormous data sets while retaining functional persistence semantics. Outboard is a simple API for your Clojure applications that enables you to make use of tens of gigabytes of local memory, far beyond what the JVM can manage. ...

Windows LDAP editor, includes support for POSIX groups and accounts, SAMBA accounts, some Postfix objects and more

...But where treedb comes into its own is when it comes to allocating from a mmap()ed disk file - the memory becomes persistent. If you follow the tests/examples, you too can store dictionaries, trees, lists or whatever you can think of in disk-based memory, just an open() and mmap() away. Meta-treedb comes with an AVL tree, doubly-linked-list and variable-entry-sized-array implementations for you to use in your data structures. So, what distinguishes meta-treedb from treedb? * "class" interfaces for treedb collections These are vtables (virtual function tables) that implement the interface...

TreeBASE is a database and web front end that stores phylogenetic trees and the data matrices used to generate them. The current iteration comprises a complete rewrite of the schema and web layer, and will include a web services layer.

...As such, the library is optimized for handling any type of data-size by using advanced streaming and caching algorithms. With the designer, you are able to create different types of decision trees, random forests, n-grams, pattern-matchers, conversational agents and all sorts of AI related algorithms. You can combine statistical approaches as well as pattern matchers or others. Do natural language processing, image or data analysis & interpretation,...

An environment where everything can be kept in an interconnected way ...dependencies, parallel serials, multiple layers/levels - trees. One system based on another. Top-down, bottom-up concepts.

CorpusSearch finds syntactic structures in a corpus of annotated sentence trees. It can be used as a research tool on a corpus, or as a development tool for building the corpus.

Our goal is to create the world's fastest extendable, non-transactional time series database for big data (you know, for kids)! Log file indexing is our initial focus. For example append only ASCII files produced by libraries like Log4J, or containing FIX messages or JSON objects. Occursions was built by a small team sick of creating hacks to remotely copy and/or grep through tons of large log files. We use it to index around a terabyte of new log data per day. You can use it too. Who...

representation by relations vs data storage. pile unifies the contradicted qualities of tables/trees (databases) and complex networks, order and flexibility. dynamical data generation on call. fast. natively compressing similarities. search across scopes.

Bonsai collection software for *nix systems and windows, based on Qt and mySql or sqlite. Manage your trees, pots and pictures and export your data to html.

iMeMex is a dataspace management system. iMeMex is a research prototype. The package also provides several useful components for research such as external sorting, B+-trees, inverted indexes, content converters, query operators, and graph indexes.

...Users have many choices in configuring what features they want the database to have and in how the data is stored. Features are for instance transactions and fast B+ trees.

A plugin for Tulip software to permit the clusterisation and navigation in trees.

Xml Generator Query Language is a language whose purpose is to Generate Xml,Xhtml from Relational DB: No Xsl required, XQuery/Xpath, DB Independant. You can interpolate queries to create multilevel xml trees and insert custom tags.

An extensible spatial index library in C++ that supports robust spatial indexing methods and many advanced features. Currently supports R-tree (Rtree, R*-tree) variants, Multi Version R-trees (MVR-tree) and TPR-trees. For more information please visit the project homepage.

baobab is an implementation of FPTrees or Frequent Pattern Trees, a pattern recognition/data mining technique. it has innumerable applications in language processing, clickstream analysis, etc.

XSpace is a globally accessible repository for hierarchically-keyed information. It provides persistence for trees with an elegant tree-navigation API. XSpace also publishes real-time events whenever a persisted tree is updated.

Himalaya Tools is a suite of programs focusing on new techniques in data mining. MAFIA/SPAM mine patterns from transactional databases. SECRET is a new algorithm for scalable linear regression trees. More algorithms will be added over time.

A set of Codesmith tempalates to create the data base structure, stored procedures and Data Access Layer for the implementation Celko's Nested Set structure to map trees in SQL

Java Component created to persist and work with trees (it doesn't matter the type of persistence). Based on "Nested Set Model of Hierarchies" by Joe Celko. [Componente Java para persistir y trabajar con árboles (no importa el tipo de persistencia)]

Delphi class for managing hierarchical data in a SQL-92 database and displaying it in TTreeView component. Includes methods: display tree, add node, remove node (with subnodes) and etc. Supports several trees in the same table.

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