# Patent

## Title
Parsing and compiling data system queries

## Abstract

Described are methods, systems and computer readable media for parsing and compiling data system queries.

## Background
This application claims the benefit of U.S. Provisional Application No. 62/161,813, entitled “Computer Data System” and filed on May 14, 2015, which is incorporated herein by reference in its entirety.


Embodiments relate generally to computer data systems, and more particularly, to methods, systems and computer readable media for parsing and compiling data system queries
Some conventional computer data systems may provide a query language in which a query is interpreted by the computer data system to produce a query results. These query languages may have a static grammar with a fixed number of commands or operators. These conventional query languages may not be extensible and may not provide for operations outside of the static grammar. A need may exist to provide a data system parser and compiler that can parse and compile a data system query written in a query language that permits inclusion of programming language code or constructs, where a result of the parsing and compiling is compiled programming language code suitable for execution on a processor. Further, a need may exist to provide a concise, expressive data system query language. Also, a need may exist to provide an expressive data system query language along with improved data system query execution performance.
Some implementations were conceived in light of the above mentioned needs, problems and/or limitations, among other things.
Some implementations can include a system for parsing, generating code and compiling computer data system query language code, the system comprising one or more hardware processors coupled to a nontransitory computer readable medium having stored thereon software instructions that, when executed by the one or more processors, cause the one or more processors to perform operations. The operations can include obtaining, at the one or more hardware processors, computer data system query language code from an electronic computer readable data storage, and parsing, at the one or more hardware processors, the computer data system query language code to generate a computer data system query language parsed code structure.
The operations can also include resolving, at the one or more hardware processors, a type of one or more columns represented in the parsed code structure, and inserting, at the one or more hardware processors, resolved types into the parsed code structure. The operations can further include generating, at the one or more hardware processors, computer programming language code from the computer data system query language parsed code structure, and determining, at the one or more hardware processors, whether precompiled code corresponding to the generated computer programming language code is available in a precompiled code repository stored in the electronic computer readable data storage.
The operations can also include, when precompiled code is available in the precompiled code repository, loading, at the one or more hardware processors, the precompiled code. The operations can further include, when precompiled code is not available in the precompiled code repository, compiling, at the one or more hardware processors, the computer programming language code to generate compiled computer programming language code, and loading, at the one or more hardware processors, the compiled computer programming language code.
The operations can also include instantiating, at the one or more hardware processors, the loaded precompiled code or the compiled computer programming language code, and executing, at the one or more hardware processors, the instantiated code to perform a query operation corresponding to the computer data system query language code.
The computer data system query language code can include one or more instructions of a data system query language. The operations can further include identifying a source of columns or query scope variables for substitution and use in computer programming language code. The operations can further include persisting the compiled computer programming language code by storing the precompiled code in the precompiled code repository.
Determining whether precompiled code corresponding to the programming language code is available in a precompiled code repository can include generating a token representing the generated computer programming language code, wherein the token includes a result of a hash function of one or more attributes of the computer programming language code, comparing the token to one or more repository tokens in the precompiled code repository corresponding to precompiled code units, and based on the comparing, determining whether the token matches any of the repository tokens.
The inserting can include inserting references to data objects and variables that have been made available to the query language code. The operations can further include repeating the resolving and inserting until any unresolved columns or variables have been resolved.
Some implementations can include a method for parsing, generating code and compiling computer data system query language code. The method can include obtaining, at a hardware processor, computer data system query language code from an electronic computer readable data storage, and parsing, at the hardware processor, the computer data system query language code to generate a computer data system query language parsed code structure. The method can also include resolving, at the hardware processor, a type of one or more columns represented in the parsed code structure, and inserting, at the hardware processor, resolved types into the parsed code structure. The method can further include generating, at the hardware processor, computer programming language code from the computer data system query language parsed code structure, and determining, at the hardware processor, whether precompiled code corresponding to the generated computer programming language code is available in a precompiled code repository stored in the electronic computer readable data storage.
The method can also include when precompiled code is available in the precompiled code repository, loading, at the hardware processor, the precompiled code. The method can further include, when precompiled code is not available in the precompiled code repository, compiling, at the hardware processor, the computer programming language code to generate compiled computer programming language code, and loading, at the hardware processor, the compiled computer programming language code.
The method can also include instantiating, at the hardware processor, the loaded precompiled code or the compiled computer programming language code, and executing, at the hardware processor, the instantiated code to perform a query operation corresponding to the computer data system query language code. The computer data system query language code includes one or more instructions of a data system query language.
The method can also include identifying a source of columns or query scope variables for substitution and use in computer programming language code. The method can further include persisting the compiled computer programming language code by storing the precompiled code in the precompiled code repository.
Determining whether precompiled code corresponding to the programming language code is available in a precompiled code repository comprises generating a token representing the generated computer programming language code, wherein the token includes a result of a hash function of one or more attributes of the computer programming language code, comparing the token to one or more repository tokens in the precompiled code repository corresponding to precompiled code units, and based on the comparing, determining whether the token matches any of the repository tokens.
The inserting can include inserting references to data objects and variables that have been made available to the query language code. The method can further include repeating the resolving and inserting until any unresolved columns or variables have been resolved.
Some implementations can include a nontransitory computer readable medium having stored thereon software instructions that, when executed by one or more processors, cause the one or more processors to perform operations. The operations can include obtaining, at the one or more hardware processors, computer data system query language code from an electronic computer readable data storage, and parsing, at the one or more hardware processors, the computer data system query language code to generate a computer data system query language parsed code structure.
The operations can also include resolving, at the one or more hardware processors, a type of one or more columns represented in the parsed code structure, and inserting, at the one or more hardware processors, resolved types into the parsed code structure. The operations can further include generating, at the one or more hardware processors, computer programming language code from the computer data system query language parsed code structure, and determining, at the one or more hardware processors, whether precompiled code corresponding to the generated computer programming language code is available in a precompiled code repository stored in the electronic computer readable data storage.
The operations can also include, when precompiled code is available in the precompiled code repository, loading, at the one or more hardware processors, the precompiled code. The operations can further include, when precompiled code is not available in the precompiled code repository, compiling, at the one or more hardware processors, the computer programming language code to generate compiled computer programming language code, and loading, at the one or more hardware processors, the compiled computer programming language code.
The operations can also include instantiating, at the one or more hardware processors, the loaded precompiled code or the compiled computer programming language code, and executing, at the one or more hardware processors, the instantiated code to perform a query operation corresponding to the computer data system query language code.
The computer data system query language code can include one or more instructions of a data system query language. The operations can further include identifying a source of columns or query scope variables for substitution and use in computer programming language code. The operations can further include persisting the compiled computer programming language code by storing the precompiled code in the precompiled code repository.
Determining whether precompiled code corresponding to the programming language code is available in a precompiled code repository can include generating a token representing the generated computer programming language code, wherein the token includes a result of a hash function of one or more attributes of the computer programming language code, comparing the token to one or more repository tokens in the precompiled code repository corresponding to precompiled code units, and based on the comparing, determining whether the token matches any of the repository tokens.
The inserting can include inserting references to data objects and variables that have been made available to the query language code. The operations can further include repeating the resolving and inserting until any unresolved columns or variables have been resolved.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a diagram of an example computer data system showing an example data distribution configuration in accordance with some implementations.
FIG. 2 is a diagram of an example computer data system showing an example administration/process control arrangement in accordance with some implementations.
FIG. 3 is a diagram of an example computing device configured for parsing and compiling data system queries in accordance with some implementations.
FIG. 4 is a diagram showing a data system parser and compiler in accordance with some implementations.
FIG. 5 is a flowchart showing an example method for parsing and compiling data system queries in accordance with some implementations.



DETAILED DESCRIPTION
Reference may be made herein to the Java programming language, Java classes, Java bytecode and the Java Virtual Machine (JVM) for purposes of illustrating example implementations. It will be appreciated that implementations can include other programming languages (e.g., groovy, Scala, R, Go, etc.), other programming language structures as an alternative to or in addition to Java classes (e.g., other language classes, objects, data structures, program units, code portions, script portions, etc.), other types of bytecode, object code and/or executable code, and/or other virtual machines or hardware implemented machines configured to execute a data system query.
FIG. 1 is a diagram of an example computer data system and network 100 showing an example data distribution configuration in accordance with some implementations. In particular, the system 100 includes an application host 102, a periodic data import host 104, a query server host 106, a long-term file server 108, and a user data import host 110. While tables are used as an example data object in the description below, it will be appreciated that the data system described herein can also process other data objects such as mathematical objects (e.g., a singular value decomposition of values in a given range of one or more rows and columns of a table), TableMap objects, etc. A TableMap object provides the ability to lookup a Table by some key. This key represents a unique value (or unique tuple of values) from the columns aggregated on in a byExternal( ) statement execution, for example. A TableMap object can be the result of a byExternal( ) statement executed as part of a query. It will also be appreciated that the configurations shown in FIGS. 1 and 2 are for illustration purposes and in a given implementation each data pool (or data store) may be directly attached or may be managed by a file server.
The application host 102 can include one or more application processes 112, one or more log files 114 (e.g., sequential, row-oriented log files), one or more data log tailers 116 and a multicast key-value publisher 118. The periodic data import host 104 can include a local table data server, direct or remote connection to a periodic table data store 122 (e.g., a column-oriented table data store) and a data import server 120. The query server host 106 can include a multicast key-value subscriber 126, a performance table logger 128, local table data store 130 and one or more remote query processors (132, 134) each accessing one or more respective tables (136, 138). The long-term file server 108 can include a long-term data store 140. The user data import host 110 can include a remote user table server 142 and a user table data store 144. Row-oriented log files and column-oriented table data stores are discussed herein for illustration purposes and are not intended to be limiting. It will be appreciated that log files and/or data stores may be configured in other ways. In general, any data stores discussed herein could be configured in a manner suitable for a contemplated implementation.
In operation, the input data application process 112 can be configured to receive input data from a source (e.g., a securities trading data source), apply schema-specified, generated code to format the logged data as it's being prepared for output to the log file 114 and store the received data in the sequential, row-oriented log file 114 via an optional data logging process. In some implementations, the data logging process can include a daemon, or background process task, that is configured to log raw input data received from the application process 112 to the sequential, row-oriented log files on disk and/or a shared memory queue (e.g., for sending data to the multicast publisher 118). Logging raw input data to log files can additionally serve to provide a backup copy of data that can be used in the event that downstream processing of the input data is halted or interrupted or otherwise becomes unreliable.
A data log tailer 116 can be configured to access the sequential, row-oriented log file(s) 114 to retrieve input data logged by the data logging process. In some implementations, the data log tailer 116 can be configured to perform strict byte reading and transmission (e.g., to the data import server 120). The data import server 120 can be configured to store the input data into one or more corresponding data stores such as the periodic table data store 122 in a column-oriented configuration. The periodic table data store 122 can be used to store data that is being received within a time period (e.g., a minute, an hour, a day, etc.) and which may be later processed and stored in a data store of the long-term file server 108. For example, the periodic table data store 122 can include a plurality of data servers configured to store periodic securities trading data according to one or more characteristics of the data (e.g., a data value such as security symbol, the data source such as a given trading exchange, etc.).
The data import server 120 can be configured to receive and store data into the periodic table data store 122 in such a way as to provide a consistent data presentation to other parts of the system. Providing/ensuring consistent data in this context can include, for example, recording logged data to a disk or memory, ensuring rows presented externally are available for consistent reading (e.g., to help ensure that if the system has part of a record, the system has all of the record without any errors), and preserving the order of records from a given data source. If data is presented to clients, such as a remote query processor (132, 134), then the data may be persisted in some fashion (e.g., written to disk).
The local table data server 124 can be configured to retrieve data stored in the periodic table data store 122 and provide the retrieved data to one or more remote query processors (132, 134) via an optional proxy.
The remote user table server (RUTS) 142 can include a centralized consistent data writer, as well as a data server that provides processors with consistent access to the data that it is responsible for managing. For example, users can provide input to the system by writing table data that is then consumed by query processors.
The remote query processors (132, 134) can use data from the data import server 120, local table data server 124 and/or from the long-term file server 108 to perform queries. The remote query processors (132, 134) can also receive data from the multicast key-value subscriber 126, which receives data from the multicast key-value publisher 118 in the application host 102. The performance table logger 128 can log performance information about each remote query processor and its respective queries into a local table data store 130. Further, the remote query processors can also read data from the RUTS, from local table data written by the performance logger, or from user table data read over NFS, for example.
It will be appreciated that the configuration shown in FIG. 1 is a typical example configuration that may be somewhat idealized for illustration purposes. An actual configuration may include one or more of each server and/or host type. The hosts/servers shown in FIG. 1 (e.g., 102-110, 120, 124 and 142) may each be separate or two or more servers may be combined into one or more combined server systems. Data stores can include local/remote, shared/isolated and/or redundant. Any table data may flow through optional proxies indicated by an asterisk on certain connections to the remote query processors. Also, it will be appreciated that the term “periodic” is being used for illustration purposes and can include, but is not limited to, data that has been received within a given time period (e.g., millisecond, second, minute, hour, day, week, month, year, etc.) and which has not yet been stored to a long-term data store (e.g., 140).
FIG. 2 is a diagram of an example computer data system 200 showing an example administration/process control arrangement in accordance with some implementations. The system 200 includes a production client host 202, a controller host 204, a GUI host or workstation 206, and query server hosts 208 and 210. It will be appreciated that there may be one or more of each of 202-210 in a given implementation.
The production client host 202 can include a batch query application 212 (e.g., a query that is executed from a command line interface or the like) and a real time query data consumer process 214 (e.g., an application that connects to and listens to tables created from the execution of a separate query). The batch query application 212 and the real time query data consumer 214 can connect to a remote query dispatcher 222 and one or more remote query processors (224, 226) within the query server host 1 208.
The controller host 204 can include a persistent query controller 216 configured to connect to a remote query dispatcher 232 and one or more remote query processors 228-230. In some implementations, the persistent query controller 216 can serve as the “primary client” for persistent queries and can request remote query processors from dispatchers, and send instructions to start persistent queries. For example, a user can submit a query to the persistent query controller 216, and the persistent query controller 216 starts and runs the query every day. In another example, a securities trading strategy could be a persistent query. The persistent query controller can start the trading strategy query every morning before the market opened, for instance. It will be appreciated that 216 can work on times other than days. In some implementations, the controller may require its own clients to request that queries be started, stopped, etc. This can be done manually, or by scheduled (e.g., cron jobs). Some implementations can include “advanced scheduling” (e.g.. auto-start/stop/restart, time-based repeat, etc.) within the controller.
The GUI/host workstation can include a user console 218 and a user query application 220. The user console 218 can be configured to connect to the persistent query controller 216. The user query application 220 can be configured to connect to one or more remote query dispatchers (e.g., 232) and one or more remote query processors (228, 230).
FIG. 3 is a diagram of an example computing device 300 in accordance with at least one implementation. The computing device 300 includes one or more processors 302, operating system 304, computer readable medium 306 and network interface 308. The memory 306 can include a data system query parser and compiler application 310 and a data section 312 (e.g., for storing data system query strings, abstract syntax trees, precompiled code, etc.).
In operation, the processor 302 may execute the application 310 stored in the memory 306. The application 310 can include software instructions that, when executed by the processor, cause the processor to perform operations for parsing and compiling data system queries in accordance with the present disclosure (e.g., performing one or more of 502-528 described below). The application program 310 can operate in conjunction with the data section 312 and the operating system 304.
FIG. 4 shows an example parser and compiler configuration 400 for use with a data system. The configuration 400 includes a parser/code generator 404, a compiler 408 and a precompiled code repository 412.
In operation, a data system query language string 402 is provided to the parser/code generator 404. The data system query language string 402 can include one or more of: a data system query language string, an object oriented programming language code string (e.g., Java code, Groovy code, etc.), other programming language string (e.g., R programming language code), or the like. Also, a data system query language string 402 may be augmented by code generated by a code generator, thus helping the data system query language to be concise.
The data system query language string 402 can be parsed by the passer/code generator 404 into computer language code 406. The parser/code generator 404 may be configured to parse computer data system language code, and then produce code in another computer programming language. As part of the two-phase parsing/code generation operation, the parser may generate an abstract syntax tree (AST), which can be used by the code generator to generate computer language code and to infer the type of any data columns and/or tables produced by the data system query language string. For example, a string in a computer data system language can be parsed into an AST that is then used by the code generator to generate Java code having properly inferred types. The parser/code generator 404 can also vectorize operations from the query language code. For example, for a query language statement of “a=b+c”, where b and c are column sources, the code generator 404 can generate a looping code structure to perform the operation, for example “ai=bi+ci, for all i values in the column sources.”
The computer language code 406 is provided as input to the compiler 408. Based on one or more attributes and/or derived attributes of the computer language code 406, the code generator or compiler can determine whether there is a precompiled class (or other precompiled code) for the computer language code 406. The attributes and/or derived attributes can include a hash function result value of one or more attributes of the computer language code 406 such as class file name, object name, one or more parameters, a portion of the code itself, etc.
When the precompiled code repository 412 contains precompiled code (e.g., one or more precompiled Java class files) that corresponds to the computer language code 406, the precompiled code can be used, which permits the system to avoid using processing time to compile the computer language code 406. If precompiled code corresponding to the computer language code 406 is not found in the repository, the compiler compiles the computer language code 406 to generate compiled programming language code (e.g., one or more compiled Java class files) and optionally add the compiled code to the precompiled code repository for future reuse. The precompiled code library can be updated over time to include compiled code not found in the repository during a parsing/compiling process (or be updated to remove compiled code). Further details of the parsing and compiling are described below in connection with FIG. 5.
FIG. 5 a flowchart showing an example method 500 for parsing and compiling data system queries in accordance with some implementations. Processing begins at 502, where a data system query language string is obtained. The query language string (e.g., 402) can be obtained from another system, from a file sent by a user, from a command line interface or the like. The query language string can include one or more data system query operations including but not limited to filtering, updating and/or viewing data retrieved from the data system or created by a query. Processing continues to 504.
At 504, the parser identifies whether the query string is an optimized query pattern (OQP), which can include, for example, special, very common queries that have been performance tuned.
Some simple examples include:
“Symbol in ‘AAPL’, ‘GOOG’”
“A=13”
“B<12”
If the query string is identified as an OQP, processing continues to 530, where the OQP is processed via a special performance tuned OQP processing section without requiring code generation/compilation, etc. Otherwise processing continues to 506.
At 506, one or more expressions (or subexpressions) within the query string are parsed into a syntax tree (e.g., an abstract syntax tree or AST). The AST can be used to provide contextual information to the compiler in later stages described below. The AST can include a tree representation of the abstract syntactic structure of source code written in a programming language (e.g., the query string). Each node of the AST can represent a construct in the source code. Processing continues to 508.
At 508, variables and/or column representations are substituted into the AST. Because the query language string may include references to data within a row, column or table of the data system, the parser may need to substitute the programming language representation of certain variables, column names, table names etc. with representations that are suitable for the compilation process. For example, assume the following code:
a=13
t2=t1.update(“X=A+a”)
In this example, there is a variable “a” and a column “A”. When “X=A+a” goes through the code generation and compilation process, the system recognizes that “A” is a column and “a” is a variable that was defined in a scope outside of the snippet we are compiling. Processing continues to 510.
At 510, matching method or library calls are identified within the AST. For example, assume a code string of t2=t1.update(“X=func(A,2)”). When the string “X=func(A,2)” is parsed and compiled, the system needs to determine what “func” is. Here, the system can determine that 2 is an “int”. From the type of column A, know the type of A—let's say “float” for this example. Now the system needs to find an appropriate function for “func(float,int)”. If we are able to find an exact match, we use it. We may have to handle type conversions. For example “func(double,long)” may be the closest match. In general, the system is performing this step to determine what the correct function is. Processing continues to 512.
At 512, column types within the AST are inferred. Because a query string can create one or more tables having one or more columns each, the compiler may need to have type information for the columns created by the query string. Often, determining variable or object type within a programming language can be difficult, especially for data objects or structures created dynamically from a language such as the data system query language described herein in which the user may not be required to declare a type of a data column. Without a type declaration, a compiler may have to resort to using a lowest common denominator type or catch all type (e.g., java.lang.Object in Java) as a substitute for the actual type of a column created by the query string.
To infer (or resolve) the type of a column, the parser traverses the AST in order to determine a context of the column in question. The context of the column in question can include the type of variables or objects related to the column within the AST (e.g., return types, argument types, etc.). The parser can evaluate the type of the adjacent variables or objects to infer (or resolve) the type of the column in question. The resolution of the type can follow standard conventions once the context of the column in question has been determined. For example, if a column having an unknown type is defined to contain the result of a hypothetical mathematical operator “plus” and the parameters to the “plus” operator are both of type “int” or integer, the parser may identify a “plus” function that takes two variables of type “int” as parameters and returns a value of type “double” as a result. Because the parser has identified the plus operator that matches the input parameter context, the return type of “double” from the “plus” function can be used to resolve the type of the column to double and a column with a correct type can be created to hold the results of the “plus” function. The parser continues traversing the AST until all unknown column types are resolved. Processing continues to 514.
At 514, the AST with unknown columns types resolved is translated into (or used to generate) programming language code. For example, the AST may be used by the code generator to generate Java language code. The code generation can also include adding programming language boilerplate for compilation purposes, providing information to permit access to relevant variables within scope, and adding information to permit access to relevant libraries and/or classes which may be in scope for the query. Processing continues to 516.
At 516, once the programming language code is available, the parser/compiler system can determine whether precompiled code corresponding to the translated code is available. The parser/compiler system can use one or more attributes of the translated code to generate a token for comparison to precompiled code sections within a precompiled code repository (e.g., 412). The token can include a result of processing one or more attributes of the translated code using a hash function. The attributes can include one or more of the code class name, code file name, a portion of the code, or the like. Processing continues to 518.
At 518, the result of the determining whether a precompiled version of the translated code is available is evaluated. If precompiled code is present, processing continues to 524. Otherwise, processing continues to 520.
At 520, the translated code is compiled by a compiler (e.g., 408) into compiled programming language code (e.g., 410). For example, the translated code may be Java language code that is compiled into one or more Java language classes. Processing continues to 522.
At 522, the compiled code is persisted (or stored) in a precompiled code repository (e.g., 412) along with one or more tokens (e.g., a result of hash function) that can be used to identify and retrieve the precompiled code. Processing continues to 524.
At 524, the compiled code is loaded. The compiled code may be the newly compiled code resulting from 520 or precompiled code identified at 516/518. Processing continues to 526.
At 526, the loaded code is instantiated (e.g., prepared for use, constructed in memory for execution, or the like). Processing continues to 528.
At 528, the instantiated code is executed to perform the query function specified in the query string provided at 502. It will be appreciated that 502-528 may be repeated in whole or in part in order to accomplish a contemplated query task.
It will be appreciated that the modules, processes, systems, and sections described above can be implemented in hardware, hardware programmed by software, software instructions stored on a nontransitory computer readable medium or a combination of the above. A system as described above, for example, can include a processor configured to execute a sequence of programmed instructions stored on a nontransitory computer readable medium. For example, the processor can include, but not be limited to, a personal computer or workstation or other such computing system that includes a processor, microprocessor, microcontroller device, or is comprised of control logic including integrated circuits such as, for example, an Application Specific Integrated Circuit (ASIC), a field programmable gate array (FPGA), a graphics processing unit (GPU), or the like. The instructions can be compiled from source code instructions provided in accordance with a programming language such as Java, C, C++, C#.net, assembly or the like. The instructions can also comprise code and data objects provided in accordance with, for example, the Visual BasicTM language, a specialized database query language, or another structured or object-oriented programming language. The sequence of programmed instructions, or programmable logic device configuration software, and data associated therewith can be stored in a nontransitory computer-readable medium such as a computer memory or storage device which may be any suitable memory apparatus, such as, but not limited to ROM, PROM, EEPROM, RAM, flash memory, disk drive and the like.
Furthermore, the modules, processes systems, and sections can be implemented as a single processor or as a distributed processor. Further, it should be appreciated that the steps mentioned above may be performed on a single or distributed processor (single and/or multi-core, or cloud computing system). Also, the processes, system components, modules, and sub-modules described in the various figures of and for embodiments above may be distributed across multiple computers or systems or may be co-located in a single processor or system. Example structural embodiment alternatives suitable for implementing the modules, sections, systems, means, or processes described herein are provided below.
The modules, processors or systems described above can be implemented as a programmed general purpose computer, an electronic device programmed with microcode, a hard-wired analog logic circuit, software stored on a computer-readable medium or signal, an optical computing device, a networked system of electronic and/or optical devices, a special purpose computing device, an integrated circuit device, a semiconductor chip, and/or a software module or object stored on a computer-readable medium or signal, for example.
Embodiments of the method and system (or their sub-components or modules), may be implemented on a general-purpose computer, a special-purpose computer, a programmed microprocessor or microcontroller and peripheral integrated circuit element, an ASIC or other integrated circuit, a digital signal processor, a hardwired electronic or logic circuit such as a discrete element circuit, a programmed logic circuit such as a PLD, PLA, FPGA, PAL, or the like. In general, any processor capable of implementing the functions or steps described herein can be used to implement embodiments of the method, system, or a computer program product (software program stored on a nontransitory computer readable medium).
Furthermore, embodiments of the disclosed method, system, and computer program product (or software instructions stored on a nontransitory computer readable medium) may be readily implemented, fully or partially, in software using, for example, object or object-oriented software development environments that provide portable source code that can be used on a variety of computer platforms. Alternatively, embodiments of the disclosed method, system, and computer program product can be implemented partially or fully in hardware using, for example, standard logic circuits or a VLSI design. Other hardware or software can be used to implement embodiments depending on the speed and/or efficiency requirements of the systems, the particular function, and/or particular software or hardware system, microprocessor, or microcomputer being utilized. Embodiments of the method, system, and computer program product can be implemented in hardware and/or software using any known or later developed systems or structures, devices and/or software by those of ordinary skill in the applicable art from the function description provided herein and with a general basic knowledge of the software engineering and computer networking arts.
Moreover, embodiments of the disclosed method, system, and computer readable media (or computer program product) can be implemented in software executed on a programmed general purpose computer, a special purpose computer, a microprocessor, or the like.
It is, therefore, apparent that there is provided, in accordance with the various embodiments disclosed herein, methods, systems and computer readable media for parsing and compiling data system queries.
Application Ser. No. 15/154,974, entitled “DATA PARTITIONING AND ORDERING” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/154,975, entitled “COMPUTER DATA SYSTEM DATA SOURCE REFRESHING USING AN UPDATE PROPAGATION GRAPH” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/154,979, entitled “COMPUTER DATA SYSTEM POSITION-INDEX MAPPING” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/154,980, entitled “SYSTEM PERFORMANCE LOGGING OF COMPLEX REMOTE QUERY PROCESSOR QUERY OPERATIONS” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/154,983, entitled “DISTRIBUTED AND OPTIMIZED GARBAGE COLLECTION OF REMOTE AND EXPORTED TABLE HANDLE LINKS TO UPDATE PROPAGATION GRAPH NODES” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/154,984, entitled “COMPUTER DATA SYSTEM CURRENT ROW POSITION QUERY LANGUAGE CONSTRUCT AND ARRAY PROCESSING QUERY LANGUAGE CONSTRUCTS” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/154,985, entitled “PARSING AND COMPILING DATA SYSTEM QUERIES” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/154,987, entitled “DYNAMIC FILTER PROCESSING” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/154,988, entitled “DYNAMIC JOIN PROCESSING USING REAL-TIME MERGED NOTIFICATION LISTENER” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/154,990, entitled “DYNAMIC TABLE INDEX MAPPING” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/154,991, entitled “QUERY TASK PROCESSING BASED ON MEMORY ALLOCATION AND PERFORMANCE CRITERIA” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/154,993, entitled “A MEMORY-EFFICIENT COMPUTER SYSTEM FOR DYNAMIC UPDATING OF JOIN PROCESSING” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/154,995, entitled “QUERY DISPATCH AND EXECUTION ARCHITECTURE” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/154,996, entitled “COMPUTER DATA DISTRIBUTION ARCHITECTURE” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/154,997, entitled “DYNAMIC UPDATING OF QUERY RESULT DISPLAYS” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/154,998, entitled “DYNAMIC CODE LOADING” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/154,999, entitled “IMPORTATION, PRESENTATION, AND PERSISTENT STORAGE OF DATA” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/155,001, entitled “COMPUTER DATA DISTRIBUTION ARCHITECTURE” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/155,005, entitled “PERSISTENT QUERY DISPATCH AND EXECUTION ARCHITECTURE” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/155,006, entitled “SINGLE INPUT GRAPHICAL USER INTERFACE CONTROL ELEMENT AND METHOD” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/155,007, entitled “GRAPHICAL USER INTERFACE DISPLAY EFFECTS FOR A COMPUTER DISPLAY SCREEN” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/155,009, entitled “COMPUTER ASSISTED COMPLETION OF HYPERLINK COMMAND SEGMENTS” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/155,010, entitled “HISTORICAL DATA REPLAY UTILIZING A COMPUTER SYSTEM” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/155,011, entitled “DATA STORE ACCESS PERMISSION SYSTEM WITH INTERLEAVED APPLICATION OF DEFERRED ACCESS CONTROL FILTERS” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
Application Ser. No. 15/155,012, entitled “REMOTE DATA OBJECT PUBLISHING/SUBSCRIBING SYSTEM HAVING A MULTICAST KEY-VALUE PROTOCOL” and filed in the United States Patent and Trademark Office on May 14, 2016, is hereby incorporated by reference herein in its entirety as if fully set forth herein.
While the disclosed subject matter has been described in conjunction with a number of embodiments, it is evident that many alternatives, modifications and variations would be, or are, apparent to those of ordinary skill in the applicable arts. Accordingly, Applicants intend to embrace all such alternatives, modifications, equivalents and variations that are within the spirit and scope of the disclosed subject matter.

## Claims

1. A system for parsing, generating code and compiling computer data system query language code, the system comprising:
one or more hardware processors coupled to a nontransitory computer readable medium having stored thereon software instructions that, when executed by the one or more processors, cause the one or more processors to perform operations including:
obtaining, at the one or more hardware processors, computer data system query language code from an electronic computer readable data storage;
parsing, at the one or more hardware processors, the computer data system query language code to generate a computer data system query language parsed code structure;
resolving, at the one or more hardware processors, a type of one or more columns represented in the parsed code structure based on a determined context of the one or more columns;
inserting, at the one or more hardware processors, resolved types into the parsed code structure;
generating, at the one or more hardware processors, computer programming language code from the computer data system query language parsed code structure;
determining, at the one or more hardware processors, whether precompiled code corresponding to the generated computer programming language code is available in a precompiled code repository stored in the electronic computer readable data storage;
when precompiled code is available in the precompiled code repository, loading, at the one or more hardware processors, the precompiled code;
when precompiled code is not available in the precompiled code repository:
compiling, at the one or more hardware processors, the computer programming language code to generate compiled computer programming language code; and
loading, at the one or more hardware processors, the compiled computer programming language code;

instantiating, at the one or more hardware processors, the loaded precompiled code or the compiled computer programming language code; and
executing, at the one or more hardware processors, the instantiated code to perform a query operation corresponding to the computer data system query language code,
wherein determining whether precompiled code corresponding to the programming language code is available in a precompiled code repository comprises:
generating a token representing the generated computer programming language code; and
comparing the token to one or more repository tokens in the precompiled code repository corresponding to precompiled code units.

2. The system of claim 1, wherein the computer data system query language code includes one or more instructions of a data system query language.

3. The system of claim 1, wherein the operations further include identifying a source of columns or query scope variables for substitution and use in computer programming language code.

4. The system of claim 1, wherein the operations further include persisting the compiled computer programming language code by storing the precompiled code in the precompiled code repository.

5. The system of claim 1,
wherein the token includes a result of a hash function of one or more attributes of the computer programming language code; and
wherein determining whether precompiled code corresponding to the programming language code is available in a precompiled code repository further comprises: based on the comparing, determining whether the token matches any of the repository tokens.

6. The system of claim 1, wherein the inserting includes inserting references to data objects and variables that have been made available to the query language code.

7. The system of claim 1, wherein the operations further include repeating the resolving and inserting until any unresolved columns or variables have been resolved.

8. A method for parsing, generating code and compiling computer data system query language code, the method comprising:
obtaining, at a hardware processor, computer data system query language code from an electronic computer readable data storage;
parsing, at the hardware processor, the computer data system query language code to generate a computer data system query language parsed code structure;
resolving, at the hardware processor, a type of one or more columns represented in the parsed code structure based on a determined context of the one or more columns;
inserting, at the hardware processor, resolved types into the parsed code structure;
generating, at the hardware processor, computer programming language code from the computer data system query language parsed code structure;
determining, at the hardware processor, whether precompiled code corresponding to the generated computer programming language code is available in a precompiled code repository stored in the electronic computer readable data storage;
when precompiled code is available in the precompiled code repository, loading, at the hardware processor, the precompiled code;
when precompiled code is not available in the precompiled code repository:
compiling, at the hardware processor, the computer programming language code to generate compiled computer programming language code; and
loading, at the hardware processor, the compiled computer programming language code;

instantiating, at the hardware processor, the loaded precompiled code or the compiled computer programming language code; and
executing, at the hardware processor, the instantiated code to perform a query operation corresponding to the computer data system query language code,
wherein determining whether precompiled code corresponding to the programming language code is available in a precompiled code repository comprises:
generating a token representing the generated computer programming language code; and
comparing the token to one or more repository tokens in the precompiled code repository corresponding to precompiled code units.

9. The method of claim 8, wherein the computer data system query language code includes one or more instructions of a data system query language.

10. The method of claim 8, further comprising identifying a source of columns or query scope variables for substitution and use in computer programming language code.

11. The method of claim 8, further comprising persisting the compiled computer programming language code by storing the precompiled code in the precompiled code repository.

12. The method of claim 8,
wherein the token includes a result of a hash function of one or more attributes of the computer programming language code; and
wherein determining whether precompiled code corresponding to the programming language code is available in a precompiled code repository further comprises: based on the comparing, determining whether the token matches any of the repository tokens.

13. The method of claim 8, wherein the inserting includes inserting references to data objects and variables that have been made available to the query language code.

14. The method of claim 8, further comprising repeating the resolving and inserting until any unresolved columns or variables have been resolved.

15. A nontransitory computer readable medium having stored thereon software instructions that, when executed by one or more processors, cause the one or more processors to perform operations including:
obtaining, at the one or more hardware processors, computer data system query language code from an electronic computer readable data storage;
parsing, at the one or more hardware processors, the computer data system query language code to generate a computer data system query language parsed code structure;
resolving, at the one or more hardware processors, a type of one or more columns represented in the parsed code structure based on a determined context of the one or more columns;
inserting, at the one or more hardware processors, resolved types into the parsed code structure;
generating, at the one or more hardware processors, computer programming language code from the computer data system query language parsed code structure;
determining, at the one or more hardware processors, whether precompiled code corresponding to the generated computer programming language code is available in a precompiled code repository stored in the electronic computer readable data storage;
when precompiled code is available in the precompiled code repository, loading, at the one or more hardware processors, the precompiled code;
when precompiled code is not available in the precompiled code repository:
compiling, at the one or more hardware processors, the computer programming language code to generate compiled computer programming language code; and
loading, at the one or more hardware processors, the compiled computer programming language code;

instantiating, at the one or more hardware processors, the loaded precompiled code or the compiled computer programming language code; and
executing, at the one or more hardware processors, the instantiated code to perform a query operation corresponding to the computer data system query language code,
wherein determining whether precompiled code corresponding to the programming language code is available in a precompiled code repository comprises:
generating a token representing the generated computer programming language code; and
comparing the token to one or more repository tokens in the precompiled code repository corresponding to precompiled code units.

16. The nontransitory computer readable medium of claim 15, wherein the computer data system query language code includes one or more instructions of a data system query language.

17. The nontransitory computer readable medium of claim 15, wherein the operations further include identifying a source of columns or query scope variables for substitution and use in computer programming language code.

18. The nontransitory computer readable medium of claim 15, wherein the operations further include persisting the compiled computer programming language code by storing the precompiled code in the precompiled code repository.

19. The nontransitory computer readable medium of claim 15,
wherein the token includes a result of a hash function of one or more attributes of the computer programming language code; and
wherein determining whether precompiled code corresponding to the programming language code is available in a precompiled code repository further comprises: based on the comparing, determining whether the token matches any of the repository tokens.

20. The nontransitory computer readable medium of claim 15, wherein the inserting includes inserting references to data objects and variables that have been made available to the query language code, and wherein the operations further include repeating the resolving and inserting until any unresolved columns or variables have been resolved.