Abstract: Facilitating data deduplication in an elastic cloud storage environment 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 facilitating a first deduplication of first data at a first storage device based on a determination that the first storage device comprises duplicated data. The operations can also comprise sending, by the system, a request for a second deduplication at a second storage device after completion of the first deduplication at the first storage device. In addition, the operations can comprise facilitating, by the system, the second deduplication of second data at the second storage device, wherein the second data comprises a copy of the duplicated data.

Abstract: A method for verifying structured data includes receiving structured data, deconstructing the structured data into corresponding elements and obtaining standard structured data having corresponding standard elements. The method also includes comparing the elements of the structured data with the standard elements of the standard structured data to identify any element differences. For each element difference, the method includes comparing the element difference against a registry of element comparisons, determining whether the element difference is expected or unexpected based on a heuristic or at least one rule, and when the element difference is unexpected, generating a signal indicating the presence of an unexpected element in the structured data.

Abstract: Implementations of the present specification provide a method for deploying a smart contract. According to the method in the implementations, in a phase of deploying a smart contract, a bytecode included in a contract module corresponding to the contract is obtained; and then the bytecode is parsed into executable instruction codes, and the executable instruction codes are stored in a cache memory. Further, a function index table is determined for import and export functions in the bytecode, where the function index table is used to indicate a memory address of an instruction code corresponding to each of the import and export functions; and the function index table is stored in the cache memory.

Abstract: A computer system is provided for retrospectively processing a data structure that includes a plurality of entries. The computer system determines if certain data transactions requests that have been recorded in the data structure could have been executed differently (e.g., by being processed at an earlier point in time). For a given entry in the data structure, the system determines if data transaction request could have at least partly succeeded against a prior recorded state of at least one of two ordered lists of pending data transaction requests. Another entry is then found that caused the initial entry to fail in execution and a time delta is stored between the timestamp of the another entry and the timestamp of the initial entry.

Abstract: Systems and methods for sharing information from a first user account to a second user account selectively and seamlessly. The systems and methods can be implemented by server(s) that analyze electronic transactions between the first user account and the second user account to determine appropriate queries for the accounts for sharing information. Such queries can include queries for file permissions. Also, the server(s) can generate sharing instructions according to results of the queries. The server(s) can also select electronic content items for sharing according to the generated sharing instructions. And, the server(s) can direct storage of a copy of the selected electronic content items of the first user account into a data structure of the second user account, such that access by the second user account to the selected items from the first account is as seamless as accessing electronic content items originated by the second user account.

Abstract: Cleartext passwords represent a security risk. An unencrypted password can be exploited to gain access to a system and/or perform unauthorized functions. This disclosure describes how to detect cleartext passwords in a generalized manner using predictive text classifiers (e.g. Word2Vec). Using a corpus of text, an artificial intelligence model can be built by training a predictive text classifier to identify password anomalies (e.g., areas of text that occur with low statistical probability). Source program code, configuration files, log files, and other types of text can be automatically scanned for cleartext passwords without having to rely on password lists or other limited and/or labor intensive mechanisms, thus improving system security and reducing the chances of data exfiltration and unauthorized actions.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives a log entry instance for creating a definition for a log entry type. The program further generates a markup associated with the log entry instance. The program also generates a document based on the markup associated with the log entry instance. The program further retrieves a set of reference documents. Each reference document is associated with a particular type of event. The program also generates a ranked list of types of events based on the document and the set of reference documents.

Abstract: Systems and methods are disclosed for processing queries against one or more dataset sources. The system tracks query resource data and resource utilization data. The query-resource usage data can indicate resources used to execute queries. The node resource utilization data can indicate current utilization of nodes in the system. Upon receipt of a query that identifies a set of data to be processed and a manner of processing the set of data, the system can use the query-resource usage data and the resource utilization data to define a query processing scheme. The query can then be executed using the query processing scheme. In some cases, the query coordinator can dynamically allocate partitions operating on worker nodes to execute the query.

Abstract: A method and computer device for storage and retrieval of a data object on a storage medium. The method includes steps of disassembling the data object into a predetermined number of redundant sub blocks, storing the redundant sub blocks on the storage medium, retrieving at least a predetermined multiple of a minimal spreading requirement of the redundant sub blocks from the storage medium, and assembling the data object from any combination of a particular number of the redundant sub blocks, the particular number corresponding to a predetermined multiple of a minimal spreading requirement. The computer device includes modules for performing the steps.

Abstract: A method for providing low-latency responses to queries to a data search system comprises storing first digital data in a first digital data repository using a first column-oriented storage format; storing second digital data in a second digital data repository using a second column-oriented storage format, wherein the second column-oriented storage format is different from the first column-oriented storage format; generating a plurality of pre-computed views based on both the exposure data and the risk item data; storing the plurality of pre-computed views in the second data repository using the second column-oriented storage format; and in response to receiving a search query, determining a result set that is responsive to the query based on one or more particular pre-computed views of the plurality of pre-computed views and providing the result set to another computer or display device as output.

Abstract: An online system generates a model for determining quality scores for content items by presenting content items to a group of users who provide ratings for the content items. Based on ratings received from various users of the group, the online system generates the model. To mitigate bias from ratings received from different users of the group, the online system generates a distribution of ratings received from users of the group within a time interval and generates a cumulative distribution function by integrating the distribution. For a user of the group, the online system generates a user distribution of rankings received from the user. Additionally, for a rating received from the user, the online system determines a percentage of ratings received from the user less than the rating. Based on the cumulative distribution function and the percentage, the online system generates a normalized rating corresponding to the rating from user.

Abstract: Disclosed methods and systems leverage resources in a storage management system to partially synchronize primary data files based on synchronizing selected portions thereof without regard to changes that may be occurring in other non-synchronized portions. Accordingly, a number of primary data files may be partially synchronized by synchronizing designated portions thereof via auto-restore operations from backup data. This approach relies on storage management resources to designate portions of source data that is to be kept synchronized across any number of targets; detect changes to the designated portions; back up changes to secondary storage; and distribute the changes from secondary storage to the associated targets, with minimal impact to the primary data environment. The approach may be mutually applied, so that changes in any one of an associated group of source data files may be likewise detected, backed up, and distributed to the other members of the group.

Abstract: This specification describes techniques for managing assets in a blockchain. One example method includes receiving, from a target user recorded in a distributed database of a blockchain network, a user input including a request to perform a contract operation on asset objects including digital assets corresponding to physical assets associated with the target user, in response to receiving the request, generating an asset container as an operation target of the contract operation, the asset container recording field information of the asset objects, generating an asset container group by dividing the asset container into the asset container group based on an association relationship between the asset objects, wherein the association relationship defines correspondences between each asset container in the asset container group and at least one other asset container in the asset container group, and performing the contract operation on the asset container group using a contract object.

Abstract: Methods, systems, and computer program products for search engine optimization techniques are provided herein.

Abstract: This specification describes techniques for managing assets in a blockchain. One example method includes receiving, from a target user recorded in a distributed database of a blockchain network, a user input including a request to perform a contract operation on asset objects including digital assets corresponding to physical assets associated with the target user, in response to receiving the request, generating an asset container as an operation target of the contract operation, the asset container recording field information of the asset objects, generating an asset container group by dividing the asset container into the asset container group based on an association relationship between the asset objects, wherein the association relationship defines correspondences between each asset container in the asset container group and at least one other asset container in the asset container group, and performing the contract operation on the asset container group using a contract object.

Abstract: A sequence of tuples, each having one or more attributes, is received at one of one or more processing elements operating on one or more processors. Each processing element may have one or more stream operators. A first stream operator may be identified as one that only processes an instance of a first attribute in a currently received tuple when a difference between an instance of the first attribute in a previously received tuple and the instance of the first attribute in the currently received tuple is outside of a difference threshold. A second stream operator may generate a difference attribute from a first instance of the first attribute in a first one of the received tuples and a second instance of the first attribute in a second one of the received tuples. The difference attribute may be transmitted from the second stream operator to the first stream operator.

Abstract: A dynamic hash partition management scheme includes associating first partitions of a database with a first partition number, and second partitions of the database with a second partition number, associating first partitions of a database with a first partition number defining a total number of first partitions, and second partitions of the database with a second partition number defining a total number of second partitions. The method further includes, after receiving a request to insert a record in the database, determining an active partition number, and determining the first partition number as an active partition number. The method further includes determining a record key for the record, generating a partition identifier defining a partition of the first partitions using the record key and the active partition number, and inserting the record in the partition defined by the partition identifier.

Abstract: Provided is a process including: obtaining a graph comprising nodes and edges, each of the edges having a value indicating an amount of similarity between objects corresponding to the two linked nodes; selecting a parameter for influencing the graph; assessing each of the nodes based on the selected influencing parameter, wherein assessing comprises, with respect to each adjacent node in the graph sharing an edge with the node: determining the value indicating the amount of similarity between the object corresponding to the node and the object corresponding to the adjacent node; and determining a score related to the edge shared with the node, the score determined based on the similarity-amount value and a value of the selected influencing parameter for the node, such that edges are removed, weakened, added, or strengthened; and preparing, based on the graph, instructions to display at least part of the graph.

Abstract: Method and systems for data storage is provided. Metric data corresponding to a component of a datacenter is received, the metric data associated with a metric instance that identifies the component of the datacenter. It is determined that the metric instance is not stored at an index server. The metric instance is stored at the index server, the metric instance being synchronously stored in a flattened format. A slot identification is generated based on at least a portion of the metric instance, and the metric instance is stored at an inventory server in accordance with the slot identification, the metric instance being asynchronously stored in an unflattened format.

Abstract: Systems and methods of managing computing resources of a computing system are described. A computing resource list and computing resource information may be stored at a data store. The computing resource list may identify a set of computing resources of a computing system, and the computing resource information may respectively describe the computing resources. The computing resource list may be updated in response to a new computing resource being added to the computing system or in response to an existing computing resource being removed from the computing system. Evaluation tasks for the computing resources may be performed, and a resource evaluation report may be generated during performance of at least one of the evaluation reports.