Struct RdfStore 

pub struct RdfStore { /* private fields */ }

Main RDF store implementation

Implementations

impl RdfStore

pub fn new() -> Result<Self>

Create a new ultra-high performance in-memory store

pub fn new_legacy() -> Result<Self>

Create a new legacy in-memory store for compatibility

pub fn open<P: AsRef<Path>>(path: P) -> Result<Self>

Create a new persistent store at the given path

Loads existing data from disk if present, otherwise creates a new store.

pub fn insert_quad(&mut self, quad: Quad) -> Result<bool>

Insert a quad into the store

pub fn bulk_insert_quads(&mut self, quads: Vec<Quad>) -> Result<Vec<u64>>

Bulk insert quads for maximum performance

pub fn insert_triple(&mut self, triple: Triple) -> Result<bool>

Insert a triple into the default graph

pub fn insert_string_triple( &mut self, subject: &str, predicate: &str, object: &str, ) -> Result<bool>

Insert a triple into the store (legacy string interface)

pub fn remove_quad(&mut self, quad: &Quad) -> Result<bool>

Remove a quad from the store

pub fn contains_quad(&self, quad: &Quad) -> Result<bool>

Check if a quad exists in the store

pub fn query_quads( &self, subject: Option<&Subject>, predicate: Option<&Predicate>, object: Option<&Object>, graph_name: Option<&GraphName>, ) -> Result<Vec<Quad>>

Query quads matching the given pattern

None values act as wildcards matching any term.

pub fn query_triples( &self, subject: Option<&Subject>, predicate: Option<&Predicate>, object: Option<&Object>, ) -> Result<Vec<Triple>>

Query triples in the default graph matching the given pattern

pub fn iter_quads(&self) -> Result<Vec<Quad>>

Get all quads in the store

pub fn triples(&self) -> Result<Vec<Triple>>

Get all triples in the default graph

pub fn len(&self) -> Result<usize>

Get the number of quads in the store

pub fn is_empty(&self) -> Result<bool>

Check if the store is empty

pub fn stats(&self) -> Option<Arc<IndexStats>>

Get performance statistics (ultra-performance mode only)

pub fn memory_usage(&self) -> Option<MemoryUsage>

Get memory usage statistics (ultra-performance mode only)

pub fn clear_arena(&self)

Clear memory arena to reclaim memory (ultra-performance mode only)

pub fn clear(&mut self) -> Result<()>

Clear all data from the store

pub fn query(&self, sparql: &str) -> Result<OxirsQueryResults>

Query the store with SPARQL (delegates to QueryExecutor)

pub fn insert(&mut self, quad: &Quad) -> Result<()>

pub fn remove(&mut self, quad: &Quad) -> Result<bool>

Remove a quad (compatibility alias for remove_quad)

pub fn quads(&self) -> Result<Vec<Quad>>

Get all quads in the store

pub fn named_graph_quads(&self) -> Result<Vec<Quad>>

Get all quads from named graphs only

pub fn default_graph_quads(&self) -> Result<Vec<Quad>>

Get all quads from the default graph only

pub fn graph_quads(&self, graph: Option<&NamedNode>) -> Result<Vec<Quad>>

Get quads from a specific graph

pub fn clear_all(&mut self) -> Result<usize>

Clear all data from all graphs

pub fn clear_named_graphs(&mut self) -> Result<usize>

Clear all named graphs (but not the default graph)

pub fn clear_default_graph(&mut self) -> Result<usize>

Clear the default graph only

pub fn clear_graph(&mut self, graph: Option<&GraphName>) -> Result<usize>

Clear a specific graph

pub fn graphs(&self) -> Result<Vec<NamedNode>>

Get all graphs (including default if it contains data)

pub fn named_graphs(&self) -> Result<Vec<NamedNode>>

Get all named graphs

pub fn create_graph(&mut self, graph: Option<&NamedNode>) -> Result<()>

Create a new graph (if it doesn’t exist)

pub fn drop_graph(&mut self, graph: Option<&GraphName>) -> Result<()>

Drop a graph (remove the graph and all its quads)

pub fn load_from_url( &mut self, url: &str, _graph: Option<&NamedNode>, ) -> Result<usize>

Load data from a URL into a graph

Trait Implementations

impl Debug for RdfStore

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for RdfStore

fn default() -> Self

Returns the “default value” for a type.

impl Store for RdfStore

fn insert_quad(&self, quad: Quad) -> Result<bool>

Insert a quad into the store

fn remove_quad(&self, quad: &Quad) -> Result<bool>

Remove a quad from the store

fn find_quads( &self, subject: Option<&Subject>, predicate: Option<&Predicate>, object: Option<&Object>, graph_name: Option<&GraphName>, ) -> Result<Vec<Quad>>

Find quads matching the given pattern

fn is_ready(&self) -> bool

Check if the store is ready for operations

fn len(&self) -> Result<usize>

Get the number of quads in the store

fn is_empty(&self) -> Result<bool>

Check if the store is empty

fn query(&self, sparql: &str) -> Result<OxirsQueryResults>

Query the store with SPARQL

fn prepare_query(&self, sparql: &str) -> Result<PreparedQuery>

Prepare a SPARQL query for execution

fn insert_triple(&self, triple: Triple) -> Result<bool>

Insert a triple into the default graph

fn insert(&self, quad: &Quad) -> Result<()>

Insert a quad (compatibility method)

fn remove(&self, quad: &Quad) -> Result<bool>

Remove a quad (compatibility method)

fn quads(&self) -> Result<Vec<Quad>>

Get all quads in the store

fn named_graphs(&self) -> Result<Vec<NamedNode>>

Get all named graphs

fn graphs(&self) -> Result<Vec<NamedNode>>

Get all graphs

fn named_graph_quads(&self) -> Result<Vec<Quad>>

Get quads from named graphs only

fn default_graph_quads(&self) -> Result<Vec<Quad>>

Get quads from the default graph only

fn graph_quads(&self, graph: Option<&NamedNode>) -> Result<Vec<Quad>>

Get quads from a specific graph

fn clear_all(&self) -> Result<usize>

Clear all data from all graphs

fn clear_named_graphs(&self) -> Result<usize>

Clear all named graphs (but not the default graph)

fn clear_default_graph(&self) -> Result<usize>

Clear the default graph only

fn clear_graph(&self, _graph: Option<&GraphName>) -> Result<usize>

Clear a specific graph

fn create_graph(&self, _graph: Option<&NamedNode>) -> Result<()>

Create a new graph (if it doesn’t exist)

fn drop_graph(&self, _graph: Option<&GraphName>) -> Result<()>

Drop a graph (remove the graph and all its quads)

fn load_from_url(&self, _url: &str, _graph: Option<&NamedNode>) -> Result<usize>

Load data from a URL into a graph

fn triples(&self) -> Result<Vec<Triple>>

Get all triples in the store (converts quads to triples)