Patents Examined by Apu M Mofiz
  • Patent number: 11126626
    Abstract: A system and method for processing a group and aggregate query on a relation are disclosed. A database system determines whether assistance of a heterogeneous system (HS) of compute nodes is beneficial in performing the query. Assuming that the relation has been partitioned and loaded into the HS, the database system determines, in a compile phase, whether the HS has the functional capabilities to assist, and whether the cost and benefit favor performing the operation with the assistance of the HS. If the cost and benefit favor using the assistance of the HS, then the system enters the execution phase. The database system starts, in the execution phase, an optimal number of parallel processes to produce and consume the results from the compute nodes of the HS. After any needed transaction consistency checks, the results of the query are returned by the database system.
    Type: Grant
    Filed: February 11, 2019
    Date of Patent: September 21, 2021
    Assignee: Oracle International Corporation
    Inventors: Sabina Petride, Sam Idicula, Nipun Agarwal
  • Patent number: 11113303
    Abstract: A computer-implemented method for deploying a new artifact file in a database. The new artifact file provides specifications for one or more new run-time database objects to be created in the database by processing of the new artifact file by artifact-type specific conversion engines. The method includes assigning ownership of the one or more new run-time database objects to be created in the database to the new artifact file, and, when an existing database object in the database provided by another artifact file corresponds to a new run-time database object specified in the new artifact file, assigning ownership of the existing database object in the database to the new artifact file being deployed.
    Type: Grant
    Filed: July 28, 2016
    Date of Patent: September 7, 2021
    Assignee: SAP SE
    Inventors: Le-Huan Stefan Tran, Arne Harren, Jonathan Bregler, Alexander Bunte, Andreas Kellner, Daniel Kuntze, Vladislav Leonkev, Simon Lueders, Volker Sauermann, Michael Schnaubelt
  • Patent number: 11113240
    Abstract: In a system for efficiently organizing, storing, accessing, and analyzing project data and for visualizing project progress, for a specified project, a reference fractal-based structure is selected based on, at least in part, the type of the specified project and/or a mapping between project types and reference fractal-based structures. The project files are organized and stored in a file structure that corresponds to the selected reference fractal-based structure, so that the file structure can be transmogrified displayed as a viewable fractal-based structure, that can indicate process of different tasks and subtasks of the project based on, in part, the status of the tasks and subtasks that is derived from the project files.
    Type: Grant
    Filed: August 28, 2020
    Date of Patent: September 7, 2021
    Inventor: Peter Antony Gish
  • Patent number: 11106676
    Abstract: Techniques are described for efficient execution of analytical queries on large amounts of data in a parallel database cluster while making maximal use of the available hardware.
    Type: Grant
    Filed: December 23, 2014
    Date of Patent: August 31, 2021
    Assignee: SAP SE
    Inventors: Martin Weidner, Jonathan Dees, Peter Sanders
  • Patent number: 11106712
    Abstract: A server can receive a seed keyword to generate additional keywords relevant to the seed keyword. The server can identify, using a semantic relationship graph, keyword categories. Each keyword can have a semantic distance from the seed keyword less than a threshold. The server can generate, for each keyword of the keyword categories, a keyword-seed affinity score based on a frequency of the keyword occurring with the seed keyword on an information resource. The server can determine, for each keyword category, a category-seed affinity score based on the keyword-seed affinity scores for each of keyword in the keyword category. The server can compare each category-seed affinity score a threshold. The server can transmit, for display, the keywords. One keyword category can be indicated as selected and another keyword category can be indicated as unselected based on the comparison.
    Type: Grant
    Filed: October 24, 2016
    Date of Patent: August 31, 2021
    Assignee: Google LLC
    Inventors: Justin Lewis, Gavin James
  • Patent number: 11106725
    Abstract: A system and method are provide for searching, writing, editing, and publishing waveform shape information. A publishing module publishes a sequence of distinct shape code values in which each shape code value has the number of members, and the sum of the member values is the same for each shape code value.
    Type: Grant
    Filed: October 18, 2018
    Date of Patent: August 31, 2021
    Inventor: Harold T Fogg
  • Patent number: 11106653
    Abstract: Execution of an exclusive lock of a page in a database is initiated. Thereafter, subsequent to the initiation of the execution of the exclusive lock, at least one non-exclusive lock for the page in the database is received. The execution of the exclusive lock is selectively timed out based on at least one savepoint statistic. While the exclusive lock is timed out, at least one of the received non-exclusive locks is executed. Further, the exclusive lock can be restarted after the execution of the at least one of the received non-exclusive locks.
    Type: Grant
    Filed: May 3, 2018
    Date of Patent: August 31, 2021
    Assignee: SAP SE
    Inventors: Dirk Thomsen, Thorsten Glebe
  • Patent number: 11106646
    Abstract: An inline tree data structure and one or more auxiliary data structure encode a multitude of data records of a dataset; data fields of the dataset define a tree hierarchy. The inline tree comprises one binary string for each data record that are all the same length, are arranged in an ordered sequence that corresponds to the tree hierarchy, and include an indicator string indicating position in the tree hierarchy of each data record relative to an immediately adjacent data record. A search program is guided through the dataset by interrogating each indicator string in the inline tree data structure so as to reduce unnecessary interrogation of data field values.
    Type: Grant
    Filed: December 18, 2019
    Date of Patent: August 31, 2021
    Assignee: MOONSHADOW MOBILE, INC.
    Inventor: Roy W. Ward
  • Patent number: 11093561
    Abstract: In one embodiment, a method includes receiving a query comprising a query content object and constraints, generating a feature vector representing the query content object, accessing a sparse graph comprising nodes corresponding to candidate content objects represented by compact codes and links connecting the nodes, selecting an entry node, selecting similar content objects iteratively by identifying linked nodes of the entry node, decompressing the compact codes representing candidate content objects to generate feature vectors, selecting zero or more similar content objects based on a comparison between the feature vector representing the query content object and the feature vectors representing the candidate content objects, returning the selected similar content objects if a completion condition is satisfied, else repeating the iterative selection by using a linked node corresponding to a most similar content object as the entry node, and sending instructions for presenting one or more of the selected si
    Type: Grant
    Filed: December 10, 2018
    Date of Patent: August 17, 2021
    Assignee: Facebook, Inc.
    Inventors: Matthys Douze, Alexandre Sablayrolles, Hervé Jegou
  • Patent number: 11093340
    Abstract: Systems and methods for performing backups including incremental backups are provided. A change log is provided. The change log includes a map file that includes a bit for each inode in a file system. The bits are set on certain file events. The map file allows the files to be included in the next backup to be identified without having to trawl the entire file system. The change log also includes a data file that lists actual changes to the various files in corresponding records that are indexed by the inode number. The change log can enable faster incremental backups in part by eliminating unnecessary disk access requests.
    Type: Grant
    Filed: December 9, 2019
    Date of Patent: August 17, 2021
    Assignee: EMC IP HOLDING COMPANY LLC
    Inventors: Kedar S. Patwardhan, Suraj M. Multani
  • Patent number: 11093387
    Abstract: System generates data structure based on unique identifiers of objects in object storages and sets indicators in positions that correspond to hashes of unique identifiers of active objects. If a first number of regions of active data objects in first data storage and second number of regions of active data objects in second data storage each fail to satisfy data threshold, then system creates model identifying locations and sizes of regions of active data objects in first data storage and regions of active data objects in second data storage. System resets indicators in positions in data structure which correspond to hashes of unique identifiers of active data objects associated with model and enables remote storage to use model to copy regions of active data objects in first data storage and second data storage to third data storage, and to delete first data storage and second data storage.
    Type: Grant
    Filed: October 26, 2018
    Date of Patent: August 17, 2021
    Assignee: EMC IP Holding Company LLC
    Inventors: Ramprasad Chinthekindi, Abhinav Duggal, Kalidas Balakrishnan, Fani Jenkins
  • Patent number: 11093497
    Abstract: Techniques are described for a nearest neighbor search service that enables users to perform nearest neighbor searches. The nearest neighbor search service includes an interface that enables users to create collections of searchable vectors, add and update vectors to a collection, delete vectors from a collection, and perform searches for nearest neighbors to a given vector. The nearest neighbor search service enables users to add, update, and delete vectors of a collection in real-time while also enabling users to perform searches at the same time.
    Type: Grant
    Filed: March 23, 2018
    Date of Patent: August 17, 2021
    Assignee: Amazon Technologies, Inc.
    Inventors: Pracheer Gupta, Poorna Chand Srinivas Perumalla, Stefano Stefani
  • Patent number: 11086832
    Abstract: The subject matter disclosed herein relates to out of memory error handling in a database system. A database operation can be received by an in-memory database. The database operation can be for a database object stored in a database table that can be represented as a plurality of pages that can be persisted in a page chain. The in-memory database can reserve out of memory space sufficient to load a predetermined number of pages in the page chain into memory. The in-memory database can iteratively process each page in the page chain until completion of the database operation. The iterative process can include loading the page from persistence into memory of the in-memory database, performing at least a portion of the database operation using the loaded page, and unloading the page from the memory of the in-memory database. Related apparatus, systems, techniques, and articles are also described.
    Type: Grant
    Filed: October 16, 2015
    Date of Patent: August 10, 2021
    Assignee: SAP SE
    Inventors: Panfeng Zhou, Colin Florendo, Ivan Schreter, Thorsten Glebe, David Wein
  • Patent number: 11086941
    Abstract: The disclosure generally describes methods, software, and systems, including a method for generating suggestions for extensions to data sets. Using metadata for a plurality of documents, data relationships are determined between sets of documents of the plurality of documents. Each set of documents originates from different data sources and does not share common ontologies. The metadata includes terms and labels for documents in the plurality of documents. Using the determined data relationships, enhancement suggestions are determined. Each enhancement suggestion identifies pieces of information from at least one first document in the set of documents that can serve as an extension to information contained in a second document in the set of documents. The identified enhancement suggestions are ranked based on enhancement usability ranking factors. The ranked enhancement suggestions are provided.
    Type: Grant
    Filed: December 13, 2016
    Date of Patent: August 10, 2021
    Assignee: SAP SE
    Inventors: Andrey Engelko, Abdullah Amer
  • Patent number: 11080291
    Abstract: In one embodiment, the present disclosure pertains to downloading visualization data. Data visualizations in a user interface display may be created from remote data. Portions of the remote data may be downloaded to a local computer to recreate the data visualizations without the need for remote data requests. In another embodiment, a data export architecture includes jobs comprising a plurality of tasks configured in series. In one example embodiment, the jobs may correspond to particular data visualizations to be downloaded.
    Type: Grant
    Filed: August 2, 2017
    Date of Patent: August 3, 2021
    Assignee: SAP SE
    Inventors: Christopher Bolognese, Jonathan Tiu, Mohsen Asadi, Yijian Wang, Anthony Kohan, Chao Han, Sae-Won Om
  • Patent number: 11061904
    Abstract: Methods, computer program products, and systems are presented. The method computer program products, and systems can include, for instance: obtaining administrator user defined configuration data associating a certain dataset to a certain widget; examining historical matching data respecting past matches between a widget attribute of the certain widget and properties of the certain dataset; performing matching between the widget attribute of the widget and a dataset property of the dataset based on the examining historical matching data respecting past matches between a widget attribute of the certain widget and properties of the certain dataset, and running the certain widget in response to the performing matching to indicate at least one condition; and sending by a computing node a communication for correction of the at least one indicated condition.
    Type: Grant
    Filed: April 17, 2018
    Date of Patent: July 13, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Bobby Joseph, Mustansir Ali
  • Patent number: 11055266
    Abstract: In an example embodiment, a method comprises determining an ordered set of key entries; determining a first key entry for a first object in the ordered set of key entries; determining an object storage operation represented by a key of the first key entry; determining the object storage operation represented by the key of the first key entry to comprise a delete operation; and responsive to determining the object storage operation represented by the key of the first key entry to comprise the delete operation, skipping over subsequent key entries associated with the first object in the ordered set of key entries.
    Type: Grant
    Filed: June 15, 2018
    Date of Patent: July 6, 2021
    Assignee: Western Digital Technologies, Inc.
    Inventors: Carl Rene D'Halluin, Bastiaan Stougie, Koen De Keyser, Thomas Demoor
  • Patent number: 11055181
    Abstract: A computer implemented method implemented with a processor for assigning a unique identifier for a data item initially deployed at a cluster of a networked environment that includes determining a unique cluster identifier for the cluster of the networked environment, atomically modifying a local counter value at the cluster of the networked environment and appending the unique cluster identifier to the atomically modified local counter value at the cluster of the networked environment to form a unique ID for the data item.
    Type: Grant
    Filed: July 9, 2018
    Date of Patent: July 6, 2021
    Assignee: Nutanix, Inc.
    Inventors: Mohit Aron, Brian Byrne
  • Patent number: 11049071
    Abstract: A method performed by a physical computing device communicatively coupled to a computer network for creating an aggregate report of a presence of a user of the physical computing device on the network includes periodically searching the network with the physical computing device for content related to the user authored by a source other than the user, the searching being based on a unique set of identifiers associated with the user, dynamically updating the unique set of identifiers based on contextual trends within content returned as a result of the searching, and aggregating content published by the user to the network with the content returned as a result of the searching to form the aggregate report of the presence of the user on the network.
    Type: Grant
    Filed: December 4, 2017
    Date of Patent: June 29, 2021
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: John M. Lance, Eleni A. Rundle, Anuphinh P. Wanderski
  • Patent number: 11048679
    Abstract: Techniques herein map between key spaces to generate a balanced adaptive resolution histogram for dataset partitioning. In embodiments, a computer (C) creates a mapping that associates sparse keys (SKs) with distinct dense keys. C constructs a trie by processing each item of a dataset as follows. Based on the item, C obtains an SK. C navigates from a root NT (node of the trie) to a particular NT based on a sequence of dense digits (SDD). Each dense digit of the SDD is based on the mapping. Each NT identifies a dense prefix comprising dense digits. C assigns the item to a target node based on a threshold and count of items assigned to a subtree rooted at the particular node. C determines a range of SKs for each partition of the dataset, based on: an item count for a node or subtree, dense prefixes of NTs, and the mapping.
    Type: Grant
    Filed: October 31, 2017
    Date of Patent: June 29, 2021
    Assignee: Oracle International Corporation
    Inventors: Anantha Kiran Kandukuri, Sam Idicula