Abstract: In accordance with one or more embodiments of the invention, a method and system are provided of processing a search query entered by a user of a device having a text input interface with overloaded keys. The search query is directed at identifying an item from a set of items. Each of the items has one or more associated descriptors. The system receives from the user an ambiguous search query directed at identifying a desired item. The search query is a prefix substring of each of at least two words relating to the desired item. The system dynamically identifies a group of one or more items from the set of items having one or more descriptors matching the search query as the user enters each character of the search query. The system outputs identification of the one or more items of the identified group to be displayed on the device operated by the user.

Abstract: A content staging system includes a content engine structured to receive content including a plurality of dataset elements from a content source, determine whether a content amount of the received content exceeds a memory capacity threshold, and auto-switch between memory and a file system during content processing based on the content amount. The content staging system includes a processing engine communicably coupled to the content engine. The processing engine is structured to receive the content including a plurality of dataset elements, and transform the plurality of dataset elements based on a source agnostic file definition format. The source agnostic file definition format supports content encryption, track a field of the plurality of dataset elements, or a combination thereof.

Abstract: A method includes receiving a piece of data at an upper-layer server of a multi-tiered storage system comprising the upper-layer server and a block server, and determining a signature for the piece of data. A first bloom filter stored on the upper-layer server is a copy of a second bloom filter stored on the block server. The first bloom filter is checked for the signature. When a match is found in the first bloom filter, the piece of data is sent for storage at the block server, and it is verified at the block server whether a match is present for the piece of data. When a match is present, the piece of data is deduplicated. When a match is not present, the piece of data is stored. When a match is not found in the first bloom filter, the piece of data is stored in the block server.

Abstract: Rollback snapshots are created by a storage system when host servers are retired. The rollback snapshots include a masking views and information about the storage objects associated with the host servers. Retired host servers can be recovered by using the rollback snapshots to reconstruct masking views and recreate storage objects.

Abstract: Technology of the disclosure may facilitate user discovery of various voice-based action queries that can be spoken to initiate computer-based actions, such as voice-based action queries that can be provided as spoken input to a computing device to initiate computer-based actions that are particularized to content being viewed or otherwise consumed by the user on the computing device. Some implementations are generally directed to determining, in view of content recently viewed by a user on a computing device, at least one suggested voice-based action query for presentation via the computing device. Some implementations are additionally or alternatively generally directed to receiving at least one suggested voice-based action query at a computing device and providing the suggested voice-based action query as a suggestion in response to input to initiate providing of a voice-based query via the computing device.

Abstract: Delta sets that are distributed for asynchronous replication of a storage object are stored at each storage array that maintains a replica of the storage object. In the event of a disaster for which recovery of the storage object is part of the disaster response, locally stored delta sets are used to recover the locally stored replica of the storage object at each storage array. For example, the most recent versions of maliciously altered or lost blocks or tracks may be recovered from the locally stored delta sets.

Abstract: Embodiments of small file restore process in deduplication file system wherein restoration requires issuing a read request within an I/O request to the file system. The process places the files in a prefetch queue such that a combined size of the files meets or exceeds a size of the prefetch queue as defined by a prefetch horizon. A file handler disassociates prefetch streams from read streams. The handler prefetches the read operations and stores them in memory. The stream corresponding to a read will only open as the read requests hit the queue processor. As a result, the stream usage is very low, since the I/O, worker threads and the read streams are disassociated from each other.

Abstract: The present disclosure relates to fault repair methods for a database system. In one example method, when working normally, a master node backs up, to a global buffer pool (GBP) node by using a data transmission protocol with a low latency and a high throughput (for example, a remote direct memory access (RDMA) protocol), a modified page generated because of transaction modification. When the master node is faulty, a standby node does not need to replay all remaining replay logs that are not replayed, but only needs to replay redo logs corresponding to a page that does not exist on the GBP node and pages that are not sequentially arranged and obtain the pages.

Abstract: Search integration is described. The actions include receiving, by one or more processors, a query. The actions include identifying search results that are responsive to the query. The actions include identifying, based on the query and the search results, structured data to supplement the search results, wherein the structured data is generated from binary table data that is received and deserialized by one or more processing modules. The actions include processing the structured data and the search results. The actions include providing, for output, the processed search results and the processed structured data results.

Abstract: A method for determining size information related one or more snapshots related to file systems stored in a storage system, the method may include (a) sampling one or more combinations of points in time and logical spaces, the logical spaces are associated with the one or more file systems to provide sampled combinations of sampled portions of file system entities (FSEs) and sampled points in time; (b) searching for relevant snapshots that are relevant to the sampled combinations to provide relevant snapshots at the sampled points in time; and (c) determining physical sizes of the relevant snapshots at the sampled point in time; wherein a number of samples per sampled FSE is indicative of a size of the sampled FSEs.

Abstract: A key-value engine of a storage system may perform a restart recovery after a system failure. The key-value engine may read a metadata log to locate a latest system checkpoint, and load a page mapping table from the latest system checkpoint. The key-value engine may replay to apply changes to the page mapping table from a system transaction log starting from a system transaction replay starting point. The key-value engine may further form one or more read-only replicas using an underlying file stream opened in a read-only mode during the recovery after the system failure to further facilitate fast recovery and provide fast response to user transactions that conduct read only transactions after the system failure.

Abstract: Systems and methods are described to a database comprising multiple database records, where each database record comprises an attribute of a content item consumed by a user and an indication of a user device used by the user to consume the content item, and is associated with an indication of whether a content provider should be granted access to the respective database record. An option to modify whether or not the content provider should be granted access to the respective database record is provided for each database record of the database records, and each database record that is associated with an indication that the content provider should be granted access is transmitted to the content provider, to enable the content provider to generate and transmit a content recommendation based on at least one of the database records transmitted to the content provider.

Abstract: Systems and methods for architecture embeddings for efficient dynamic synthetic data generation are disclosed. The disclosed systems and methods may include a system for generating synthetic data configured to perform operations. The operations may include retrieving a set of rules associated with a first data profile and generating, by executing a hyperparameter search, a plurality of hyperparameter sets for generative adversarial networks (GANs) that satisfy the set of rules. The operations may include generating mappings between the hyperparameter sets and the first data profile and storing the mappings in a hyperparameter library. The operations may include receiving a request for synthetic data, the request indicating a second data profile and selecting, from the mappings in the hyperparameter library, a hyperparameter set mapped to the second data profile. The operations may include building a GAN using the selected hyperparameter set and generating, using the GAN, a synthetic data set.

Abstract: Techniques are disclosed for adjusting a ranking of information content presented to a user based on voice-of-customer feedback. In one embodiment, a user may provide feedback on information content presented to the user. Such feedback may be evaluated to identify at least one topic referenced in the received feedback. If an application determines that the at least one topic is related to topics of the information content, the application determines sentiment regarding the information content based on the feedback, and adjusts a ranking of the information content based on the determined sentiment.

Abstract: An SCP data mirroring system includes a chassis housing a central processing system and an SCP subsystem. The SCP subsystem includes an SCP memory system with different priority storage queues each storing a copy of data provided by the central processing system, along with an SCP communication system and an SCP data storage subsystem. During a first time period, the SCP data storage subsystem retrieves a first copy of the data from a first storage queue in the SCP memory system and transmits it via the SCP communication system and through a network for storage on first storage device(s). During a subsequent second time period, the SCP data storage system retrieves a second copy of the data from a lower priority second storage queue in the SCP memory system and transmits it via the SCP communication system and through the network for storage on second storage device(s).

Abstract: A current retention mode is identified as being one of conservative or aggressive. When the retention mode is identified as aggressive, a check is made as to whether used space on backup storage is below a lower threshold. If the used space is below the lower threshold, a switch is made into the conservative mode. If the used space is above the lower threshold, the aggressive mode is maintained. While in the aggressive mode, a backup chain of a database is selected for pruning, the selected backup chain having a shortest retention term of all backup chains not yet pruned and not being a latest backup chain. Log backups of the database in the selected backup chain are identified. Each log backup that has expired is deleted regardless of dependency of other backups on an expired log backup.

Abstract: Disclosed herein are system, method, and computer tangible medium embodiments for generating a relational database model from a model view that provides an estimate for generating query plan for a query on the model view, according to an embodiment. A join model of a model view set on one or more database tables is received. At least one index conversion of the join model is performed, where the index conversion converts at least one index in the join model into at least one leaf node in a relational model tree. At least one join conversion of the join model is performed where the at least one join conversion generates a node in the relational model tree that joins a first and second leaf nodes in the relational model tree. A requested parameter conversion is performed, where the requested parameter conversion includes an attribute or key figure requested by a query.

Abstract: According to one embodiment, an information management device includes an individual information manager configured to allocate a second identifier to a second individual obtained by performing a first operation on a first individual to which a first identifier is allocated; and a data generator configured to generate first data including the first identifier, the first operation, and the second identifier.

Abstract: Described is a system (and method) for efficient access-based reallocation of backup data stored within an object storage. The system may implement various specialized procedures to efficiently store and manage backup data within the object storage. These procedures may include packing backup data into objects to improve data operation efficiency. The system may also conserve storage space on the object storage by performing an analysis to reallocate backup data as necessary. For example, data may be stored in objects in an immutable manner, and thus, the system may efficiently reallocate data to new objects based on data access patterns. For example, the system may determine an access pattern associated with live data remaining within the first object satisfies a condition, and in response, reallocated the live data to a new object.

Abstract: Recovery of an in-memory database is initiated. Thereafter, pages for recovery having a size equal to or below a pre-defined threshold are copied to a superblock. For each copied page, encryption information is added to a superblock control block for the superblock. The copied pages are encrypted within the superblock using the corresponding encryption information added to the super block control block. The superblock is then flushed from memory (e.g., main memory, etc.) of the database to physical persistence.