Patent classifications
G06F16/2458
Dynamically normalizing intervals in a table
Dynamically normalizing intervals in a table including receiving, from a client computing system, a request to normalize intervals for a data set on a cloud-based data warehouse, wherein the request comprises a reference to the data set and a data range; generating, on the cloud-based data warehouse, an interval table using the data range; joining, into a joined table on the cloud-based data warehouse, the interval table and the data set; receiving the joined table from the cloud-based data warehouse; and presenting, via a graphical user interface on the client computing system, the joined table as a worksheet.
Leveraging feature engineering to boost placement predictability for seed product selection and recommendation by field
An example computer-implemented method includes receiving a plurality of agricultural data records including yield properties of products grown in fields and raw field features of the fields. The method also includes transforming the raw field features into distinct feature classes that characterize key features affecting yield of the one or more products, and generating, using data from the plurality of agricultural data records and the distinct feature classes, genomic-by-environmental relationships between one or more products, yield properties of the one or more products, and field features associated with the one or more products. Further, the method includes generating, based at least in part on the genomic-by-environmental relationships, predicted yield performance for a set of products associated with one or more target environments, generating product recommendations for the one or more target environments based on the predicted yield performance for the set of products, and providing one or more instructions configured to cause display of the product recommendations.
Incremental addition of data to partitions in database tables
A method and system for accessing updated data from a database in response to a user query has been developed. First, multiple transaction logs are generated for a database. Each transaction log contains a record of actions executed by a database management system and referenced according to the specified date of the actions. Data updates are received and stored with the database. An incremental database partition is created for each data update. Each incremental database partition is stored with reference to a corresponding transaction log for the date of the data update. The updated data is accessed through the incremental database partition in response to an outdated user query. The outdated user query contains a data access request for a date earlier than the receipt of data updates.
Crowdsourced innovation laboratory and process implementation system
A system and method for crowdsourced innovation and automated process implementation, wherein individuals and businesses use a distributed computational graph module with crowdsourcing-technology to develop ideas and create process workflows for implementing those ideas. The developed process workflows are implemented through a system which automatically integrates heterogenous Internet resources such as electronic commerce, recruiting, and management platforms into a single portal. Businesses and other collaboration initiatives are supported via crowdsourced labor that are automatically orchestrated by the distributed computational graph workflows and user interface that provide a comprehensive and convergent solution for process management.
Nested query modification tool
Techniques for modifying queries in a set of nested queries are disclosed. A graphical user interface displays a query detail region alongside a nested query display region. The graphical user interface includes functionality to provide for modification of queries in the nested set of queries. Based on a selection by a user, a query modification tool promotes a query attribute from a child query to one or more parent queries. Based on another selection by a user associated with one query in the set of nested queries, the system deletes an attribute from each query in the set of nested queries. Responsive to a selection to create multiple conditions for a query rule, the system modifies the functionality of the user interface to enable entry of multiple condition characteristics. Based on a further selection, the system creates the multiple conditions for the query rule.
Nested query modification tool
Techniques for modifying queries in a set of nested queries are disclosed. A graphical user interface displays a query detail region alongside a nested query display region. The graphical user interface includes functionality to provide for modification of queries in the nested set of queries. Based on a selection by a user, a query modification tool promotes a query attribute from a child query to one or more parent queries. Based on another selection by a user associated with one query in the set of nested queries, the system deletes an attribute from each query in the set of nested queries. Responsive to a selection to create multiple conditions for a query rule, the system modifies the functionality of the user interface to enable entry of multiple condition characteristics. Based on a further selection, the system creates the multiple conditions for the query rule.
Detecting and mitigating golden ticket attacks within a domain
A system and methods for mitigating golden ticket attacks within a domain is provided, comprising an authentication object inspector configured to observe a new authentication object generated by an identity provider, and retrieve the new authentication object; and a hashing engine configured to retrieve the new authentication object from the authentication object inspector, calculate a cryptographic hash for the new authentication object, and store the cryptographic hash for the new authentication object in a data store; wherein subsequent access requests accompanied by authentication objects are validated by comparing hashes for each authentication object to previous generated hashes.
Join elimination enhancement for real world temporal applications
A database system receives a query and determines that the query includes an inner join between a parent table and a child table. The database system determines that the following relationships exists between the parent table and the child table: referential integrity (“RI”) between a primary key attribute (pk) in the parent table and a foreign key attribute (fk) in the child table and a temporal relationship constraint (“TRC”) between a period attribute in the parent table and a TRC-attribute in the child table. The database system determines that the query satisfies non-temporal join elimination conditions and temporal join elimination conditions and that the query contains no other qualification conditions on the parent table's period attribute and eliminates the inner join when planning execution of the query.
Copying buckets from a remote shared storage system to memory associated with a search node for query execution
Systems and methods are disclosed for processing and executing queries in a data intake and query system. The data intake and query system receives a query identifying a set of data to be processed and a manner of processing the set of data. The data intake and query system identifies buckets that are to be searched and stores a copy of buckets in memory associated with one or more search nodes. A search node performs a search on buckets residing in its memory.
EFFICIENT IN-MEMORY MULTI-VERSION CONCURRENCY CONTROL FOR A TRIE DATA STRUCTURE BASED DATABASE
The invention describes a method for determining a storage location of a database object of a specific version, wherein indexes for each version of the database object are stored in a trie having a root node corresponding to the specific version, the method comprising: determining a trie corresponding to the specific version by accessing the root node of the trie corresponding to the specific version; determining an object identifier of the database object by traversing the trie corresponding to the specific version using a secondary key related to the database object as search key; determining the storage location of the database object by traversing the trie corresponding to the specific version using the determined object identifier as search key.