Techniques for indexing and querying a set of documents at a computing device

At least one computing device configured to index a set of documents accessible to the at least one computing device, the at least one computing device comprising:

• at least one processor;
• and
• at least one memory configured to store instructions that, when executed by the at least one processor, cause the at least one computing device to:
• assign a rank to each term of a set of terms based at least in part on a historical occurrence of each term to produce a set of ranked terms;
• create a plurality of subsets comprising one or more ranked terms from the set of ranked terms to produce a plurality of ranked term subsets, wherein each ranked term subset is encoded in accordance with an allocated bit size;
• and
• generate an index for each document of the set of documents by:
• (i) identifying the plurality of ranked term subsets within the document;
• (ii) generating one or more arrays to store each ranked term subset identified within the document;
• and
• (iii) embedding metadata within the document, wherein the metadata comprises at least:
• (i) the one or more arrays;
• and
• (ii) one or more counts corresponding to the one or more arrays, wherein each count represents a number of ranked terms stored by a respective array of the one or more arrays.

A method for querying an indexed set of documents stored at at least one computing device, the method comprising, at the at least one computing device:

• receiving a query comprising one or more ranked terms from a set of ranked terms, wherein the set of ranked terms are ranked based at least in part on a historical occurrence of a set of terms;
• accessing a data structure based at least in part on receipt of the query, wherein the data structure includes:
• a document identifier for each document of the indexed set of documents, wherein each document comprises:
• metadata embedded within the document, wherein the metadata includes:
• (i) at least one array that stores one or more ranked terms from a respective ranked term subset, from a plurality of ranked term subsets, identified within the document, wherein each ranked term subset from the plurality of ranked term subsets is a different subset of the set of ranked terms and each ranked term subset is encoded in accordance with an allocated bit size;
• and
• (ii) one or more counts corresponding to the least one array, wherein each count represents a number of ranked terms stored by the least one array;
• and
• at least one ranked term identified within each document of the indexed set of documents is based at least in part on a particular ranked term subset;
• and
• selecting, from the data structure, a subset of the indexed set of documents, wherein the subset of the indexed set of documents includes:
• (i) one or more document identifiers, and (ii) the at least one ranked term matching the query.