Patent Grant
10198466
Embodiments relate generally to computer database systems and computer networks, and more particularly, to methods, systems and computer readable media for limiting user access to data through the application of data access controls.
Many systems control user access to data based on a user group or a user role. These systems apply these controls based on an access list and not on the operation being used to access the data. Also, the access control is applied to a large data source without regards to smaller subsets of data within the large data source. Normally, applying access controls to large data sources with a broad brush incurs a higher performance cost. This extra cost is especially evident when the user is applying a filtering operation, such as a where clause, to gain access to a smaller set of data, but the security measures are applied to the large data source before the filtering operation. A need may exist for interleaving generated access control filters based on the type of operation requested with data store structure-based access filters to achieve high performance while keeping the data secure.
Embodiments were conceived in light of the above mentioned needs, problems and/or limitations, among other things.
Some implementations can include a system for automatically applying access control deferred filters to a first table object, the system comprising one or more hardware processors, a computer readable data storage device coupled to the one or more hardware processors, the computer readable data storage device having stored thereon software instructions that, when executed by the one or more hardware processors, cause the one or more hardware processors to perform operations. The operations can include receiving a user request submitted from a computing device for data from the first table object. The operations can also include requesting from an access control list source stored in a computer medium, access control groups for the user. The operations can further include requesting from an access control filter source in the computer medium, a set of filter generators for each access control group. The operation can also include determining for each set of filter generators for each access control group, a most specific filter generator based on metadata for the first table object for identifying a computer medium source of the first table object data. The operations can include for each most specific filter generator, executing the specific filter generator to create a filter for the first table object. The operations can also include combining each of the generated filters for the first table object into an access control deferred filter. The operations can include creating a second table object in memory that references the first table object. The operations can also include associating an access control deferred filter with the second table. The operations can further include making the second table object available for user operations.
The operations can include receiving a user request from a computing device to perform a filtering operation on the second table object. The operations can also include accessing the metadata of the second table object. The operations can further include retrieving a tree-based table storage structure from the metadata. The operations can also include traversing the tree-based table storage structure starting at a table root of the tree-based table storage structure. The operations can include when the user request requests data from one or more partition columns of the tree-based table storage structure, applying one or more partition column filters based on a partition column structure of the tree. The operations can also include when the user request contains a filtering operation for one or more grouping columns of the tree-based table storage structure, in a first pass, executing user-specified filters on the one or more partition columns that execute only system-specified code, and between the first and a second pass, applying internal access-control filters, thereby removing all rows for which the user does not have authorized access by retrieving the access control deferred filter from the metadata, extracting access control filters from the access control deferred filter that apply to the access control groups for the user, and choosing a least restrictive access control filter from the extracted access control filters. The operations can further include applying the least restrictive access control filter to the user request. The operations can also include applying on the second pass one or more second grouping column filters based on a first filter request contained in the user request. The operations can include applying one or more normal filters contained in the user request to identify a filtered data source result. The operations can also include returning the final set of data.
The operations can include wherein the access control deferred filter includes an access control disjunctive filter.
The operations can also include wherein the access control deferred filter includes an access control conjunctive filter.
The operations can include receiving a user request from a computing device to perform a data access operation on the second table object. The operations can also include accessing the metadata of the second table object. The operations can also include retrieving a tree-based table storage structure from the metadata. The operations can further include traversing the tree-based table storage structure starting at a table root of the tree-based table storage structure. The operations can also include when the user request requests data from one or more columns of the tree-based table storage structure, applying internal access-control filters, thereby removing all rows for which the user does not have authorized access by retrieving the access control deferred filter from the metadata, extracting access control filters from the access control deferred filter that apply to the access control groups for the user, and choosing a least restrictive access control filter from the extracted access control filters. The operations can also include applying the least restrictive access control filter to the user request. The operations can include applying the specified user operation. The operations can also include returning the final set of data.
Some implementations can include a method for applying access control deferred filters to a first table object in a computer medium, the method comprising receiving a user request submitted from a computing device for data from the first table object. The method can also include requesting from an access control list source stored in a computer medium, access control groups for the user. The method can further include requesting from an access control filter source in the computer medium, a set of filter generators for each access control group. The method can also include determining for each set of filter generators for each access control group, a most specific filter generator based on metadata for the first table object for identifying a computer medium source of the first table object data. The method can include for each most specific filter generator, executing the specific filter generator to create a filter for the first table object. The method can also include combining each of the generated filters for the first table object into an access control deferred filter. The method can also include creating a second table object in memory that references the first table object. The method can further include associating an access control deferred filter with the second table. The method can also include making the second table object available for user operations.
The method can also include receiving a user request from a computing device to perform a filtering operation on the second table object. The method can include accessing the metadata of the second table object. The method can also include retrieving a tree-based table storage structure from the metadata. The method can further include traversing the tree-based table storage structure starting at a table root of the tree-based table storage structure. The method can also include when the user request requests data from one or more partition columns of the tree-based table storage structure, applying one or more partition column filters based on a partition column structure of the tree. The method can also include when the user request contains a filtering operation for one or more grouping columns of the tree-based table storage structure, in a first pass, executing user-specified filters on the one or more partition columns that execute only system-specified code, and on a second pass, applying internal access-control filters, thereby removing all rows for which the user does not have authorized access. The method can include retrieving the access control deferred filter from the metadata. The method can also include extracting access control filters from the access control deferred filter that apply to the access control groups for the user. The method can also include choosing a least restrictive access control filter from the extracted access control filters. The method can further include applying the least restrictive access control filter to the user request. The method can also include applying one or more second grouping column filters based on a first filter request contained in the user request. The method can include applying one or more normal filters contained in the user request to identify a filtered data source result. The method can also include returning the final set of data.
The method can include wherein the access control deferred filter includes an access control disjunctive filter.
The method can include wherein the access control deferred filter includes an access control conjunctive filter.
The method can include receiving a user request from a computing device to perform a data access operation on the second table object. The method can also include accessing the metadata of the second table object. The method can further include retrieving a tree-based table storage structure from the metadata. The method can also include traversing the tree-based table storage structure starting at a table root of the tree-based table storage structure. The method can further include when the user request requests data from one or more columns of the tree-based table storage structure, applying internal access-control filters, thereby removing all rows for which the user does not have authorized access by retrieving the access control deferred filter from the metadata, extracting access control filters from the access control deferred filter that apply to the access control groups for the user, and choosing a least restrictive access control filter from the extracted access control filters. The method can also include applying the least restrictive access control filter to the user request. The method can include applying the specified user operation. The method can also include returning the final set of data.
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 receiving a user request submitted from a computing device for data from the first table object. The operations can also include requesting from an access control list source stored in a computer medium, access control groups for the user. The operations can include requesting from an an access control filter source in the computer medium, a set of filter generators for each access control group. The operations can also include determining for each set of filter generators for each access control group, a most specific filter generator based on metadata for the first table object for identifying a computer medium source of the first table object data. The operations can include for each most specific filter generator, executing the specific filter generator to create a filter for the first table object. The operations can also include combining each of the generated filters for the first table object into an access control deferred filter. The operations can further include creating a second table object in memory that references the first table object. The operations can also include associating an access control deferred filter with the second table. The operation can include making the second table object available for user operations.
The operations can include receiving a user request from a computing device to perform a filtering operation on the second table object. The operations can also include accessing the metadata of the second table object. The operations can further include retrieving a tree-based table storage structure from the metadata. The operations can also include traversing the tree-based table storage structure starting at a table root of the tree-based table storage structure. The operations can include if the user request requests data from one or more partition columns of the tree-based table storage structure, applying one or more partition column filters based on a partition column structure of the tree. The operations can also include if the user request contains a filtering operation for one or more grouping columns of the tree-based table storage structure, in a first pass, executing user-specified filters on the one or more partition columns that execute only system-specified code, and on a second pass, applying internal access-control filters, thereby removing all rows for which the user does not have authorized access. The operations can include retrieving the access control deferred filter from the metadata. The operations can also include extracting access control filters from the access control deferred filter that apply to the access control groups for the user. The operations can include choosing a least restrictive access control filter from the extracted access control filters. The operations can further include applying the least restrictive access control filter to the user request. The operations can also include applying one or more second grouping column filters based on a first filter request contained in the user request. The operations can include applying one or more normal filters contained in the user request to identify a filtered data source result. The operations can also include returning the final set of data.
The operations can include wherein the access control deferred filter includes an access control disjunctive filter.
The operations can include wherein the access control deferred filter includes an access control conjunctive filter.
The operations can include receiving a user request from a computing device to perform a data access operation on the second table object. The operations can also include accessing the metadata of the second table object. The operations can include retrieving a tree-based table storage structure from the metadata. The operations can further include traversing the tree-based table storage structure starting at a table root of the tree-based table storage structure. The operations can also include when the user request requests data from one or more columns of the tree-based table storage structure, applying internal access-control filters, thereby removing all rows for which the user does not have authorized access by retrieving the access control deferred filter from the metadata, extracting access control filters from the access control deferred filter that apply to the access control groups for the user and choosing a least restrictive access control filter from the extracted access control filters. The operations can also include applying the least restrictive access control filter to the user request. The operations can further include applying the specified user operation. The operations can also include returning the final set of data.
Reference is 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.
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.
It will be appreciated that the configuration shown in
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 1208.
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 216, and 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).
In operation, the processor 302 may execute the remote query processor application 310 stored in the memory 306. The remote query processor application 310 can include software instructions that, when executed by the processor, cause the processor to perform operations for executing and updating queries in accordance with the present disclosure (e.g., performing one or more of 502-526, 550-572, 602-612 described below).
The remote query processor application program 310 can operate in conjunction with the data section 312 and the operating system 304.
A data object (such as a table) within the computer data system can include a definition that provides information used to access and/or modify the data object. The data object definition information can include a namespace, a data object name (e.g., a table name), and an ordered list of column definitions. Each column definition can include one or more of a column name, a column type (e.g., partitioning, grouping, normal, etc.), data type, component type (for arrays), and storage hint information for columns having variable sized or encoded data.
Each partition column value (e.g., 506-510) can include zero or more table location data values (516, 518). The table location data can include a table location key comprised of a prefix and a partition column value. For example, table location data 1516 could have a table location key of “A/2016-05-01”, which can refer to a prefix of “A” (e.g., a security symbol of “A”) and the partition column value of the date “2016-05-01.” While a tree structure is shown in
The table 520 can include one or more locations (528-532). Each table location (528-532) can include table location key information (e.g., 534-538, respectively) and table location metadata (540-544, respectively). Each table location (528-532) can also include column data (546-548, 550-552, and 554-556, respectively).
The table location key (e.g., 534-538 can include storage information (path, address, etc.), and partitioning column value(s) (e.g., date). The table location metadata (e.g., 540-544) can include table location size, modification time, etc.).
Column data (e.g., 546-556) can be represented by one or more files with per position (e.g., row number in this table location) access at the outermost table location level.
There is a processing cost associated with applying access controls to data sources. It would be fairly simple and low cost to either deny or grant a user access to a large data source without regard to the content of the large data source. The cost of granting or denying user access increases when access controls are applied separately to subsets of data. The cost further increases when a user has many roles within an organization and the system needs to decide which role should govern when granting access. Some of the cost can be lessened by building security into the data storage structure itself. More cost savings can be achieved by interleaving additional security measures into a secure data storage structure at levels that are only executed when a user has successfully navigated the built-in security measures. For example, a tree-based table storage structure can be used to implement filtering at different levels of the tree and permit interleaving of additional security measures at optimum levels of the tree.
The leaf nodes of a partition column can be subtables. An example subtable structure is shown at 570. In a subtable structure 570, a subtable 578 can be stored for all rows and columns of a table.
For example, a table can have a logical table schema of columns for Date, Ticker Symbol, Timestamp, Bid Price and Ask Price. In this example, two partition columns can be created under the table root, one partition for Date and one partition for FileServer. The Date partition column (for example, 564) can contain directory paths to data for a single date, such as 2016-03-18. Because the data is all of the same date, 2016-03-18, the subtable 578 does not need to contain a Date value. In this example, the subtable 578 for the same date, 2016-03-18, can be spread across multiple file servers. A second partition column (for example, 566) is set under the Date partition column in the tree to provide a path, such as <table>/<date>/<fileserver>, to locate all the Date data for 2016-03-18. As noted earlier in this example, the Date partition column can be visible to a user, but a fileserver partition column may not be visible.
The data partition column is visible to the user to help the user formulate queries that can take advantage of the tree structure. For example, query performance can be enhanced by applying filters, such as where clauses, in an order based on the location of the data in a tree. Generally, applying the filter to a partition column closer to the table root 562 can minimize the amount of data processed to arrive at a final result. For example, in the Date, Ticker Symbol, Timestamp, Bid Price, Ask Price example, the most efficient filtering order is Date followed by Ticker Symbol. In this example, table.where (“Date=d”, “Sym=‘AAPL’”, “Bid>1000”) can be much faster than table.where (“BID>1000”, “Sym=‘AAPL’”, “Date=d”). In table.where (“Date=d”, “Sym=‘AAPL’”, “Bid>1000”), only the subtable 578 under the date “d” partition column needs to be retrieved for processing because the subtable 578 in this example is already partitioned by date, the system does not need to provide any additional filtering work for date. In contrast table.where (“BID>1000”, “Sym=‘AAPL’”, “Date=d”) can require every bid for every stock ticker for every date to be retrieved and processed because the “BID>1000” is processed first, and a partition column for “BID>1000” may not exist. As shown by this example, partition columns can be used to provide a tree structure that can permit the system to efficiently re-filter per each query the filters on the contents of the partition columns.
It will be appreciated that partition columns are not limited to Date or Fileserver. Any common attribute that would provide performance gains if pre-filtered can be a good candidate for partition columns.
It will also be appreciated that query performance gains can be achieved by creating grouping columns (572, 574, 576) underneath the Date data. For example, a grouping column could be created for each distinct ticker symbol.
The tree-based table storage 560 can also be used to insert access control filters to protect against unauthorized access to subtable 578. As with other filters, access control filters can affect the query efficiency depending on where in the tree, the access control filters are inserted. For example, if a user is not permitted access to ticker symbol for “AAPL” data, the access control filter can be written as “TickerSymbol !=‘AAPL’”. In this example, if this access control filter is inserted before the Date filter, the performance can suffer because the query can first look through all data for AAPL across all available dates (could be years of data) instead of first filtering by Date, which is already a partition column.
User-specified and internal access control filters can be applied at the partition column and the grouping column levels. For example, a user-specified filter of Date=‘2016-03-18’ can be applied to the Date partition column for where the Date=‘2016-03-18’. In applying the user-specified filters, it can be assumed that data in upper partition columns, such as Date, are generic enough that security is not an issue if the Date partition column is accessed prior to applying the internal access filter of “TickerSymbol !=‘AAPL’”, because the user is already likely aware that data was collected for each date.
After applying the partition column filters, a two-pass access control approach can be taken with grouping columns because the grouping columns can contain sensitive data values, in contrast to the higher tree-level partition columns. User-specified filters can be divided into two classes: (1) filters which can execute system-controlled code, and (2) filters which can run user-controlled code. Filters which can run only system-controlled code can safely be executed against partition columns without leaking data to the user. Filters which can run user-controlled code may not be executed against the partitioning columns, as arbitrary user code can record values instead of simply filtering values. An example of a system-controlled filter can be a simple match (e.g., TickerSymbol=‘SPY’). An example of a user-controlled filter can be a filter that specifies a conditional formula (e.g., TickerSymbol.contains(“1”)). In a first pass, the system can execute user-specified filters on the partitioning columns that execute only system-specified code. Next, the internal access-control filters can be applied, thereby removing all rows that the user does not have authorization to access. For example, after the internal access-control filters are applied, no rows are in the result set which the user does not have authorization to access. The system can then apply user-specified filters that can contain user-controlled code to partitioning columns. Finally, other user-specified filters can be applied to the remaining columns.
It will be appreciated that additional columns may be added to the user-group table 600 (e.g., unique id key, time stamp of creation, time stamp of last update, etc.).
It will be appreciated that the user-group information shown in table 600 is not limited to table form and can also be maintained in other forms and formats. For example, the user information and security group information can be stored in files, xml, objects, etc.
It will be appreciated that additional columns may be added to the data source specific access control table 700 (e.g., unique id key, time stamp of creation, time stamp of last update, etc.).
It will also be appreciated that other methods in addition to table namespace and table name can be used to locate tables. For example, a path can be provided to a table, such as /domain_name/fileserver_name/table_name/.
It will be appreciated that the data source specific access control information shown in table 700 is not limited to table form and can also be maintained in other forms and formats. For example, the security group information, table namespace information, table name information and filter generator information can be stored in files, xml, objects, etc.
It will also be appreciated that the data source specific access control table could apply to other forms of data stores other than tables such as files, xml, objects, etc.
At 804, the union of all security groups for the user is determined. For example, in user-group table 600 there are two users identified in the user column 602. A union of all security groups for user “Carlos” in column 602 would include “Carlos”, “Allusers”, and “Developers” from the security group column 604. Processing continues to 806.
At 806, the union of all security groups from the user-group table 600 is applied to the data source identified in the data source specific access control table 700 to determine the most specific filter generator for the data source's metadata. For example, in the data source specific access control table 700 the security groups 702 that apply to Carlos are the “Allusers” and “Developers” security groups. If only one matching row exists (not shown) for “Allusers” in the data source access control table, then the filter generator in the filter generator column would be by default of only having one row, the most specific generator. In the
In a first example, a user can query a database using NameSpace—1 and TableName—1. In this example, the only match in 700 for the table namespace 704 and tablename 706 columns are the wildcards. Accordingly, for this example, the most specific filter generator is the wildcard, which effectively does not further limit the security applied.
In a second example, a user's access to all tables of the account_db can be prohibited by the “NO_ACCESS” designation.
In a third example, a user can query a database using MAIN_DB and TableName—1. In this example, the closest or most precise match in 700 for the table namespace 704 and tablename 706 columns are “MAIN_DB” and the wildcard. Accordingly, for this example, the most specific filter generator is WhereClause (parameters 1) as shown in filter generator column 708 for “MAIN_DB” and wildcard row.
In a fourth example, a user can query a database using MAIN_DB and Shipments. In this example, the most precise match in 700 for the table namespace 704 and tablename 706 columns are “MAIN_DB” and “Shipments,” respectively. Accordingly, for this example, the most specific filter generator is WhereClause (parameters 2) as shown in filter generator column 708 for “MAIN_DB” and “Shipments.” Processing continues to 808.
At 808, the most specific filter generator for each of the user's security groups determined in step 806 is added to a set of relevant filter generators for that particular user and the data source determined by the table namespace 704 and tablename 706. Processing continues to 810.
At 810, for each filter generator that was added to the set of relevant filter generators in step 808, a filter can be generated for the data source. For example, continuing with the “Allusers” examples from step 808, if the data source can be determined by “MAIN_DB” and “Shipments” the filter generator added for “Allusers” can be “WhereClause (parameters 2), and for “Developers” can be “WhereClause (parameters 3)” and “WhereClause (parameters 4)”. The wildcard would be added for “SuperUser.” Processing continues to 812.
At 812, the set of generated filters can be combined into an access control deferred filter. Continuing the example from 810, the most specific filter generated for “Allusers”, “MAIN_DB”, “Shipments”, “WhereClause (parameters 2) can be combined along with any filters generated for “Developers”, and “SuperUser”.
It will be appreciated that the access control filters can be combined in a variety of ways, such as an access control disjunctive filter, an access control conjunctive filter, or the like. For example, rather than allowing access to a disjunction of rows providing a union; the filters can be combined conjunctively providing an intersection. Processing continues to 814.
At 814, the data source requested in 802 is created as a non-filtered data source with access control supplemented by the deferred access control filter. The access control deferred filter can be stored in the table metadata 504 in the table information 502. The access control deferred filter can be stored in an in-memory object representation of the table that can contain an index and references to relevant data. This storage location for the access control deferred filter can provide quick access to the filter and the access control deferred filter can be applied when data in the table is accessed whether it be accessed through filtering, viewing, or another table operation.
It will be appreciated that access control filters can be created for any data source that can be associated with metadata. For example, access control filters can be created for partitioned, column-based table objects, non-partitioned relational database tables, flat files, xml, data objects, etc.
It will be appreciated that many of the coding examples given are presented in pseudo code. The filtering can be implemented in any coding language that is supported by a system for querying data sources.
Processing begins at 902 when a query that contains an operation on a non-filtered data source with a deferred access control list can be received from a user. The metadata of the non-filtered data source can contain a deferred access control filter similar to the access control filter generated in process 800. Processing continues to 904.
At 904, partition column filtering is applied. For example, the data may be stored as represented in
At 906, the system proceeds down the tree and applies any secure grouping column filters that exist. For an example, a user can submit a query for a table filtered by TickerSymbol=‘AAPL’. If the data is grouped in the tree hierarchy by ticker symbols, a user-specified filter of TickerSymbol=‘AAPL’ can be applied to the TickerSymbol grouping column for where the TickerSymbol=‘AAPL’. As the system applies the TickerSymbol=‘AAPL’ without the need to execute user-controlled code, no sensitive data can be leaked to the user via the application of this user-specified filter. Processing continues to 908.
At 908, the access control filter is applied before the user can execute user written unsecure code. For example, the access control filter may contain a filter generated for “Allusers” such as: “Allusers”, “MAIN_DB”, “Shipments”, “WhereClause (parameters 2)” combined along with filters generated for “Developers”, and “SuperUser”. After the access control filter is applied, the remaining user-specified filters are applied.
It will be appreciated that with the processing of the query through the table tree structure partition columns, grouping columns and the application of the access control filter, no user written code has been executed against the queried table. The access filters that have been applied are built into the data tree structure and the meta data of the table. Processing continues to 910.
It will be appreciated that filters are not limited to equality filters executing only system-controlled code. The system can parse a variety of user-specified filters and implement them with system-controlled code. For example, greater than, less then, not equals, range checks, inclusion, arbitrarily complex code, or any other operation that the system can identify or appropriately sandbox may be executed before the access control filter is applied.
At 910, a second pass through the group filters is executed, but this time with the application of the user-specified filters containing code that may not be controlled by the system. For example, if the user query filtered by a formula on the ticker symbol (e.g., ticker symbol.contains(“AAPL”), the system would follow the tree structure to the data under the ticker symbol grouping column. Processing continues to 912.
At 912, normal filters are applied in response to the user's query. Normal filters can be filters that do not match any of the tree structures such as column partitions and grouping partitions. For example, Date and Fileserver location can be partition column examples and ticker symbol can be a grouping columns example. If the query contains a third filter component that is not a partition column or grouping column then that third filter component, a normal filter, can be executed against the subtable 578. For example, the Asking Price (Ask>16) may not be captured in a partition column or a grouping column. The query would follow the tree structure down through the Data and Fileserver location partition columns and then through the ticker symbol grouping column to arrive at the subtable 578. At this point the subtable is filtered by Ask>16.
It will be appreciated that the data may be spread across more than one subtable. For example, if a query attempts to retrieve data across many days with a value greater than “x”, the query can require access to many date partitions and many subtables under those partitions. Processing continues to 914.
At 914, the filtered data source result with access controls applied is now available for an operation to be applied. For example, the filtered data source results may be all the rows for “AAPL” collected on 2016-03-18 with a Bid>14 and an Ask>16. The query can also contain an operation to be applied to this resultant data set, such as an a “select”, “update”, “join”, “view”, or the like. Processing continues to 916.
At 916, the operation is applied to the filtered data source. Processing continues to 918.
At 918, the resulting filtered data source with operation applied is displayed.
It will be appreciated that step 908, the application of the access control deferred filter can be applied at other levels of the table tree. For example, the access control filters can be applied at all levels of the tree.
It will be appreciated that method 900 for filtering a non-filtered data source with an access control filter as created in 800 is not limited to the filtering of any one particular data source type. Method 900 can be applied to any structured data source such as partitioned, column-based table objects, non-partition relational database tables, flat files, xml, data objects, etc.
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), 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 Basic™ language, a specialized database query language such as PL/SQL, 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 a permissions system including relationships of partitioning, grouping, and the application of access control deferred filters.
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” 10087) 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.
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.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5335202 | Manning et al. | Aug 1994 | A |
| 5452434 | Macdonald | Sep 1995 | A |
| 5469567 | Okada | Nov 1995 | A |
| 5504885 | Alashqur | Apr 1996 | A |
| 5530939 | Mansfield et al. | Jun 1996 | A |
| 5568632 | Nelson | Oct 1996 | A |
| 5673369 | Kim | Sep 1997 | A |
| 5701461 | Dalal et al. | Dec 1997 | A |
| 5701467 | Freeston | Dec 1997 | A |
| 5764953 | Collins et al. | Jun 1998 | A |
| 5787428 | Hart | Jul 1998 | A |
| 5806059 | Tsuchida et al. | Sep 1998 | A |
| 5859972 | Subramaniam et al. | Jan 1999 | A |
| 5875334 | Chow et al. | Feb 1999 | A |
| 5878415 | Olds | Mar 1999 | A |
| 5890167 | Bridge et al. | Mar 1999 | A |
| 5899990 | Maritzen et al. | May 1999 | A |
| 5920860 | Maheshwari et al. | Jul 1999 | A |
| 5943672 | Yoshida | Aug 1999 | A |
| 5960087 | Tribble et al. | Sep 1999 | A |
| 5991810 | Shapiro et al. | Nov 1999 | A |
| 5999918 | Williams et al. | Dec 1999 | A |
| 6006220 | Haderle et al. | Dec 1999 | A |
| 6032144 | Srivastava et al. | Feb 2000 | A |
| 6032148 | Wilkes | Feb 2000 | A |
| 6038563 | Bapat | Mar 2000 | A |
| 6058394 | Bakow et al. | May 2000 | A |
| 6061684 | Glasser | May 2000 | A |
| 6138112 | Slutz | Oct 2000 | A |
| 6160548 | Lea et al. | Dec 2000 | A |
| 6266669 | Brodersen et al. | Jul 2001 | B1 |
| 6289357 | Parker | Sep 2001 | B1 |
| 6292803 | Richardson et al. | Sep 2001 | B1 |
| 6304876 | Isip | Oct 2001 | B1 |
| 6317728 | Kane | Nov 2001 | B1 |
| 6327702 | Sauntry et al. | Dec 2001 | B1 |
| 6336114 | Garrison | Jan 2002 | B1 |
| 6353819 | Edwards et al. | Mar 2002 | B1 |
| 6367068 | Vaidyanathan et al. | Apr 2002 | B1 |
| 6389414 | Delo et al. | May 2002 | B1 |
| 6389462 | Cohen et al. | May 2002 | B1 |
| 6438537 | Netz et al. | Aug 2002 | B1 |
| 6446069 | Yaung et al. | Sep 2002 | B1 |
| 6460037 | Weiss et al. | Oct 2002 | B1 |
| 6473750 | Petculescu et al. | Oct 2002 | B1 |
| 6487552 | Lei et al. | Nov 2002 | B1 |
| 6496833 | Goldberg et al. | Dec 2002 | B1 |
| 6505189 | Au et al. | Jan 2003 | B1 |
| 6505241 | Pitts | Jan 2003 | B2 |
| 6510551 | Miller | Jan 2003 | B1 |
| 6530075 | Beadle et al. | Mar 2003 | B1 |
| 6538651 | Hayman et al. | Mar 2003 | B1 |
| 6546402 | Beyer et al. | Apr 2003 | B1 |
| 6553375 | Huang et al. | Apr 2003 | B1 |
| 6584474 | Pereira | Jun 2003 | B1 |
| 6604104 | Smith | Aug 2003 | B1 |
| 6618720 | Au et al. | Sep 2003 | B1 |
| 6631374 | Klein et al. | Oct 2003 | B1 |
| 6640234 | Coffen et al. | Oct 2003 | B1 |
| 6697880 | Dougherty | Feb 2004 | B1 |
| 6701415 | Hendren | Mar 2004 | B1 |
| 6714962 | Helland et al. | Mar 2004 | B1 |
| 6725243 | Snapp | Apr 2004 | B2 |
| 6732100 | Brodersen et al. | May 2004 | B1 |
| 6745332 | Wong et al. | Jun 2004 | B1 |
| 6748374 | Madan et al. | Jun 2004 | B1 |
| 6748455 | Hinson et al. | Jun 2004 | B1 |
| 6760719 | Hanson et al. | Jul 2004 | B1 |
| 6775660 | Lin et al. | Aug 2004 | B2 |
| 6785668 | Polo et al. | Aug 2004 | B1 |
| 6795851 | Noy | Sep 2004 | B1 |
| 6816855 | Hartel et al. | Nov 2004 | B2 |
| 6820082 | Cook et al. | Nov 2004 | B1 |
| 6829620 | Michael et al. | Dec 2004 | B2 |
| 6832229 | Reed | Dec 2004 | B2 |
| 6851088 | Conner et al. | Feb 2005 | B1 |
| 6882994 | Yoshimura et al. | Apr 2005 | B2 |
| 6925472 | Kong | Aug 2005 | B2 |
| 6934717 | James | Aug 2005 | B1 |
| 6947928 | Dettinger et al. | Sep 2005 | B2 |
| 6983291 | Cochrane et al. | Jan 2006 | B1 |
| 6985895 | Witkowski et al. | Jan 2006 | B2 |
| 6985899 | Chan et al. | Jan 2006 | B2 |
| 6985904 | Kaluskar et al. | Jan 2006 | B1 |
| 7020649 | Cochrane et al. | Mar 2006 | B2 |
| 7024414 | Sah et al. | Apr 2006 | B2 |
| 7031962 | Moses | Apr 2006 | B2 |
| 7058657 | Berno | Jun 2006 | B1 |
| 7089228 | Arnold et al. | Aug 2006 | B2 |
| 7089245 | George et al. | Aug 2006 | B1 |
| 7096216 | Anonsen | Aug 2006 | B2 |
| 7099927 | Cudd et al. | Aug 2006 | B2 |
| 7103608 | Ozbutun et al. | Sep 2006 | B1 |
| 7110997 | Turkel et al. | Sep 2006 | B1 |
| 7127462 | Hiraga et al. | Oct 2006 | B2 |
| 7146357 | Suzuki et al. | Dec 2006 | B2 |
| 7149742 | Eastham et al. | Dec 2006 | B1 |
| 7167870 | Avvari et al. | Jan 2007 | B2 |
| 7171469 | Ackaouy et al. | Jan 2007 | B2 |
| 7174341 | Ghukasyan et al. | Feb 2007 | B2 |
| 7181686 | Bahrs | Feb 2007 | B1 |
| 7188105 | Dettinger et al. | Mar 2007 | B2 |
| 7200620 | Gupta | Apr 2007 | B2 |
| 7216115 | Walters et al. | May 2007 | B1 |
| 7216116 | Nilsson et al. | May 2007 | B1 |
| 7219302 | O'Shaughnessy et al. | May 2007 | B1 |
| 7225189 | McCormack et al. | May 2007 | B1 |
| 7254808 | Trappen et al. | Aug 2007 | B2 |
| 7257689 | Baird | Aug 2007 | B1 |
| 7272605 | Hinshaw et al. | Sep 2007 | B1 |
| 7308580 | Nelson et al. | Dec 2007 | B2 |
| 7316003 | Dulepet et al. | Jan 2008 | B1 |
| 7330969 | Harrison et al. | Feb 2008 | B2 |
| 7333941 | Choi | Feb 2008 | B1 |
| 7343585 | Lau et al. | Mar 2008 | B1 |
| 7350237 | Vogel | Mar 2008 | B2 |
| 7380242 | Alaluf | May 2008 | B2 |
| 7401088 | Chintakayala et al. | Jul 2008 | B2 |
| 7426521 | Harter | Sep 2008 | B2 |
| 7430549 | Zane et al. | Sep 2008 | B2 |
| 7433863 | Zane et al. | Oct 2008 | B2 |
| 7447865 | Uppala et al. | Nov 2008 | B2 |
| 7478094 | Ho et al. | Jan 2009 | B2 |
| 7484096 | Garg et al. | Jan 2009 | B1 |
| 7493311 | Cutsinger et al. | Feb 2009 | B1 |
| 7506055 | McClain et al. | Mar 2009 | B2 |
| 7529734 | Dirisala | May 2009 | B2 |
| 7529750 | Bair | May 2009 | B2 |
| 7542958 | Warren et al. | Jun 2009 | B1 |
| 7552223 | Ackaouy et al. | Jun 2009 | B1 |
| 7610351 | Gollapudi et al. | Oct 2009 | B1 |
| 7620687 | Chen et al. | Nov 2009 | B2 |
| 7624126 | Pizzo et al. | Nov 2009 | B2 |
| 7627603 | Rosenblum et al. | Dec 2009 | B2 |
| 7661141 | Dutta et al. | Feb 2010 | B2 |
| 7664778 | Yagoub et al. | Feb 2010 | B2 |
| 7672275 | Yajnik et al. | Mar 2010 | B2 |
| 7680782 | Chen et al. | Mar 2010 | B2 |
| 7711716 | Stonecipher | May 2010 | B2 |
| 7711740 | Minore et al. | May 2010 | B2 |
| 7747640 | Dettinger et al. | Jun 2010 | B2 |
| 7761444 | Zhang et al. | Jul 2010 | B2 |
| 7797356 | Iyer et al. | Sep 2010 | B2 |
| 7827204 | Heinzel et al. | Nov 2010 | B2 |
| 7827403 | Wong et al. | Nov 2010 | B2 |
| 7827523 | Ahmed et al. | Nov 2010 | B2 |
| 7882121 | Bruno et al. | Feb 2011 | B2 |
| 7882132 | Ghatare | Feb 2011 | B2 |
| 7904487 | Ghatare | Mar 2011 | B2 |
| 7908259 | Branscome et al. | Mar 2011 | B2 |
| 7908266 | Zeringue et al. | Mar 2011 | B2 |
| 7930412 | Yeap et al. | Apr 2011 | B2 |
| 7966311 | Haase | Jun 2011 | B2 |
| 7966312 | Nolan et al. | Jun 2011 | B2 |
| 7966343 | Yang et al. | Jun 2011 | B2 |
| 7970777 | Saxena et al. | Jun 2011 | B2 |
| 7979431 | Qazi et al. | Jul 2011 | B2 |
| 7984043 | Waas | Jul 2011 | B1 |
| 8019795 | Anderson et al. | Sep 2011 | B2 |
| 8027293 | Spaur et al. | Sep 2011 | B2 |
| 8032525 | Bowers et al. | Oct 2011 | B2 |
| 8037542 | Taylor et al. | Oct 2011 | B2 |
| 8046394 | Shatdal | Oct 2011 | B1 |
| 8046749 | Owen et al. | Oct 2011 | B1 |
| 8055672 | Djugash et al. | Nov 2011 | B2 |
| 8060484 | Bandera et al. | Nov 2011 | B2 |
| 8171018 | Zane et al. | May 2012 | B2 |
| 8180789 | Wasserman et al. | May 2012 | B1 |
| 8196121 | Peshansky et al. | Jun 2012 | B2 |
| 8209356 | Roesler | Jun 2012 | B1 |
| 8286189 | Kukreja et al. | Oct 2012 | B2 |
| 8321833 | Langworthy et al. | Nov 2012 | B2 |
| 8332435 | Ballard et al. | Dec 2012 | B2 |
| 8359305 | Burke et al. | Jan 2013 | B1 |
| 8375127 | Lita | Feb 2013 | B1 |
| 8380757 | Bailey et al. | Feb 2013 | B1 |
| 8418142 | Ao et al. | Apr 2013 | B2 |
| 8433701 | Sargeant et al. | Apr 2013 | B2 |
| 8458218 | Wildermuth | Jun 2013 | B2 |
| 8473897 | Box et al. | Jun 2013 | B2 |
| 8478713 | Cotner et al. | Jul 2013 | B2 |
| 8515942 | Marum et al. | Aug 2013 | B2 |
| 8543620 | Ching | Sep 2013 | B2 |
| 8553028 | Urbach | Oct 2013 | B1 |
| 8555263 | Allen et al. | Oct 2013 | B2 |
| 8560502 | Vora | Oct 2013 | B2 |
| 8595151 | Hao et al. | Nov 2013 | B2 |
| 8601016 | Briggs et al. | Dec 2013 | B2 |
| 8631034 | Peloski | Jan 2014 | B1 |
| 8650182 | Murthy | Feb 2014 | B2 |
| 8660869 | MacIntyre et al. | Feb 2014 | B2 |
| 8676863 | Connell et al. | Mar 2014 | B1 |
| 8683488 | Kukreja et al. | Mar 2014 | B2 |
| 8713518 | Pointer et al. | Apr 2014 | B2 |
| 8719252 | Miranker et al. | May 2014 | B2 |
| 8725707 | Chen et al. | May 2014 | B2 |
| 8726254 | Rohde et al. | May 2014 | B2 |
| 8745014 | Travis | Jun 2014 | B2 |
| 8745510 | D'Alo′ et al. | Jun 2014 | B2 |
| 8751823 | Myles et al. | Jun 2014 | B2 |
| 8768961 | Krishnamurthy | Jul 2014 | B2 |
| 8788254 | Peloski | Jul 2014 | B2 |
| 8793243 | Weyerhaeuser et al. | Jul 2014 | B2 |
| 8805947 | Kuzkin et al. | Aug 2014 | B1 |
| 8806133 | Hay et al. | Aug 2014 | B2 |
| 8812625 | Chitilian et al. | Aug 2014 | B1 |
| 8838656 | Cheriton | Sep 2014 | B1 |
| 8855999 | Elliot | Oct 2014 | B1 |
| 8863156 | Lepanto et al. | Oct 2014 | B1 |
| 8874512 | Jin et al. | Oct 2014 | B2 |
| 8880569 | Draper et al. | Nov 2014 | B2 |
| 8880787 | Kimmel et al. | Nov 2014 | B1 |
| 8881121 | Ali | Nov 2014 | B2 |
| 8886631 | Abadi et al. | Nov 2014 | B2 |
| 8903717 | Elliot | Dec 2014 | B2 |
| 8903842 | Bloesch et al. | Dec 2014 | B2 |
| 8922579 | Mi et al. | Dec 2014 | B2 |
| 8924384 | Driesen et al. | Dec 2014 | B2 |
| 8930892 | Pointer et al. | Jan 2015 | B2 |
| 8954418 | Faerber et al. | Feb 2015 | B2 |
| 8959495 | Chafi et al. | Feb 2015 | B2 |
| 8996864 | Maigne et al. | Mar 2015 | B2 |
| 9031930 | Valentin | May 2015 | B2 |
| 9077611 | Cordray et al. | Jul 2015 | B2 |
| 9122765 | Chen | Sep 2015 | B1 |
| 9195712 | Freedman et al. | Nov 2015 | B2 |
| 9298768 | Varakin et al. | Mar 2016 | B2 |
| 9311357 | Ramesh et al. | Apr 2016 | B2 |
| 9372671 | Balan et al. | Jun 2016 | B2 |
| 9384184 | Cervantes et al. | Jul 2016 | B2 |
| 9612959 | Caudy et al. | Apr 2017 | B2 |
| 9613018 | Zeldis et al. | Apr 2017 | B2 |
| 9613109 | Wright et al. | Apr 2017 | B2 |
| 9619210 | Kent et al. | Apr 2017 | B2 |
| 9633060 | Caudy et al. | Apr 2017 | B2 |
| 9639570 | Wright et al. | May 2017 | B2 |
| 9672238 | Wright et al. | Jun 2017 | B2 |
| 9679006 | Wright et al. | Jun 2017 | B2 |
| 9690821 | Wright et al. | Jun 2017 | B2 |
| 9710511 | Wright et al. | Jul 2017 | B2 |
| 9760591 | Caudy et al. | Sep 2017 | B2 |
| 9805084 | Wright et al. | Oct 2017 | B2 |
| 9832068 | McSherry et al. | Nov 2017 | B2 |
| 9836494 | Caudy et al. | Dec 2017 | B2 |
| 9836495 | Wright | Dec 2017 | B2 |
| 9886469 | Kent et al. | Feb 2018 | B2 |
| 9898496 | Caudy et al. | Feb 2018 | B2 |
| 9934266 | Wright et al. | Apr 2018 | B2 |
| 10002153 | Teodorescu et al. | Jun 2018 | B2 |
| 10002154 | Kent et al. | Jun 2018 | B1 |
| 10002155 | Caudy et al. | Jun 2018 | B1 |
| 10003673 | Caudy et al. | Jun 2018 | B2 |
| 10019138 | Zeldis et al. | Jul 2018 | B2 |
| 10069943 | Teodorescu et al. | Sep 2018 | B2 |
| 20020002576 | Wollrath et al. | Jan 2002 | A1 |
| 20020007331 | Lo et al. | Jan 2002 | A1 |
| 20020054587 | Baker et al. | May 2002 | A1 |
| 20020065981 | Jenne et al. | May 2002 | A1 |
| 20020129168 | Kanai et al. | Sep 2002 | A1 |
| 20020156722 | Greenwood | Oct 2002 | A1 |
| 20030004952 | Nixon et al. | Jan 2003 | A1 |
| 20030061216 | Moses | Mar 2003 | A1 |
| 20030074400 | Brooks et al. | Apr 2003 | A1 |
| 20030110416 | Morrison et al. | Jun 2003 | A1 |
| 20030167261 | Grust et al. | Sep 2003 | A1 |
| 20030182261 | Patterson | Sep 2003 | A1 |
| 20030208484 | Chang et al. | Nov 2003 | A1 |
| 20030208505 | Mullins et al. | Nov 2003 | A1 |
| 20030233632 | Aigen et al. | Dec 2003 | A1 |
| 20040002961 | Dettinger et al. | Jan 2004 | A1 |
| 20040076155 | Yajnik et al. | Apr 2004 | A1 |
| 20040111492 | Nakahara et al. | Jun 2004 | A1 |
| 20040148630 | Choi | Jul 2004 | A1 |
| 20040186813 | Tedesco et al. | Sep 2004 | A1 |
| 20040216150 | Scheifler et al. | Oct 2004 | A1 |
| 20040220923 | Nica | Nov 2004 | A1 |
| 20040254876 | Coval et al. | Dec 2004 | A1 |
| 20050015490 | Saare et al. | Jan 2005 | A1 |
| 20050060693 | Robison et al. | Mar 2005 | A1 |
| 20050097447 | Serra et al. | May 2005 | A1 |
| 20050102284 | Srinivasan et al. | May 2005 | A1 |
| 20050102636 | McKeon et al. | May 2005 | A1 |
| 20050131893 | Glan | Jun 2005 | A1 |
| 20050132384 | Morrison et al. | Jun 2005 | A1 |
| 20050138624 | Morrison et al. | Jun 2005 | A1 |
| 20050165866 | Bohannon et al. | Jul 2005 | A1 |
| 20050198001 | Cunningham et al. | Sep 2005 | A1 |
| 20060059253 | Goodman et al. | Mar 2006 | A1 |
| 20060074901 | Pirahesh et al. | Apr 2006 | A1 |
| 20060085490 | Baron et al. | Apr 2006 | A1 |
| 20060100989 | Chinchwadkar et al. | May 2006 | A1 |
| 20060101019 | Nelson et al. | May 2006 | A1 |
| 20060116983 | Dettinger et al. | Jun 2006 | A1 |
| 20060116999 | Dettinger et al. | Jun 2006 | A1 |
| 20060136361 | Peri et al. | Jun 2006 | A1 |
| 20060173693 | Arazi et al. | Aug 2006 | A1 |
| 20060195460 | Nori et al. | Aug 2006 | A1 |
| 20060212847 | Tarditi et al. | Sep 2006 | A1 |
| 20060218123 | Chowdhuri et al. | Sep 2006 | A1 |
| 20060218200 | Factor et al. | Sep 2006 | A1 |
| 20060230016 | Cunningham et al. | Oct 2006 | A1 |
| 20060253311 | Yin et al. | Nov 2006 | A1 |
| 20060271510 | Harward et al. | Nov 2006 | A1 |
| 20060277162 | Smith | Dec 2006 | A1 |
| 20070011211 | Reeves et al. | Jan 2007 | A1 |
| 20070027884 | Heger et al. | Feb 2007 | A1 |
| 20070033518 | Kenna et al. | Feb 2007 | A1 |
| 20070073765 | Chen | Mar 2007 | A1 |
| 20070101252 | Chamberlain et al. | May 2007 | A1 |
| 20070116287 | Rasizade et al. | May 2007 | A1 |
| 20070169003 | Branda et al. | Jul 2007 | A1 |
| 20070256060 | Ryu et al. | Nov 2007 | A1 |
| 20070258508 | Werb et al. | Nov 2007 | A1 |
| 20070271280 | Chandasekaran | Nov 2007 | A1 |
| 20070299822 | Jopp et al. | Dec 2007 | A1 |
| 20080022136 | Mattsson et al. | Jan 2008 | A1 |
| 20080033907 | Woehler et al. | Feb 2008 | A1 |
| 20080034084 | Pandya | Feb 2008 | A1 |
| 20080046804 | Rui et al. | Feb 2008 | A1 |
| 20080072150 | Chan et al. | Mar 2008 | A1 |
| 20080120283 | Liu et al. | May 2008 | A1 |
| 20080155565 | Poduri | Jun 2008 | A1 |
| 20080168135 | Redlich et al. | Jul 2008 | A1 |
| 20080235238 | Jalobeanu et al. | Sep 2008 | A1 |
| 20080263179 | Buttner et al. | Oct 2008 | A1 |
| 20080276241 | Bajpai et al. | Nov 2008 | A1 |
| 20080319951 | Ueno et al. | Dec 2008 | A1 |
| 20090019029 | Tommaney et al. | Jan 2009 | A1 |
| 20090022095 | Spaur et al. | Jan 2009 | A1 |
| 20090024615 | Pedro et al. | Jan 2009 | A1 |
| 20090037391 | Agrawal et al. | Feb 2009 | A1 |
| 20090055370 | Dagum et al. | Feb 2009 | A1 |
| 20090083215 | Burger | Mar 2009 | A1 |
| 20090089312 | Chi et al. | Apr 2009 | A1 |
| 20090248902 | Blue | Oct 2009 | A1 |
| 20090254516 | Meiyyappan et al. | Oct 2009 | A1 |
| 20090271472 | Scheifler et al. | Oct 2009 | A1 |
| 20090300770 | Rowney et al. | Dec 2009 | A1 |
| 20090319058 | Rovaglio et al. | Dec 2009 | A1 |
| 20090319484 | Golbandi et al. | Dec 2009 | A1 |
| 20090327242 | Brown et al. | Dec 2009 | A1 |
| 20100036801 | Pirvali et al. | Feb 2010 | A1 |
| 20100042587 | Johnson et al. | Feb 2010 | A1 |
| 20100047760 | Best et al. | Feb 2010 | A1 |
| 20100049715 | Jacobsen et al. | Feb 2010 | A1 |
| 20100161555 | Nica et al. | Jun 2010 | A1 |
| 20100186082 | Ladki et al. | Jul 2010 | A1 |
| 20100199161 | Aureglia et al. | Aug 2010 | A1 |
| 20100205017 | Sichelman et al. | Aug 2010 | A1 |
| 20100205351 | Wiener et al. | Aug 2010 | A1 |
| 20100281005 | Carlin et al. | Nov 2010 | A1 |
| 20100281071 | Ben-Zvi et al. | Nov 2010 | A1 |
| 20110126110 | Vilke et al. | May 2011 | A1 |
| 20110126154 | Boehler et al. | May 2011 | A1 |
| 20110153603 | Adiba et al. | Jun 2011 | A1 |
| 20110161378 | Williamson | Jun 2011 | A1 |
| 20110167020 | Yang et al. | Jul 2011 | A1 |
| 20110178984 | Talius et al. | Jul 2011 | A1 |
| 20110194563 | Shen et al. | Aug 2011 | A1 |
| 20110219020 | Oks et al. | Sep 2011 | A1 |
| 20110314019 | Peris | Dec 2011 | A1 |
| 20120110030 | Pomponio | May 2012 | A1 |
| 20120144234 | Clark et al. | Jun 2012 | A1 |
| 20120159303 | Friedrich et al. | Jun 2012 | A1 |
| 20120191446 | Binsztok et al. | Jul 2012 | A1 |
| 20120192096 | Bowman et al. | Jul 2012 | A1 |
| 20120197868 | Fauser et al. | Aug 2012 | A1 |
| 20120209886 | Henderson | Aug 2012 | A1 |
| 20120215741 | Poole et al. | Aug 2012 | A1 |
| 20120221528 | Renkes | Aug 2012 | A1 |
| 20120246052 | Taylor et al. | Sep 2012 | A1 |
| 20120254143 | Varma et al. | Oct 2012 | A1 |
| 20120259759 | Crist et al. | Oct 2012 | A1 |
| 20120296846 | Teeter | Nov 2012 | A1 |
| 20130041946 | Joel et al. | Feb 2013 | A1 |
| 20130080514 | Gupta et al. | Mar 2013 | A1 |
| 20130086107 | Genochio et al. | Apr 2013 | A1 |
| 20130166556 | Baeumges et al. | Jun 2013 | A1 |
| 20130173667 | Soderberg et al. | Jul 2013 | A1 |
| 20130179460 | Cervantes et al. | Jul 2013 | A1 |
| 20130185619 | Ludwig | Jul 2013 | A1 |
| 20130191370 | Chen et al. | Jul 2013 | A1 |
| 20130198232 | Shamgunov et al. | Aug 2013 | A1 |
| 20130226959 | Dittrich et al. | Aug 2013 | A1 |
| 20130246560 | Feng et al. | Sep 2013 | A1 |
| 20130263123 | Zhou et al. | Oct 2013 | A1 |
| 20130290243 | Hazel et al. | Oct 2013 | A1 |
| 20130304725 | Nee et al. | Nov 2013 | A1 |
| 20130304744 | McSherry et al. | Nov 2013 | A1 |
| 20130311352 | Kayanuma et al. | Nov 2013 | A1 |
| 20130311488 | Erdogan et al. | Nov 2013 | A1 |
| 20130318129 | Vingralek et al. | Nov 2013 | A1 |
| 20130346365 | Kan et al. | Dec 2013 | A1 |
| 20140019494 | Tang | Jan 2014 | A1 |
| 20140040203 | Lu et al. | Feb 2014 | A1 |
| 20140059646 | Hannel et al. | Feb 2014 | A1 |
| 20140082724 | Pearson et al. | Mar 2014 | A1 |
| 20140136521 | Pappas | May 2014 | A1 |
| 20140143123 | Banke et al. | May 2014 | A1 |
| 20140149997 | Kukreja et al. | May 2014 | A1 |
| 20140156618 | Castellano | Jun 2014 | A1 |
| 20140173023 | Varney et al. | Jun 2014 | A1 |
| 20140181036 | Dhamankar et al. | Jun 2014 | A1 |
| 20140181081 | Veldhuizen | Jun 2014 | A1 |
| 20140188924 | Ma et al. | Jul 2014 | A1 |
| 20140195558 | Murthy et al. | Jul 2014 | A1 |
| 20140201194 | Reddy et al. | Jul 2014 | A1 |
| 20140215446 | Araya et al. | Jul 2014 | A1 |
| 20140222768 | Rambo et al. | Aug 2014 | A1 |
| 20140229506 | Lee | Aug 2014 | A1 |
| 20140229874 | Strauss | Aug 2014 | A1 |
| 20140244687 | Shmueli et al. | Aug 2014 | A1 |
| 20140279810 | Mann et al. | Sep 2014 | A1 |
| 20140280522 | Watte | Sep 2014 | A1 |
| 20140282227 | Nixon et al. | Sep 2014 | A1 |
| 20140282444 | Araya et al. | Sep 2014 | A1 |
| 20140282540 | Bonnet et al. | Sep 2014 | A1 |
| 20140292765 | Maruyama et al. | Oct 2014 | A1 |
| 20140297611 | Abbour et al. | Oct 2014 | A1 |
| 20140317084 | Chaudhry et al. | Oct 2014 | A1 |
| 20140324821 | Meiyyappan et al. | Oct 2014 | A1 |
| 20140330700 | Studnitzer et al. | Nov 2014 | A1 |
| 20140330807 | Weyerhaeuser et al. | Nov 2014 | A1 |
| 20140344186 | Nadler | Nov 2014 | A1 |
| 20140344391 | Varney et al. | Nov 2014 | A1 |
| 20140359574 | Beckwith et al. | Dec 2014 | A1 |
| 20140372482 | Martin et al. | Dec 2014 | A1 |
| 20140380051 | Edward et al. | Dec 2014 | A1 |
| 20150019516 | Wein et al. | Jan 2015 | A1 |
| 20150026155 | Martin | Jan 2015 | A1 |
| 20150067640 | Booker et al. | Mar 2015 | A1 |
| 20150074066 | Li et al. | Mar 2015 | A1 |
| 20150082218 | Affoneh et al. | Mar 2015 | A1 |
| 20150088894 | Czarlinska et al. | Mar 2015 | A1 |
| 20150095381 | Chen et al. | Apr 2015 | A1 |
| 20150120261 | Giannacopoulos et al. | Apr 2015 | A1 |
| 20150127599 | Schiebeler | May 2015 | A1 |
| 20150154262 | Yang et al. | Jun 2015 | A1 |
| 20150172117 | Dolinsky et al. | Jun 2015 | A1 |
| 20150188778 | Asayag et al. | Jul 2015 | A1 |
| 20150205588 | Bates et al. | Jul 2015 | A1 |
| 20150205589 | Dally | Jul 2015 | A1 |
| 20150254298 | Bourbonnais et al. | Sep 2015 | A1 |
| 20150304182 | Brodsky et al. | Oct 2015 | A1 |
| 20150317359 | Tran et al. | Nov 2015 | A1 |
| 20150356157 | Anderson et al. | Dec 2015 | A1 |
| 20160026442 | Chhaparia | Jan 2016 | A1 |
| 20160065670 | Kimmel et al. | Mar 2016 | A1 |
| 20160092599 | Barsness et al. | Mar 2016 | A1 |
| 20160125018 | Tomoda et al. | May 2016 | A1 |
| 20160171070 | Hrle et al. | Jun 2016 | A1 |
| 20160179754 | Borza et al. | Jun 2016 | A1 |
| 20160253294 | Allen et al. | Sep 2016 | A1 |
| 20160316038 | Jolfaei | Oct 2016 | A1 |
| 20160335281 | Teodorescu et al. | Nov 2016 | A1 |
| 20160335304 | Teodorescu et al. | Nov 2016 | A1 |
| 20160335317 | Teodorescu et al. | Nov 2016 | A1 |
| 20160335323 | Teodorescu et al. | Nov 2016 | A1 |
| 20160335330 | Teodorescu et al. | Nov 2016 | A1 |
| 20160335361 | Teodorescu et al. | Nov 2016 | A1 |
| 20170161514 | Dettinger et al. | Jun 2017 | A1 |
| 20170177677 | Wright et al. | Jun 2017 | A1 |
| 20170185385 | Kent et al. | Jun 2017 | A1 |
| 20170206229 | Caudy et al. | Jul 2017 | A1 |
| 20170206256 | Tsirogiannis et al. | Jul 2017 | A1 |
| 20170235794 | Wright et al. | Aug 2017 | A1 |
| 20170235798 | Wright et al. | Aug 2017 | A1 |
| 20170249350 | Wright et al. | Aug 2017 | A1 |
| 20170270150 | Wright et al. | Sep 2017 | A1 |
| 20170316046 | Caudy et al. | Nov 2017 | A1 |
| 20170359415 | Venkatraman et al. | Dec 2017 | A1 |
| 20180004796 | Kent et al. | Jan 2018 | A1 |
| 20180011891 | Wright et al. | Jan 2018 | A1 |
| 20180052879 | Wright | Feb 2018 | A1 |
| 20180137175 | Teodorescu et al. | May 2018 | A1 |
| Number | Date | Country |
|---|---|---|
| 2309462 | Dec 2000 | CA |
| 1406463 | Apr 2004 | EP |
| 1198769 | Jun 2008 | EP |
| 2199961 | Jun 2010 | EP |
| 2423816 | Feb 2012 | EP |
| 2743839 | Jun 2014 | EP |
| 2421798 | Jun 2011 | RU |
| 2000000879 | Jan 2000 | WO |
| 2001079964 | Oct 2001 | WO |
| 2011120161 | Oct 2011 | WO |
| 2012136627 | Oct 2012 | WO |
| 2014026220 | Feb 2014 | WO |
| 2014143208 | Sep 2014 | WO |
| Entry |
|---|
| “About Entering Commands in the Command Window”, dated Dec. 16, 2015. Retrieved from https://knowledge.autodesk.com/support/autocad/learn-explore/caas/CloudHelp/cloudhelp/2016/ENU/AutoCAD-Core/files/GUID-BB0C3E79-66AF-4557-9140-D31B4CF3C9CF-htm.html (last accessed Jun. 16, 2016). |
| “Change Data Capture”, Oracle Database Online Documentation 11g Release 1 (11.1), dated Apr. 5, 2016. Retreived from https://web.archive.org/web/20160405032625/http://docs.oracle.com/cd/B28359_01/server.111/b28313/cdc.htm. |
| “Chapter 24. Query access plans”, Tuning Database Performance, DB2 Version 9.5 for Linux, UNIX, and Windows, pp. 301-462, dated Dec. 2010. Retreived from http://public.dhe.ibm.com/ps/products/db2/info/vr95/pdf/en_US/DB2PerfTuneTroubleshoot-db2d3e953.pdf. |
| “GNU Emacs Manual”, dated Apr. 15, 2016, pp. 43-47. Retrieved from https://web.archive.org/web/20160415175915/http://www.gnu.org/software/emacs/manual/html_mono/emacs.html. |
| “Google Protocol RPC Library Overview”, dated Apr. 27, 2016. Retrieved from https://cloud.google.com/appengine/docs/python/tools/protorpc/ (last accessed Jun. 16, 2016). |
| “IBM—What is HBase?”, dated Sep. 6, 2015. Retrieved from https://web.archive.org/web/20150906022050/http://www-01.ibm.com/software/data/infosphere/hadoop/hbase/. |
| “IBM Informix TimeSeries data management”, dated Jan. 18, 2016. Retrieved from https://web.archive.org/web/20160118072141/http://www-01.ibm.com/software/data/informix/timeseries/. |
| “IBM InfoSphere BigInsights 3.0.0—Importing data from and exporting data to DB2 by using Sqoop”, dated Jan. 15, 2015. Retrieved from https://web.archive.org/web/20150115034058/http://www-01.ibm.com/support/knowledgecenter/SSPT3X_3.0.0/com.ibm.swg.im.infosphere.biginsights.import.doc/doc/data_warehouse_sqoop.html. |
| “Maximize Data Value with Very Large Database Management by SAP Sybase IQ”, dated 2013. Retrieved from http://www.sap.com/bin/sapcom/en_us/downloadasset.2013-06-jun-11-11.maximize-data-value-with-very-large-database-management-by-sap-sybase-iq-pdf.html. |
| “Microsoft Azure—Managing Access Control Lists (ACLs) for Endpoints by using PowerShell”, dated Nov. 12, 2014. Retrieved from https://web.archive.org/web/20150110170715/http://msdn. microsoft.com/en-us/library/azure/dn376543.aspx. |
| “Oracle Big Data Appliance—Perfect Balance Java API”, dated Sep. 20, 2015. Retrieved from https://web.archive.org/web/20131220040005/http://docs.oracle.com/cd/E41604_01/doc.22/e41667/toc.htm. |
| “Oracle Big Data Appliance—X5-2”, dated Sep. 6, 2015. Retrieved from https://web.archive.org/web/20150906185409/http://www.oracle.com/technetwork/database/bigdata-appliance/overview/bigdataappliance-datasheet-1883358.pdf. |
| “Oracle Big Data Appliance Software User's Guide”, dated Feb. 2015. Retrieved from https://docs.oracle.com/cd/E55905_01/doc.40/e55814.pdf. |
| “SAP HANA Administration Guide”, dated Mar. 29, 2016, pp. 290-294. Retrieved from https://web.archive.org/web/20160417053656/http://help.sap.com/hana/SAP_HANA_Administration_Guide_en.pdf. |
| “Sophia Database—Architecture”, dated Jan. 18, 2016. Retrieved from https://web.archive.org/web/20160118052919/http://sphia.org/architecture.html. |
| “Tracking Data Changes”, SQL Server 2008 R2, dated Sep. 22, 2015. Retreived from https://web.archive.org/web/20150922000614/https://technet.microsoft.com/en-us/library/bb933994(v=sql.105).aspx. |
| “Use Formula AutoComplete”, dated 2010. Retrieved from https://support.office.com/en-us/article/Use-Formula-AutoComplete-c7c46fa6-3a94-4150-a2f7-34140c1ee4d9 (last accessed Jun. 16, 2016). |
| Adelfio et al. “Schema Extraction for Tabular Data on the Web”, Proceedings of the VLDB Endowment, vol. 6, No. 6. Apr. 2013. Retrieved from http://www.cs.umd.edu/˜hjs/pubs/spreadsheets-vldb13.pdf. |
| Borror, Jefferey A. “Q for Mortals 2.0”, dated Nov. 1, 2011. Retreived from http://code.kx.com/wiki/JB:QforMortals2/contents. |
| Cheusheva, Svetlana. “How to change the row color based on a cell's value in Excel”, dated Oct. 29, 2013. Retrieved from https://www.ablebits.com/office-addins-blog/2013/10/29/excel-change-row-background-color/ (last accessed Jun. 16, 2016). |
| Corrected Notice of Allowability dated Mar. 10, 2017, in U.S. Appl. No. 15/154,979. |
| Ex Parte Quayle Action mailed Aug. 8, 2016, in U.S. Appl. No. 15/154,999. |
| Final Office Action dated Dec. 19, 2016, in U.S. Appl. No. 15/154,995. |
| Final Office Action dated Feb. 24, 2017, in U.S. Appl. No. 15/154,993. |
| Final Office Action dated Jan. 27, 2017, in U.S. Appl. No. 15/154,980. |
| Final Office Action dated Jan. 31, 2017, in U.S. Appl. No. 15/154,996. |
| Final Office Action dated Mar. 1, 2017, in U.S. Appl. No. 15/154,975. |
| Final Office Action dated Mar. 13, 2017, in U.S. Appl. No. 15/155,012. |
| Gai, Lei et al. “An Efficient Summary Graph Driven Method for RDF Query Processing”, dated Oct. 27, 2015. Retreived from http://arxiv.org/pdf/1510.07749.pdf. |
| International Search Report and Written Opinion dated Aug. 18, 2016, in International Appln. No. PCT/US2016/032582 filed May 14, 2016. |
| International Search Report and Written Opinion dated Aug. 18, 2016, in International Appln. No. PCT/US2016/032584 filed May 14, 2016. |
| International Search Report and Written Opinion dated Aug. 18, 2016, in International Appln. No. PCT/US2016/032588 filed May 14, 2016. |
| International Search Report and Written Opinion dated Aug. 18, 2016, in International Appln. No. PCT/US2016/032593 filed May 14, 2016. |
| International Search Report and Written Opinion dated Aug. 18, 2016, in International Appln. No. PCT/US2016/032597 filed May 14, 2016. |
| International Search Report and Written Opinion dated Aug. 18, 2016, in International Appln. No. PCT/US2016/032599 filed May 14, 2016. |
| International Search Report and Written Opinion dated Aug. 18, 2016, in International Appln. No. PCT/US2016/032605 filed May 14, 2016. |
| International Search Report and Written Opinion dated Aug. 25, 2016, in International Appln. No. PCT/US2016/032590 filed May 14, 2016. |
| International Search Report and Written Opinion dated Aug. 25, 2016, in International Appln. No. PCT/US2016/032592 filed May 14, 2016. |
| International Search Report and Written Opinion dated Aug. 4, 2016, in International Appln. No. PCT/US2016/032581 filed May 14, 2016. |
| International Search Report and Written Opinion dated Jul. 28, 2016, in International Appln. No. PCT/US2016/032586 filed May 14, 2016. |
| International Search Report and Written Opinion dated Jul. 28, 2016, in International Appln. No. PCT/US2016/032587 filed May 14, 2016. |
| International Search Report and Written Opinion dated Jul. 28, 2016, in International Appln. No. PCT/US2016/032589 filed May 14, 2016. |
| International Search Report and Written Opinion dated Sep. 1, 2016, in International Appln. No. PCT/US2016/032596 filed May 14, 2016. |
| International Search Report and Written Opinion dated Sep. 1, 2016, in International Appln. No. PCT/US2016/032598 filed May 14, 2016. |
| International Search Report and Written Opinion dated Sep. 1, 2016, in International Appln. No. PCT/US2016/032601 filed May 14, 2016. |
| International Search Report and Written Opinion dated Sep. 1, 2016, in International Appln. No. PCT/US2016/032602 filed May 14, 2016. |
| International Search Report and Written Opinion dated Sep. 1, 2016, in International Appln. No. PCT/US2016/032607 filed May 14, 2016. |
| International Search Report and Written Opinion dated Sep. 15, 2016, in International Appln. No. PCT/US2016/032591 filed May 14, 2016. |
| International Search Report and Written Opinion dated Sep. 15, 2016, in International Appln. No. PCT/US2016/032594 filed May 14, 2016. |
| International Search Report and Written Opinion dated Sep. 15, 2016, in International Appln. No. PCT/US2016/032600 filed May 14, 2016. |
| International Search Report and Written Opinion dated Sep. 29, 2016, in International Appln. No. PCT/US2016/032595 filed May 14, 2016. |
| International Search Report and Written Opinion dated Sep. 29, 2016, in International Appln. No. PCT/US2016/032606 filed May 14, 2016. |
| International Search Report and Written Opinion dated Sep. 8, 2016, in International Appln. No. PCT/US2016/032603 filed May 14, 2016. |
| International Search Report and Written Opinion dated Sep. 8, 2016, in International Appln. No. PCT/US2016/032604 filed May 14, 2016. |
| Jellema, Lucas. “Implementing Cell Highlighting in JSF-based Rich Enterprise Apps (Part 1)”, dated Nov. 2008. Retrieved from http://www.oracle.com/technetwork/articles/adf/jellema-adfcellhighlighting-087850.html (last accessed Jun. 16, 2016). |
| Lou, Yuan. “A Multi-Agent Decision Support System for Stock Trading”, IEEE Network, Jan./Feb. 2002. Retreived from http://www.reading.ac.uk/AcaDepts/si/sisweb13/ais/papers/journal12-A%20multi-agent%20Framework.pdf. |
| Mallet, “Relational Database Support for Spatio-Temporal Data”, Technical Report TR 04-21, Sep. 2004, University of Alberta, Department of Computing Science. |
| Mariyappan, Balakrishnan. “10 Useful Linux Bash_Completion Complete Command Examples (Bash Command Line Completion on Steroids)”, dated Dec. 2, 2013. Retrieved from http://www.thegeekstuff.com/2013/12/bash-completion-complete/ (last accessed Jun. 16, 2016). |
| Murray, Derek G. et al. “Naiad: a timely dataflow system.” SOSP '13 Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles. pp. 439-455. Nov. 2013. |
| Non-final Office Action dated Aug. 12, 2016, in U.S. Appl. No. 15/155,001. |
| Non-final Office Action dated Aug. 16, 2016, in U.S. Appl. No. 15/154,993. |
| Non-final Office Action dated Aug. 19, 2016, in U.S. Appl. No. 15/154,991. |
| Non-final Office Action dated Aug. 25, 2016, in U.S. Appl. No. 15/154,980. |
| Non-final Office Action dated Aug. 26, 2016, in U.S. Appl. No. 15/154,995. |
| Non-final Office Action dated Aug. 8, 2016, in U.S. Appl. No. 15/154,983. |
| Non-final Office Action dated Aug. 8, 2016, in U.S. Appl. No. 15/154,985. |
| Non-final Office Action dated Feb. 8, 2017, in U.S. Appl. No. 15/154,997. |
| Non-final Office Action dated Mar. 2, 2017, in U.S. Appl. No. 15/154,984. |
| Non-final Office Action dated Nov. 17, 2016, in U.S. Appl. No. 15/154,999. |
| Non-final Office Action dated Oct. 13, 2016, in U.S. Appl. No. 15/155,009. |
| Non-final Office Action dated Oct. 27, 2016, in U.S. Appl. No. 15/155,006. |
| Non-final Office Action dated Oct. 7, 2016, in U.S. Appl. No. 15/154,998. |
| Non-final Office Action dated Sep. 1, 2016, in U.S. Appl. No. 15/154,979. |
| Non-final Office Action dated Sep. 1, 2016, in U.S. Appl. No. 15/155,011. |
| Non-final Office Action dated Sep. 1, 2016, in U.S. Appl. No. 15/155,012. |
| Non-final Office Action dated Sep. 14, 2016, in U.S. Appl. No. 15/154,984. |
| Non-final Office Action dated Sep. 16, 2016, in U.S. Appl. No. 15/154,988. |
| Non-final Office Action dated Sep. 22, 2016, in U.S. Appl. No. 15/154,987. |
| Non-final Office Action dated Sep. 26, 2016, in U.S. Appl. No. 15/155,005. |
| Non-final Office Action dated Sep. 29, 2016, in U.S. Appl. No. 15/154,990. |
| Non-final Office Action dated Sep. 8, 2016, in U.S. Appl. No. 15/154,975. |
| Non-final Office Action dated Sep. 9, 2016, in U.S. Appl. No. 15/154,996. |
| Non-final Office Action dated Sep. 9, 2016, in U.S. Appl. No. 15/155,010. |
| Notice of Allowance dated Dec. 19, 2016, in U.S. Appl. No. 15/155,001. |
| Notice of Allowance dated Dec. 22, 2016, in U.S. Appl. No. 15/155,011. |
| Notice of Allowance dated Dec. 7, 2016, in U.S. Appl. No. 15/154,985. |
| Notice of Allowance dated Feb. 1, 2017, in U.S. Appl. No. 15/154,988. |
| Notice of Allowance dated Feb. 14, 2017, in U.S. Appl. No. 15/154,979. |
| Notice of Allowance dated Feb. 28, 2017, in U.S. Appl. No. 15/154,990. |
| Notice of Allowance dated Jan. 30, 2017, in U.S. Appl. No. 15/154,987. |
| Notice of Allowance dated Mar. 2, 2017, in U.S. Appl. No. 15/154,998. |
| Notice of Allowance dated Nov. 17, 2016, in U.S. Appl. No. 15/154,991. |
| Notice of Allowance dated Nov. 21, 2016, in U.S. Appl. No. 15/154,983. |
| Notice of Allowance dated Nov. 8, 2016, in U.S. Appl. No. 15/155,007. |
| Notice of Allowance dated Oct. 11, 2016, in U.S. Appl. No. 15/155,007. |
| Notice of Allowance dated Oct. 21, 2016, in U.S. Appl. No. 15/154,999. |
| Palpanas, Themistoklis et al. “Incremental Maintenance for Non-Distributive Aggregate Functions”, Proceedings of the 28th VLDB Conference, 2002. Retreived from http://www.vldb.org/conf/2002/S22P04.pdf. |
| PowerShell Team, Intellisense in Windows PowerShell ISE 3.0, dated Jun. 12, 2012, Windows PowerShell Blog, pp. 1-6 Retrieved: https://biogs.msdn.microsoft.com/powershell/2012/06/12/intellisense-in-windows-powershell-ise-3-0/. |
| Smith, Ian. “Guide to Using SQL: Computed and Automatic Columns.” Rdb Jornal, dated Sep. 2008, retrieved Aug. 15, 2016, retrieved from the Internet <URL: http://www.oracle.com/technetwork/products/rdb/automatic-columns-132042.pdf>. |
| Wes McKinney & PyData Development Team. “pandas: powerful Python data analysis toolkit, Release 0.16.1” Dated May 11, 2015. Retrieved from: http://pandas.pydata.org/pandas-docs/version/0.16.1/index.html. |
| Wes McKinney & PyData Development Team. “pandas: powerful Python data analysis toolkit, Release 0.18.1” Dated May 3, 2016. Retrieved from: http://pandas.pydata.org/pandas-docs/version/0.18.1/index.html. |
| Wu, Buwen et al. “Scalable SPARQL Querying using Path Partitioning”, 31st IEEE International Conference on Data Engineering (ICDE 2015), Seoul, Korea, Apr. 13-17, 2015. Retreived from http://imada.sdu.dk/˜zhou/papers/icde2015.pdf. |
| Notice of Allowance dated Jun. 20, 2017, in U.S. Appl. No. 15/154,975. |
| Notice of Allowance dated Mar. 1, 2018, in U.S. Appl. No. 15/464,314. |
| Notice of Allowance dated Mar. 31, 2017, in U.S. Appl. No. 15/154,998. |
| Notice of Allowance dated May 10, 2017, in U.S. Appl. No. 15/154,988. |
| Notice of Allowance dated May 4, 2018, in U.S. Appl. No. 15/897,547. |
| Notice of Allowance dated Nov. 17, 2017, in U.S. Appl. No. 15/154,993. |
| Notice of Allowance dated Oct. 6, 2017, in U.S. Appl. No. 15/610,162. |
| Sobell, Mark G. “A Practical Guide to Linux, Commands, Editors and Shell Programming.” Third Edition, dated Sep. 14, 2012. Retrieved from: http://techbus.safaribooksonline.com/book/operating-systems-and-server-administration/linux/9780133085129. |
| Notice of Allowance dated Sep. 11, 2018, in U.S. Appl. No. 15/608,963. |
| Advisory Action dated Apr. 19, 2017, in U.S. Appl. No. 15/154,999. |
| Advisory Action dated Apr. 20, 2017, in U.S. Appl. No. 15/154,980. |
| Advisory Action dated Apr. 6, 2017, in U.S. Appl. No. 15/154,995. |
| Advisory Action dated Dec. 21, 2017, in U.S. Appl. No. 15/154,984. |
| Advisory Action dated Mar. 31, 2017, in U.S. Appl. No. 15/154,996. |
| Advisory Action dated May 3, 2017, in U.S. Appl. No. 15/154,993. |
| Breitbart, Update Propagation Protocols for Replicated Databases, SIGMOD '99 Philadelphia PA, 1999, pp. 97-108. |
| Corrected Notice of Allowability dated Aug. 9, 2017, in U.S. Appl. No. 15/154,980. |
| Corrected Notice of Allowability dated Jul. 31, 2017, in U.S. Appl. No. 15/154,999. |
| Corrected Notice of Allowability dated Oct. 26, 2017, in U.S. Appl. No. 15/610,162. |
| Decision on Pre-Appeal Conference Request dated Nov. 20, 2017, in U.S. Appl. No. 15/154,997. |
| Final Office Action dated Apr. 10, 2017, in U.S. Appl. No. 15/155,006. |
| Final Office Action dated Aug. 10, 2018, in U.S. Appl. No. 15/796,230. |
| Final Office Action dated Aug. 2, 2018, in U.S. Appl. No. 15/154,996. |
| Final Office Action dated Aug. 28, 2018, in U.S. Appl. No. 15/813,119. |
| Final Office Action dated Dec. 29, 2017, in U.S. Appl. No. 15/154,974. |
| Final Office Action dated Jul. 27, 2017, in U.S. Appl. No. 15/154,993. |
| Final Office Action dated Jun. 18, 2018, in U.S. Appl. No. 15/155,005. |
| Final Office Action dated Jun. 23, 2017, in U.S. Appl. No. 15/154,997. |
| Final Office Action dated Mar. 31, 2017, in U.S. Appl. No. 15/155,005. |
| Final Office Action dated May 15, 2017, in U.S. Appl. No. 15/155,010. |
| Final Office Action dated May 18, 2018, in U.S. Appl. No. 15/654,461. |
| Final Office Action dated May 4, 2017, in U.S. Appl. No. 15/155,009. |
| Kramer, The Combining DAG: A Technique for Parallel Data Flow Analysis, IEEE Transactions on Parallel and Distributed Systems, vol. 5, No. 8, Aug. 1994, pp. 805-813. |
| Non-final Office Action dated Apr. 12, 2018, in U.S. Appl. No. 15/154,997. |
| Non-final Office Action dated Apr. 19, 2017, in U.S. Appl. No. 15/154,974. |
| Non-final Office Action dated Apr. 23, 2018, in U.S. Appl. No. 15/813,127. |
| Non-final Office Action dated Apr. 5, 2018, in U.S. Appl. No. 15/154,984. |
| Non-final Office Action dated Aug. 10, 2018, in U.S. Appl. No. 16/004,578. |
| Non-final Office Action dated Aug. 14, 2017, in U.S. Appl. No. 15/464,314. |
| Non-final Office Action dated Dec. 13, 2017, in U.S. Appl. No. 15/608,963. |
| Non-final Office Action dated Dec. 28, 2017, in U.S. Appl. No. 15/154,996. |
| Non-final Office Action dated Dec. 28, 2017, in U.S. Appl. No. 15/796,230. |
| Non-final Office Action dated Feb. 15, 2018, in U.S. Appl. No. 15/813,112. |
| Non-final Office Action dated Feb. 28, 2018, in U.S. Appl. No. 15/813,119. |
| Non-final Office Action dated Jan. 4, 2018, in U.S. Appl. No. 15/583,777. |
| Non-final Office Action dated Jul. 27, 2017, in U.S. Appl. No. 15/154,995. |
| Non-final Office Action dated Jun. 29, 2018, in U.S. Appl. No. 15/154,974. |
| Non-final Office Action dated Jun. 8, 2018, in U.S. Appl. No. 15/452,574. |
| Non-final Office Action dated Mar. 20, 2018, in U.S. Appl. No. 15/155,006. |
| Non-final Office Action dated Nov. 15, 2017, in U.S. Appl. No. 15/654,461. |
| Non-final Office Action dated Nov. 21, 2017, in U.S. Appl. No. 15/155,005. |
| Non-final Office Action dated Nov. 30, 2017, in U.S. Appl. No. 15/155,012. |
| Non-final Office Action dated Oct. 5, 2017, in U.S. Appl. No. 15/428,145. |
| Notice of Allowance dated Apr. 30, 2018, in U.S. Appl. No. 15/155,012. |
| Notice of Allowance dated Feb. 12, 2018, in U.S. Appl. No. 15/813,142. |
| Notice of Allowance dated Feb. 26, 2018, in U.S. Appl. No. 15/428,145. |
| Notice of Allowance dated Jul. 11, 2018, in U.S. Appl. No. 15/154,995. |
| Notice of Allowance dated Jul. 28, 2017, in U.S. Appl. No. 15/155,009. |
| Notice of Allowance dated Jun. 19, 2017, in U.S. Appl. No. 15/154,980. |
| Number | Date | Country | |
|---|---|---|---|
| 20170192910 A1 | Jul 2017 | US |
| Number | Date | Country | |
|---|---|---|---|
| 62161813 | May 2015 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 15155011 | May 2016 | US |
| Child | 15466836 | US |
