Abstract: Methods, systems, and computer program products for optimization of query processing in a data federation system using priority queuing techniques are provided. Priority queuing techniques may include generating a query vector corresponding to a query, comparing the query vector to historical query vectors to determine similarity, determining an expected processing time for the query based on the determined similarity, and inserting the query into a priority ordered queue at a particular position based on the expected processing time.

Abstract: Techniques for ordering predicates in column partitioned databases for query optimization. Predicates on a single CP table within a query are organized to predicate-CP nodes with various sets of column partitions. The predicates within each predicate-CP node and the predicate-CP nodes as a whole are ordered in ascending order of cost which is determined by CPU/IO cost and predicate selectivity. The reorganized query is then executed.

Abstract: Some embodiments improve object accessibility within a user interface based on a set of access patterns associated with the object. Improving accessibility for an object may include positioning a shortcut for the object to allow for quick access to the object. Another example includes executing commands to traverse a user interface, without receiving user input, to display a screen for accessing the object. Another example includes establishing a connection for accessing the object prior to receiving a request to access the object. A trigger for improving the accessibility for the object may be programmed based on a set of conditions detected when the object was previously accessed. Thereafter, detection of the same set of conditions triggers an improvement in the accessibility for the object. When the set of conditions corresponding to the trigger is no longer detected, the system may revert back to the default accessibility for the object.

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: Disclosed embodiments include apparatuses, methods and storage media associated with modifying a food record database. The method comprises receiving a plurality of food records from a plurality of sources, each of the plurality of food records comprising at least a food record description, the plurality of sources including (i) at least one non-user entity that is an owner of a third party food database and (ii) users of the food record database. The method further comprises receiving search requests from users, and returning one or more top search results from the food record database in response. The method also comprises determining a score for a particular food record identified by the top search results, wherein the score is calculated based at least in part on one of: a number of times the particular food record has been included in the top search results of the search requests or a number of times the particular food record has been logged.

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: Methods and systems for automatically upgrading or synchronizing a remote data management agent running on a remote host machine (e.g., a hardware server) to a particular version that is in-sync with a corresponding version used by a cluster of data storage nodes controlling the remote data management agent are described. The remote agent may be initially installed on the remote host and subsequent updates to the remote agent may be performed using the remote agent itself without requiring intervention by the remote host. The remote agent may comprise a backup agent and a bootstrap agent that are each exposed in different network ports or associated with different port numbers or networking addresses. The backup agent may perform data backup related tasks for backing up files stored on the remote host and the bootstrap agent may perform upgrade related tasks for upgrading the backup agent.

Abstract: A system includes a processor and a memory storing multiple records in a key-value data structure and processor executable instructions for managing access to records in the key-value data structure. The instructions are executable to perform operations including managing a shared atomic epoch counter and thread epoch counters, determining a maximal safe epoch as a function of the shared atomic epoch counter and the thread epoch counters, maintaining a drain list of trigger actions, and triggering the trigger actions in the drain list as a function of an update of the shared atomic epoch counter and the maximal safe epoch.

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.

Abstract: Herein are high throughput techniques for incorporating cryptographic blockchains into relational data. In an embodiment, a computer indicates, in a database dictionary in a database, that a relational table is for blockchain storage. The relational table contains application column(s). In response to that indication, the relational table is associated with system column(s) that are unmodifiable by administrators and clients of the database. The system column(s) include a cryptographic hash column. A request to store a particular value in a particular application column is received from a client. In response to receiving the request, a cryptographic hash value is calculated for a new row for the relational table. In the relational table, the computer stores the new row that contains: the particular value in the particular application column, and the cryptographic hash value in the cryptographic hash column.

Abstract: The claimed subject matter includes techniques for offline evaluation of ranking functions. An example system includes a first module configured to receive production log data, the first module to pre-process the production log data to generate an exploration data set. The example system also includes a second module configured to perform offline estimation of online metrics for ranking functions using the exploration data set. The example system also includes a third module to evaluate a proposed ranking function by comparing the estimated online metrics to a set of baseline metrics of a baseline ranking function and detecting that the estimated online metrics of the proposed ranking function exceed, are lower than, or are within a predetermined range of the baseline metrics.

Abstract: A system and method for applying extended regular expressions against arbitrary data objects, wherein a state machine maintains an internal state model for the system, an object analysis server receives data objects from a data source, and the object analysis server analyzes the structure and contents of the objects, compares them against received search pattern, and directs the state machine to update the state model based on either or both of the analysis and comparison operations.

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.

Abstract: Embodiments of the present disclosure relate to a method for storage management, an electronic device, and a computer program product. According to an example implementation of the present disclosure, a method for storage management is provided, which comprises receiving an access request for target metadata from a user at a node among a plurality of nodes included in a data protection system, wherein the access request includes an identification of the target metadata; based on the identification, acquiring target access information corresponding to the identification from a set of access information for the user, wherein the target access information records information related to access to the target metadata; and if the target access information is acquired, determining the target metadata based on the target access information.

Abstract: A system including one or more processors and one or more non-transitory computer-readable media storing computing instructions configured to run on the one or more processors and perform receiving from an item catalog database a respective item description and respective attribute values for each item of a set of items; generating text embeddings using a text embedding model to represent the respective item description and the respective attribute values; generating a graph of the set of items from the item catalog database connected by a set of edges; training the text embedding model and a machine learning model using a neural loss function based on the graph; and automatically determining, based on the machine learning model, as trained, a gender label for each first item in which the gender classification is unlabeled and in which a respective quantity of respective attribute values for the each first item is at least a predetermined threshold. Other embodiments are disclosed.

Abstract: This invention relates to methods and systems for searching. It is particularly applicable to methods of searching which enable efficient identification of compatible portfolios. Embodiments of the invention propose methods of searching which address the huge search space issue associated with identifying compatible portfolios. In particular, embodiments of the invention start their search operations simultaneously from both sides by both trying to form valid portfolios from candidate products until a valid solution is found and trying to find conflicts from the defined compatibility rules until a conflict is found which leads to the conclusion that no valid solution exists. A conclusion from either process will stop the whole searching process which can significantly reduce blind and unnecessary searching in the whole search space.

Abstract: A system and method are presented in which known genetic attributes associated with a condition are used to seed the determination of additional attributes which are associated with the condition. Based on the learning, the additional attributes (genetic, behavioral, or both) provide for an increased correlation between the combined attributes and the condition. For behavioral attributes, a measure of the impact of the behavioral attribute on the risk of the condition can be transmitted to another device or system.

Abstract: A network-based service may be provided for facilitating queries for a number of items, such as travel services. A user may submit a query including criteria for determining one or more relevant items. Based on the submitted query, the network-based service may present the user with information regarding the actions of other similar users of the network-based service, such as searches performed by the other users. Based on this information, the user may elect to supplement the current query to conform to the actions for other users. In some embodiments, actions by other users may be based at least in part on a category of the querying user. By presenting actions of similar users, a current user may be enabled to select the most relevant query terms for identifying a desired item.