Fork of https://github.com/oxigraph/oxigraph.git for the purpose of NextGraph project
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
77 lines
4.1 KiB
77 lines
4.1 KiB
Oxigraph
|
|
========
|
|
|
|
[](https://crates.io/crates/oxigraph)
|
|
[](https://docs.rs/oxigraph)
|
|
[](https://crates.io/crates/oxigraph)
|
|
[](https://github.com/oxigraph/oxigraph/actions)
|
|
[](https://gitter.im/oxigraph/community?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge)
|
|
|
|
Oxigraph is a graph database library implementing the [SPARQL](https://www.w3.org/TR/sparql11-overview/) standard.
|
|
|
|
Its goal is to provide a compliant, safe and fast graph database.
|
|
It also provides a set of utility functions for reading, writing, and processing RDF files.
|
|
|
|
It currently provides three store implementations providing [SPARQL](https://www.w3.org/TR/sparql11-overview/) capability:
|
|
* `MemoryStore`: a simple in memory implementation.
|
|
* `RocksDbStore`: a file system implementation based on the [RocksDB](https://rocksdb.org/) key-value store.
|
|
It requires the `"rocksdb"` feature to be activated.
|
|
The [clang](https://clang.llvm.org/) compiler needs to be installed to compile RocksDB.
|
|
* `SledStore`: another file system implementation based on the [Sled](https://sled.rs/) key-value store.
|
|
It requires the `"sled"` feature to be activated.
|
|
Sled is much faster to build than RockDB and does not require a C++ compiler.
|
|
However, Sled is still in development, less tested and data load seems much slower than RocksDB.
|
|
|
|
Oxigraph is in heavy development and SPARQL query evaluation has not been optimized yet.
|
|
|
|
The disabled by default `"sophia"` feature provides [`sophia_api`](https://docs.rs/sophia_api/) traits implementation on Oxigraph terms and stores.
|
|
|
|
Oxigraph also provides [a standalone HTTP server](https://crates.io/crates/oxigraph_server) and [a Python library](https://oxigraph.org/pyoxigraph/) based on this library.
|
|
|
|
|
|
Oxigraph implements the following specifications:
|
|
* [SPARQL 1.1 Query](https://www.w3.org/TR/sparql11-query/), [SPARQL 1.1 Update](https://www.w3.org/TR/sparql11-update/), and [SPARQL 1.1 Federated Query](https://www.w3.org/TR/sparql11-federated-query/).
|
|
* [Turtle](https://www.w3.org/TR/turtle/), [TriG](https://www.w3.org/TR/trig/), [N-Triples](https://www.w3.org/TR/n-triples/), [N-Quads](https://www.w3.org/TR/n-quads/), and [RDF XML](https://www.w3.org/TR/rdf-syntax-grammar/) RDF serialization formats for both data ingestion and retrieval using the [Rio library](https://github.com/oxigraph/rio).
|
|
* [SPARQL Query Results XML Format](http://www.w3.org/TR/rdf-sparql-XMLres/), [SPARQL 1.1 Query Results JSON Format](https://www.w3.org/TR/sparql11-results-json/) and [SPARQL 1.1 Query Results CSV and TSV Formats](https://www.w3.org/TR/sparql11-results-csv-tsv/).
|
|
|
|
A preliminary benchmark [is provided](../bench/README.md).
|
|
|
|
Usage example with the `MemoryStore`:
|
|
|
|
```rust
|
|
use oxigraph::MemoryStore;
|
|
use oxigraph::model::*;
|
|
use oxigraph::sparql::QueryResults;
|
|
|
|
let store = MemoryStore::new();
|
|
|
|
// insertion
|
|
let ex = NamedNode::new("http://example.com")?;
|
|
let quad = Quad::new(ex.clone(), ex.clone(), ex.clone(), None);
|
|
store.insert(quad.clone());
|
|
|
|
// quad filter
|
|
let results: Vec<Quad> = store.quads_for_pattern(Some(ex.as_ref().into()), None, None, None).collect();
|
|
assert_eq!(vec![quad], results);
|
|
|
|
// SPARQL query
|
|
if let QueryResults::Solutions(mut solutions) = store.query("SELECT ?s WHERE { ?s ?p ?o }")? {
|
|
assert_eq!(solutions.next().unwrap()?.get("s"), Some(&ex.into()));
|
|
}
|
|
```
|
|
|
|
## License
|
|
|
|
This project is licensed under either of
|
|
|
|
* Apache License, Version 2.0, ([LICENSE-APACHE](../LICENSE-APACHE) or
|
|
http://www.apache.org/licenses/LICENSE-2.0)
|
|
* MIT license ([LICENSE-MIT](../LICENSE-MIT) or
|
|
http://opensource.org/licenses/MIT)
|
|
|
|
at your option.
|
|
|
|
|
|
### Contribution
|
|
|
|
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in Futures by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.
|
|
|