Abstract: A system, method, and computer-readable medium, including authoring and consolidating a semantic layer universe and at least one semantic layer extension (e.g., a collection of semantic layer entities) created on top of the objects of the semantic layer universe, the semantic layer universe and the one or more semantic layer extensions being linked via a repository relationship; and dynamically presenting a consolidated view of relevant objects from the semantic layer universe and possibly entities of the at least one semantic layer extension to provide a user with additional querying metadata.

Abstract: Systems and methods are disclosed for associating summarizations of visualizations of a data set based on affinities between the summarizations. For a data set, a number of summarizations may be created that summarizes the data set in different ways. The summarizations may be linked, such that selecting a data element of a first summarization causes display of a second summarization. To assist in linking of summarizations, suggested linkings between summarizations can be determined based on affinities of the two summarizations. Affinities can reflect similarities in the data content of the two summarizations, such as an output of a first summarization being a valid input to the second summarization.

Abstract: Aspects of the present disclosure involve a system comprising a computer-readable storage medium storing a program and method for determining zone identification reliability. The program and method provide for receiving plural page samples of a webpage or page group, each page sample of the plural page samples corresponding to a respective pageview of the webpage or page group; determining, for each page sample of the plural page samples, zone identification information for the page sample, the zone identification information indicating targets and zones identified by the targets for the page sample; detecting any identification errors with respect to the zone identification information for the plural page samples; and determining, based on the detecting, a reliability of the zone identification information.

Abstract: The present disclosure provides systems and methods for associating data with non-material concepts that allows for subsequent searching and retrieval of such non-material concepts. A concept definition is received that defines a concept identifier used for identifying data associated with the concept, and a plurality of discrete stages of the concept. Retrieved data is analyzed to determine if the data corresponds to the concept, and to determine at least one discrete stage of the concept definition that the data corresponds to. The data is stored in association with the concept identifier and the at least one discrete stage to allow for subsequent searching and retrieval. When a search request relating to the concept is received, the data associated with the different stages of the concept can be retrieved and output in a manner to capture the holistic nature of the concept.

Abstract: This application relates to systems and methods for automatically correcting labels in untrusted data based on a small sample of trusted data in a training database. In some examples, training data may be divided into a trusted dataset and an untrusted dataset using stratified sampling. An adversarial algorithm may be used to reassign labels in the data samples associated with the untrusted data based on a set of features in the data and labels in the trusted dataset. The untrusted dataset with the reassigned labels may then be used to train a machine learning model.

Abstract: Embodiments of the disclosure provide systems and methods for obtaining content for a workspace of a collaboration environment. According to one embodiment, a method for requesting and obtaining a content item for a workspace of a collaboration environment can comprise generating, by a cloud-based collaboration environment system, a content request identifying the content item and metadata for the content item. The requested metadata for the content item can be defined by a requestor of the content item and the content item and the metadata for the content item can be requested from a submitter. The generated content request can be provided by the cloud-based collaboration environment system to a computing device associated with the submitter. In response to the provided request, the content item and the requested metadata for the content item can be obtained by the cloud-based collaboration environment system from the computing device associated with the submitter.

Abstract: Embodiments of the present disclosure provide solutions for determining an elected search head captain is unqualified for the position, identifying a more qualified search head, and transferring the captain position to the more qualified search head. A method is provided that includes referencing qualification parameters in an elected search head captain, determining whether the newly elected search head captain is qualified for the position based on the parameters, identifying a more qualified search head to be the search head captain if the newly elected search head captain is determined to be unqualified for the position, and transferring the position of captain to the more qualified search head. The qualification parameters may include, for example, a pre-determined static flag set by an administrator of the search environment, and configuration replication status that corresponds to the most recent configuration state of the search head as recorded by the previous search head captain.

Abstract: The present disclosure provides solutions for determining the divergence (delta) between the current and previous reference data structures for mutable data in a search head. A method is provided that includes updating a pre-existing lookup table in a search head, generating a delta file that identifies the divergence between the updated and previous lookup table, and distributing the delta file to other components in the search environment. The compatibility of the delta file is checked with the local instance of the lookup table in each search component, and the lookup table is applied if compatibility is determined. However, if the delta file is determined to not be compatible with the current version of a local lookup table in an indexer, the entire lookup table sent to the requesting indexer instead.

Abstract: Case management systems and techniques are disclosed. In various embodiments, searching case instances is facilitated. An indication to create a composite index across hierarchical case nodes comprising a case model is received. Case instance data associated with the case model is used to generate the composite index. The composite index is made available to be used to optimize searches of a plurality of case instances with which the case instance data is associated.

Abstract: A system for confirming file integrity of automatically generated documents is disclosed. The system comprises one or more processors that execute instructions to receive a document template specifying one or more sections, each section comprising a set of labels for attributes and receive two or more automatically generated documents, each comprising the set of labels for attributes and values of each of those attributes. The system extracts the set of labels for attributes and values of each of those attributes from each of the two or more automatically generated documents. Finally, the system generates a tabular report comparing the values of each of the attributes and generates an alert for a human user if the value for any attribute in a first document is different from the value for that attribute in a second document.

Abstract: A data analysis system is provided in the invention. The data analysis system includes a storage device, a field-data-description-file generating module, and a general data readiness analysis module. The storage device stores a plurality of raw data. The field-data-description-file generating module generates the field-data-description files corresponding to the raw data. The general data readiness analysis module obtains a score of the consistency indicator of the raw data according to the field-data-description files. The general data readiness analysis module obtains the data of the category which needs to be analyzed from the raw data according to the category of each field-data-description file. The general data analysis module obtains the score of the completeness indicator, the score of the accuracy indicator, the score of the validity indicator, and the score of the compaction indicator which all correspond to the data of the category which needs to be analyzed.

Abstract: Compression of data that permits direct reconstruction of arbitrary portions of the uncompressed data. Also, the direct reconstruction of arbitrary portions of the uncompressed data. Conventional compression is done such that decompression has to begin either at the very beginning of the data, or at particular intervals (e.g., at block boundaries—every 64 kilobytes) within the data. However, the principles described herein permit decompression to begin at any point within the compressed data, without having to decompress any prior portion of the file. Thus, the principles described herein permit random access of the compressed data. In accordance with the principles described herein, this is accomplished by using an index that correlates positions within the uncompressed data with positions within the compressed data.

Abstract: Data cataloging has become a necessity for empowering organizations with analytical ability. Conventional cataloging systems may fail to provide proper visualization of data to the different stakeholders of an organization. The present disclosure provides a hierarchical dynamic cataloging system so that visualization of data at different levels would be possible for different stake holders. In the present disclosure, a hierarchical structure of algorithms and multiple stake holders along with relevant metadata is generated. Further, a catalog is generated by performing a mapping across components comprised in the hierarchical structure and identifying relationship across the components based on mapping. The catalog gets dynamically updated and provides a dynamic view of the algorithms and associated metadata to the multiple stakeholders of an organization.

Abstract: In one aspect, a fault intercepting computing device is provided. The fault intercepting computing devices receives a request message including an outdated key value from a client computing device, retrieves an updated key value from a key mapping database, generates a remapped request based on the request message by replacing the outdated key value with the updated key value in the request message, and transmits the remapped request to a host computing device. The fault intercepting computing device further receives an initial response from the host computing device including the updated key value, generates a surrogate response based on the initial response by replacing the updated key value with the outdated key value, appends a key remapped flag to the surrogate response, transmits the surrogate response, including the outdated key value to the client computing device.

Abstract: Garbage collection processing in a distributed shared log system includes a client identifying obsoleted log entries for a shared data object. The client sends information associated with the identified obsoleted log entries to a shared log server. The shared log server receives information associated with obsoleted log entries from all clients in the distributed shared log system and uses the information to delete the obsoleted log entries. The shared log server can update a snapshot mark to indicate the earliest time that a snapshot of the shared log can be taken. The snapshot mark can be updated based on the information associated with obsoleted log entries.

Abstract: Methods and devices for simplifying data collected from assets are provided. An example method involves obtaining raw data from a data source at an asset, determining whether a data logging trigger is satisfied, and, when satisfied, performing a dataset simplification algorithm on the raw data to generate a simplified set of data in which interpolation error is limited by an upper bound that is fixed across the simplified set of data.

Abstract: Techniques are disclosed relating to determining whether a set of database schemas are different. A computer system may receive a request to create a snapshot for a set of data stored in a database having a first database schema. In response to receiving the request, the computer system may create the snapshot for the set of data. As part of the creating, the computer system may generate, based on the first database schema, a first hierarchy of hash values that includes a first root hash value for the first database schema. The first hierarchy of hash values may be usable to determine whether the first database schema is different from a second database schema. The computer system may include the first hierarchy of hash values with the snapshot.

Abstract: A flexible, scalable, and fast query system for a distributed execution environment is provided. An example method includes receiving a plurality of processor summaries, each including a list of job digests, each job digest including a job identifier for a job running on a job processor and a payload portion. The method can also include, for each job digest, determining a location in a probabilistic payload data structure for the job digest and storing the payload portion and a fingerprint portion generated from a portion of a hash of the job identifier in an entry at the location as a job summary and responding to queries using the probabilistic payload data structure. Responding to a particular query may include identifying job properties corresponding to parameters of the particular query, updating job property statistics, and using the job property statistics to change the job properties represented in the payload portion.

Abstract: Disclosed herein is a data structure that reduces computational load on a database in querying and visualizing historical values of slowly changing dimensions. The slowly changing dimensions have one or more values associated with them (e.g., a monthly average accounts receivable is a single value, and a set of contact information for an individual may have multiple values). On a periodic basis, database images, also known as “snapshots” are generated of a current status of a given database. The snapshots are used to build a historical data table that is computationally efficient to reference.

Abstract: A processor may filter data to generate a subset of the data less than an entire set of the data. The subset may include at least one string and at least one numeric value. The processor may match the at least one string and the at least one numeric value to one of a plurality of archetypes by applying a clustering algorithm. Each archetype may include a subset of archetype data less than an entire set of archetype data. The processor may compare the entire set of data to the entire set of archetype data to identify at least one difference between the entire set of data and the entire set of archetype data. The processor may apply at least one optimization to address the at least one difference.