Project Name | Stars | Downloads | Repos Using This | Packages Using This | Most Recent Commit | Total Releases | Latest Release | Open Issues | License | Language |
---|---|---|---|---|---|---|---|---|---|---|
Algorithms | 22,512 | 14 | 1 | a month ago | 5 | October 04, 2020 | 200 | mit | Python | |
Minimal examples of data structures and algorithms in Python | ||||||||||
Sonic | 18,180 | 19 days ago | 24 | July 10, 2022 | 68 | mpl-2.0 | Rust | |||
🦔 Fast, lightweight & schema-less search backend. An alternative to Elasticsearch that runs on a few MBs of RAM. | ||||||||||
Dsa.js Data Structures Algorithms Javascript | 7,009 | 1 | 5 months ago | 44 | November 30, 2021 | 6 | mit | JavaScript | ||
🥞Data Structures and Algorithms explained and implemented in JavaScript + eBook | ||||||||||
Levelgraph | 1,268 | 76 | 35 | 2 years ago | 53 | August 16, 2021 | 46 | mit | JavaScript | |
Graph database JS style for Node.js and the Browser. Built upon LevelUp and LevelDB. | ||||||||||
Ngt | 1,032 | 3 | 5 | 19 hours ago | 19 | June 20, 2022 | 13 | apache-2.0 | C++ | |
Nearest Neighbor Search with Neighborhood Graph and Tree for High-dimensional Data | ||||||||||
Graph | 830 | 3 | 4 years ago | 59 | April 12, 2016 | 4 | mit | Swift | ||
Graph is a semantic database that is used to create data-driven applications. | ||||||||||
Atomspace | 701 | 3 | 11 days ago | 9 | March 30, 2017 | 75 | other | C++ | ||
The OpenCog (hyper-)graph database and graph rewriting system | ||||||||||
Cracking The Coding Interview | 495 | 2 years ago | 2 | bsd-3-clause | C++ | |||||
:books: C++ and Python solutions with automated tests for Cracking the Coding Interview 6th Edition. | ||||||||||
Samples | 367 | 4 years ago | 4 | bsd-3-clause | Swift | |||||
Sample projects using Material, Graph, and Algorithm. | ||||||||||
Facebook Events By Location | 336 | 4 | 2 | 5 years ago | 19 | February 19, 2018 | 2 | mit | JavaScript | |
[DEPRECATED] A Express.js-based webservice to get public Facebook events by location |
HDT-lib is a Java Library that implements the W3C Submission (http://www.w3.org/Submission/2011/03/) of the RDF HDT (Header-Dictionary-Triples) binary format for publishing and exchanging RDF data at large scale. Its compact representation allows storing RDF in fewer space, providing at the same time direct access to the stored information. This is achieved by depicting the RDF graph in terms of three main components: Header, Dictionary and Triples. The Header includes extensible metadata required to describe the RDF data set and details of its internals. The Dictionary organizes the vocabulary of strings present in the RDF graph by assigning numerical IDs to each different string. The Triples component comprises the internal structure of the RDF graph in a compressed form.
It provides several components:
Use mvn install
to let Apache Maven install the required jars in your system.
You can also run mvn assembly:single
under hdt-java-package to generate a distribution directory with all the jars and launcher scripts.
Please refer to hdt-java-package/README for more information on how to use the library. You can also find useful information on our Web Page http://www.rdfhdt.org
Each module has a different License. Core is LGPL, examples and tools are Apache.
hdt-api
: Apache Licensehdt-java-cli
: (Commandline tools and examples): Apache Licensehdt-java-core
: Lesser General Public Licensehdt-jena
: Lesser General Public Licensehdt-fuseki
(< 2.2.0): Apache LicenseNote that hdt-fuseki
has been removed in version 2.2.0 and might be readded later when made compatible with fuseki2.
RDF/HDT is a project developed by the Insight Centre for Data Analytics (www.insight-centre.org), University of Valladolid (www.uva.es), University of Chile (www.uchile.cl). Funded by Science Foundation Ireland: Grant No. SFI/08/CE/I1380, Lion-II; the Spanish Ministry of Economy and Competitiveness (TIN2009-14009-C02-02); Chilean Fondecyt's 1110287 and 1-110066; and the European Union's Horizon 2020 research and innovation program under the Marie Sklodowska-Curie grant agreement No 642795.