Method for automated query language expansion and indexing
AssigneeSisense SF, Inc.
InventorsSteven Griffith, Ilge Akkaya, Audrey McGowan, Chris Tice, Jason Freidman, Jeff Watts
Life of this patent
Estimating the term…
Abstract
In an embodiment, a query system sends compact code to a database service for expansion of the compact code to partially-expanded code and expanded code. In an embodiment, a hash value is generated based on the partially-expanded code and indexed in memory with the expanded code. In an embodiment, a hash value is received as part of a command and expanded code is identified based on the hash value and sent to a database service.
Claims17
A method of hashing code, comprising:
- generating an instance of tokenized code by replacing each of at least one occurrence of a string in an instance of compact code with an instance of a token, wherein the string corresponds to an expanded string;
- generating a first instance of partially-expanded code by replacing only a subset of occurrences of the string with the expanded string with respect to the instance of tokenized code;
- generating a hash value based on the first instance of partially-expanded code;
- and
- generating a hash-value-to-expanded-code index based on hash values created by applying a hash function to a plurality of second instances of partially-expanded code, wherein the first instance of partially-expanded code is determined by using the hash-value-to-expanded-code index to look up the first instance of partially-expanded code based on a hash value included in a command received from a client device.
The method of 1, further comprising:
- determining that a size of the instance of compact code is greater than a compact code limit;
- and
- generating an instance of reduced-size compact code by reducing the size of the instance of compact code such that the instance of reduced-size compact code is less than or equal to the compact code limit, wherein the first instance of partially-expanded code is generated by replacing only a subset of occurrences of the string with the expanded string in the reduced-size compact code.
Computer-readable storage media for transferring data from a source repository to a target repository having computer-executable instructions embodied thereon, wherein, when executed by at least one processing circuitry, the computer-executable instructions cause the at least one processing circuitry to:
- generate an instance of tokenized code by replacing each of at least one occurrence of a string in an instance of compact code with an instance of a token, wherein the string corresponds to an expanded string;
- generate a first instance of partially-expanded code by replacing only a subset of occurrences of the string with the expanded string with respect to the instance of tokenized code;
- generate a hash value based on the first instance of partially-expanded code;
- and
- generate a hash-value-to-expanded-code index based on hash values created by applying a hash function to a plurality of second instances of partially-expanded code, wherein the first instance of partially-expanded code is determined by using the hash-value-to-expanded-code index to look up the first instance of partially-expanded code based on a hash value included in a command received from a client device.
A system for hashing code, comprising:
- a processing circuitry;
- and
- a memory, the memory containing instructions that, when executed by the processing circuitry, configures the system to:
- generate an instance of tokenized code by replacing each of at least one occurrence of a string in an instance of compact code with an instance of a token, wherein the string corresponds to an expanded string;
- generate a first instance of partially-expanded code by replacing only a subset of occurrences of the string with the expanded string with respect to the instance of tokenized code;
- generate a hash value based on the first instance of partially-expanded code;
- and
- generate a hash-value-to-expanded-code index based on hash values created by applying a hash function to a plurality of second instances of partially-expanded code, wherein the first instance of partially-expanded code is determined by using the hash-value-to-expanded-code index to look up the first instance of partially-expanded code based on a hash value included in a command received from a client device.
The system of 10, wherein the system is further configured to:
- determine that a size of the instance of compact code is greater than a compact code limit;
- and
- generate an instance of reduced-size compact code by reducing the size of the instance of compact code such that the instance of reduced-size compact code is less than or equal to the compact code limit, wherein the first instance of partially-expanded code is generated by replacing only a subset of occurrences of the string with the expanded string in the reduced-size compact code.
Dependencies are inferred from the claim text.