Generic Index for Protobuf Data
AssigneeGoogle Inc.
InventorHui Wu
Life of this patent
Estimating the term…
Abstract
Aspects of the disclosure are directed to an approach for building a generic framework to allow protocol buffer data to be fully text searchable and matched fields to be quickly identified. The approach includes converting protocol buffer data from a tree structure into a field-value pair structure. The field-value pair structure can represent any protocol buffer and any new protocol buffer definition change can be adopted automatically. The approach further includes building a reverse index at a record level, which can immediately indicate the fields for each token.
Claims20
A method for searching protocol buffer data comprising:
- converting, with one or more processors, protocol buffer data from a tree structure into a field-value pair structure, a field portion of each field-value pair representing leaf fields of the tree structure and a value portion of each field-value pair representing one or more terms appearing in the respective field;
- and
- generating, with the one or more processors, a reverse index of the field-value pairs, the reverse index comprising a term-to-field list that maps the terms with the respective fields in which they appear.
A system comprising:
- one or more processors;
- and
- one or more storage devices coupled to the one or more processors and storing instructions that, when executed by the one or more processors, causes the one or more processors to perform operations for searching protocol buffer data, the operations comprising:
- converting protocol buffer data from a tree structure into a field-value pair structure, a field portion of each field-value pair representing leaf fields of the tree structure and a value portion of each field-value pair representing one or more terms appearing in the respective field;
- and
- generating a reverse index of the field-value pairs, the reverse index comprising a term-to-field list that maps the terms with the respective fields in which they appear.
A non-transitory computer readable medium for storing instructions that, when executed by one or more processors, causes the one or more processors to perform operations for searching protocol buffer data, the operations comprising:
- converting protocol buffer data from a tree structure into a field-value pair structure, a field portion of each field-value pair representing leaf fields of the tree structure and a value portion of each field-value pair representing one or more terms appearing in the respective field;
- and
- generating a reverse index of the field-value pairs, the reverse index comprising a term-to-field list that maps the terms with the respective fields in which they appear.
Dependencies are inferred from the claim text.