Abstract: Techniques and architectures to estimate storage system capacity are disclosed. Deduplicated data and an index of object entries are maintained in a storage system. The entries contain shallow reference counts. The shallow reference count values indicate a number of parent metadata objects that hold a reference to corresponding object. One or more tree milli-indices and one or more node milli-indices of object entries are maintained in the storage system. The entries correspond to a subset of objects stored in the storage system. The entries also have truncated object signature values and deep reference count values for the corresponding objects in the storage system. A capacity utilization of the storage system is determined based on analysis utilizing the deep reference count values to perform various multiset operations.

Abstract: A first score associated with matching between entity records of a plurality of entities of master data of an MDM system is received. A set of entity records with a first score above a lower threshold score and below an upper threshold score is identified as unresolved; neither confirmed as matched or unmatched. A second score associated with relationships between entity records is generated. Overall scores for pairs of the set of entity records are determined by combining the first matching score with the second relationship score. The overall score of respective pairs of the set of entities is compared to the upper threshold, and if the upper threshold is exceeded, then the information of the pair of entity records of the set of entity records are combined into a single record, and redundant entity records are removed from the MDM system.

Abstract: Systems and methods maintain a toplist associated with a sliding window having m elements. The toplist can include the top k elements of the sliding window, where k is less than m (typically an order of magnitude or more less than m). As new elements are received from a data stream, a counter associated with the new element is updated and the new element is inserted into the sliding window. If the toplist has less than k elements, the new element is added. Otherwise, if the new element is already in the toplist, its counter value is updated with the new value. Otherwise, if the new element's counter is smaller than the smallest element in toplist, then do nothing. If the new element counter is larger than the smallest counter in the toplist, the smallest element is discarded from the toplist and the new element is inserted.

Abstract: An information processing system manages data on customers using tenants which are storage regions dedicated for the customers of a database and registers a message for processing data of a processing target in a queue. The data is processed by accessing the tenants corresponding to the data so as to refer to the tenants based on the message. The information processing system registers a message for processing a plurality of data of processing targets as a batch process in the queue in a case where the plurality of data satisfy the predetermined condition when the message for processing a plurality of data of processing targets is to be registered in the queue. In the process performed on the plurality of data, the different tenants are accessed to be referred to.

Abstract: A method includes: generating first vector data by vector-converting first sentence data from a user input; specifying plural pieces of second sentence data from among a plurality of second sentence data stored in a storage device, each second sentence data including a plurality of vector data, each of the plural pieces of second sentence data including vector data corresponding to the first vector data; and determining data to be output in connection with the first sentence data by using a degree of similarity between second and third vector data, the second vector data being each of vector data other than the first vector data in certain data included in the specified plural pieces of second sentence data, the third vector data being each of vector data other than the first vector data in data other than the certain data included in the specified plural pieces of second sentence data.

Abstract: The present application discloses a method for data aggregation, the method includes: acquiring original data to be aggregated and dividing the original data into at least one first data set; determining whether each of the at least one first data set has a corresponding historical aggregation record; when there is at least one second data set with a historical aggregation record in the at least one first data set, acquiring a historical aggregation result corresponding to each second data set to obtain at least one first aggregation result; performing aggregation on each third data set without a historical aggregation record to obtain at least one second aggregation result; and determining a third aggregation result of the original data according to the at least one first aggregation result and the at least one second aggregation result, and determining a data tag of the original data according to the third aggregation result.

Abstract: Example methods, apparatus, systems and articles of manufacture (e.g., physical storage media) to deduplicate common devices across multiple data sources are disclosed. An example system includes a comparison controller to identify a first device in a first data source and a second device in a second data source as a possible common device.

Abstract: A data deduplication system includes a data deduplication subsystem coupled to each of a host system and a storage system. The data deduplication system receives data from the host system, generates a data deduplication identifier for the data, and determines whether the data deduplication identifier for the data is stored in a data deduplication database. In response to determining that the data deduplication identifier is not stored in the data deduplication database, the data deduplication system stores the data deduplication identifier for the data in the data deduplication database in association with a data counter for the data, and transmits the data to the storage system for storage. In response to determining that the data deduplication identifier is stored in the data deduplication database, the data deduplication system increments a data counter that is associated with the data deduplication identifier in the data deduplication database, and discards the data.

Abstract: Concepts may be associated with each other based on information provided by data sources. Entities may be associated based on the information provided by the data sources and characteristics of the entities. A concept graph may be generated based on the concepts such that each edge in the concept graph corresponds to a relationship between two or more associated concepts. A data graph may be generated based on the concept graph and the entities such that each node in the data graph corresponds to a concept or an entity and the edges in the data graph correspond to relationships between two or more concepts and such that other relationships between two or more associated concepts are absent from the concept graph. In response to a query, traversing the data graph to determine entities that are related to the query and providing a report that includes those entities.

Abstract: There are provided systems and methods for duplicate table identification in enterprise database systems for data storage optimization. A service provider, such as an electronic transaction processor for digital transactions, may determine data duplication in database tables so that database storage resources may be optimized. In order to determine data duplication, within database tables, a data collector daemon operation and/or application may collect metadata for tables within a domain. Using the metadata, a master table and derived tables may be determined for a group of the tables. Further, a duplication factor may be determined based on matching columns in the tables, a usage factor may be determined using processing hits to the tables, and a size factor may be determine based on table size. This allows for determination of a relevance score of the group, which provides a measure of duplication of data within those tables.

Abstract: Facilitating temporal data management for anomalous state detection in data centers is provided herein. A system can comprise a processor and a memory that stores executable instructions that, when executed by the processor, facilitate performance of operations. The operations can comprise performing a process of extraction, transformation, and loading of data from log files into a telemetry data store. The data can be loaded into the telemetry data store as telemetry data. The operations also can comprise dividing the telemetry data into first telemetry data and second telemetry data. The first telemetry data can comprise telemetry data that does not satisfy a defined quality level. The second telemetry data can comprise telemetry data that satisfies the defined quality level. Further, the operations can comprise removing the first telemetry data from the telemetry data store and outputting the second telemetry data based on a request for the second telemetry data.

Abstract: Described is a system for a providing a service (or microservice) for performing deduplication for an object storage. The service (or microservice) may be source-agnostic in that it may receive data from multiple types of source systems by providing a uniform set of functions for deduplicating and writing the data to a destination object storage. The set of functions encapsulate a previously dispersed set of functionality provided by various components. Accordingly, the service provides a single scalable and stateless component for performing deduplication. For example, the service (e.g. deduplication service) may receive object related information and perform a filtering to accelerate network transfers. Accordingly, the service provides the ability to only transfer and write data that does not already exist on the object storage.

Abstract: A cloud native global file system is augmented to include a “file accelerator” that is configured to speed up data propagation with respect to updates on a shared volume and, in particular by performing real-time analysis on audit event data to coordinate pushes and pulls across multiple edge appliances, effectively replacing static snapshot and synchronization schedules. A “push” refers to a snapshot on the volume that occurs at a particular filer, and a “pull” refers to a synchronization (sync) operation initiated by a particular filer to obtain whatever is in the cloud (and that is the subject of the pull). The file accelerator operates in several modes of “triggered” operation based on user activity, and under the control of a cloud-based controller.

Abstract: Disclosed is an improved system, method, and computer program product to allocate backup devices for a database system, where an appropriate appliance can be automatically allocated to accommodate backups. The allocation selects an appliance that effectively balances space allocation needs of the database with overall performance effects on a multi-tenant backup system that handles multiple databases of varying sizes.

Abstract: Computer-based systems, methods, and articles of manufacture are disclosed. In a social network embodiment, information regarding a first user is obtained and formed into a first dataset. Conceptual spaces are selected for the first user, and the first user's location is determined in the spaces. Distances between the first user and other users and their datasets are computed in the selected conceptual spaces. Actions are taken based on the distances, such as including or excluding the other users from a friends list of the first user.

Abstract: A shared log system can provide a key-index structure (main map) that allows clients (users) to access the state of objects stored in the shared log system. The client can define secondary indices on the main map to provide access to the data that are tailored to the client's data needs. Each client can generate their own customized set of secondary indices different from other clients.

Abstract: Systems and methods utilize a data model database which includes a plurality of symbol data types. Each of the plurality of symbol data types have one or more symbol data fields. The data model database further includes a plurality of concrete data types. Each of the concrete data types have one or more language-agnostic concrete fields associated with each of the one or more symbol data fields. Each of the one or more language-agnostic concrete fields apply one or more concrete constraints to each of the corresponding symbol data fields. The data model database further includes a plurality of carrier data types. The plurality of carrier data types having one or more language-specific carrier fields associated with each of the one or more language-agnostic concrete fields. Each of the one or more language-specific carrier fields apply one or more carrier constraints to each of the corresponding language-agnostic concrete fields.

Abstract: System and method are provided for searching, writing, editing, and publishing waveform shape information. A publishing module provides a shape data file from sets of parameters. Each set of parameters comprises a full scale value (FSy) for a yValue defined by a shape code value; a maximum value for binary file data values, each binary file data value having a number of bits, the maximum value being less than the number two raised to the power of the number of bits of the binary file data values; a full scale file data value, the full scale value being less than the maximum value for the binary file data values and equal to an integer multiple of FSy; and the binary file data values corresponding to the yValues calculated by multiplying the yValue by the full scale file data value divided by FSy.

Abstract: A system and a method are disclosed that provides a data replication management technique for a distributed environment that eliminates a need to order members of a replica set. A node of a node cluster in the distributed system may be configured to send in parallel an IO request to each respective member of the replica set. Reponses are received from members of the replica set that indicate a completion status of the IO request at the replica set member sending the IO response. A request is sent to other nodes of the node cluster to remove a replica from the replica set based on an error response received from the replica. The replica that responded with the error response is removed from the replica set based on an agreement of nodes of the node cluster to remove the replica from the replica set.

Abstract: Metadata of a root node from a serialized representation of a file system metadata tree data structure is obtained. A representation of the root node that references a stub intermediate node that is a placeholder for an intermediate node stored in the serialized representation is created. A request to access data of a leaf node in a tree path including the intermediate node is received. In response to the request, metadata of the intermediate node is obtained from serialized metadata representation.