Patents Examined by Yicun Wu
  • Patent number: 10282379
    Abstract: Various embodiments are generally directed to techniques for generating effective visualizations of some or all of a storage cluster system. An apparatus includes an API component of a visualization server to make an API available to be called by another device via a network to request information associated with an object that represents a component of a storage cluster system; and a translation component of the visualization server to, in response to a call to the API received via the network that requests information associated with the object, generate query instructions to search for a system entry corresponding to the storage cluster system within a system database and to search for the requested information within the system entry.
    Type: Grant
    Filed: October 30, 2015
    Date of Patent: May 7, 2019
    Assignee: NETAPP, INC.
    Inventors: Apoorva Sareen, Shankar Pasupathy, Ross Ackerman
  • Patent number: 10268706
    Abstract: Embodiments of the present invention provide methods, systems, and computer program products for prioritizing database failover. In one embodiment, an order in which to failover databases is determined based on a priority order of databases and the time at which the failover process occurs, which can be used to help reduce possible down time users can experience while waiting for the database most important to them to be failed over.
    Type: Grant
    Filed: October 12, 2015
    Date of Patent: April 23, 2019
    Assignee: International Business Machines Corporation
    Inventors: Juilee S. Hapse, Priyanka K. Joshi, Nishant Sinha
  • Patent number: 10248684
    Abstract: The disclosed embodiments provide a system that manages synchronization between a profile store and a source of truth that is used to update the profile store via a real-time link. During operation, the system selects a profile for an entity in the profile store for use in verifying the synchronization between the profile store and the source of truth based on an access pattern associated with the profile store. Next, the system obtains a first set of attributes from a profile for an entity in the profile store and a second set of attributes for the entity from the source of truth. The system then compares the first and second sets of attributes to detect and correct mismatches between the first and second sets of attributes, wherein the corrected mismatches improve subsequent use of the profile in the profile store by the set of remote offerings.
    Type: Grant
    Filed: October 30, 2015
    Date of Patent: April 2, 2019
    Assignee: INTUIT INC.
    Inventors: Tobias Ullrich, Lars Pfannenschmidt, Frank Wisniewski, Thorsten Kr├╝ger, Shabbir Y. Rajgara, Guohan Gao
  • Patent number: 10242107
    Abstract: Systems and methods for extracting and organizing quantitative content with a corresponding topic in regard to a particular, desired event, from a body of user posts is presented. More particularly, nearly ubiquitously a body of user posts includes a substantial amount of highly relevant and interesting information goes largely unprocessed and widely inaccessible. According to the disclosed subject matter, a body/corpus of user posts is filtered according to a desired event such that those user posts relating to a desired event is identified. Additionally, the user posts are also filtered according to whether or not the user posts include a quantitative value. An analysis of the filtered user posts is conducted to extract, for qualifying user posts, a quantitative tuple comprising a quantitative value and a corresponding topic.
    Type: Grant
    Filed: January 11, 2015
    Date of Patent: March 26, 2019
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Omar Alonso, Thibault Henri Joseph Sellam
  • Patent number: 10216799
    Abstract: Query handling devices in a federated database system and related methods and computer program products for handling queries in the federated database system are disclosed. The query handling device receives database queries directed towards a group of databases from several applications and filters the queries based on common query rules such as common query syntax, investigates the queries that have passed the filtering, and sends the investigated queries to the databases. The investigation includes prioritising between at least some queries according to a query prioritisation scheme. The prioritised queries are sent according to the query prioritisation scheme.
    Type: Grant
    Filed: October 19, 2012
    Date of Patent: February 26, 2019
    Assignee: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Manoj Prasanna Kumar, Subramanian Shivashankar, Jawad Mohamed Zahoor
  • Patent number: 10209899
    Abstract: Embodiments relate to off-loading aspects of storage virtualization to storage hardware and modifying software to take advantage of hardware virtualization features. A co-design of hardware and software allows a filesystem to provide files such that indirection overhead normally needed to access the content of files can be bypassed while still managing the files as filesystem objects. A storage device manages and exposes a virtual volume which is used to store the content of a file. Virtual volumes can be initialized or populated so that virtual blocks therein align with device storage blocks. A virtual volume can be initialized and populated by parsing a virtual disk file to access virtual disk metadata, which is then used to determine and set features of the virtual volume.
    Type: Grant
    Filed: November 6, 2015
    Date of Patent: February 19, 2019
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Jacob Oshins, Neal Christiansen
  • Patent number: 10204138
    Abstract: Methods, systems, and apparatus, including computer program products, for identifying navigational resources for queries. In an aspect, a candidate query in a query sequence is selected, and a revised query subsequent to the candidate query in the query sequence is selected. If a quality score for the revised query is greater than a quality score threshold and a navigation score for the revised query is greater than a navigation score threshold, then a navigational resource for the revised query is identified and associated with the candidate query. The association specifies the navigational resource as being relevant to the candidate query in a search operation.
    Type: Grant
    Filed: November 10, 2015
    Date of Patent: February 12, 2019
    Assignee: Google LLC
    Inventors: Trystan G. Upstill, Henele I. Adams, Eric Lehman, Neesha Subramaniam, Wensi Xi, Sundeep Tirumalareddy
  • Patent number: 10198522
    Abstract: A system and method for creating an index of native application content indexable by a search engine is disclosed herein. The system includes a content server, a web server, and a URL to native mobile application mapping database comprising a plurality of web content and a plurality of native mobile application content. The content server is configured to serve up the content as both a native mobile application and a web based application.
    Type: Grant
    Filed: April 12, 2015
    Date of Patent: February 5, 2019
    Assignee: Joingo, LLC
    Inventors: Stephen S. Boyle, Russell S. Greer, Thang Dao, Ha Do
  • Patent number: 10180984
    Abstract: Provided are techniques for providing and using pivot facets for text mining and search. A metadata field is mapped to a pivot facet. In response to executing a first query, at least a first document and the pivot facet are displayed. In response to selection of the pivot facet, a second query that includes a value of the metadata field is generated, and the second query is executed to locate at least a second document that includes the value of the metadata field.
    Type: Grant
    Filed: September 24, 2014
    Date of Patent: January 15, 2019
    Assignee: International Business Machines Corporation
    Inventors: Barton W. Emanuel, Todd Leyba
  • Patent number: 10157201
    Abstract: A method of searching for and providing information about a natural language query having a simple or complex sentence structure, includes: generating a mashup query language having a tree structure in a plurality of levels based on at least one query entity included in a natural language query language via a semantic analysis of the natural language query language; determining whether the plurality of levels are linked through a query entity forming each of the plurality of levels based on attribute information of the mashup query language; searching for data corresponding to the query entity forming each of the plurality of levels from a knowledge database based on a result of the determining, and deriving main information and at least one piece of entity information corresponding to the natural language query language from found data; and laying out a search result screen including the main information and the at least one piece of entity information.
    Type: Grant
    Filed: July 10, 2015
    Date of Patent: December 18, 2018
    Assignee: NAVER Corporation
    Inventors: Jae Hyeok Chang, Ki Young Kim, Myeong Seok Kim, Ji Hye Choi, Won Jin Lee, Hyun Ah Lee, Yong Hun Lee
  • Patent number: 10152557
    Abstract: Systems and methods offer an efficient approach to computing similarity rankings in bipartite graphs. An example system includes at least one processor and memory storing a bipartite graph having a first set and a second set of nodes, with nodes in the first set being connected to nodes in the second set by edges. The memory also stores instructions that, when executed by the at least one processor, cause the system to assign each node in the second set to one of a plurality of categories and, for each of the plurality of categories, generate a subgraph. The subgraph comprises of a subset of nodes in the first set and edges linking the nodes in the subset, where the nodes in the subset are selected based on connection to a node in the second set that is assigned to the category. The system uses the subgraph to respond to queries.
    Type: Grant
    Filed: May 15, 2014
    Date of Patent: December 11, 2018
    Assignee: Google LLC
    Inventors: Seyed Vahab Mirrokni Banadaki, Silvio Lattanzi, Jonathan Ezra Feldman, Alessandro Epasto, Stefano Leonardi, Hugh Lynch, Varun Sharma
  • Patent number: 10120897
    Abstract: Embodiments of the present invention provide a method, system and computer program product for the seamless integration of an application with an in memory data grid. In an embodiment of the invention, a method for intercepting database queries from a computer program for delegation to an in memory data grid is provided. The method includes retrieving database queries from a database driver for a database management system from a requesting computer program and comparing at least a portion of each of the database queries to a listing of database queries. Thereafter, the database queries are selectively routed to a data grid, such as an in memory data grid, in lieu of the database management based upon the comparison.
    Type: Grant
    Filed: June 6, 2011
    Date of Patent: November 6, 2018
    Assignee: International Business Machines Corporation
    Inventors: Snehal S. Antani, Kulvir S. Bhogal, Nitin Gaur, Christopher D. Johnson
  • Patent number: 10101965
    Abstract: Sorting algorithms are generally used at different steps in data processing. In many situations, the efficiency of the sorting algorithm used determines the throughput/execution speed of the application. Methods for implementing high speed sorting in hardware are often based on Batcher's Odd/Even sort or Bitonic sort algorithms. These algorithms are computation intensive and involve high number of logic gates to implement and high power consumption. The higher the number of logic gates, the more silicon area may be required and may lead to higher cost. Insertion sort is a sorting algorithm that is relatively simpler and may require fewer logic gates to implement. However, throughput achieved using Insertion sort algorithm is much lower than the throughput achieved using high speed sorting algorithms. A method and apparatus enable an efficient hardware design capable of simultaneously sorting multiple data inputs for high throughput at reduced complexity.
    Type: Grant
    Filed: October 28, 2015
    Date of Patent: October 16, 2018
    Assignee: MBIT WIRELESS, INC.
    Inventors: Raghavendra H. Bhat, Bhaskar Patel
  • Patent number: 10102239
    Abstract: The disclosure generally describes methods, software, and systems, including a method for event notification associated with changed data objects. A change to a data object associated with a change notification rule is identified. The change notification rule defines at least one target system to be notified in response to changes to a data set. A notification event identifying the data object associated with the change is generated substantially instantaneously in response to the identified change. Substantially instantaneously and in response to the generation of the notification event, the notification event is sent to the at least one target system defined by the change notification rules. A request for the changed data object is received in response to the sent notification event. The changed data object is provided to the target system.
    Type: Grant
    Filed: July 13, 2015
    Date of Patent: October 16, 2018
    Assignee: SAP SE
    Inventor: Masoud Aghadavoodi Jolfaei
  • Patent number: 10095801
    Abstract: Interaction is provided between a first content set and a second content set, both of which are loaded into a data structure. When an event associated with loading of the second content set is detected, the second content set is parsed to identify at least one sub-set of the second content set. The identified sub-set is checked against a first data set associated with the first content set to determine whether the identified sub-set matches the first data set. If a match is found, an action associated with the least one identified sub-set is executed and the data structure is modified.
    Type: Grant
    Filed: August 17, 2015
    Date of Patent: October 9, 2018
    Inventor: Julian L. Friedman
  • Patent number: 10089085
    Abstract: From a present version of a first artifact which is mutable, an artifact baseline corresponding to the present version of the first artifact can be created. Responsive to creating the artifact baseline, the present version of the first artifact can be made immutable. Present versions of children artifacts of the present version of the first artifact which are mutable also can be made immutable. Responsive to identifying a change to the present version of the first artifact, a new version of the first artifact can be automatically created, wherein the new version of the first artifact is mutable.
    Type: Grant
    Filed: October 25, 2016
    Date of Patent: October 2, 2018
    Inventors: Nicholas D. J. Crossley, Troy R. Dugger, David J. Honey, Samuel Sung-Ok Lee, Schuyler B. Matthews, Darcy L. Wiborg Weber
  • Patent number: 10083234
    Abstract: In embodiments, the present invention provides a method and system for delivery of content on a mobile media platform, providing an automated tag processing facility, and delivering content to a mobile device, wherein content delivery is based at least in part on the automated tag processing.
    Type: Grant
    Filed: September 30, 2014
    Date of Patent: September 25, 2018
    Inventors: Kavi Maharajh, Bart MacNeil, Torin Walker
  • Patent number: 10078624
    Abstract: There is disclosed a computer-implemented method for generating a hierarchical data structure. The computer-implemented method can be executable at a server. The computer implemented method comprises: identifying a plurality of data elements to be searched, the plurality of data elements having a set of descriptors, each descriptor within the set of descriptors being associated with a data type being different from data types of other descriptors within the set of descriptors; defining the hierarchical data structure, having a first level and a second level.
    Type: Grant
    Filed: April 8, 2015
    Date of Patent: September 18, 2018
    Assignee: Yandex Europe AG
    Inventor: Leonid Leonidovich Nalchadzhi
  • Patent number: 10073979
    Abstract: Disclosed is a method, system, and program for providing access to spatial data. A request for data is received. Enterprise and third party data are integrated. The integrated data is processed. Spatially referenced results are generated using the processed data. The spatially referenced results are returned in response to the request.
    Type: Grant
    Filed: February 6, 2015
    Date of Patent: September 11, 2018
    Inventors: Tim A. Von Kaenel, David Neil Dyrnaes, C. Suresh Kumar, Jared Paul Wayman, Jonathan David Goodwin, Craig Evan Trivelpiece, Joseph Mihalich, Anthony Page Jenkins, Richard Hoyt Odom, Jr., Mark Andrew Stier, Anne Janetta Obee
  • Patent number: 10061810
    Abstract: An administrator may wish to limit the number of tuples that may be spawned as a result of a first tuple entering an operator graph. A first stream operator may receive a first tuple in order to perform an operation on the first tuple to generate a second tuple. The first stream operator may determine whether it is permitted to generate the second tuple by comparing the first tuple's tuple spawn counts to a tuple creation policy. If the first stream operator is permitted to generate the second tuple, the first stream operator may perform the operation on the first tuple and generate the second tuple.
    Type: Grant
    Filed: April 13, 2015
    Date of Patent: August 28, 2018
    Assignee: International Business Machines Corporation
    Inventors: Eric L. Barsness, Michael J. Branson, John M. Santosuosso