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: 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: 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: Generating granular clusters for real-time processing is provided. The systems can identify tokens based on aggregating input from computing devices over a time interval. The systems can identify, based on metrics, a subset of tokens for cluster generation. The systems can generate, via a clustering technique, token clusters from the subset of the tokens, each of the token clusters comprising two or more tokens from the subset of the tokens. The systems can apply a de-duplication technique to each of the token clusters. The systems can apply a filtering technique to the token clusters to remove tokens erroneously grouped in a token cluster. The systems can assign, based on a selection process, a label for each of the token clusters. The systems can activate, based on a number of remaining tokens in each of the token clusters, a subset of the token clusters for real-time content selection.

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.

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 portable, hand-held computer functions as an intermediary between a database server and individual aircraft when the aircraft cannot be connected to the database server. By virtue of being portable and being locally linked (over time) to different aircraft, the intermediary computing device can provide the data upload validation and auditing for accurate billing of database usage for a flight database provided from the server. This ensures that each aircraft which receives an uploaded database is entitled to receive the upload based on a paid license. As a result, billing by the database vendor is based on usage. Licensing and data authentication is mediated by the intermediary computing device.

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.

Abstract: Generating a storage interface includes receiving a request for documents, detecting an accounting workflow type corresponding to request, and identifying a document organizational structure matching the accounting workflow type. Further, a virtual storage interface is built using an index on the documents and according to the document organizational structure, and presented.

Abstract: Methods and apparatus for extracting structured data from weblogs are disclosed. In some examples, the methods and apparatus include a web crawler to access a home page of a weblog, and identify a feed associated with the weblog. The methods and apparatus also include a feed finder to determine whether items in the feed contain sufficient content for feed-guided segmentation. The methods and apparatus also include a feed classifier to determine whether the items in the feed contain full content of the weblog. The methods and apparatus also include a wrapper to map data found in the feed into a representation of a weblog post, and screen scrape the weblog into the representation of the weblog post.

Abstract: Systems and methods are provided that automatically process a message input, construct an intelligent query based on the processing of the message input, and provide at least one attachable entity according to the processing results and the intelligent query. In some example aspects, a message is received. A natural language processor to determine if the message is requesting content may then process the message. If the message is determined to be requesting content, then candidate sub-queries may be generated to serve as a training set for a query that will be sent to an external search engine to retrieve the attachable entity. The sub-queries may be ranked in order of relevance and performance score. The highest ranked sub-queries may then be used in the actual query that is fired against the external search engine. The external search engine may search local and remote repositories for the top K most relevant attachable entities and present them to a user for attachment in a reply message.

Abstract: Method and system are provided for writing output from map-reduce jobs to an archive file. The method may include providing an archive manager and exposing an interface to be called from map-reduce jobs to output to an archive file in a map-reduce distributed file system. The method may also include using a buffering database as a temporary cache to buffer updates to the archive file. Handling by the archive manager calls from map-reduce jobs may allow: reading directly from an archive file or from a job index at the buffering database; writing to a job index at the buffering database used as a temporary cache to buffer updates; and serializing updates from the buffering database to the archive file.

Abstract: Systems and techniques for data tagging and task dataset generation are described herein. A set of context elements may be obtained for a data element in a data source. The set of context elements may be evaluated using a machine learning processor to embed one or more tags into the data element. A task to be completed by the user may be identified. A set of task tags may be determined that correspond to the task. The data source may be searched using the set of task tags to select the data element. A task dataset may be generated that includes the data element in response to the search.