Query Execution Plan Patents (Class 707/718)
  • Patent number: 11144546
    Abstract: An approach is provided for accessing data in a database. A query which accesses item(s) in the data is received. The query has multiple conditions whose execution produces a final result. Amounts of filtering of portions of the data caused by utilizing different types of indexes to filter the portions are determined. Greatest amounts of filtering for the portions are determined. Types of indexes are selected so that a utilization of a given type of index causes a greatest amount of filtering for a given portion. Data access methods for the portions of data are generated. During runtime, process tasks are generated for the multiple conditions in the query. An execution flow is controlled. The execution flow executes the process tasks by utilizing the data access methods to generate initial results. The final result of the query is generated by combining the initial results from the process tasks.
    Type: Grant
    Filed: February 13, 2020
    Date of Patent: October 12, 2021
    Assignee: International Business Machines Corporation
    Inventors: Shuo Li, Xiaobo Wang, ShengYan Sun, Peng Hui Jiang
  • Patent number: 11138165
    Abstract: A method, a system, and a computer program product for executing a query. A query plan for execution of a query is generated. The query requires access to at least one table stored in a database system. The query includes one or more filter predicates. A filter predicate in the one or more filter predicates is selected. For the selected filter predicate, a plurality of cost function values associated executing a filter evaluation of the selected filter predicate are determined. Filter evaluation of the selected predicate is executed in accordance with at least one determined cost function value in the plurality of cost function values.
    Type: Grant
    Filed: April 4, 2019
    Date of Patent: October 5, 2021
    Assignee: SAP SE
    Inventors: Oliver Horn, Marius Eich
  • Patent number: 11138192
    Abstract: A query referencing an external table function provided by a remote software component is received. Requests to execute the external table function on input data are sent to a proxy service. A first request includes a batch of input rows from the input data. A first response to the first request received from the proxy service includes a first portion of result data and a pagination token. The pagination token indicates that at least a second portion of the result data corresponding to the first batch of input rows is to be obtained from the remote software component. Based on the pagination token, a second request is sent to obtain the second portion of the result data. One or more responses are received from the proxy service that comprise at least the second portion of the result data. The result data is processed according to the query.
    Type: Grant
    Filed: April 30, 2021
    Date of Patent: October 5, 2021
    Assignee: Snowflake Inc.
    Inventors: Srilakshmi Chintala, Istvan Cseri, Albert L. Hu, Isaac Kunen, Nitya Kumar Sharma, Igor Zinkovsky
  • Patent number: 11132365
    Abstract: Disclosed aspects include the database management system detecting that a first data storage medium includes a first set of data of a database. The first data storage medium has a first access-factor. The database management system detects that a second data storage medium includes a second set of data of the database. The second data storage medium has a second access-factor which differs from the first access-factor. Based on a data storage relationship, the database management system determines a query plan to access both the first set of data with respect to the first data storage medium and the second set of data with respect to the second data storage medium. The database management system establishes the query plan.
    Type: Grant
    Filed: March 20, 2016
    Date of Patent: September 28, 2021
    Assignee: International Business Machines Corporation
    Inventors: Eric L. Barsness, Brian R. Muras, John M. Santosuosso
  • Patent number: 11132364
    Abstract: A computing system determines a response to a query. A bin start value and a bin stop value is defined for each bin based on an input bin option. End nodes are split based on the bin start value and the bin stop value of each bin to define a second plurality of end nodes. Each start node of a plurality of start nodes that is connected to each end node of the second plurality of end nodes is identified based on the respective link attributes of a plurality of link attributes. Overlapping start nodes of the plurality of start nodes that overlap at an end node of the second plurality of end nodes are identified based on a predefined overlap query graph that defines a connectivity to identify between a start node and the end node. The identified overlapping start nodes are output as a response to the predefined overlap query graph.
    Type: Grant
    Filed: April 8, 2021
    Date of Patent: September 28, 2021
    Assignee: SAS Institute Inc.
    Inventors: Matthew Victor Galati, Brandon Michael Reese
  • Patent number: 11126623
    Abstract: A database system may receive a query and form a plan for executing the query using a hypothetical index selected based on columns referenced by the query. The database system may compare the hypothetical index to indexes on the computing nodes of the database system. Based on the comparison, the database system may form a new index, based on the hypothetical index, on one of the computing nodes. An additional computing node may be added to the database system for the purpose of maintaining the new index. Subsequent queries having commonality with the first query may be processed on a node maintaining the first index.
    Type: Grant
    Filed: September 28, 2016
    Date of Patent: September 21, 2021
    Assignee: Amazon Technologies, Inc.
    Inventor: Jamie Plenderleith
  • Patent number: 11106674
    Abstract: Techniques for data skipping that may be user defined and extensible may be provided. A method may include receiving a query, at a computer system comprising a processor, memory accessible by the processor, and computer program instructions stored in the memory and executable by the processor, modifying, at the computer system, the received query to utilize at least one data skipping index to evaluate at least one criterion of the query, wherein the at least one data skipping index comprises an index on at least one attribute of data that excludes index information for at least a portion of those data items that do not meet the at least one criterion, and wherein the at least one data skipping index is generated based on information received from an application programming interface, and evaluating, at the computer system, the query.
    Type: Grant
    Filed: March 31, 2019
    Date of Patent: August 31, 2021
    Assignee: International Business Machines Corporation
    Inventors: Guy Khazma, Gal Lushi, Paula Ta-Shma
  • Patent number: 11106665
    Abstract: A computer-implemented automated review method for structured query language (SQL) source code files seeking to access a data store comprises the steps of calculating an SQL complexity score; setting an issue flag if the SQL complexity score is greater than a threshold; checking the SQL source code for SQL-92 compliance; setting the issue flag if any of the SQL source code files is not SQL-92 compliant; comparing a type of data in the SQL source code files to be input to the data store with a type of a field in the data store set to receive the input data; setting the issue flag if the type of any input data does not match the type of a corresponding data store field; checking the SQL source code for SQL triggers set to activate when selected SQL commands are executed; and setting the issue flag if there are any SQL triggers.
    Type: Grant
    Filed: May 6, 2020
    Date of Patent: August 31, 2021
    Assignee: STATE FARM MUTUAL AUTOMOBILE INSURANCE COMPANY
    Inventors: Matthew Anderson, Richard T. Snyder, Daniel George Galvin
  • Patent number: 11100104
    Abstract: A device may identify a query for a database system, wherein the query is a candidate for optimization. The device may determine a first execution plan according to a first hint for executing the query and a second execution plan according to a second hint for executing the query, wherein the first execution plan is associated with a first execution time and the second execution plan is associated with a second execution time. The device may select the first execution plan or the second execution plan as a selected execution plan. The device may generate, based on selecting the selected execution plan, a profile for the query, wherein the profile is based on the selected execution plan. The database system may execute the query according to the profile.
    Type: Grant
    Filed: April 9, 2019
    Date of Patent: August 24, 2021
    Assignee: Accenture Global Solutions Limited
    Inventors: Mihir S Nanal, Vinitha Sunodh, Deepak Jain, Kiran Chaudhari, Junaid M Khan
  • Patent number: 11093496
    Abstract: Performance-based caching may be implemented for query plan caches that are used to provide query plans to perform queries instead of generating query plans to perform queries. Performance metrics for queries performed at a database may be collected and used to cache query plans generated for the queries. When a query is received that matches one of the queries, the cached plan corresponding to the matching query may be used to perform the query.
    Type: Grant
    Filed: November 22, 2017
    Date of Patent: August 17, 2021
    Assignee: Amazon Technologies, Inc.
    Inventors: Sandeep Bhatia, Kanishka Chaturvedi, Maruthi Manohar Reddy Devarenti
  • Patent number: 11093526
    Abstract: A method of processing a query to a graph database using processors. The method comprises providing threads to be executed on processors, each the thread is associated with one of a plurality of unique thread identifiers, providing a graph database having a plurality of graph database nodes and a plurality of graph database edges, each the graph database edge represents a relationship between two of the plurality of graph database nodes, receiving a query tree that defines a tree comprising plurality of query nodes connected by a plurality of query tree edges, and searching at least part of the graph database for a match with the query tree, wherein the searching is executed by the processors, and wherein each processor searches one of a plurality of sub-graphs of the graph database, each the sub-graph is defined by one of the plurality of thread identifiers.
    Type: Grant
    Filed: March 26, 2018
    Date of Patent: August 17, 2021
    Assignee: Technion Research & Development Foundation Limited
    Inventors: Oded Shmueli, Lila Shnaiderman
  • Patent number: 11093492
    Abstract: A system and method for fetching data using an SQL query from the execution of an external code that may be in any language and executed in any environment. The system includes a query engine that can receive a query from a SQL interface and parses the query to the desired format. The system also includes a protocol server that can trigger a code executor to execute an external code based on the query and transmits the data returned by the external code to the query engine. The query engine can process the data to an SQL understandable format and present the processed data on the SQL interface.
    Type: Grant
    Filed: April 9, 2021
    Date of Patent: August 17, 2021
    Inventor: Ravishankar Narayanan Nair
  • Patent number: 11074252
    Abstract: An analysis system connects to a set of data sources and perform natural language questions based on the data sources. The analysis system connects with the data sources and retrieves metadata describing data assets stored in each data source. The analysis system generates an execution plan for the natural language question. The analysis system finds data assets that match the received question based on the metadata. The analysis system ranks the data assets and presents the ranked data assets to users for allowing users to modify the execution plan. The analysis system may use execution plans of previously stored questions for executing new questions. The analysis system supports selective preprocessing of data to increase the data quality.
    Type: Grant
    Filed: March 20, 2020
    Date of Patent: July 27, 2021
    Assignee: Promethium, Inc.
    Inventor: Kaycee Lai
  • Patent number: 11074265
    Abstract: Methods, computer program products, and systems are presented. The method, computer program products, and systems can include, for instance: initiating evaluating of a tree data structure expression having nodes and edges between the nodes, wherein a plurality of nodes of the tree data structure expression express functions, and wherein a hierarchy of the tree data structure expression defines an order of execution of functions expressed by nodes of the plurality of nodes; and in response to the initiating, reading, processing and writing tile data of a dataset according to node expressed functions of the tree data structure expression.
    Type: Grant
    Filed: April 2, 2018
    Date of Patent: July 27, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Samuel R. Baskinger, Chad Johnson
  • Patent number: 11068484
    Abstract: Disclosed herein are system, method, and computer program product embodiments for accelerating queries with zone map enhancements. An embodiment operates by receiving a query including a condition on one or more values from a column of a database table. It is determined that the values from the column are divided into a plurality of data zones, and that a sorted dictionary includes an ordered arrangement of the values from the column. A min value and a max value from a satisfaction array that indicates which values satisfy the condition are determined. Which of the data zones are disqualified are determined based on the values of the disqualified data zone falls outside of the range between the minimum value and the maximum value. The values of any remaining zones are evaluated to determine a result of the query. The result set is returned.
    Type: Grant
    Filed: April 26, 2019
    Date of Patent: July 20, 2021
    Assignee: SAP SE
    Inventors: Steven Kirk, Roland McKenney
  • Patent number: 11061898
    Abstract: A system includes reception of a database query, determination of a first logical query execution plan to execute the database query, determination of a second logical query execution plan to execute the database query, determination of a first plurality of resource usage estimates associated with the first logical query execution plan, determination of a second plurality of resource usage estimates associated with the second logical query execution plan, and determination, based on the first plurality of resource usage estimates and the second plurality of resource usage estimates, whether it is determinable to a suitable degree of certainty that one of the first logical query execution plan and the second logical query execution plan will be associated with a smaller amount of resource usage than the other one of the first logical query execution plan and the second logical query execution plan.
    Type: Grant
    Filed: September 15, 2016
    Date of Patent: July 13, 2021
    Assignee: SAP SE
    Inventor: Sangyong Hwang
  • Patent number: 11061907
    Abstract: If a query indicates joining of N (N is an integer of no less than 3) relation tables, a database management system calculates a query cost that is based on a power consumption amount for query execution, for each of a first query plan candidate in which a temporary table is generated and the temporary table is stored in a storage device unit with a first access cost, a second query plan candidate in which a temporary table is generated and the temporary table is stored in a storage device unit with a second access cost that is higher than the first access cost and a third query plan candidate in which the N relation tables are joined in a pipelined manner without generation of a temporary table, selects a relatively low-query cost query plan candidate and executes the query based on the query plan candidate.
    Type: Grant
    Filed: February 22, 2019
    Date of Patent: July 13, 2021
    Assignees: HITACHI, LTD., THE UNIVERSITY OF TOKYO
    Inventors: Yuya Isoda, Kazuhiko Mogi, Kouji Kimura, Kazuo Goda, Yuto Hayamizu, Masaru Kitsuregawa
  • Patent number: 11055285
    Abstract: A first query is received by a computing device to access data in a database. A first access path is identified based on optimization information about a second query. The first access path is applied.
    Type: Grant
    Filed: September 8, 2017
    Date of Patent: July 6, 2021
    Assignee: International Business Machines Corporation
    Inventors: Xiaobo Wang, Shuo Li, Xin Peng Liu, ShengYan Sun
  • Patent number: 11055354
    Abstract: Methods, systems, and devices for processing and answering a natural language query at a database server are described. An end user may submit a question in natural language over a communication platform. An answer engine running on the database server may receive the question, and may process the content of the question using natural language processing (NLP) techniques. The answer engine may construct a search query based on the NLP, and may retrieve a set of documents from a database using the search query. The answer engine may rank the documents, prune the number of documents, modify the documents for the given communication platform, or perform any combination of these functions. In some cases, an intermediate user may review the documents, and may select one or more documents for publication. The answer engine may send the selected documents to the end user as answers in response to the question.
    Type: Grant
    Filed: November 3, 2017
    Date of Patent: July 6, 2021
    Assignee: salesforce.com, inc.
    Inventors: Peter Francis White, Michael Micucci, Scott Douglas White, Weiping Peng, Anjan Goswami, Pranav Suresh Shah, Prakash Mallick, Pingping Xiu, Zhenhua Xu
  • Patent number: 11036706
    Abstract: In accordance with embodiments, there are provided mechanisms and methods for performing transparent object migration across storage tiers. In an embodiment and by way of example, a method for appending data to large data volumes is provided. The method embodiment includes a) setting a CustomEntityOption bit that determines (at object creation time) where the object is stored, either in the relational or the non-relational data store portion, b) loading the CustomEntityOption bit in a cached CustomEntityDefinition, c) showing the CustomEntityOption bit as EntityInfo, and d) allowing custom object definition and Metadata API functionality when the bit is shown.
    Type: Grant
    Filed: October 6, 2017
    Date of Patent: June 15, 2021
    Assignee: salesforce.com, inc.
    Inventors: James Taylor, Bill C. Eidson, Kevin Oliver
  • Patent number: 11036736
    Abstract: A method, computing system and computer program product are provided. A nested loop join access plan for a query is executed and processed records of a most outer table of a nested loop join that satisfy local predicates are counted. When a count of the processed records is not less than a threshold value, a cost to complete execution of the nested loop join access plan and a cost of executing a new access plan based on recalculated filter factors for local predicates of the query are compared. When the cost to complete is less, execution of the nested loop join access plan is resumed to complete running of the query. When the cost of executing the new access plan is less, the new access plan is executed to rerun the query. A result of the query is provided.
    Type: Grant
    Filed: March 22, 2017
    Date of Patent: June 15, 2021
    Assignee: International Business Machines Corporation
    Inventors: Zhi Tong Dou, Yue Li, Guang Bao N. Ni, Gang Shen, Jing Jing Xiao, Xin Ying Yang
  • Patent number: 11036740
    Abstract: According to some embodiments, a system to manage a query plan cache for a Database Management System (“DBMS”) includes a DBMS query plan cache data store. The DBMS query plan cache data store may contain, for example, electronic records representing a plurality of query plans each associated with a set of instructions created in response to a query previously submitted by a user. A DBMS query plan cache management platform may then calculate a utility score for each query plan in the DBMS query plan cache data store. At least one query plan may be evicted from the DBMS query plan cache data store based on the calculated utility score, wherein the evicting is not based on a size of the DBMS query plan cache.
    Type: Grant
    Filed: September 11, 2019
    Date of Patent: June 15, 2021
    Assignee: SAP SE
    Inventors: Sung Gun Lee, Sanghee Lee, Hyung Jo Yoon, Boyeong Jeong
  • Patent number: 11036734
    Abstract: Techniques herein generate a query plan that combines a global reporting aggregate calculation and an organizing operation. A method detects an organizing operation, a group aggregate function, and a global aggregate function within a database statement. The organizing operation specifies organizational activities such as grouping, joining, or sorting rows. The method generates an execution plan that specifies calculating all values in a single pass. For each row, the single pass applies the organizing operation and updates an access structure. The pass updates one of multiple cumulative group calculations based on the group aggregate function and updates a cumulative global calculation based on the global aggregate function. Each cumulative group calculation is associated with some of the access structure. Based on the access structure, result rows that satisfy the database statement are generated. Result rows contain a final result of each group calculation and a final result of the global calculation.
    Type: Grant
    Filed: March 8, 2016
    Date of Patent: June 15, 2021
    Assignee: Oracle International Corporation
    Inventor: Srikanth Bellamkonda
  • Patent number: 11023466
    Abstract: A cost based optimizer and a cost estimation method and device. The method includes: in response to deciding that acquired statistical information is incomplete, determining a corresponding cost estimation manner according to an operation type of an operation tree relying on the statistical information (S11); determining a cost estimate of the corresponding operation type based on the cost estimation manner (S12); and determining an accumulative cost estimate of the operation tree according to the cost estimate corresponding to the operation type relying on the statistical information and a cost estimate corresponding to an operation type not relying on the statistical information (S13). Therefore, cost estimation may be performed for a temporary table and a subquery created in a running process, and is not limited by a data scale in a scenario of massive data.
    Type: Grant
    Filed: November 22, 2018
    Date of Patent: June 1, 2021
    Assignee: TRANSWARP TECHNOLOGY (SHANGHAI) CO., LTD.
    Inventors: Li Xia, Zhenqiang Chen
  • Patent number: 10990879
    Abstract: A method includes obtaining a symbolic AI model, where the symbolic AI model is configured to produce an outcome state responsive to an input based on events. The method also includes obtaining a first scenario and a second scenario, where the first scenario causes the failure of a condition associated with a norm of the symbolic AI model and the second scenario satisfies the condition associated with the norm of the symbolic AI model. The method also includes obtaining a failure penalty value, determining a first outcome state based on the symbolic AI model, the first scenario, and the failure penalty value. The method also includes determining a second outcome state based on the symbolic AI model and the second scenario. The method also includes determining an outcome score based on the first outcome state and the second outcome state.
    Type: Grant
    Filed: June 4, 2020
    Date of Patent: April 27, 2021
    Assignee: Digital Asset Capital, Inc.
    Inventor: Edward Hunter
  • Patent number: 10986039
    Abstract: Embodiments are disclosed for a network switch appliance with a traffic broker that facilitates routing of network traffic between pairs of end nodes on a computer network through a configurable sequence of in-line tools.
    Type: Grant
    Filed: November 11, 2015
    Date of Patent: April 20, 2021
    Assignee: Gigamon Inc.
    Inventors: Zbigniew Sufleta, Hung Nguyen
  • Patent number: 10970187
    Abstract: A system and method for generating a data set structured for recognition of time series data by a machine learning computer are provided. The method includes acquiring time series data, generating tensor units based on the time series data, and identifying a target tensor unit including a time of failure of a mainframe computer system. The method further includes generating tensor sets, in which at least one tensor set includes the target tensor unit. The generated tensor sets are then migrated to a machine learning computer for generating or updating of a computer model based on the time series data, the computer model recognizing a data pattern preceding the time of failure of the mainframe computer system. The computer model is then applied to data in a production environment for identifying a production data pattern corresponding to a data pattern recognized in the tensor sets.
    Type: Grant
    Filed: October 30, 2019
    Date of Patent: April 6, 2021
    Assignee: JPMORGAN CHASE BANK, N.A.
    Inventor: Laura Schornack
  • Patent number: 10963445
    Abstract: A data system is provided for analyzing and maintaining data obtained from one or more data sources on which the data system depends. The system includes a primary database including current values used by the system and a collection of executable algorithms used to generate the data maintained in the primary database. In response to receiving a notification regarding a change in one of the data sources, a dependency database is used to establish an execution order for algorithms of the algorithm collection that are directly or indirectly dependent on the changed data. The algorithms identified in the execution order are then executed in accordance with the execution order and the corresponding result is stored in the primary database. The system may include data harvesters adapted to recognize changes in the data sources and to generate and transmit corresponding change notifications when such changes occur.
    Type: Grant
    Filed: November 7, 2019
    Date of Patent: March 30, 2021
    Assignee: Level 3 Communications, LLC
    Inventors: William Gray, Binchao Chen, Steven D. Meyer
  • Patent number: 10963426
    Abstract: A method and system for executing database queries in parallel using a shared metadata store. The metadata store may reside on a master node, and the master node may distribute this metadata with query plans to worker nodes. The worker nodes may request additional metadata from the master node when necessary.
    Type: Grant
    Filed: June 28, 2013
    Date of Patent: March 30, 2021
    Assignee: EMC IP Holding Company LLC
    Inventors: Caleb Welton, Hitoshi Harada, Jeffrey Ira Cohen, Lei Chang, Radhika Reddy, Tao Ma, Zhanwei Wang
  • Patent number: 10949424
    Abstract: Disclosed is a computer-readable medium including a computer program including encoded commands. The computer program is configured to cause one or more processors to perform operations for optimizing a database application when the computer program is executed by the one or more processors of a computer system and the operations include: operation for receiving a query including a bind parameter from an application source; operation for obtaining information related to the bind parameter included in the received query; and operation for rewriting the received query by reflecting the obtained information related to the bind parameter within the received query as hint information.
    Type: Grant
    Filed: July 19, 2017
    Date of Patent: March 16, 2021
    Inventors: Sang Young Park, Cheol Woo Kim, Po Sung Chun
  • Patent number: 10944814
    Abstract: Independent scheduling of resources may be performed for distributed data processing programs. When a request is received that causes the performance of a distributed data processing program, a plan to perform the distributed data processing program may be generated. Different resources may be obtained to perform different portions of the distributed data processing program according to different portions of the generated plan. A result of the request may be provided to a user. In some embodiments, resources obtained for different portions of the distributed data processing program may be returned for use by other programs.
    Type: Grant
    Filed: December 4, 2017
    Date of Patent: March 9, 2021
    Assignee: Amazon Technologies, Inc.
    Inventors: Anthony Virtuoso, Turkay Mert Hocanin
  • Patent number: 10929397
    Abstract: A query is received. Based on statistics for a database, a first query access plan is generated for executing the query on the database. A first result set for the query is obtained by implementing the first query access plan on the database. Based on at least one trend in the statistics, a target time after which implementing the first query access plan will fail a set of criteria is forecasted. In response to the forecasting and based on the statistics, a replacement query access plan is generated prior to the target time. After the target time, a second result set for the query is obtained by implementing the replacement query access plan rather than the first query access plan.
    Type: Grant
    Filed: February 20, 2018
    Date of Patent: February 23, 2021
    Assignee: International Business Machines Corporation
    Inventors: Shawn J. Baranczyk, Rafal P. Konik, Roger A. Mittelstadt, Brian R. Muras
  • Patent number: 10929394
    Abstract: Described are methods, systems and computer readable media for persistent query connection architecture.
    Type: Grant
    Filed: December 10, 2018
    Date of Patent: February 23, 2021
    Assignee: Deephaven Data Labs LLC
    Inventors: David R. Kent, IV, Ryan Caudy, Charles Wright, Nathaniel J. Dorfman, Brian Ries, Radu Teodorescu
  • Patent number: 10929399
    Abstract: Computer-implemented systems and associated operating methods take measurements and landmarks associated with robustness maps and perform tests evaluating the robustness of a database engine's operator implementations and/or query components. The illustrative computer-implemented system comprises logic that receives one or more robustness maps of measured database system performance acquired during database execution in a predetermined range of runtime conditions and uses information from the robustness map or maps to perform regression testing wherein landmarks in the robustness maps are operated upon as a robustness bugs describing conditions under which a predetermined implementation of a database operator or query component degrades in a manner different from a predetermined expected manner.
    Type: Grant
    Filed: February 2, 2009
    Date of Patent: February 23, 2021
    Assignee: Micro Focus LLC
    Inventors: Goetz Graefe, Harumi Kuno, Janet L. Wiener
  • Patent number: 10931518
    Abstract: A system and method for handling queries where the queries and the answers to those queries are transmitted by means of a network which may have significantly variable latencies. The system and method involve copying the queries and calculating a response to each copy of the query and sending each response over the network. The first-received response can then be acted upon. The query may be divided up into sub-queries which are then replicated and sent for determination.
    Type: Grant
    Filed: June 5, 2019
    Date of Patent: February 23, 2021
    Assignee: CSG Systems, Inc.
    Inventors: Matthew Vanden Berg, Christopher E. Lerato
  • Patent number: 10922625
    Abstract: Embodiments of the present invention are directed to facilitating distributed data processing for machine learning. In accordance with aspects of the present disclosure, a set of commands in a query to process at an external computing service is identified. For each command in the set of commands, at least one compute unit including at least one operation to perform at the external computing service is identified. Each of the at least one compute unit associated with each command is analyzed to identify an optimized manner in which to execute the set of commands at the external computing service. An indication of the optimized manner in which to execute the set of commands and a corresponding set of data is provided to the external computing service to utilize for executing the set of commands at the external computing service.
    Type: Grant
    Filed: January 31, 2018
    Date of Patent: February 16, 2021
    Assignee: SPLUNK Inc.
    Inventors: Lin Ma, Jacob Leverich, Adam Oliner, Alex Cruise, Hongyang Zhang
  • Patent number: 10922485
    Abstract: Disclosed herein is a platform for translating various user input into a standardized input used to cause a database to sort data in a specified manner and present the data in a graphic user interface according to user instruction. User input is a text string that includes a first set of characters and a second set of characters split by a dividing symbol. Based on the choice of dividing symbol and the arrangement of the first set of character and second set of characters the system converts the input into a standardized form.
    Type: Grant
    Filed: July 10, 2019
    Date of Patent: February 16, 2021
    Assignee: FinancialForce.com, Inc.
    Inventors: Richard Corfield, Stephen Fry
  • Patent number: 10915525
    Abstract: In an approach for semantically translating data. Aspects of an embodiment of the present invention include an approach for semantically translating data, wherein the approach includes a processor selecting a first node. A processor identifies a parent node of the first node. A processor determines that a value of the first node is unknown. A processor responsive to determining that the value of the first node is unknown, annotates the first node to indicate that the first node is at least partially unknown. A processor identifies a common table expression of the first node. A processor determines that the common table expression of the first node matches, within a predetermined threshold, a common table expression of the second node. A processor merges information from the common table expression of the second node with the common table expression of the first node.
    Type: Grant
    Filed: June 15, 2015
    Date of Patent: February 9, 2021
    Assignee: International Business Machines Corporation
    Inventor: Praveen Devarao
  • Patent number: 10915545
    Abstract: A system displays summaries of relationships of a selected data asset with other data assets at a limited number of levels upstream and downstream from the selected data asset in rows above and below the selected data asset. In each row, data assets are arranged in order of usage, with most used data asset displayed directly above or below the selected data asset. The user views grandparent-level data assets of a parent-level data asset that is directly above the selected data asset. The system includes a carousal feature to further navigate the lineage data upstream or downstream. By selecting a new data asset in the parent row, the user can view grandparent-level data assets of the newly selected data asset. The user can view multiple upstream or downstream levels arranged in respective rows displayed above or below the selected data asset. The system can analyze data from any application.
    Type: Grant
    Filed: December 2, 2016
    Date of Patent: February 9, 2021
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Sandhya Vankamamidi, Jung-Chen Hung, Mark Wade Heninger
  • Patent number: 10885034
    Abstract: A data query method and apparatus, and a database system, where the method includes receiving a data query request, generating an original query plan according to the data query request, obtaining a candidate query plan set according to the original query plan, restructuring a join predicate in the original query plan, determining basic information of a restructured join predicate in the original query plan, determining a constraint condition of the restructured join predicate in the original query plan, determining an equal-cost query plan for the original query plan according to the basic information of the restructured join predicate in the original query plan and the constraint condition of the restructured join predicate in the original query plan, and performing querying according to the equal-cost query plan for the original query plan. Hence, data query performance can be improved.
    Type: Grant
    Filed: May 30, 2018
    Date of Patent: January 5, 2021
    Assignee: HUAWEI TECHNOLOGIES CO., LTD.
    Inventors: Guoping Wang, Junhua Zhu
  • Patent number: 10884982
    Abstract: Systems and methods for performing hash-based mount point lookup in virtual file systems. An example method may include: receiving a first character string representing a file name; identifying, within an array of mount point strings, a second character string comprised by the first character string; identifying a file system object associated with a mount point path represented by the second character string; and utilizing the file system object to access a file referenced by the file name.
    Type: Grant
    Filed: May 21, 2018
    Date of Patent: January 5, 2021
    Assignee: Red Hat, Inc.
    Inventor: Richard Oliveri
  • Patent number: 10885053
    Abstract: A system displays summaries of relationships of a selected data asset with other data assets at a limited number of levels upstream and downstream from the selected data asset in rows above and below the selected data asset. In each row, data assets are arranged in order of usage, with most used data asset displayed directly above or below the selected data asset. The user views grandparent-level data assets of a parent-level data asset that is directly above the selected data asset. The system includes a carousal feature to further navigate the lineage data upstream or downstream. By selecting a new data asset in the parent row, the user can view grandparent-level data assets of the newly selected data asset. The user can view multiple upstream or downstream levels arranged in respective rows displayed above or below the selected data asset. The system can analyze data from any application.
    Type: Grant
    Filed: December 2, 2016
    Date of Patent: January 5, 2021
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Sandhya Vankamamidi, Jung-Chen Hung, Mark Wade Heninger
  • Patent number: 10877971
    Abstract: Techniques for implementing logical queries in a distributed stream processing system using automatic branching and joins. An exemplary technique includes determining a query is a logical query. The logical query includes two or more summaries based on different groups configured to execute in a single query stage of a stream analytics application. The technique further includes converting the logical query into one or more physical queries. The one or more physical queries are separated into individual query stages, and each of the query stages includes a summary from the two or more summaries that is based on an associated group. The technique further includes generating a directed acyclic graph for the one or more physical queries. The directed acyclic graph includes a physical query transformation for each of the individual query stages.
    Type: Grant
    Filed: September 29, 2018
    Date of Patent: December 29, 2020
    Assignee: Oracle International Corporation
    Inventors: Sandeep Bishnoi, Hoyong Park, Iuliia Shmeleva, Vitaly Vitalievich Bychkov, Gyorgy Geiszter, Péter Gordos
  • Patent number: 10872120
    Abstract: A system can provide a visual representation of an inventory of data entities for a distributed computing system. Inventory data including cost and operational data for data entities such as data centers, servers, and virtual machines, can be converted into a format file. The format file can be used to create a tree of nodes and node summaries corresponding to the data entities. A user interface can display hierarchical and isolated views of the tree revealing parent child relationships between data entities within a computing system infrastructure. Node summaries including cost and utilization data can be displayed to reveal how specific sub-costs such as labor and licensing, are driven by data entities in one level of the infrastructure and pushed to respective parent or child data entities in other levels. Views of the tree can be used to determine areas of inefficiency or reduced value within the computing system.
    Type: Grant
    Filed: May 31, 2018
    Date of Patent: December 22, 2020
    Assignee: VMware, Inc.
    Inventors: Chandrashekhar Jha, Kumar Gaurav, Sushil Verma, Vishal Gupta, Aditya Gopisetti
  • Patent number: 10866971
    Abstract: A system for hash collision tables for relational operations is provided. In some implementations, the system performs operations comprising generating a plurality of hash values for at least a portion of one or more database tables based on a database query, and generating a hash table for at least a portion of the plurality of hash values. The operations can further include generating first results based on execution of a first operation in the database query using the hash table. Additionally, the operations can further include generating second results based on the first results and execution of a second operation in the database query using the hash table. Related systems, methods, and articles of manufacture are also described.
    Type: Grant
    Filed: May 22, 2017
    Date of Patent: December 15, 2020
    Assignee: SAP SE
    Inventors: Christian Bensberg, Till Merker
  • Patent number: 10853370
    Abstract: Systems, apparatuses and methods may provide a query response. A value of a time-to-live (TTL) for data associated with a computation unit may be determined, wherein the computation unit may disallow access to the data when the TTL is expired. Additionally, a determination may be made whether the data associated with the computation unit satisfies a query. Also, a query response may be generated including the data associated with the computation unit that satisfies the query. In one example, a context for the data associated with the computation unit may be determined, wherein the computation unit may disallow access to the data based on the context. Data may be represented as a network of computation units which may provide data with a TTL that is contextual, which may be handled in a massively distributed fashion.
    Type: Grant
    Filed: June 26, 2015
    Date of Patent: December 1, 2020
    Assignee: Intel Corporation
    Inventor: Gabriel G. Infante-Lopez
  • Patent number: 10855649
    Abstract: Control component and method for registering device names assigned to industrial automation devices or communication devices in a name service system, wherein in order to register device names assigned to industrial automation devices or communication devices in a name service system, at least selected automation or communication devices each comprise a name service component where the selected automation or communication devices control transmission of a registration request containing an assignment between their respectively assigned device name and at least one respectively configured communication network address to a name service server via their name service component, and where a control component is respectively assigned to the name service components and enables or blocks transmission of a registration request.
    Type: Grant
    Filed: April 29, 2019
    Date of Patent: December 1, 2020
    Assignee: Siemens Aktiengesellschaft
    Inventors: Harald Albrecht, Stephan Höme, Thomas Talanis
  • Patent number: 10846291
    Abstract: Disclosed aspects relate to transforming a user-defined table function (UDTF) to a derived table in a database management system (DBMS). It may be detected by the DBMS that a query indicates the UDTF. A derived table may be constructed from the UDTF. The derived table may be derived from a set of statements of the UDTF. The derived table may be introduced to the query to fulfill the UDTF. A query plan may be generated for the query by the DBMS. The query plan may be generated in response to introducing the derived table in the query.
    Type: Grant
    Filed: April 18, 2019
    Date of Patent: November 24, 2020
    Assignee: Alibaba Group Holding Limited
    Inventors: Craig S. Aldrich, Stephanie A. Burrichter, Scott P. Hanson, Rafal P. Konik, Roger A. Mittelstadt, Jane A. Vold
  • Patent number: 10831771
    Abstract: Disclosed herein are system, method, and computer program product embodiments for interactive exploration of graph data. An embodiment operates by compiling a data query in any database-readable language based upon an input parameter. A data query of a graph data set is then conducted but is halted when a breakpoint generated from the input parameter is reached. Halting the data query includes partitioning a data subset from the graph data set. The data subsets is then displayed.
    Type: Grant
    Filed: July 6, 2015
    Date of Patent: November 10, 2020
    Assignee: SAP SE
    Inventors: Marcus Paradies, Michael Rudolf, Wolfgang Lehner
  • Patent number: 10824592
    Abstract: Generally discussed herein are devices, systems, and methods for database management. A method may include determining a first hyperloglog (HLL) sketch of a first column of data, determining a second HLL sketch of a second column of data, estimating an inclusion coefficient based on the first and second HLL sketches, and performing operations on the first column of data or the second column of data in response to determining the inclusion coefficient is greater than, or equal to, a specified threshold.
    Type: Grant
    Filed: June 14, 2018
    Date of Patent: November 3, 2020
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Azade Nazi, Bolin Ding, Vivek R Narasayya, Surajit Chaudhuri