Search Results for "tree database"
Sort By:
Showing 7 open source projects for "tree database"
View related business solutions-
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.
-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
1
PqFun for CLIPS
DB-Library functions which provides a PostgreSQL interface for CLIPS
We have developed some DB-Library functions which provides a PostgreSQL interface via libpq for CLIPS Rule Based Programming Language. See https://sourceforge.net/p/pqfun-for-clips/code/HEAD/tree/63x-PqFun/Readme.md for more details. The latest snapshot is downloadable from https://sourceforge.net/p/pqfun-for-clips/code/HEAD/tree/63x-PqFun/. -
2
MyFun for CLIPS
DB-Library functions which provides a MySQL interface for CLIPS
We have developed some DB-Library functions which provides a MySQL interface for CLIPS Rule Based Programming Language. See https://sourceforge.net/p/myfun-for-clips/code/HEAD/tree/63x-MyFun/Readme.md for more details. The latest snapshot is downloadable from https://sourceforge.net/p/myfun-for-clips/code/HEAD/tree/63x-MyFun/. -
3
ADAMS
ADAMS is a workflow engine for building complex knowledge workflows.
ADAMS is a flexible workflow engine aimed at quickly building and maintaining data-driven, reactive workflows, easily integrated into business processes. Instead of placing operators on a canvas and manually connecting them, a tree structure and flow control operators determine how data is processed (sequentially/parallel). This allows rapid development and easy maintenance of large workflows, with hundreds or thousands of operators. Operators include machine learning (WEKA, MOA, MEKA)... -
4
Next Generation Programming
Compose Software Without Writing Any Programing Code
"Next Generation Programming - Programming Without Coding Software" is a drag-drop wizard for creating simple or complex applications without writing any programming language code The Software is coded/designed with "Java Programming Language" for novice/expert programmers; Programmers can write softwares with visual tools : drag-drop components;visual editors... Programmers can use the software to compose of simple/complex applications : Database programs, circuit design, generate... -
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
5
Immutable Sparse Wave Trees (WaveTree)
Realtime bigdata tool for bit strings up to 2^63 based on AVL forest
Realtime bigdata tool at the bit level based on immutable AVL forest which can be run in memory or, in future versions, as a merkle forest like a blockchain. Main object is a sparse bit string (Bits) that efficiently scales up to 2^63 bits normally compressed as forest has duplicated substrings. Bits objects support reading bit, byte, short, int, or long (Java primitives) at any bit index in 64 bit range. Example: instead of building a class to hold a header and then data, represent all of... -
6
S-Match
S-Match is a semantic matching framework.
S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. -
7
- Previous
- You're on page 1
- Next
