Abstract: Systems, device and techniques are disclosed for a time series database search system. A data object may be received. The data object may include timestamp data indicating a time at which an event occurred, a value indicating a measure of the event, and key-value pairs comprising data associated with the event. A hash ID may be generated by hashing the one or more key-value pairs. The timestamp data, the value, and the hash ID may be stored in a first database as an object in the first database. The key-value pairs and the hash ID may be stored in a second database as an object in the second database.

Abstract: Techniques for implementing a non-relational database that makes efficient use of collections within the database. For one or more collections, two or more sub-collections can be created for storing documents. Each collection can be configured as a single partition entity or a partitioned entity within the database. Each sub-collection is identified by a sub-collection identifier. If the collection is configured as a partitioned entity, then a partition key can be determined for documents to be accessed in the collection. The partition key can be extended with the sub-collection ID to form a compound property (sub-collection ID, partition key) that determines placements of the respective documents in the identified sub-collection across partitions of the collection. If the collection is configured as a single partition entity, then a field for the partition key is ignored and the respective documents are placed in the identified sub-collection within the single partition of the collection.

Abstract: An aggregation service aggregates extraction results from diverse named entity recognition (“NER”) services, which can help improve the quality of extracted information. In some cases, the aggregation service considers differences in entity type classifications when aggregating extraction results from different NER services. The aggregation service can also consider performance characteristics (e.g., error rates) for the different NER services. For example, the aggregation service receives extraction results generated for a document corpus according to an entity type schema for each of multiple different NER services, then aggregates the extraction results based at least in part on relations between entity types for the NER services. For a given annotation area, the computing system can identify hypotheses and rank the hypotheses according to an aggregation approach.

Abstract: A compliance audit log of a data storage is obtained. The compliance audit log is analyzed to identify one or more files associated with a mounted storage volume that have changed since a previous backup snapshot of the mounted storage volume associated with the data storage. An incremental backup snapshot of the mounted storage volume is caused to be performed based on a result of the analysis of the compliance audit log.

Abstract: A data identifier for each data portion of a first group of different data portions of a first version of data is determined. The first version of the data is represented in a tree structure that references the determined data identifiers. A second version of the data is represented in a second tree structure using at least a portion of elements of the first tree structure of the first version. The second tree structure references one or more data identifiers of a portion of the second version of the data that is different from the first version of the data. The one or more data identifiers of the portion of the second version of the data that is different from the first version of the data are identified and sent. A response indicating which of the data portions corresponding to the sent one or more data identifiers are requested to be provided for replication is received.

Abstract: An approach is provided for searching multilingual documents. Structure components are extracted from multilingual documents. Based on the extracted components, the documents are grouped into classifications including respective sets of documents expressed in different respective natural languages. A natural language in a query is detected. One of the documents is selected based on the document having content indicated by the query and the natural language of the document matching the detected natural language. Structure components of the selected document are extracted. Based on the extracted structure components of the selected document, one of the classifications is identified as including the selected document. Other document(s) in the classification are identified and presented as having content that matches the content of the selected document. The natural language(s) of the other document(s) are each different from the natural language of the selected document.

Abstract: Examples relate to citation explanations. A process to provide citation explanation is provided herein. The process analyzes a primary document to extract a citation claim. The process generates a set of candidate segments of a cited document that may correspond to the citation claim. The process also analyzes the set of candidate segments.

Abstract: A request to migrate from a secondary storage system to a server a requested version of database content of a database backed up at the secondary storage system is received. A new version of the database content at the secondary storage system is instantiated. Functionality of the database is maintained including by allowing a database application hosted on the server to access the database content from the secondary storage system using the instantiated new version of the database content while migrating the requested version of database content from the secondary storage system to the server.

Abstract: A method may include in response to a user request for a playlist, identifying, by a processing device, a plurality of media items from the playlist, for each of the plurality of media items, determining whether a respective media item is available for a playback on a user device, in response to a determination that the respective media item is not available for the playback on the user device, causing the use device to advance to a next media item on the playlist without user interaction, and in response to a determination that the respective media item is available for the playback on the user device, causing the user device to play the respective media item.

Abstract: A rendering engine can generate a three-dimensional (3D) graph. The 3D graph can include a plurality of partitions contiguously connected. Each partition corresponds to a respective data record in a data set and a surface of each partition corresponds to a given parameter that references a given data field in the respective data record. Visual indicia of the surface of each partition can vary as a function of a value for the given data field of the respective data record.

Abstract: At least a portion of data of a tree data structure is serialized into a first set of flat data. At least a portion of a structure of the tree data structure is serialized to reproduce at least the portion of the structure in a second set of flat data. It is determined to access a desired data of the tree data structure from an archive. The second set of flat data is read to reconstitute at least the portion of a structure of the tree data structure. The reconstituted structure of the tree data structure is used to determine a data offset associated with the first set of flat data, wherein the data offset corresponds to the desired data. The desired data is accessed using the data offset associated with the first set of flat data.

Abstract: Disclosed herein is a method and system for generating an ontology based on plurality of tickets in an enterprise system 100. The method includes processing, by the enterprise system 100, input data associated with the plurality of tickets to obtain a structured data 228 associated with each of the plurality of tickets. Also, the method comprises performing multi-level clustering on the structured data 228 to obtain a plurality of clusters and corresponding error indicators, based on one or more parameters associated with the plurality of tickets. Further, the method comprises mapping each of the plurality of dusters with each of the error indicators, to obtain a mapped data at each cluster of the plurality of clusters and generating the ontology using the mapped data at each duster of the plurality of clusters, corresponding to the plurality of tickets.

Abstract: A pattern can be identified in at least part of a query whose definition is received in a query request. The identified pattern can be matched with a set of pre-defined patterns, each of which has associated therewith at least one pre-compiled query execution sub-component of a plurality of pre-compiled query execution sub-components retained in a library. A plan for executing the query can be generated, for example by incorporating the pre-compiled query execution sub-component associated with the matched pattern into the plan based on a pseudo code representation of the plan derived from the definition.

Abstract: A lock manager configured for locking files is tested. As part of the test and based on a lock assignment plan, a process acquires locks on portions of the files. Based on a lock testing plan, a second process performs a lock verification for a portion of the locked portions. A result of this lock verification is compared to its expected result. Based on an updated lock assignment plan, the process transitions from the locks to other locks on other portions of the files. Based on an updated lock testing plan, the second process performs a second lock verification for a portion of the other locked portions. A result of this second lock verification is compared to its expected result. Based at least in part on the two comparisons, the lock manager is evaluated.

Abstract: A lock manager configured for locking files is tested. As part of the test and based on a lock assignment plan, a process acquires locks on portions of the files. Based on a lock testing plan, a second process performs a lock verification for a portion of the locked portions. A result of this lock verification is compared to its expected result. Based on an updated lock assignment plan, the process transitions from the locks to other locks on other portions of the files. Based on an updated lock testing plan, the second process performs a second lock verification for a portion of the other locked portions. A result of this second lock verification is compared to its expected result. Based at least in part on the two comparisons, the lock manager is evaluated.

Abstract: Systems and methods for generating visualizations of a set of processed electronic documents are disclosed. According to certain aspects, a set of clusters may be generated to reflect similarities among content of a set of electronic documents. An electronic device may generate a visualization of the set of clusters, where the visualization may include a set of representations corresponding to the set of clusters. A user interface may display the visualization, where the representations may be positioned to reflect similarities and differences between a set of documents included in a target cluster and additional sets of documents included in additional clusters.

Abstract: A computer-implemented method of a database statement for a relational database. The database comprises one or more tables comprising one or more data rows. A database statement is received. A set of predicates from the database statement and a set of data rows from the tables to use to generate the result of the database statement are determined. A set of interdiction statements applicable to one or more data rows is obtained. For each predicate, a set of masks applicable to one or more data rows is obtained, where for each mask, the data masked by the mask is used by the predicate. It is determined if a data row has an applicable interdiction statement, and contains data masked by a mask. If so, the result of the database statement without using the result of applying the predicate to the data row.

Abstract: In an example embodiment, for each of a plurality of different titles in a social network structure, the title is mapped into a first vector having n coordinates, while kills are mapped into a second vector having n coordinates. The first and second vectors are stored in a deep representation data structure. One or more objective functions are applied to at least one combination of two or more of the vectors in the deep representation data structure. Then, an optimization test on each of the at least one combination is performed using a corresponding objective function output for each of the at least one combination of two or more of the vectors, and, for any combination that did not pass the optimization test, one or more coordinates for the vectors in the combination are altered so that the vectors in the combination become closer together within an n-dimensional space.

Abstract: An approach is provided in which an information handling system matches a set of documents, from a corpus of documents, to a query received from a client. The information handling system determines an amount of facets corresponding to the matching set of documents by dynamically dividing the corpus of documents into multiple sub-corpuses and performing complement facet counting on at least one of the sub-corpuses. In turn, the information handling system sends a set of results to the client that includes the determined amount of facets corresponding to the matching set of documents.

Abstract: An approach is provided in which an information handling system matches a set of documents, from a corpus of documents, to a query received from a client. The information handling system determines an amount of facets corresponding to the matching set of documents by dynamically dividing the corpus of documents into multiple sub-corpuses and performing complement facet counting on at least one of the sub-corpuses. In turn, the information handling system sends a set of results to the client that includes the determined amount of facets corresponding to the matching set of documents.