BITPlan / com.bitplan.simplegraphLinks
Wrapping Apache TinkerPop
☆9Updated 3 weeks ago
Alternatives and similar repositories for com.bitplan.simplegraph
Users that are interested in com.bitplan.simplegraph are comparing it to the libraries listed below
Sorting:
- Java access to Neo4J graph databases at multiple levels of abstraction☆85Updated 4 years ago
- Java memoization library☆18Updated last year
- A new object-graph-wrapper for the Tinkerpop 3 graph stack.☆40Updated 4 years ago
- A Java compiler plugin that turns Java into a mostly dynamically typed language☆12Updated 10 years ago
- Alenka JDBC is a library for accessing and manipulating data with the open-source GPU database Alenka.☆20Updated 11 years ago
- ☆17Updated 5 years ago
- Analyzes chronological patterns present in time-series data and provides human-readable descriptions☆25Updated 2 years ago
- Home of RDF2Go and RDFReactor☆13Updated 9 years ago
- Master repository for the JHeaps project☆48Updated 4 years ago
- AirConcurrentMap is a fast, memory efficient Java ConcurrentNavigableMap implementation☆32Updated 7 years ago
- An ORM / OGM for the TinkerPop graph stack.☆137Updated 3 years ago
- JooFlux is a Java agent for dynamic aspect-oriented middlewares.☆26Updated 10 years ago
- Blazegraph Tinkerpop3 Implementation☆62Updated 4 years ago
- The core library of Tensorics - a Java Library for Manipulating Multi-Dimensional Data with Pleasure☆10Updated last year
- A generic compact Trie implementation in Java. Built for high-performance applications.☆45Updated 4 years ago
- Lightweight dataflow Java library. Includes various asynchronous constructs, including actors and asynchronous I/O requests.☆96Updated 2 years ago
- Write parsers for arbitrary text inputs, entirely in Java, with no preprocessing phase☆65Updated 9 years ago
- TinkerPop3 Graph Structure Implementation for OrientDB☆93Updated last month
- Provides off-heap storage for in-memory datagrid build in Turkey☆51Updated 9 years ago
- Example Java program using Titan 1.0 and TinkerPop 3☆9Updated 9 years ago
- Fast in-memory graph structure, powering Gephi☆75Updated last month
- Algorithms that build k-nearest neighbors graph (k-nn graph): Brute-force, NN-Descent,...☆34Updated 6 years ago
- Collection of generic Apache Flink operators☆17Updated 8 years ago
- A framework for scalable graph computing.☆147Updated 7 years ago
- Run cassandra inside a java project without bring server deps into client classpath☆33Updated 6 years ago
- A Java DSL (Builder) for the Cypher Query Language☆215Updated this week
- Provides a SQL interface to your TinkerPop enabled graph db☆74Updated 2 years ago
- Async helpers for Vert.x☆12Updated 3 years ago
- Graal is a Java toolkit for querying knowledge bases within the framework of existential rules, aka Datalog+/-. See Graal's homepage:☆47Updated 3 years ago
- Provides when.java wrappers for standard vert.x objects to return promises.☆42Updated 8 years ago