pub enum Phase {
Show 20 variants
Read,
Parse,
Reason,
ParseDictionary,
ParseEncode,
ParseChunk,
FrequentObjects,
Dictionary,
Encode,
CardDerive,
Pyramid,
TextIndex,
LabelsSchema,
DictionarySection,
IndexPermutations,
NamedGraphs,
Serialize,
StarterQueries,
Write,
ContentHash,
}Expand description
One phase of a build. A closed set, so a reader of the record knows every name it can meet, and a writer can size a record before the build has run.
Variants§
Read
Reading the input .rete back (repyramid, recard).
Parse
Reading and parsing the inputs into memory (the in-RAM text path).
Reason
--materialize / --reason: the reasoner over the default graph.
ParseDictionary
The two-pass streaming build’s first pass: read + parse + observe every term, then sort the dictionary.
ParseEncode
The two-pass streaming build’s second pass: read + parse + encode.
ParseChunk
The memory-bounded build’s single pass: read + parse + spill chunks.
FrequentObjects
The memory-bounded build’s --frequent-objects pass: one k-way walk of
the chunks’ object counts that picks the terms to promote.
Dictionary
Building the dictionary from parsed statements (in-RAM), or merging the chunk dictionaries (memory-bounded).
Encode
Encoding statements to id-triples (in-RAM), or remapping the chunks’ local ids to global ones (memory-bounded).
CardDerive
Deriving the Dataset Card.
Pyramid
The community pyramid.
TextIndex
The full-text index.
LabelsSchema
The LABEL_INDEX and SCHEMA sections.
DictionarySection
Compressing and serializing the dictionary section.
IndexPermutations
Sorting and tiling the index permutations (and, in-RAM, the named graphs’ indexes).
NamedGraphs
The memory-bounded build’s named-graph indexes or quad index.
Serialize
Assembling the file image in memory.
StarterQueries
Running the card’s starter queries against the finished file.
Write
Writing the file to disk.
ContentHash
Folding the content hash over the written sections for a card placed
after the data (the memory-bounded build, rete recard --in-place):
the card is hashed first, so the rest of the hash can only be folded
once it exists — one read of every hashed section.