Search Results for "b-tree implementation"
Sort By:
Showing 33 open source projects for "b-tree implementation"
View related business solutions-
Catch Bugs Before Your Customers DoMove from alert to fix before users notice. AppSignal monitors errors, performance bottlenecks, host health, and uptime—all from one dashboard. Instant notifications on deployments, anomaly triggers for memory spikes or error surges, and seamless log management. Works out of the box with Rails, Django, Express, Phoenix, Next.js, and dozens more. Starts at $23/month with no hidden fees.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
Datahike
A durable Datalog implementation adaptable for distribution
Datahike is a durable Datalog database powered by an efficient Datalog query engine. This project started as a port of DataScript to the hitchhiker-tree. All DataScript tests are passing, but we are still working on the internals. Having said this we consider Datahike usable for medium sized projects, since DataScript is very mature and deployed in many applications and the hitchhiker-tree implementation is heavily tested through generative testing. We are building on the two projects and the storage backends for the hitchhiker-tree through konserve. ... -
2
Helidon
Java libraries for writing microservices
...Since Helidon is simply a collection of Java libraries running on a fast Netty core, there is no extra overhead or bloat. Helidon supports MicroProfile and provides familiar APIs like JAX-RS, CDI and JSON-P/B. Our implementation runs on our fast Helidon Reactive WebServer. Helidon Reactive WebServer provides a modern functional programming model and runs on top of Netty. Lightweight, flexible and reactive, the Helidon WebServer provides a simple-to-use and fast foundation for your microservices. -
3
Java generic API for search algorithms on graphs implicitly given by tree node expansion operator
-
4
Wheefun Computer Prototyping Kit
A Toolkit for Designing Computers
This package is designed for people who are a) interested in writing emulators or b) integrating this level of detain into their applications (e.g., a video game). The ability to do this is useful because a) it allows for tinkering far before physical implementation of the design is. In addition to a strong core, WFCPK will also include modules emulating various processors (e.g., the MOS 6502 and the Zilog Z80) as well as the Video-Audio Interface (a custom VGA-compatible display and audio controller). ... -
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
5
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known... -
6
Point Symmetry Clustering
Point Symmetry Clustering Approach Using Differential Evolution
Implementation of Point Symmetry-based Automatic Clustering Approach Using Differential Evolution Using bug fixed KD tree nearest neighbor search from https://github.com/CristianDallos/kmeansclustering. (It is also modified to search for multiple nearest points instead only for one.) Used those academic works for algorithm implementation: http://cs.cug.edu.cn/teacherweb/gwy/Publication/ISICA-09.pdf http://www.isical.ac.in/~sanghami/ieeetkde_cameraready.pdf http://www.softcomputing.net/smca-paper1.pdf 1. ... -
7
Bilibili Android Client
An unofficial bilibili client for Android
The realization of six modules on the homepage, recommendation, drama, live broadcast, follow, partition, and discovery. Video details interface, video comments, video playback completed by ijkplayer, and barrage functions implemented by the flame barrage library. The realization of the fan drama module, including the topic details interface, the fan drama details interface, the fan drama broadcasting table, the fan drama index, the new fan serial, and the new fan by season. Use ijkplayer to... -
8
SmarTree
Smart Swing JTree evolution
An extension of the class javax.swing.JTree with a lot of improvements and utilities. -
9
Arbaro is an implementation of the tree generating algorithm described in Jason Weber & Joseph Penn: Creation and Rendering of Realistic Trees
-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
10
R-Tree in Java (not usable or finished)
This is a implementation of a R-Tree made in Java.
This is a implementation of a R-Tree made in Java for scientific purposes. The implementation is not working well for now, it is not ready for use yet. -
11
QueLang
QueLang is a designing tool to use for Questionnaire Design.
This is the first implementation of QueLang. QueLang is a language I designed for Questionnaire Design and Implementation. This software can compile your code (written in .ql text files) into a special .qlc format (a kind of database). Then it can read those .qlc files to open them in viewer and export them to PDF format. It can be also used for exam and test designing! Tested on: -Linux Ubuntu 12.04 -Windows 7 64-bit QueLang can run by double clicking the .jar (or .exe)... -
12
Cost-sensitive Classifiers
Adaboost extensions for cost-sentive classification
Adaboost extensions for cost-sentive classification CSExtension 1 CSExtension 2 CSExtension 3 CSExtension 4 CSExtension 5 AdaCost Boost CostBoost Uboost CostUBoost AdaBoostM1 Implementation of all the listed algorithms of the cluster "cost-sensitive classification". They are the meta algorithms which requires base algorithms e.g. Decision Tree Moreover, Voting criteria is also required e.g. Minimum expected cost criteria Input also requires to load an arff file and a cost matrix (sample arff and cost files are uploaded for users' reference) This extension uses weka for classification and generates the classification model along with confusion matrix. ... -
13
Stand-alone Java library implementing parser/formatter/comparator/validator for JSON/XML-like text formats oriented on JSON-like object model (list,map,scalar + reflection). Library is designed to maximize adaptivity via set of extendable modules.
-
14
Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity in practical situations significantly.
-
15
VHDT
VHDL Design Tool - code generation and project management
Application simplifies the development and management of VHDL projects. The project is displayed in a well-arranged tree structure depending on the hierarchy of entities. It also helps to maintain projects in a consistent state. Other features include automatic generation of VHDL testbenches and structures based on user-defined templates. The NetBeans platform is used as a basis for the implementation. -
16
This project aims to provide an extensible Tree interface to supplement the Java Collections framework, making full use of Java 5 generics. At least one reference implementation will be provided as part of the scope of this project.
-
17
Ticket Cluster
Java aplication who groups related text documents, text mining
...This is done without preconceptions about keywords — this Java software analyzes the text and identifies the structure that arises naturally. The extraction phase depends of the data of the helpdesk, in the current implementation there is a php script who extracts all text from numered tickets (Facil HelpDesk ) to a folder. Once created the folder with text, run ticket cluster, select folder and click process. After processing is done you can watch results in dendogram or tree. Text mining, text clustering using LINGO -
18
JDots, Java Dynamic Object Tree Software. A library/framework to create a dynamic tree of Java objects, for active method communication/propagation. Java implementation of the BEAST project.
-
19
The Open Protocol for Access Control Identification and Ticketing with privacY, is a standard suite of Key Establishment and Authentication protocols based on ECC and AES, for optimized contactless transactions and simple PKI based Key management.
-
20
ProDT is a Prolog Integrated Development Environment (IDE) aiming to be as rich in functionality as the Eclipse's java IDE, and to support any standard Prolog implementation. Currently is being supported SWI Prolog, B-Prolog and XSB Prolog
-
21
Java login module implementation that searches the users and their roles in multiple specified paths (contexts) of an LDAP directory tree.
-
22
-
23
BlueOxygen Debus is the security implementation of tree for BlueOxygen Cimande. Originally this is a Cimande Security, but we found that there is several security that we can implement and we must test it, so we decouple it.
-
24
Another xwiki document tree implementation. There are provided as samples two velocity files: one is a JavaScript approach (offers the posibility in expanding / collapsing a tree node) and the second a standard velocity approach.
-
25
The EURP OntoLookup is a CREOLE plugin for GATE http://www.gate.ac.uk/ which uses an OWL ontology for lookup. It has a very fast implementation based on a tree of hash maps.
