Query Optimization Patents (Class 707/713)
  • Patent number: 10726010
    Abstract: A method, apparatus, and stored instructions are provided for transforming a query representation by unnesting a predicate condition that is based on whether or not a result exists for a subquery of the predicate condition. An initial query representation is received. The initial query representation represents an initial query that includes an EXISTS-equivalent predicate or a NOT-EXISTS-equivalent predicate and at least one other predicate in a disjunction. The initial query representation is transformed into a semantically equivalent transformed query representation that represents a transformed query. The transformed query includes, instead of the EXISTS-equivalent predicate or a NOT-EXISTS-equivalent predicate, a join operator that references the data object.
    Type: Grant
    Filed: September 4, 2012
    Date of Patent: July 28, 2020
    Assignee: ORACLE INTERNATIONAL CORPORATION
    Inventors: Rafi Ahmed, Chun-Chieh Lin, Mohamed Zait
  • Patent number: 10719403
    Abstract: Recovery support techniques for storage virtualization environments are described. In one embodiment, for example, a method may be performed that comprises defining, by processing circuitry, a storage container comprising one or more logical storage volumes of a logical storage array of a storage system, associating the storage container with a virtual volume (vvol) datastore, identifying metadata for a vvol of the vvol datastore, and writing the metadata for the vvol to the storage system. Other embodiments are described and claimed.
    Type: Grant
    Filed: January 31, 2016
    Date of Patent: July 21, 2020
    Assignee: NetApp Inc.
    Inventors: Deepak Thomas, Dan Sarisky, Nagender Somavarapu, Santosh Lolayekar
  • Patent number: 10713252
    Abstract: One method includes receiving aggregated free-form query information comprising a first section and a second section for requesting data pertaining to a computing system and converting the first section and the second section of the aggregated free-form query information into an original query portion and a contingency query portion for accessing at least one data set. The method further includes accessing, using the original query portion, the at least one data set to obtain result information pertaining to an initial element included in the computing system. The method also includes accessing, using the contingency query portion and the result information returned in response to the original query portion, the at least one data set to obtain information for at least one descendant element or ancestor element related to the initial element included in the result information.
    Type: Grant
    Filed: August 29, 2016
    Date of Patent: July 14, 2020
    Assignee: EMC IP HOLDING COMPANY LLC
    Inventors: Geoffrey David Bourne, James K. Boettcher
  • Patent number: 10706049
    Abstract: The present invention discloses a method and apparatus for querying a nondeterministic graph, which are used to implement quick query of a nondeterministic graph, reduce query complexity, and improve query efficiency. The method comprises receiving a query instruction, where the query instruction is used to query a nondeterministic graph for data that satisfies a query condition; determining two vertices in the nondeterministic graph according to the query instruction; determining all possible paths that use one vertex in the two vertices as a start point and the other vertex as an end point; calculate a probability of a first event or a second event corresponding to each of the paths; and obtaining, according to the probability of the first event or the probability of the second event, a query result corresponding to the query instruction.
    Type: Grant
    Filed: October 31, 2016
    Date of Patent: July 7, 2020
    Assignee: Huawei Technologies Co., Ltd.
    Inventors: Jiefeng Cheng, Cheng He, Wei Fan
  • Patent number: 10698582
    Abstract: Methods, systems, and computer program products are provided for presenting a user interface on a display of a computer system. A presence of a second person in a proximity of a computer system other than a first person using the computer system is determined. A user interface is automatically selected based on the determined presence of the second person. In an absence of the second person, a voice interface is selected. When the second person is present, a text entry interface is selected. The selected user interface is presented to the first person on a display of the computer system.
    Type: Grant
    Filed: June 28, 2018
    Date of Patent: June 30, 2020
    Assignee: International Business Machines Corporation
    Inventors: Lisa Seacat DeLuca, Maharaj Mukherjee, Jonathan Lenchner
  • Patent number: 10698926
    Abstract: Aspects extend to methods, systems, and computer program products for clustering streamed or batch data. Aspects of the invention include dynamic clustering and labeling of streamed data and/or batch data, including failures and error logs (user, platform, etc.), latency logs, warning logs, information logs, Virtual Machine (VM) creation data logs, template logs, etc., for use in analysis (e.g., error log analysis). A clustering system can learn from previously identified patterns and use that information to group newer information dynamically as it gets generated. The clustering system can leverage streamed data and/or batch data domain knowledge for preprocessing. In one aspect, a clustering system uses a similarity measure. Based on (e.g., users' configuration of) a similarity threshold, the cluster system (e.g., automatically) assigns/clusters streamed data and/or batch data into groups.
    Type: Grant
    Filed: April 20, 2017
    Date of Patent: June 30, 2020
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Shandan Zhou, Karthikeyan Subramanian, Murtaza Muidul Huda Chowdhury, Gowtham Natarajan
  • Patent number: 10691679
    Abstract: Data, such as product data or airline flight data, is represented using structured data tuples, tables, or as data with related metadata and tags, and stored by a search engine. Partial queries are received by the search engine from a user and are used to generate a dialog between the search engine and the user. The dialog may include suggested query completions for the partial queries that correspond to a schema associated with the data tuples. The suggested query completions may be determined using attribute combinations of attributes and attribute values, or metadata and tags associated with the data tuples, including known synonyms and misspellings. The user may interact with the query completions in the dialog, and the search engine may revise the dialog and the query completions according to the interactions. A user may query data tuples without knowing the schema used by the underlying data structures.
    Type: Grant
    Filed: January 18, 2011
    Date of Patent: June 23, 2020
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Stelios Paparizos, David James Gemmell
  • Patent number: 10691680
    Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining query refinements using search data. In one aspect, a method includes receiving a first query and a second query each comprising one or more n-grams for a user session, determining a first set of query refinements for the first query, determining a second set of query refinements from the first set of query refinements, each query refinement in the second set of query refinements including at least one n-gram that is similar to an n-gram from the first query and at least on n-gram that is similar to an n-gram from the second query, scoring each query refinement in the second set of query refinements, selecting a third query from a group consisting of the second set of query refinements and the second query, and providing the third query as input to a search operation.
    Type: Grant
    Filed: June 8, 2017
    Date of Patent: June 23, 2020
    Assignee: Google LLC
    Inventors: Matthias Heiler, Behshad Behzadi, Evgeny A. Cherepanov, Nils Grimsmo, Aurelien Boffy, Alessandro Agostini, Karoly Csalogany, Fredrik Bergenlid, Marcin M. Nowak-Przygodzki
  • Patent number: 10685062
    Abstract: New methods of relational database management are described, for example, to enable completion and checking of data in relational databases, including completion of missing foreign key values, to facilitate understanding of data in relational databases, to highlight data that it would be useful to add to a relational database and for other applications. In various embodiments, the schema of a relational database is used to automatically create a probabilistic graphical model that has a structure related to the schema. For example, nodes representing individual rows are linked to rows of other tables according to the database schema. In examples, data in the relational database is used to carry out inference using inference algorithms derived from the probabilistic graphical model. In various examples, inference results, comprising probability distributions each for an individual table cell, are used to fill missing data, highlight errors, and for other purposes.
    Type: Grant
    Filed: December 31, 2012
    Date of Patent: June 16, 2020
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Sameer Singh, Thore Kurt Hartwig Graepel, Lucas Julien Bordeaux, Andrew Donald Gordon
  • Patent number: 10671618
    Abstract: Computer-implemented curriculum creation can include determining, using a processor, inquiries for educational content from data aggregated from a plurality of different users over time, determining, using the processor, topics of the inquiries, and categorizing, using the processor, the inquiries into groups based upon the topics. Computer-implemented curriculum creation may include searching, using the processor, for educational content for a subset of the topics, wherein the topics of the subset are selected based upon a ranking of the topics, and determining, using the processor, whether educational content is available for the topics of the subset based upon results of the searching.
    Type: Grant
    Filed: January 17, 2017
    Date of Patent: June 2, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Claudio Calazans O. Alves, Ian D. Douglas, Joel P. Sundman, Karim Younsi
  • Patent number: 10671685
    Abstract: Methods and apparatus related to adjusting the ranking of a suggestion for a geographic location based on determining how many of one or more users visited the geographic location after receiving the suggestion. In some implementations the one or more users may belong to first grouping of users and the ranking may be adjusted only for suggestions to the first grouping of users. In some implementations it may be determined if a second grouping of users visited the geographic location after receiving the suggestion. In some implementations a property of the given geographic location may be determined based on a comparison of how many of the second grouping of users visited the given geographic location after receiving the suggestion and how many of the one or more users visited the given geographic location after receiving the suggestion.
    Type: Grant
    Filed: February 3, 2017
    Date of Patent: June 2, 2020
    Assignee: Google LLC
    Inventors: Andrew Tomkins, Shanmugasundaram Ravikumar
  • Patent number: 10650001
    Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for disaggregating latent causes for computer system optimization. In one aspect, a method includes accessing a data stream for data values resulting from operations performed by a computer system; providing the data values as input to a data disaggregation machine learning model that generates descriptors of latent causes of the data values; providing the data values and the descriptors of the latent causes of the data values as inputs to a control system model that generates embedded representations of commands to modify the operations performed by the computer system; determining commands to modify the operations performed by the computer system based on the embedded representations of commands to modify the operations performed by the computer system; and providing the commands to the computer system.
    Type: Grant
    Filed: October 5, 2017
    Date of Patent: May 12, 2020
    Assignee: Google LLC
    Inventors: Milad Olia Hashemi, Parthasarathy Ranganathan, Harsh Satija
  • Patent number: 10650074
    Abstract: Systems and methods are disclosed for identifying and managing topical content for websites. In accordance with one implementation, a method is provided for identifying and managing topical content for a website. The method may include determining a set of topics at a first level of popularity, determining a set of topics at a second level of popularity, and discounting the set of topics at the second level of popularity based on the set of topics at the first level of popularity to determine a revised set of topics for the second level of popularity. The method may also include managing the topical content based on the revised set of topics for the second level of popularity.
    Type: Grant
    Filed: July 9, 2014
    Date of Patent: May 12, 2020
    Assignee: Oath Inc.
    Inventors: Ian Holsman, Sultana Darya
  • Patent number: 10642834
    Abstract: Selecting a join plan for a query containing a join and a union block includes determining whether to propose a join plan with the join pushed across the union block. A selection is made between a join plan in which the join is not pushed across the union block and any proposed join plan in which the join is pushed across the union block.
    Type: Grant
    Filed: March 30, 2017
    Date of Patent: May 5, 2020
    Assignee: Teradata US, Inc.
    Inventors: Ahmad Said Ghazal, William Joseph McKenna
  • Patent number: 10645055
    Abstract: In some examples, a method includes receiving, from one or more client devices, a stream of messages composed by one or more users of the one or more client devices, wherein each of the messages includes a particular hashtag, determining, using a set of metrics that are based at least in part on the messages, a trending score that represents a magnitude of a trend for the particular hashtag, in response to determining that the trending score satisfies a threshold, sending, to a content provider system, a set of demographic data that describes one or more of the users who associated with the particular hashtag, and, in response to receiving, from the content provider system, targeted content that is based at least in part on the particular hashtag and the set of demographic data, sending, for display at the one or more of the one or more client devices, the targeted content.
    Type: Grant
    Filed: April 1, 2019
    Date of Patent: May 5, 2020
    Assignee: Twitter, Inc.
    Inventors: Dinkar Jain, Mu Lin, David Hotchkiss
  • Patent number: 10628470
    Abstract: In accordance with embodiments, there are provided mechanisms and methods for dynamically suggesting answers to questions submitted to a portal of an online service. These mechanisms and methods for dynamically suggesting answers to questions submitted to a portal of an online service can enable embodiments to provide help document suggestions with limited user input. The ability of embodiments to provide help document search term suggestions with limited user input can enable users to quickly and efficiently find useful help documents.
    Type: Grant
    Filed: October 20, 2015
    Date of Patent: April 21, 2020
    Assignee: salesforce.com, inc.
    Inventors: Patrick McFarlane, Ganesh Mathrubootham, Shuchun Yang
  • Patent number: 10621183
    Abstract: Embodiments of the present disclosure are directed to methods, computer program products, computer systems for providing a computing search platform for conducting opinion searches over the Internet concerning aggregated social media electronic messages about public opinions and public sentiments for a wide variety of matrices, such as social media posting of a particular industry over a specified time period, electronic social media posting on the public sentiments, public buzz, and public mood. Methods and systems of the present disclosure are directed to collecting and analyzing unstructured social media messages and correlating with structured entity representations in order to discern amount of interest in (buzz) and feelings about (mood) the real world organizations, people, products, and locations described by those entity representations transforming the data into a readily understandable visual display of the aggregated results on a computer display.
    Type: Grant
    Filed: March 9, 2016
    Date of Patent: April 14, 2020
    Assignee: Interos Solutions, Inc.
    Inventors: Manjirnath Chatterjee, Erick Watson, Kevin Perillo, Rabia Turan
  • Patent number: 10623250
    Abstract: Techniques are described for providing a simultaneous, multi-device user experience for one or more users, on computing devices that include different capabilities for data input and/or data output. A user may register multiple devices with a service, and the service may determine capabilities of the devices for data input and data output. During a communication session involving the user and another user, such as a service representative, the service may receive input data collected through one or more devices and/or provide output data to be presented on one or more devices, where such data input and data output is received and provided according to the various input/output capabilities of the various devices. The data input and/or data output may switch from device to device during a session. In some instances, data may be replicated for presentation through multiple devices simultaneously.
    Type: Grant
    Filed: June 24, 2016
    Date of Patent: April 14, 2020
    Assignee: United Services Automobile Association (USAA)
    Inventors: Michael Joseph Gaeta, Gunjan Vijayvergia, Nathan Mahoney
  • Patent number: 10621641
    Abstract: A method for pushing information includes obtaining information of first commodity including the predetermined characteristic information selected by customers on an e-commerce website; obtaining information of second commodities with the same predetermined characteristic information as that of the first commodity; extracting at least two kinds of predetermined attribute information from each of the second commodities; pushing the information of second commodities with the same predetermined characteristic information as that of the first commodity according to the at least two kinds of predetermined attribute information, to make sure that the pushed information meets customers' requirements.
    Type: Grant
    Filed: April 1, 2014
    Date of Patent: April 14, 2020
    Assignee: TENCENT TECHNOLOGY (SHENZHEN) COMPANY LIMITED
    Inventor: Shaobo Li
  • Patent number: 10614069
    Abstract: A database is configured to analyze user queries to dynamically partition the database according to a partition scheme. User queries can be rewritten based on the partition scheme so that, in response to queries, partitions including relevant data are read while partitions including irrelevant data can be skipped, reducing latency. Files can be named according to the partition scheme and stored on respective partitions so that low partition management can be implemented by underlying systems. Blocks within files can be sorted and statistics can be determined. The statistics can be used to find and read relevant blocks and skip irrelevant blocks.
    Type: Grant
    Filed: January 15, 2018
    Date of Patent: April 7, 2020
    Assignee: Palantir Technologies Inc.
    Inventor: James Ding
  • Patent number: 10606910
    Abstract: An online system identifies and ranks records using multiple machine learning models in response to a search query. Therefore, the online system can provide selected records that are of the most relevance to a user of a client device that provided the search query. More specifically, the online system applies a first machine learning model that is of low complexity, such as a regression model. Therefore, the first machine learning model can quickly narrow down the large number of records of the online system to a first set of candidate records. The online system analyzes candidate records in the first set by applying a more complex, second machine learning model that more accurately determines records of interest for the user. In various embodiments, the online system can apply subsequent machine learning models of higher complexity for selecting and ranking records for provision to the client device.
    Type: Grant
    Filed: October 11, 2017
    Date of Patent: March 31, 2020
    Assignee: salesforce.com, inc.
    Inventors: Jayesh Govindarajan, Nicholas Beng Tek Geh, Francisco Borges, Ammar Haris
  • Patent number: 10606873
    Abstract: Embodiments of the present disclosure relate generally to index trimming to improve search results of a large corpus. Some embodiments, prior to receiving, from a user device, a search query of one or more keywords searching for a relevant set of publications in a publication corpus, trim candidate publications from a plurality of candidate publications to generate a trimmed plurality of candidate publications.
    Type: Grant
    Filed: February 22, 2017
    Date of Patent: March 31, 2020
    Assignee: EBAY INC.
    Inventors: Mingkuan Liu, Hao Zhang, Xianjing Liu, Alan Qing Lu
  • Patent number: 10606834
    Abstract: Techniques are provided for sharing expression evaluation across a database management system and a storage layer. In an embodiment, a computer identifies, in a query execution plan compiled for a query, a plurality of target operators that includes an expression that computes a common value. A storage layer evaluates the expression that computes the common value during a table scan of stored data indicated by the expression. For at least one target operator of the plurality of target operators, the computer modifies a row input of the at least one target operator to add a column to receive an evaluation result comprising the common value from the storage layer. The query execution plan is performed by a database management system and the storage layer.
    Type: Grant
    Filed: September 26, 2017
    Date of Patent: March 31, 2020
    Assignee: Oracle International Corporation
    Inventors: Thierry Cruanes, Junyi Xie, Yiu Woon Lau
  • Patent number: 10599649
    Abstract: Systems are disclosed for modifying weighting of database components by a query planner based on component volatility. The systems obtain a plurality of snapshots of one or more datasets that include one or more data components, and from the plurality of snapshots, the system identifies the volatility of each data component. The systems further generate a plurality of separate dynamic weights for each data component and initiates application of the separate dynamic weights by the query planner to the one or more data components. In some instances, the weights differentially affect the computational cost for query plans based in a time-dependent fashion and are applied prior to calculating costs of the query plans.
    Type: Grant
    Filed: December 20, 2016
    Date of Patent: March 24, 2020
    Assignee: Microsoft Technology Licensing, LLC
    Inventor: Atri Sharma
  • Patent number: 10592822
    Abstract: Aspects of the disclosure generally relate to computing devices and may be generally directed to devices, systems, methods, and/or applications for learning the operation of a computing device or software application, storing this knowledge in a knowledgebase, neural network, or other repository, and enabling autonomous operation of the computing device or software application with partial, minimal, or no user input.
    Type: Grant
    Filed: August 4, 2016
    Date of Patent: March 17, 2020
    Inventor: Jasmin Cosic
  • Patent number: 10585874
    Abstract: Disclosed herein are methods for receiving a command for adding or removing a resource in a database and acquiring an exclusive lock for the database in response the command. In response to obtaining the exclusive lock, the method comprises determining a first number indicating the number of resources currently existing in the database and a second number indicating the number of resources subject to concurrent further commands for adding or removing a resource; comparing the first and the second number for determining whether the received command will remove the last existing resource or add a first resource to the database; and obtaining an exclusive or a shared lock for the received command in dependence on the determination. The method further includes releasing the exclusive lock for the database and adding or removing the resource while holding the lock obtained for the received command.
    Type: Grant
    Filed: August 1, 2016
    Date of Patent: March 10, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Bjoern Broll, Sabine Perathoner-Tschaffler, Stefan Renner, Knut Stolze
  • Patent number: 10579680
    Abstract: Techniques to store graph information in a database are disclosed. In various embodiments, each node in a graph may be modeled as a micro b-tree. Node identity, attribute, edge, and edge attribute data may be stored in one or more pages modeled on page formats typically used to store index data for a relational database index. Data associated with a plurality of nodes and edges, each of said edges representing a relationship between two or more of said nodes, may be received. For each node, one or more pages of data may be created, each corresponding to a prescribed page size associated with a storage device in which said one or more pages are to be stored, and each page having a data structure that includes a variable-sized set of fixed length data slots and a variable-sized variable length data region.
    Type: Grant
    Filed: November 21, 2016
    Date of Patent: March 3, 2020
    Assignee: TIBCO SOFTWARE INC.
    Inventors: Suresh Subramani, Vincent Chung
  • Patent number: 10565229
    Abstract: The system described herein can automatically match, link, or otherwise associate electronic activities with one or more record objects. For an electronic activity that is eligible or qualifies to be matched with one or more record objects, the system can identify one or more set of rules or rule sets. Using the rule sets, the system can identify candidate record objects. The system can then rank the identified candidate record objects to select one or more record objects with which to associate the electronic activity. The system can then store an association between the electronic activity and the selected one or more record objects.
    Type: Grant
    Filed: December 7, 2018
    Date of Patent: February 18, 2020
    Assignee: People.ai, Inc.
    Inventors: Oleg Rogynskyy, Rajit Kurien Joseph, Jose Alberto Muniz Navarro
  • Patent number: 10565176
    Abstract: The present disclosure relates to a method for processing a data table. The data table is divided into a plurality of data blocks, and a multidimensional data structure for representing the plurality of data blocks is generated. For each data block of at least part of the plurality of data blocks, a respective data element is added into the multidimensional data structure. The data element has multiple values indicative of a first attribute of the data block. The multidimensional data structure is stored for selectively processing a portion of the data blocks using the multidimensional data structure.
    Type: Grant
    Filed: July 29, 2016
    Date of Patent: February 18, 2020
    Assignee: International Business Machines Corporation
    Inventors: Andreas Brodt, James L. Finnie, Oliver Schiller, Marc Schwind, Knut Stolze, Mathias Trumpp
  • Patent number: 10558633
    Abstract: A data store system includes a processor that may generate a hash value based on a hash function for each column value in a selected column of a data store table and may select a first domain and a second domain of hash values. The processor may determine a frequency value for each hash value within the first domain, generate a unique identifier for each hash value within the second domain, and determine at least one statistic on the selected column based on the frequency values and the unique identifiers. The processor may store the at least one statistic for use in a query plan. A method and computer-readable medium may also be implemented.
    Type: Grant
    Filed: December 30, 2015
    Date of Patent: February 11, 2020
    Assignee: Teradata US, Inc.
    Inventor: Sung Jin Kim
  • Patent number: 10558690
    Abstract: A method for searching for multiple sub-strings of an original text is provided. A search query is received, wherein the search query includes a plurality of sub-strings. A hash array is allocated. The hash array has a size based, at least in part, on the plurality of sub-strings and an original text. The hash array is populated with a plurality of hash values, wherein the plurality of hash values are generated using a rolling hash function, and wherein each of the plurality of hash values corresponds to a portion of the original text. A plurality of sub-string values are computed based on the plurality of sub-strings. Each of the plurality of sub-strings are determined to occur in the original text based, at least in part, on searching the hash array for the plurality of sub-string values.
    Type: Grant
    Filed: July 6, 2015
    Date of Patent: February 11, 2020
    Assignee: International Business Machines Corporation
    Inventors: Chi-Wai Cheung, Ying-Chau R. Mak
  • Patent number: 10558663
    Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. In response to receiving a first query for a set of data, the program generates a first query execution plan based on the first query. The program further executes the first query execution plan in order to generate a first result set comprising the set of data. The program also stores the first query execution plan in a cache. The program further replaces the first query execution plan in the cache with a second query execution plan. The second query execution plan includes a query hint applied to the first query execution plan. In response to receiving a second query for the set of data, the program also retrieves the second query execution plan from the cache. The program further executes the second query execution plan in order to generate a second result set comprising the set of data.
    Type: Grant
    Filed: March 30, 2017
    Date of Patent: February 11, 2020
    Assignee: SAP SE
    Inventor: Ulrich Bestfleisch
  • Patent number: 10558658
    Abstract: A method for propagating a structure query language (SQL) association can include determining, based at least on a syntax of a SQL create view statement, that a SQL association requires propagation to a SQL view associated with the SQL create view statement. The SQL association can combine data from at least a first data model and a second data model at a database. The SQL view can comprise at least a portion of the combined data. An association information data structure can be generated for storing information corresponding to a definition of the SQL association. The SQL create view statement can be executed based on the association information data structure. Related systems and articles of manufacture, including computer program products, are also disclose.
    Type: Grant
    Filed: May 16, 2017
    Date of Patent: February 11, 2020
    Assignee: SAP SE
    Inventors: Di Wu, Ki Hong Kim, Stefan Baeuerle, Steffen Weinstock, Daniel Hutzel, Zhi Qiao
  • Patent number: 10558636
    Abstract: Disclosed herein are system, method, and computer program product embodiments for providing read queries latch-free access to an index page. In an embodiment, a processor receives a request from a read query to access one or more records of an index page. The index page includes an update pointer and a slot array. The processor locates one or more updates prepended to the index page by locating a most recently prepended update indicated by the update pointer. Then, the processor generates a local offset table with entries in the slot array and the located one or more updates. The generated local offset table enables the processor to provide the read query access to the one or more records of the index page.
    Type: Grant
    Filed: April 27, 2016
    Date of Patent: February 11, 2020
    Assignee: SAP SE
    Inventors: Zheng-wei She, Xu-dong Qian, Zhi-ping Xiong
  • Patent number: 10552412
    Abstract: Described are methods, systems and computer readable media for query task operations based on memory allocation and performance criteria.
    Type: Grant
    Filed: March 3, 2017
    Date of Patent: February 4, 2020
    Assignee: Deephaven Data Labs LLC
    Inventors: Charles Wright, Ryan Caudy, David R. Kent, IV, Mark Zeldis, Radu Teodorescu
  • Patent number: 10554603
    Abstract: Activity information relating to activities of a respective electronic communication recipient accessing information associated with an electronic communication is received from each of a plurality of electronic communication clients. The activity information received from each of the plurality of electronic communication clients can indicate an amount of time the electronic communication is open in the respective electronic communication client. Based on the received activity information, each of the electronic communication recipients can be rated to generate at least one recommendation as to who is able to provide information pertaining to the electronic communication. The recommendation can be communicated to another electronic communication recipient.
    Type: Grant
    Filed: August 17, 2018
    Date of Patent: February 4, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Al Chakra, Liam Harpur, Michelle M. Purcell, John Rice
  • Patent number: 10546008
    Abstract: An apparatus and techniques for constructing and utilizing a “dynamic dictionary” that is not a compiled dictionary, and therefore does not need to be recompiled in order to be updated. The dynamic dictionary includes respective data structures that represent (i) a management automaton that includes a plurality of management nodes, and (ii) a runtime automaton that is derived from the management automaton and includes a plurality of runtime nodes. The runtime automaton may be used to search input data, such as communication traffic over a network, for keywords of interest, while the management automaton manages the addition of keywords to the dynamic dictionary. Typically, at least two (e.g., exactly two) such dynamic dictionaries are used in combination with a static dictionary.
    Type: Grant
    Filed: October 21, 2016
    Date of Patent: January 28, 2020
    Assignee: VERINT SYSTEMS LTD.
    Inventor: Yitshak Yishay
  • Patent number: 10540256
    Abstract: A computer-implemented method for automatically reviewing structured query language (SQL) statements comprises the steps of receiving SQL code from a user seeking to access a database, parsing the SQL code to retrieve SQL keywords, mathematical operators, and logical operators, applying a complexity score calculation algorithm to the parsed code, calculating a complexity score, and executing the SQL code on a computing system which stores the database if the complexity score is less than or equal to a threshold. On the other hand, if the complexity score is greater than the threshold, the SQL code may be flagged to be rewritten.
    Type: Grant
    Filed: November 2, 2018
    Date of Patent: January 21, 2020
    Inventors: Richard Snyder, Matthew R Anderson, Daniel Galvin
  • Patent number: 10534775
    Abstract: A system for cardinality estimation for database query planning is provided. In some implementations, the system performs operations comprising selecting a subset of data from a set of data on which a database query is to be executed, the set of data including a first quantity of tuples and the subset of data including a second quantity of tuples. The operations can further comprise determining, based on evaluating one or more predicates on the subset, a third quantity of tuples in the subset which satisfy the one or more predicates. The operations can further comprise determining, based on the first quantity, the second quantity, and the third quantity, a range within the subset that comprises estimated cardinalities of the one or more predicates within a predetermined error threshold range. Related systems, methods, and articles of manufacture are also described.
    Type: Grant
    Filed: May 23, 2017
    Date of Patent: January 14, 2020
    Assignee: SAP SE
    Inventors: Guido Moerkotte, Alexander Boehm, Norman May
  • Patent number: 10510045
    Abstract: A computer server system and method are disclosed for personalization and customizable filtering of network search results and search result rankings, such as for Internet searching. A representative server system comprises: a network interface to receive a query from a respondent or co-respondent; at least one data storage device storing a plurality of return queries; and one or more processors adapted to access the data storage device and using the query, to select the return queries for transmission; to search the data storage device for corresponding pluralities of responses to the return queries from other co-respondents or respondents; to pair-wise score the responses and generate pair-wise alignment scores for respondent and co-respondent combinations; to sort and rank the combinations according to the alignment scores; and to output a listing of the sorted and ranked respondents or co-respondents to form the personalized network search results and search result rankings.
    Type: Grant
    Filed: May 4, 2019
    Date of Patent: December 17, 2019
    Assignee: Digerati, Inc.
    Inventors: Brian Balasia, Joseph Klecha, Robert Levy, Timothy Kocoloski
  • Patent number: 10509836
    Abstract: Systems and methods for presenting search results from multiple sources by ranking sources that results are received from and not presenting duplicate results from lower ranked sources. For example, results from a first source and a second source may be received. The results from the first source may be presented in a row closer to the top of a screen than the results from the second source in response to the user having a preference for the first source over the second source. If the two results match, the result is only displayed in the row for the higher ranked source and another result is presented in the second row that does not match any of the displayed results in the first row.
    Type: Grant
    Filed: April 19, 2017
    Date of Patent: December 17, 2019
    Assignee: Rovi Guides, Inc.
    Inventor: David Gerald Wittke
  • Patent number: 10496644
    Abstract: According to one aspect, a query plan is generated for a newly submitted structured query language (SQL) query received by a relational database management system by reusing at least part of an existing query plan that is being kept in memory after execution.
    Type: Grant
    Filed: December 21, 2018
    Date of Patent: December 3, 2019
    Assignee: MUREX S.A.S.
    Inventors: Fady Chamieh, Bilal El Tayara, Philippe Bourgau
  • Patent number: 10489980
    Abstract: Techniques for managing and discovering data using visual or audible representations may be provided. The data, in some examples, may correspond with individual items, and the system may correlate each item with a representation of the item (e.g., for navigation, for accessibility, etc.). The representations may be provided to allow discovery of the items in response to adjusting the resolution, audibly requesting information, or panning across a display to discover items that are displayed as these representations outside of the original presentation of representations. In some examples, the representation of the item may not be unique to the item or may be represented as a placeholder image or description. The higher the resolution, the more detail about the item may be provided. When an item is selected, item data may be provided that corresponds with the item.
    Type: Grant
    Filed: March 30, 2017
    Date of Patent: November 26, 2019
    Assignee: Amazon Technologies, Inc.
    Inventors: Darren Ernest Canavor, Moustafa Ghazal, Darryl Havens, Jane Mooney, Brandon William Porter
  • Patent number: 10482142
    Abstract: Systems, methods and devices to provide recommendation information. A server, server system or server-implemented method can comprise circuitry that collects pieces of information via the Internet, determines recommendation information from the collected pieces of information, and determines an information search degree associated with the recommendation information. Data regarding the recommendation information and data regarding the information search degree can be output to provide an indication of the recommendation information. An apparatus, system or method can control display of recommended information and can comprise or be implemented using circuitry that receives, from a source external to the apparatus or system, data regarding recommended information and data regarding a generated information search degree associated with the recommended information.
    Type: Grant
    Filed: May 19, 2015
    Date of Patent: November 19, 2019
    Assignee: SONY CORPORATION
    Inventor: Mitsuhiro Miyazaki
  • Patent number: 10459915
    Abstract: Managing queries performed on one or more data sources includes: storing at least a first query in a storage medium; selecting the first query for processing; instructing a query engine to process the first query on a first portion of data in the one or more data sources for a first query interval; receiving result data from the query engine based on processing the first query on the first portion of data; saving a state of the first query in the storage medium after the first query interval; instructing the query engine to process a second query during a second query interval after the first query interval; and instructing the query engine to process the first query on a second portion of data in the one or more data sources during a third query interval after the second query interval.
    Type: Grant
    Filed: December 23, 2010
    Date of Patent: October 29, 2019
    Assignee: Ab Initio Technology LLC
    Inventors: Craig W. Stanfill, John Maclean
  • Patent number: 10459960
    Abstract: Clustering a set of natural language queries NLQs based on a set of significant events retrieved from a corpus stored in a computer system is described. A set of NLQs is used by a search engine for searching a selected corpus to retrieve respective sets of significant events. The set of NLQs is clustered into a plurality of NLQ clusters according to a threshold number of common significant events being returned by the search engine for respective members of an NLQ cluster.
    Type: Grant
    Filed: November 8, 2016
    Date of Patent: October 29, 2019
    Assignee: International Business Machines Corporation
    Inventors: Swaminathan Chandrasekaran, Joseph N Kozhaya, Lakshminarayanan Krishnamurthy
  • Patent number: 10445361
    Abstract: Systems, methods, and computer readable devices embodying instructions are provided herein for reducing latencies and/or improving computational efficiency when traversing data stored in a relational graph by caching subgraphs and enabling the utilization thereof. More specifically, after a user performs a graph query, the resulting subgraphs of the graph query are cached in a reusable form. Subsequent graph queries are able to identify cached subgraphs based on the graph query. Further, the subsequent graph query is operable to integrate the cached subgraphs as part of the result of subsequent graph query, which may include a portion or the entire result of the subsequent graph query being composed from cached subgraphs, thereby improving the computational efficiency and performance of querying relational graphs, reducing the query execution cost required to traverse the relational graphs, and improving the functionality of the computing devices hosting the relational graphs and running the queries.
    Type: Grant
    Filed: January 6, 2017
    Date of Patent: October 15, 2019
    Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC
    Inventors: Tor Kreutzer, Åge Kvalnes, Steffen Viken Valvåg, Amund Kronen Johansen, Dag Steinnes Eidesen, Peter Dahle Heen, Jan-Ove Almli Karlberg
  • Patent number: 10430454
    Abstract: The disclosed computer-implemented method for culling search results in electronic discovery may include (1) identifying a data source that is subject to electronic discovery in connection with a lawsuit, (2) mining metadata of a plurality of files within the data source to generate metadata derivatives that describe non-content-based attributes of the files, (3) creating an index that groups the files into a plurality of categories representative of the metadata derivatives, (4) receiving, from a user involved in the electronic discovery, user input that specifies a subset of the categories within the index and a keyword, (5) searching the subset of categories within the index for a subset of the files whose contents include the keyword, and (6) providing, to the user, a result of the search that identifies the subset of files whose contents include the keyword. Various other methods, systems, and computer-readable media are also disclosed.
    Type: Grant
    Filed: February 4, 2015
    Date of Patent: October 1, 2019
    Assignee: Veritas Technologies LLC
    Inventor: Sandeep Khanzode
  • Patent number: 10423601
    Abstract: In one respect, there is provided a method. The method can include identifying, based on a plurality of queries executed at a distributed database, a disjoint table set. The identifying of the disjoint table set can include: identifying a first table that is used in executing a first query; identifying a second query that also uses the first table used in executing the first query; identifying a second table that is used in executing the second query but not in executing the first query; and including, in the disjoint table set, the first table and the second table. The method can further include allocating, based on the disjoint table set, a storage and/or management of the disjoint table set such that subsets of the disjoint table set are stored at and/or managed by different nodes in the distributed database system. Related methods and articles of manufacture are also disclosed.
    Type: Grant
    Filed: March 6, 2017
    Date of Patent: September 24, 2019
    Assignee: SAP SE
    Inventors: Antje Heinle, Hans-Joerg Leu
  • Patent number: 10417281
    Abstract: Among other things, we describe a computer-implemented method, performed by a data processing system, of executing a computer program based on a query that is expressed in accordance with a query language applicable to a relational database, the computer program executed based at least in part on data stored in a tangible, non-transitory computer-readable medium, the executing including receiving a SQL query, where the SQL query includes an identifier associated with a resource that is external to the data processing system, generating a computer program based on the SQL query, and executing the computer program, causing transmitting one or more instructions to the resource, the instructions defining operations other than operations of the SQL query, and receiving data from the resource in response to the instructions.
    Type: Grant
    Filed: June 26, 2015
    Date of Patent: September 17, 2019
    Assignee: Ab Initio Technology LLC
    Inventors: Ian Schechter, Glenn John Allin