High-level query conversion system with prefix-based search for data stores

A method, comprising:

• receiving a query from a user device;
• converting the query into a predicate expression data instance;
• generating an iteration tree based on the predicate expression data instance, comprising:
• transforming each predicate in the predicate expression data instance into a corresponding iterator node;
• and
• arranging the iterator nodes in a hierarchical structure that reflects logical relationships among the predicates to create the iteration tree;
• determining search data based on the generated iteration tree, comprising:
• traversing the hierarchical structure of the iterator nodes in the generated iteration tree to identify the search data having at least one attribute associated with at least one iterator node;
• and
• generating a prefix based on the at least one attribute associated with the at least one iterator node;
• accessing a set of index entries of a data store;
• searching the set of index entries based on the search data, wherein searching the set of index entries based on the search data comprises:
• comparing the prefix of a given key of the search data to the set of index entries;
• responsive to the given key matching an entry of the set of index entries, accessing a data object corresponding to the given key in the data store and adding the given key and its corresponding data object to a result dataset;
• iteratively searching the set of index entries in a predefined order until all keys of the search data are considered;
• and
• compiling the result dataset;
• and
• causing a graphical user interface to display an indicator associated with the result dataset.

A computer program product comprising a non-transitory computer readable storage medium having instructions encoded thereon that, when executed by a computing system, cause the computing system to perform operations including:

• receiving a query from a user device;
• converting the query into a predicate expression data instance;
• generating an iteration tree based on the predicate expression data instance, comprising:
• transforming each predicate in the predicate expression data instance into a corresponding iterator node;
• and
• arranging the iterator nodes in a hierarchical structure that reflects logical relationships among the predicates to create the iteration tree;
• determining search data based on the generated iteration tree, comprising:
• traversing the hierarchical structure of the iterator nodes in the generated iteration tree to identify the search data having at least one attribute associated with at least one iterator node;
• and
• generating a prefix based on the at least one attribute associated with the at least one iterator node;
• accessing a set of index entries of a data store;
• searching the set of index entries based on the search data, wherein searching the set of index entries based on the search data comprises:
• comparing the prefix of a given key of the search data to the set of index entries;
• responsive to the given key matching an entry of the set of index entries, accessing a data object corresponding to the given key in the data store and adding the given key and its corresponding data object to a result dataset;
• iteratively searching the set of index entries in a predefined order until all keys of the search data are considered;
• and
• compiling the result dataset;
• and
• causing a graphical user interface to display an indicator associated with the result dataset.