1
1
mirror of https://github.com/go-gitea/gitea synced 2024-11-18 08:04:25 +00:00
gitea/vendor/github.com/blevesearch/zapx/v12
Lauris BH f5abe2f563
Upgrade blevesearch dependency to v2.0.1 (#14346)
* Upgrade blevesearch dependency to v2.0.1

* Update rupture to v1.0.0

* Fix test
2021-01-17 20:21:14 -05:00
..
.gitignore Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
.golangci.yml Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
build.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
chunk.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
contentcoder.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
count.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
dict.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
docvalues.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
enumerator.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
go.mod Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
go.sum Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
intcoder.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
intDecoder.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
LICENSE Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
memuvarint.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
merge.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
new.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
plugin.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
posting.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
read.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
README.md Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
segment.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
sizes.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
write.go Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00
zap.md Upgrade blevesearch dependency to v2.0.1 (#14346) 2021-01-17 20:21:14 -05:00

zapx file format

The zapx module is fork of zap module which maintains file format compatibility, but removes dependency on bleve, and instead depends only on the indepenent interface modules:

Advanced ZAP File Format Documentation is here.

The file is written in the reverse order that we typically access data. This helps us write in one pass since later sections of the file require file offsets of things we've already written.

Current usage:

  • mmap the entire file
  • crc-32 bytes and version are in fixed position at end of the file
  • reading remainder of footer could be version specific
  • remainder of footer gives us:
    • 3 important offsets (docValue , fields index and stored data index)
    • 2 important values (number of docs and chunk factor)
  • field data is processed once and memoized onto the heap so that we never have to go back to disk for it
  • access to stored data by doc number means first navigating to the stored data index, then accessing a fixed position offset into that slice, which gives us the actual address of the data. the first bytes of that section tell us the size of data so that we know where it ends.
  • access to all other indexed data follows the following pattern:
    • first know the field name -> convert to id
    • next navigate to term dictionary for that field
      • some operations stop here and do dictionary ops
    • next use dictionary to navigate to posting list for a specific term
    • walk posting list
    • if necessary, walk posting details as we go
    • if location info is desired, consult location bitmap to see if it is there

stored fields section

  • for each document
    • preparation phase:
      • produce a slice of metadata bytes and data bytes
      • produce these slices in field id order
      • field value is appended to the data slice
      • metadata slice is varint encoded with the following values for each field value
        • field id (uint16)
        • field type (byte)
        • field value start offset in uncompressed data slice (uint64)
        • field value length (uint64)
        • field number of array positions (uint64)
        • one additional value for each array position (uint64)
        • compress the data slice using snappy
    • file writing phase:
      • remember the start offset for this document
      • write out meta data length (varint uint64)
      • write out compressed data length (varint uint64)
      • write out the metadata bytes
      • write out the compressed data bytes

stored fields idx

  • for each document
    • write start offset (remembered from previous section) of stored data (big endian uint64)

With this index and a known document number, we have direct access to all the stored field data.

posting details (freq/norm) section

  • for each posting list
    • produce a slice containing multiple consecutive chunks (each chunk is varint stream)
    • produce a slice remembering offsets of where each chunk starts
    • preparation phase:
      • for each hit in the posting list
      • if this hit is in next chunk close out encoding of last chunk and record offset start of next
      • encode term frequency (uint64)
      • encode norm factor (float32)
    • file writing phase:
      • remember start position for this posting list details
      • write out number of chunks that follow (varint uint64)
      • write out length of each chunk (each a varint uint64)
      • write out the byte slice containing all the chunk data

If you know the doc number you're interested in, this format lets you jump to the correct chunk (docNum/chunkFactor) directly and then seek within that chunk until you find it.

posting details (location) section

  • for each posting list
    • produce a slice containing multiple consecutive chunks (each chunk is varint stream)
    • produce a slice remembering offsets of where each chunk starts
    • preparation phase:
      • for each hit in the posting list
      • if this hit is in next chunk close out encoding of last chunk and record offset start of next
      • encode field (uint16)
      • encode field pos (uint64)
      • encode field start (uint64)
      • encode field end (uint64)
      • encode number of array positions to follow (uint64)
      • encode each array position (each uint64)
    • file writing phase:
      • remember start position for this posting list details
      • write out number of chunks that follow (varint uint64)
      • write out length of each chunk (each a varint uint64)
      • write out the byte slice containing all the chunk data

If you know the doc number you're interested in, this format lets you jump to the correct chunk (docNum/chunkFactor) directly and then seek within that chunk until you find it.

postings list section

  • for each posting list
    • preparation phase:
      • encode roaring bitmap posting list to bytes (so we know the length)
    • file writing phase:
      • remember the start position for this posting list
      • write freq/norm details offset (remembered from previous, as varint uint64)
      • write location details offset (remembered from previous, as varint uint64)
      • write length of encoded roaring bitmap
      • write the serialized roaring bitmap data

dictionary

  • for each field
    • preparation phase:
      • encode vellum FST with dictionary data pointing to file offset of posting list (remembered from previous)
    • file writing phase:
      • remember the start position of this persistDictionary
      • write length of vellum data (varint uint64)
      • write out vellum data

fields section

  • for each field
    • file writing phase:
      • remember start offset for each field
      • write dictionary address (remembered from previous) (varint uint64)
      • write length of field name (varint uint64)
      • write field name bytes

fields idx

  • for each field
    • file writing phase:
      • write big endian uint64 of start offset for each field

NOTE: currently we don't know or record the length of this fields index. Instead we rely on the fact that we know it immediately precedes a footer of known size.

fields DocValue

  • for each field
    • preparation phase:
      • produce a slice containing multiple consecutive chunks, where each chunk is composed of a meta section followed by compressed columnar field data
      • produce a slice remembering the length of each chunk
    • file writing phase:
      • remember the start position of this first field DocValue offset in the footer
      • write out number of chunks that follow (varint uint64)
      • write out length of each chunk (each a varint uint64)
      • write out the byte slice containing all the chunk data

NOTE: currently the meta header inside each chunk gives clue to the location offsets and size of the data pertaining to a given docID and any read operation leverage that meta information to extract the document specific data from the file.

  • file writing phase
    • write number of docs (big endian uint64)
    • write stored field index location (big endian uint64)
    • write field index location (big endian uint64)
    • write field docValue location (big endian uint64)
    • write out chunk factor (big endian uint32)
    • write out version (big endian uint32)
    • write out file CRC of everything preceding this (big endian uint32)