Quiz: Graph Architecture & Modern Engines: JVM vs. Oxigraph

Quiz Summary

0 of 3 Questions completed

Questions:

You have already completed the quiz before. Hence you can not start it again.

Quiz is loading…

You must sign in or sign up to start the quiz.

You must first complete the following:

Results

Quiz complete. Results are being recorded.

Results

0 of 3 Questions answered correctly

Your time:

You have reached 0 of 0 point(s), (0)

Question 1 of 3

1. Question

Which statement about the storage architecture of Oxigraph compared with mature JVM triple stores is accurate?

Oxigraph is built on B-trees, which is why it ingests data faster than JVM engines built on LSM-trees.
Correct Incorrect Correct answer

Oxigraph persists data through RocksDB, an LSM-tree engine that buffers writes in a MemTable before flushing immutable SSTables, giving excellent write throughput at the cost of write amplification during compaction and potentially higher random-read latency than a B-tree.
Correct Incorrect Correct answer

Because Rust has no garbage collector, an Oxigraph deployment has no memory tuning considerations at all.
Correct Incorrect Correct answer

LSM-trees update records in place on disk, and it is that property which removes the need for garbage collection.
Correct Incorrect Correct answer

Correct / 1 Points

Incorrect / 1 Points
Question 2 of 3

2. Question

An engineer loads several hundred million triples into Oxigraph through the HTTP store endpoint and the process runs out of memory. What is the correct remedy?

Keep transactions enabled, since ACID guarantees reduce the memory required during a large import.
Correct Incorrect Correct answer

Split the payload into single-triple HTTP requests so that each triple is committed in its own transaction.
Correct Incorrect Correct answer

A single transaction tracks the whole import state in memory, so use the no_transaction=1 parameter on the HTTP endpoint or the dedicated BulkLoader API, which targets roughly 2GB of memory per thread and streams straight into RocksDB.
Correct Incorrect Correct answer

Convert the data to RDF/XML first, because RocksDB can only ingest tree-structured input.
Correct Incorrect Correct answer

Correct / 1 Points

Incorrect / 1 Points
Question 3 of 3

3. Question

A BGP contains one pattern matching 100,000 employees and one pattern matching a single badge identifier. Which statement about execution is correct?

A cost-based optimiser estimates the cardinality of each triple pattern and evaluates the most selective one first, so the single badge identifier is resolved before the pattern that matches 100,000 employees.
Correct Incorrect Correct answer

SPARQL engines are obliged to evaluate the triple patterns of a BGP in the order written, so join order is entirely the query author responsibility.
Correct Incorrect Correct answer

Allocating almost all system RAM to the JVM heap is the most effective way to accelerate a memory-mapped triple store.
Correct Incorrect Correct answer

Oxigraph ships a mature cost-based optimiser with parallel execution, so its plans match GraphDB on billion-triple analytical queries.
Correct Incorrect Correct answer

Correct / 1 Points

Incorrect / 1 Points

Quiz: Graph Architecture & Modern Engines: JVM vs. Oxigraph

Quiz Summary

Information

Results

Results

Categories

1. Question

2. Question

3. Question