Abstract: A computing arrangement receives data. The data is from computer apps running on computer devices. The data has user identity data and associated device identity data. A memory stores sets of identity data. A respective set of identity data is associated with a user identity. Sets of identity data comprise at least one user identity data, at least one device entity data and information defining a connection relationship between the identity data of the respective set of identity data. At least one processor determines in response to received user identity data and device identity data that a first stored set of identity data is to be divided into two or more sets of user identity data. At least two sets of user identity data are associated with different user identities. The set of identity data is divided in dependence on the information defining the connection relationships.

Abstract: The subject technology selects a most recently created file from a set of files stored in a source table. The subject technology iterates, in the source table, starting from the most recently created file up to an age threshold to select a first set of files for performing a first defragmentation process. The subject technology sets an indication corresponding to a particular file that is a last file, from the first set of files, that meets the age threshold. The subject technology performs the first defragmentation process on the selected first set of files. The subject technology determines that the first defragmentation process was successful.

Abstract: System and method for managing copy-on-write (COW) B tree structures for metadata of storage objects stored in a storage system determine, when a request to modify a target storage object stored in the storage system that requires a modification of a target leaf node in a B tree structure for metadata of the target storage object is received, whether an operation sequence number of the target leaf node is greater than a snapshot sequence number of a parent snapshot of a running point of the B tree structure. When the operation sequence number is greater than the snapshot sequence number, the target leaf mode is modified in place without copying the target leaf node. When the operation sequence number is not greater than the snapshot sequence number, the target leaf node is copied as a new leaf node for the B tree structure and the new leaf node is modified.

Abstract: An information processing apparatus capable of accurately specifying identification information whose users are the same user regardless of information registered by users is provided.

Abstract: A system for displaying a performance dashboard comprises an input interface, a processor, and an output interface. The input interface is configured to receive log data. The log data comprises a set of process log entries. The processor is configured to determine one or more daemon response times and to determine dashboard information. The dashboard information is based at least in part on the log data and the one or more daemon response times. The output interface is configured to provide the dashboard information.

Abstract: Techniques are disclosed relating to merge operations for multi-level data structures, such as log-structured merge-trees (LSM trees). A computer system may store, in a database, a plurality of files as part of an LSM tree and a plurality of database key structures. A given one of the plurality of database key structures may indicate, for a corresponding one of the plurality of files, a set of key ranges derived from database records that are included in the corresponding file. The computer system may determine, using ones of the plurality of database key structures, a key range overlap that is indicative of an extent of overlap of key ranges from a set of the plurality of files with respect to a particular key range. Based on the determined key range overlap, the computer system may assign a priority level to a merge operation that involves the set of files.

Abstract: Systems, methods, and computer-readable media for generating a hybrid table template pre-populated with data pulled from preexisting tables are disclosed. The systems and methods may involve storing a customized hybrid table-template definition, wherein the hybrid table-template definition includes a table format and at least one pre-population rule linking at least one cell of the hybrid table template with at least one cell of a preexisting table populated with data; receiving a request to generate a new table using the hybrid table template definition; and following receipt of the request, generating the new table, wherein generating includes following a link to access real-time cell data from the preexisting table, and migrating the real-time cell data to the new table.

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 method can include initiating one or more transactions in response to a request associated with a first tenant in a multi-tenant computing system. The multi-tenant computing system can store a table of system master data. A determination can be made as to whether the first tenant has a table of customized master data that can include customized data values absent from the table of system master data. Based on the determination, one or more of the table of system master data and the table of customized master data can be used to respond to the request. A response to the request can be provided. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: The disclosure relates to a method for displaying information, device, system, electronic device, and storage medium. The method includes acquiring, user tag of a user account in response to a trigger operation on an information page, the user tag corresponding to one or more types of media files of the user account. The method includes displaying the user tag on the information page. The method includes displaying an associated user account corresponding to the user tag in response to an operation of selecting target user tag from the user tag.

Abstract: At least one aspect of the present disclosure is directed to a systems and methods of maintaining key-value stores. The method can include establishing a first run of data records indexed by a key value. The method can include tracking, using an index, a merging of the data records of the first run onto a merge level on a database. The method can include establishing, concurrent to the merging of the first run, a second run of data records indexed by a key value. The method can include determining that the index tracking the merge of the data records of the first run onto the merge level satisfies a quantile condition. The method can include adding the subset of the second plurality of records of the second run to the merging of the first plurality of records of the first run onto the merge level maintained on the database.

Abstract: A system for performing recursive online searches is configured to: (a) receive a first attribute for building a summary profile for an entity, the first attribute being used as seed data in building the summary profile; (b) search at least one of a set of data sources using the seed data to obtain one or more subsequent attributes related to the seed data, the subsequent attributes being contextual information having a relational connection to the entity; (c) populate the summary profile with the first attribute and the subsequent attributes under specified fields in the profile; (d) determine that a set of attributes in the subsequent attributes does not result in a stopping condition; (e) search the set of data sources using each of the set of attributes to receive additional attributes; and (f) populate the summary profile with the received additional attributes.

Abstract: A method, system, and computer program product for implementing indexes in a dispersed storage network (dsNet) are provided. The method accesses a work queue containing a set of work items as a set of key-value pairs. The key-value pairs are tuples including a work identifier and a work lease timestamp. The method selects a first work identifier and a first lease timestamp for a new work. The set of work items and the new work item are ordered according to a priority scheme to generate a modified work queue. Based on the modified work queue, the method transmits a work request to a plurality of data source units. The work request including a hash parameter and a bit parameter. The hash parameter is associated with a key-value pair of the modified work queue. The bit parameter indicates a number of bits of the hash parameter to consider.

Abstract: Described herein is a system and method for propagating modifications in flows. In an embodiment, a central system activates a master process (e.g., master flow), including a sub-process (e.g., sub-flow) and a pre-programmed object (e.g., component). The master process is configured to execute a task using the sub-process and pre-programmed object. The central system initializes a variable corresponding to the master process. The central system further identifies a metadata object using the variable. The metadata object defines a runtime configuration of the master process and sub-process. The central system receives a modification to a setting of the metadata object and propagates the modification of setting in the metadata object to the master process and sub-process.

Abstract: Disclosed are a method and apparatus for analyzing a cause of a product defect. The apparatus includes a pre-processing unit configured to receive process data and perform pre-processing for analyzing a cause of a product defect, a search unit configured to search for a primary defect cause-conditional sentence to represent a primary defect cause through solution encoding and decoding and solution fitness calculation for a plurality of candidate solutions in order to search for a conditional sentence using the pre-processed process data and to output the primary defect cause-conditional sentence, and a post-processing unit configured to receive the primary defect cause-conditional sentence, remove a redundant conditional sentence, and output the final defect cause-conditional sentence.

Abstract: When a DBMS receives a suspend instruction in which a suspend completion time of query processing is a future time and between receipt of the suspend instruction and the suspend completion time, if there is a target object (at least a processing object whose execution is in progress upon receipt of the suspend instruction) whose predicted completion time is at or precedes the suspend completion time, the DBMS changes the state of the target object to a state signifying a snapshot suspend. If there is a processing object whose state signifies a snapshot suspend, the DBMS executes the processing object at or before the suspend completion time.

Abstract: Aggregation in a computing system can include receiving, at a service node of the computing system, a first query specifying aggregation and translating the first query into a second query having a first canonical format and specifying the aggregation. The method can include forwarding the second query to a first subset of a plurality of endpoint nodes and translating, at each endpoint node of the first subset, the second query into a third query having a format executable by a data source connected to the endpoint node. The third query can specify a level of the aggregation to be performed by the data source determined based upon a processing capability of the data source. The endpoint nodes can initiate execution of the third query by the data sources and provide an aggregated result including a result from the data source(s) to the service node.

Abstract: Methods are provided of optimizing a tree-structured distributed-index with tree-nodes including data-elements and parent-child relations between tree-nodes. The distributed-index is stored in distributed system including computer-nodes each storing tree-nodes and a tree-map structurally describing the distributed-index. The methods include: inspecting the tree-map in first computer-node to determine whether the distributed-index is imbalanced due to a first tree-node in first computer-node and, in said case: notifying to other computer-nodes that first tree-node is replicable, to provoke that any request from other computer-nodes of inserting a data-element in first-tree-node includes inserting the data-element in corresponding child-node of first-tree-node; and verifying whether the other computer-nodes have been notified and, in said case, replicating data-elements stored in first tree-node into children-nodes thereof.

Abstract: A computer implemented method may include: receiving write requests to add key-value pairs to an index; storing the key-value pairs in a buffer of an indirect node of the index; determining whether the buffer of the indirect node exceeds a threshold level; and in response to a determination that the buffer of the indirect node exceeds the threshold level, transferring the key-value pairs stored in the buffer of the indirect node to buffers of a plurality of child nodes, where each buffer of the plurality of child nodes is smaller than the buffer of the indirect node.

Abstract: A system, method, and machine-readable storage medium for maintaining an object storage system data are provided. In some embodiments, an object manager may receive a request to perform an operation on an object. The object storage system includes a first database of a first type and a second database of a second type. The object manager may identify a first record stored in the first database. The first record includes a name marker indicating a range of object names covered by the second database and includes a file handle referencing the second database. The range of object names includes the object name. Additionally, the object manager may identify a second record stored in the second database. The second record includes the object name and includes a file handle referencing the object. The object manager may perform the operation on the object in accordance with the request.