Abstract: Methods and systems are described herein for facilitating data integrity processes using measures of statistical dispersion (e.g., gini impurities) of dataset features. The described mechanism may be also be used for selection and dimensionality reduction. Dimensionality reduction may enable storing the dataset using less storage space or performing other operations on the dataset using less resources. In some embodiments, the above described mechanism may be used for supervised categorial clustering and/or categorical classification.

Abstract: The present disclosure relates to restricting generation and delivery of insights to data source providers. Electronic activities and record objects may be accessed. Each record object may correspond to a record object type and have one or more object field-value pairs. Node profiles may be maintained. Updates to a node graph or corresponding to a record object may be detected. A number of data source providers having respective electronic activities or record objects from which the update to the node graph or corresponding to the record object can be determined. Provisioning of a content item to a second data source provider may be restricted.

Abstract: A method and apparatus for converting code-description table data to an enumerated data type in a schema record referencing the code-description table. A record of a table is identified that references the code-description table, and a portion of a schema describing the record is updated to include the relevant data of the code-description table as an enumerated type of the record schema. The enumerated type schema element includes data elements of the code-description table relevant to the record, each element having its own type. As additional records of the same table that are related to the code-description table are called, the enumerated type schema element may be updated to include additional code-description table data elements.

Abstract: Case management systems and techniques are disclosed. In various embodiments, for each of a plurality of case nodes comprising a case model a trait definition comprising a corresponding set of traits associated with that case node is received. The respective trait definitions are used to bind each set of traits to the case node with which the set of traits is associated in case instances created based on the case model.

Abstract: A method, computer program and apparatus is disclosed. The method, performed by one or more processors, may comprise receiving, from one or more predetermined organizations, datasets representing entities and datasets representing one or more tasks for those entities and storing in a database, in accordance with an ontology which is common to the organizations, the received one or more datasets as data objects, the ontology defining properties of data objects and relationships between the data objects. The method may also comprise mapping the data objects stored in the database to the organization from which the one or more datasets were received and receiving, through a querying application, a query from a user of one of the predetermined organizations to view one or more data objects relating to a task.

Abstract: A method for configuring the operation of the software of a data as a service (DAAS) system during run time is described. The configuring includes at least one of configuring ingestion of a vendor dataset to produce an ingested dataset and which analysis operations to perform on the vendor dataset to produce an analyzed dataset, and the configuring also includes at least one of how to search the vendor dataset based on a search query from a customer to allow the customer to locate a new record from the vendor dataset and how to match records in the vendor dataset with a match query from the customer to provide an updated record to the customer.

Abstract: Disclosed are various embodiments for asynchronously generating consistent snapshots in a distributed system. In one embodiment, a snapshotting agent receives a respective local snapshot for individual processes in a distributed system. The respective local snapshot for a corresponding process includes a corresponding vector clock that comprises respective values indicating respective state changes in the corresponding process and other processes. The snapshotting agent determines whether a collection of the respective local snapshots for the individual processes represents a global consistent snapshot for the distributed system based at least in part on a comparison of the respective values of the corresponding vector clocks.

Abstract: Techniques for managing a file system involve: receiving an event published by the file system, the event being associated with an operation on an object in the file system; determining a value of a counter corresponding to the event based on execution information of the operation; determining a target action corresponding to the value of the counter based on a trigger strategy associated with the counter, the trigger strategy defining at least one action that can be triggered by the counter; and generating an indication for causing the file system to execute the target action. Accordingly, file system management in finer granularity can be provided.

Abstract: Change data capture is performed asynchronously for direct transfer to a stream processor. When updates to a database as part of database transactions are performed, a transaction log is generated that describes the database transactions. The transaction log may be evaluated to determine indications of changes included in the database transactions. The indications of the changes may be stored in memory according to the database transactions that include the indications of the changes. When a database transaction is determined to be committed to the database, the change indications may be sent directly from the memory to the stream processor.

Abstract: The present inventors devised techniques and technologies that streamline the protection of data stored on shared file storage e.g., on file servers, network-attached storage (NAS), share drives, network shares, etc., in a data storage management system. Some embodiments feature a proxy-less backup configuration in which backup services hosts are assigned to perform a secondary copy job, at job runtime, based on host attributes relative to the data source. Some embodiments are configured to, at job runtime, automatically resolve data paths to the source data, and automatically mount the data paths, rather than requiring data paths to be expressly pre-administered on all possible candidate backup machines. Some embodiments automatically protect data from shared file storage that was not expressly given a backup plan (“undefined” data) by applying default preferences for protecting undefined data.

Abstract: A process of fulfilling a database deployment request for a data platform. A compute service manager of the data platform scans one or more accounts of a consumer region of the data platform for a pending listing fulfillment request, where the pending listing request includes a request for deployment of a consumer database and an associated share of grant metadata of the consumer database within the consumer region. When the compute service manager determines that an account of the one or more accounts has a pending listing fulfillment request, the compute service manager determines a listing for the pending listing fulfillment request based on listing data of the account. The compute service manager determines that no other fulfillment task is scheduled for the pending listing fulfillment request and schedules a background fulfillment task to perform the fulfillment process for the pending listing fulfillment request.

Abstract: Systems and methods are disclosed to implement a bounded group by query system that computes approximate time-sliced statistics for groups of records in a dataset according to a group by query. In embodiments, a single pass scan of the dataset is performed to accumulate exact results for a maximum number of groups in a result grouping structure (RGS) and approximate results for additional groups in an approximate result grouping structure (ARGS). RGSs and ARGSs are accumulated by a set of accumulator nodes and provided to an aggregator node, which combines the received structures to generate exact or approximate statistical results for at least a subset of the groups in the dataset. Advantageously, the disclosed query system is able to produce approximate results for at least some of the groups in a single pass of the dataset using size-bounded data structures, without predetermining the actual number of groups in the dataset.

Abstract: Technologies for template generation using directed acyclic word graphs (DAWGs). The technologies can include receiving a first plurality of titles from a first plurality of title feeds, and sorting the first plurality of titles into a plurality of category sets. And, for each category set of the plurality of category sets, the technologies can include transforming the respective titles belonging to the category set into a trie data structure by separating words in the respective titles into nodes of the trie data structure. For each category set, the technologies can also include transforming the trie data structure into a directed acyclic word graph (DAWG) data structure. Also, for each category set, the technologies can also include generating one or more unique templates based on the DAWG data structure.

Abstract: Techniques are provided for on-demand creation and/or utilization of containers and/or serverless threads for hosting data connector components. The data connector components can be used to perform integrity checking, anomaly detection, and file system metadata analysis associated with objects stored within an object store. The data connector components may be configured to execute machine learning functionality to perform operations and tasks. The data connector components can perform full scans or incremental scans. The data connector components may be stateless, and thus may be offlined, upgraded, onlined, and/or have tasks transferred between data connector components. Results of operations performed by the data connector components upon base objects may be stored within sibling objects.

Abstract: A top K query directed at a table is received. The table is organized into multiple storage units. The top K query comprises a first clause to sort a result set in order and a second clause that specifies a limit on a number of results provided in response to the query. A table scan operator identifies a first set of rows from the table based on a scan set determined for the table and provides the first set of rows to a top K operator. The top K operator determines a current boundary based on the first set of rows and provides the current boundary to the table scan operator. The table scan operator prunes the scan set based on the current boundary and identifies a second set of rows from the table based on the pruning.

Abstract: An automated method and system are provided for comparing a source database and a target database that are intended to be kept in synchronization with each other. An application processes transactions that are posted to the source database and replicated to the target database. Before images of changes made to records or rows of the source database resulting from transactions posted to the source database into a first change log are collected. The before images of changes made to records or rows of the source database are replicated to the target database. Current images of records or rows of the target database that correspond to the before images of changes made to records or rows of the source database are read. Representations of the before images of changes made to records or rows of the source database are compared with representations of the current images of records or rows of the target database that correspond to the before images of changes made to records or rows of the source database.

Abstract: A system and method for generating shard data based on semantic sharding is proposed. Shard data is generated by a map sharder that is configured to generate the shard data based on semantic objects in a geographical area and a definition of sections. The sections cover parts of the geographical area. The map sharder searches, for each of the sections, for semantic objects that are located at least partly in a section and stores found objects in a shard data entry of the shard data.

Abstract: The present disclosure involves systems, software, and computer implemented methods for configuring graph query parallelism for high system throughput. One example method includes receiving a query to be executed against a graph database. System properties are determined of a system in which the query is to be executed. Algorithmic properties are determined of at least one algorithm to be used to execute the query. Graph data statistics are determined for the graph database. Graph traversal estimations are determined for a first iteration of the graph query and an estimated cost model is determined for the first iteration based on the graph traversal estimations. Estimated thread boundaries are determined for performing parallel execution of the first iteration. Work packages of vertices to be processed during the execution of the first iteration are determined based on the first estimated cost model and the work packages are provided to a work package scheduler.

Abstract: A first information handling system may receive a telemetry metric report from a client information handling system. The first information handling system may determine that one or more characteristics of the telemetry metric report do not match one or more predetermined telemetry metric report characteristics. The first information handling system may perform one or more corrective actions based, at least in part, on the determination that the one or more characteristics of the telemetry metric report do not match one or more predetermined telemetry metric report characteristics.

Abstract: A hardware-implemented file reader includes an interface, multiple hardware-implemented column readers and a hardware-implemented record reconstructor. The interface is configured to access a file including multiple records. The records store values in accordance with a nested structure that supports optional values and repeated values. The file is stored in a columnar format having multiple columns, each column storing (i) compressed values and (ii) corresponding compressed structure information that associates the values in the column to the nested structure of the records. Each column reader is configured to be assigned to a respective selected column, and to read and decompress both the values and the structure information from at least a portion of the selected column. The record reconstructor is configured to reconstruct one or more of the records from at least portions of the columns that are read by the column readers, and to output the reconstructed records.