Patents Examined by Christopher J Raab
  • Patent number: 10318590
    Abstract: Operation of a user interface includes performing token based analysis of a baseline text corpus and a targeted text listing. For a selected token in the targeted text listing, a matching baseline token in identified. From a plurality of contexts corresponding to the matching baseline token, context-matched and non-context matched usage data for the matching baseline token is identified and provided to a user interface. Similar processing may be performed on the basis of a related, but matching, baseline token. In another embodiment, instances of similar spelling errors are identified on the basis of a plurality of tokens identified in the targeted text listing.
    Type: Grant
    Filed: August 15, 2014
    Date of Patent: June 11, 2019
    Assignee: FEEEDOM SOLUTIONS GROUP, LLC
    Inventors: David Cook, Jacek Zwierzchlejski, Stacey Kacek, Jason Maeder, Stewart Beck
  • Patent number: 10296600
    Abstract: Identifying and visualizing geographic data includes obtaining a set of data including candidate geographic data elements. Metrics are determined based on two or more of: a best parent for the candidate geographic data elements; additional concepts associated with the candidate geographic data elements; and an average distance between the candidate geographic data elements. Then, the candidate geographic data elements are identified as geographic based on the metrics and a map is generated displaying the candidate geographic data elements identified as geographic.
    Type: Grant
    Filed: September 2, 2016
    Date of Patent: May 21, 2019
    Assignee: International Business Machines Corporation
    Inventors: Michael J. Moniz, Yvon R. Nonez, Claudiu D. Popescu, Graham A. Watts
  • Patent number: 10275475
    Abstract: A method of operating a data analysis system includes retrieving objects from a data source. Each of the retrieved objects includes (i) data and (ii) metadata describing the data. The method further includes dynamically creating a cumulative schema by, for each object of the retrieved objects: (i) inferring a schema from the object based on the metadata of the object and inferred data types of elements of the data of the object, (ii) creating a unified schema, wherein the unified schema describes both (a) the object described by the inferred schema and (b) a cumulative set of objects described by the cumulative schema, and (iii) storing the unified schema as the cumulative schema. The method further includes exporting the data of each of the retrieved objects to a data warehouse.
    Type: Grant
    Filed: March 14, 2014
    Date of Patent: April 30, 2019
    Assignee: Amazon Technologies, Inc.
    Inventors: Dimitris Tsirogiannis, Nathan A. Binkert, Stavros Harizopoulos, Mehul A. Shah, Benjamin A. Sowell, Bryan D. Kaplan, Kevin R. Meyer
  • Patent number: 10255351
    Abstract: A social network system (or other type of hosting system) is described herein which allows different types of applications to interact with the common resources of the system via respective application-specific channels. Through an application-specific channel, a user may obtain a filtered set of content items (e.g., posts) and notifications that pertain to a particular application with which the user is currently interacting. But the user may also obtain items and notifications that do not necessarily have an affiliation with the particular application. The social network system may maintain a single identity for each user across all application channels hosted by the system.
    Type: Grant
    Filed: March 13, 2014
    Date of Patent: April 9, 2019
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Todd D. Newman, James H. Lewallen, Colleen G. Estrada, Rajeev V. Karunakaran
  • Patent number: 10235377
    Abstract: Innovations for adaptive compression and decompression for dictionaries of a column-store database can reduce the amount of memory used for columns of the database, allowing a system to keep column data in memory for more columns, while delays for access operations remain acceptable. For example, dictionary compression variants use different compression techniques and implementation options. Some dictionary compression variants provide more aggressive compression (reduced memory consumption) but result in slower run-time performance. Other dictionary compression variants provide less aggressive compression (higher memory consumption) but support faster run-time performance. As another example, a compression manager can automatically select a dictionary compression variant for a given column in a column-store database.
    Type: Grant
    Filed: December 23, 2013
    Date of Patent: March 19, 2019
    Assignee: SAP SE
    Inventors: Ingo Mueller, Cornelius Ratsch, Peter Sanders, Franz Faerber
  • Patent number: 10223391
    Abstract: Systems, methods, and other embodiments associated with history and scenario data tracking are described. In one embodiment, a method includes receiving a request for trending analysis on project data. The request includes a trend range and a time basis. An item table associated with the time basis is selected. The item table includes a record for each time increment of the time basis. Each respective record in the item table includes an effective time for the respective time increment. The method further includes selecting a set of records in the item table that fall within the trend range; and generating a snapshot of the project data for each effective time in each respective selected record in the item table. The generated snapshots of project data are returned in response to the request for trending analysis.
    Type: Grant
    Filed: May 18, 2015
    Date of Patent: March 5, 2019
    Assignee: ORACLE INTERNATIONAL CORPORATION
    Inventor: Brian Kelly Diehl
  • Patent number: 10216719
    Abstract: Embodiments of the present invention disclose a method, a computer program product, and a computer system for extracting natural language relations between entities. A computer receives a configuration for associating one or more natural language questions with one or more entities and identifies the one or more entities annotated within a document. The computer answers the natural language questions associated with the identified one or more entities based on context surrounding the identified one or more entities. The computer may further transmit the natural language questions associated with the identified one or more entities and the surrounding context to a question and answer service, then receive answers to the natural language questions from the question and answer service. The computer may further determine whether the received answers correctly describe the relation between the identified one or more entities and other entities within the extracted surrounding context.
    Type: Grant
    Filed: February 6, 2018
    Date of Patent: February 26, 2019
    Assignee: International Business Machines Corporation
    Inventors: Brendan C. Bull, Scott R. Carrier, Aysu Ezen Can, Dwi Sianto Mansjur
  • Patent number: 10216787
    Abstract: An apparatus, computer-readable medium, and computer-implemented method for contextual data mining using a relational data set includes monitoring one or more data sources for information relating to the relational data set, the relational data set comprising one or more data objects in one or more classes, detecting activity corresponding to a first data object in the one or more data objects based at least in part on information gathered from at least one data source, determining whether the activity exceeds a predefined threshold, identifying a second data object in the one or more data objects which is connected to the first data object based at least in part on an analysis of relationships between the one or more data objects, and transmitting information relating to the second data object based at least in part on a determination that the activity exceeds the predefined threshold.
    Type: Grant
    Filed: March 13, 2014
    Date of Patent: February 26, 2019
    Assignee: Geographic Services, Inc.
    Inventors: Keyvan Rafei, Alex Taranenko
  • Patent number: 10198501
    Abstract: A computer-implemented method generates a candidate answer triple for use in retrieving information used to answer a question. One or more processors parse a question to identify a lexical answer type for the question, a question action for the question, and a question timestamp for the question to make up a question triple. One or more processors retrieve multiple candidate passages for answering the question, and parse each of the multiple candidate passages to identify a candidate entity, a candidate action, and a candidate timestamp from each of the multiple candidate passages to generate a candidate answer triple. One or more processors compare the question triple to the candidate answer triple and establish a match score for each candidate answer triple, which is used in retrieving information used to answer the question.
    Type: Grant
    Filed: September 28, 2016
    Date of Patent: February 5, 2019
    Assignee: International Business Machines Corporation
    Inventors: Kyle L. Croutwater, Vikrant Verma, Le Zhang, Zhe Zhang
  • Patent number: 10198431
    Abstract: For generating a word space, manual thresholding of word scores is used. Rather than requiring the user to select the threshold arbitrarily or review each word, the user is iteratively requested to indicate the relevance of a given word. Words with greater or lesser scores are labeled in the same way depending upon the response. For determining the relationship between named entities, Latent Dirichlet Allocation (LDA) is performed on text associated with the name entities rather than on an entire document. LDA for relationship mining may include context information and/or supervised learning.
    Type: Grant
    Filed: August 22, 2011
    Date of Patent: February 5, 2019
    Assignee: SIEMENS CORPORATION
    Inventors: Swapna Somasundaran, Dingcheng Li, Amit Chakraborty
  • Patent number: 10176248
    Abstract: Arrangements described herein related to performing a dynamic search. A search term can be received and a format of the search term can be identified. Based on the identified format of the search term, a field of a plurality of records can be selected to search, the field having a format matching the identified format of the search term. The field can be searched to identify at least a first of the plurality of records that at least partially matches the search term. At least a portion of at least the first of the plurality of records that at least partially matches the search term can be presented to a user.
    Type: Grant
    Filed: August 12, 2013
    Date of Patent: January 8, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ram Krishnamurthy, Susan K. McKinstry, Anders Swenson
  • Patent number: 10169407
    Abstract: A computer-implemented method is provided for storing process data. The method comprises allocating a storage area for the process data in the storage means, loading the process data, from the at least one source system, and storing the process steps according to a predetermined data structure in the allocated storage area of the storage means. The predetermined data structure comprises a first attribute, in which a unique identification of the process instance of the respective process step is stored, a second attribute, in which an identification of the respective process step is stored, and a third attribute, in which the sequence of the process steps within a process instance is stored. The method then sorts the process steps in the allocated storage area, wherein the process steps are first sorted according to the first attribute, and subsequently, according to the third attribute.
    Type: Grant
    Filed: September 4, 2015
    Date of Patent: January 1, 2019
    Assignee: CELONIS SE
    Inventors: Alexander Rinke, Martin Klenk, Bastian Nominacher
  • Patent number: 10162861
    Abstract: A computer-implemented method is provided for analysis of process data. The method comprises receiving an APE statement (Advanced Process Algebra Execution), wherein the APE statement defines a query of process instances from the storage means, and wherein the APE statement comprises at least one process operator, and executing the APE statement and reading the process instances according to the APE statement from the storage means, and providing the result of the query for further processing.
    Type: Grant
    Filed: September 4, 2015
    Date of Patent: December 25, 2018
    Assignee: CELONIS SE
    Inventors: Alexander Rinke, Martin Klenk, Bastian Nominacher
  • Patent number: 10157239
    Abstract: Techniques for identifying common neighbors of two nodes in a graph are provided. One technique involves performing a binary split search and/or a linear search. Another technique involves creating a segmenting index for a first neighbor list. A second neighbor list is scanned and, for each node indicated in the second neighbor list, the segmenting index is used to determine whether the node is also indicated in the first neighbor list. Techniques are also provided for counting the number of triangles. One technique involves pruning nodes from neighbor lists based on the node values of the nodes whose neighbor lists are being pruned. Another technique involves sorting the nodes in a node array (and, thus, their respective neighbor lists) based on the nodes' respective degrees prior to identifying common neighbors. In this way, when pruning the neighbor lists, the neighbor lists of the highly connected nodes are significantly reduced.
    Type: Grant
    Filed: December 23, 2013
    Date of Patent: December 18, 2018
    Assignee: Oracle International Corporation
    Inventors: Sungpack Hong, Martin Sevenich, Hassan Chafi
  • Patent number: 10146864
    Abstract: Embodiments of the invention relate to systems and methods for obtaining and/or organizing information related to documents cited in a source document. For example, a legal brief may cite authority, such as judicial opinions, in support of the arguments in the brief. Embodiments of the invention relate to automatic identification in a document of citations to authority and preparation of information related to the cited authorities. For example, in an embodiment of the invention, a report may comprise normalized expressions of one or more legal principles asserted in one or more cited opinions and information associated with the ongoing vitality of one or more the legal principles, the cited authority, or both.
    Type: Grant
    Filed: February 19, 2010
    Date of Patent: December 4, 2018
    Assignee: THE BUREAU OF NATIONAL AFFAIRS, INC.
    Inventor: Richard Douglas Kemp
  • Patent number: 10146805
    Abstract: A method of generating a test database from a deployed database by “sanitizing”, or removing sensitive data, is employed for recreating problem scenarios from a customer site, verifying compatibility of customer data with database version updates, and for performance testing using actual, rather than generated, database structures. In database management operations, in can be beneficial to use data generated from actual operational scenarios rather than artificially generated data created from a test pattern. Data generated from actual operation, such has at a customer site, assures compatibility with the relation patterns and record volumes employed by the customer (user). However, databases often contain sensitive information that would be inappropriate, illegal, or vulnerable in a testing environment. Accordingly, the generated test database overwrites sensitive data values with benign, or generic values while preserving the structure and relations of the data stored.
    Type: Grant
    Filed: April 7, 2014
    Date of Patent: December 4, 2018
    Assignee: EMC IP Holding Company LLC
    Inventors: Rajesh Kumar Gandhi, Venkata Ramana Rao Tiruveedi, Hanumantha Reddy Narayana, Pushpalatha Tantrady, Arun Kumar Palani, Anuragh Ravindran, Anitha Athipathy
  • Patent number: 10133776
    Abstract: A method, apparatus, and stored instructions are provided for transforming an initial query by eliminating a subquery nested within the initial query. The initial query may include an outer query that references a first instance of a particular data object. The initial query may also include set operator(s). At least a particular set operator may include a particular subquery that references a different instance of the particular data object. A query processor may transform the initial query to a transformed query that excludes the particular set operator and the particular subquery. The transformed query may instead include an added predicate that is based at least in part on the particular subquery. The added predicate may reference the first instance of the particular data object without referencing the different instance of the particular data object. The transformed query may be used for query execution instead of the initial query.
    Type: Grant
    Filed: June 20, 2013
    Date of Patent: November 20, 2018
    Assignee: Oracle International Corporation
    Inventors: Rafi Ahmed, Mohamed Zait
  • Patent number: 10120902
    Abstract: A database system includes a query planner with instructions executed by a processor to generate a logical plan tree. Each node of the logical plan tree is a distributed relational algebra operator. Each child node of the logical plan tree produces results processed by a parent node. The logical plan tree includes a distributed relational operator that reparations tuples of results that are at least 1 GB on a dimension and regroups the tuples on the dimension to avoid broadcasting the tuples between machines and thereby avoid consumption of network bandwidth associated with broadcasting the tuples. The logical plan tree is modified according to algebraic transformation rules. The logical plan tree is mapped to distributed query execution primitives. The distributed query execution primitives are processed on machines storing partitions of a distributed database table.
    Type: Grant
    Filed: February 20, 2014
    Date of Patent: November 6, 2018
    Assignee: Citus Data Bilgi Islemleri Ticaret A.S.
    Inventors: Ozgun Erdogan, Sumedh Pathak, Hadi Moshayedi, Metin Doslu
  • Patent number: 10120931
    Abstract: In embodiments of the disclosed technology, indexes, such as inverted indexes, are updated only as necessary to guarantee answer precision within predefined thresholds which are determined with little cost in comparison to the updates of the indexes themselves. With the present technology, a batch of daily updates can be processed in a matter of minutes, rather than a few hours for rebuilding an index, and a query may be answered with assurances that the results are accurate or within a threshold of accuracy.
    Type: Grant
    Filed: October 31, 2016
    Date of Patent: November 6, 2018
    Assignee: AT&T Intellectual Property I, L.P.
    Inventors: Marios Hadjieleftheriou, Nick Koudas, Divesh Srivastava
  • Patent number: 10114901
    Abstract: Systems and methods for real-time location-aware recommendations are discussed herein. In an example, a method for generating location-aware recommendations can include receiving a current location of a user, calculating a place graph for the user, traversing the place graph, selecting a recommendation, and communicating the recommendation. In this example, the place graph is calculated based on the current location. Traversing the place graph can identify one or more potential recommendations within a pre-defined distance of the current location.
    Type: Grant
    Filed: July 20, 2012
    Date of Patent: October 30, 2018
    Assignee: eBay Inc.
    Inventor: Ivan Mitrovic