Abstract: The method of the present disclosure includes: after a graph partitioning apparatus extracts an edge, first determining whether an aggregation degree between a currently extracted edge and an allocated edge in a first device satisfies a preset condition; then, when the preset condition is satisfied, determining whether a quantity of allocated edges stored in the first device is less than a first preset threshold; and allocating the currently extracted edge to the first device when the quantity is less than the first preset threshold. In this way, an aggregation degree between allocated edges in each device is relatively high and each device has relatively balanced load. When an edge changes and an edge associated with the particular edge needs to be synchronized, a relatively small quantity of devices need to perform synchronization and update, so that costs of communication between devices are reduced, and distributed graph computing efficiency is improved.

Abstract: Embodiments of the present invention provide a method and system for processing a query on a set of data blocks in analytical databases. The query is on a set of data blocks, having at least one attribute and specifies at least one selection condition on the attribute. The selection condition is associated with at least one selection expression. Attribute value information on each attribute is generated for each data block. Next, a condition is generated on each attribute to negate the selection expression, if the selection expression has a negation operator. Additional conditions are generated for each selection expression that does not contain a negation operation. The attribute value is used to select the positive and negative subsets of data blocks for each condition. Next, a negative subset that does not require processing to evaluate the query is skipped and the positive subsets and the non-skipped negative subsets are processed.

Abstract: Disclosed is a technique that can be performed in a distributed computer network. The technique can include a data index and query system that receives a search query, defines a search scheme for applying the search query on distributed data storage systems including an internal data storage system of the data index and query system and an external data storage system. The internal data storage system stores data as time-indexed events including respective segments of raw machine data. The data index and query system can transfer a portion of the search scheme to a search service, which can return search results obtained by application of the search scheme to the distributed data storage systems including the internal data storage system and the external data storage system. Lastly, the search results or data indicative of the search results can be output on a display device to the user.

Abstract: Embodiments of the present invention provide a method, system and computer program product for visual data object dependency tracing. In an embodiment of the invention, a method for visual data object dependency tracing includes loading into memory of a computer, a data model for data of a database, retrieving a definition for each object in the model and within each retrieved definition, identifying one or more parameters. The method additionally includes correlating a multiplicity of identified ones of the parameters with different objects in the data model and creating a relational table for the correlations. Finally, the method includes generating a visualization of the relational table and displaying the visualization in a display of the computer.

Abstract: Transformation configuration data is set for a consumer replication set on a consumer instance to replicate on the consumer instance data of a source table included in a producer replication set on a producer instance. The transformation configuration data includes configuration data of at least one of: (i) a target table from among a plurality of tables on the consumer instance that is specified in the consumer replication set as a table for loading on the consumer instance, incoming data from the source table; and (ii) a specified mapping of incoming fields of the source table with respective fields of the target table. Replication event data of a data modification event associated with a record on the source table is received. The received replication event data is transformed based on the set transformation configuration data, and loaded on the target table.

Abstract: Example systems and methods for cloning catalog objects are described. In one implementation, a method includes creating a copy of a catalog object without copying a data associated with the catalog object by only coping metadata associated with the object. The method further includes modifying, by one or more processors, the data associated with the catalog object independently of the copy of the catalog object such that modified data is not visible to the copy of the catalog object and wherein the modified data is not visible to the catalog object in a database. The method further includes deleting the copy of the catalog object following completion of the modification of the data associated with the catalog object.

Abstract: A system and method for communicating events between applications. A first application receives event information for an event. A first action is performed by the first application in response to receiving the event information. The first application generates an event message comprising an event name and a message payload. The message payload comprises at least a portion of the event information. The first application publishes the event message by sending the event message to an event message pipeline. A second application may listen for the event message in the event message pipeline, receive the event message from the event message pipeline, and use the message payload to perform a second action, wherein the second action is different from the first action.

Abstract: Systems and methods for cloud-based file sharing, where templates are provided for creating workflow instances which enable the sharing of managed objects. Reusable workflow templates are stored in the repository of a cloud-based file sharing system as objects that define components of the workflow, or placeholders for these components. A user instantiates a workflow instance from one of the templates and configures the workflow instance to identify content objects or forms, tasks related to the content objects, and users assigned to perform the tasks. The workflow instance is stored as an object in the repository. Users assigned to tasks are authorized through the workflow instance to access the content objects or forms to perform the tasks.

Abstract: Example systems and methods for cloning catalog objects are described. In one implementation, a method includes creating a copy of a catalog object without copying a data associated with the catalog object by only coping metadata associated with the object. The method further includes modifying, by one or more processors, the data associated with the catalog object independently of the copy of the catalog object.

Abstract: Event time selection output techniques are described. In one or more implementations, one or more inputs are received, at one or more computing devices, that involve interaction associated with a particular one of a plurality of events via a user interface, in which the plurality of events result from a search of data, each of the plurality of events include the data that is associated with a respective point in time, and the one or more inputs specify a relative time in relation to the respective point in time of the particular event. A determination is made as to which of the plurality of events correspond to the specified relative time by the one or more computing devices and a result of the determination is output by the one or more computing devices for display in the user interface.

Abstract: A method is used in managing deduplication of data in storage systems. A candidate data object is identified for deduplicating a data object by evaluating digests stored in a current digest segment to determine whether another digest matching a digest associated with the data block is stored in the current digest segment. The current digest segment includes a set of digests associated with a set of data blocks previously received for deduplication. Based on the evaluation, a deduplicating technique is applied to the data object. The current digest segment is stored in an index table. A previous digest segment associated with a digest stored in the index table matches the digest associated with the data block is replaced by the current digest segment. A plurality of digest segments are organized into a segment group and a reference counter is associated with the segment group, wherein if the reference counter reaches zero, storage space consumed by the digest group is reclaimed.

Abstract: In a multitenant database, one or more supporting data tables are used to write and store tenant data. Based on the contextual data returning an indication of validity of a detected database transaction, various actions are performed. Data changes may be captured if no valid context is found. At runtime, triggers are used to set a valid context or fix mode context, and database operations causing the data corruptions are captured in a change tracking data structure. The captured data from the database operations include a primary key and an original value for each data change. The original value and primary key for each data change is used to nullify the unintended write.

Abstract: Methods, systems, and computer-readable storage media for receiving workload data, the workload data including queries executed within a distributed database system over a period of time, defining windows, each window including a time slice within the period of time, generating a hypergraph for each window, each hypergraph including vertices and hyperedges and being generated based on a sub-set of queries and weight functions, partitioning each hypergraph into blocks, for each shard in a set of shards, determining a set of ratings, each rating in the set of ratings being based on a weight of a respective share with respect to a respective block, and assigning each shard in the set of shards to a block in the set of blocks based on the set of ratings for the respective shard, the shard being assigned to a block, for which a maximum rating is provided in the set of ratings.

Abstract: The present disclosure generally relates to obtaining details regarding an image based on search intent and, further, to determining royalty distributions of musical projects. In an example, a computer-implemented method includes: receiving, by a computing device, an image as part of a request to receive information regarding an object in the image, wherein the image is received via an application hosted by a user device; identifying, by the computing device, the object in the image; determining, by the computing device, a user intent based on identifying the object; executing, by the computing device, the search query, wherein the executing includes accessing one or more blockchain-based databases storing metadata; and returning, by the computing device, results to the search query, wherein the returning the results includes presenting the search results within the application and overlaid on or around the image within a user interface of the user device.

Abstract: A remote agent for providing data protection services includes persistent storage and a backup manager. The persistent storage stores lifecycle policies. The backup manager updates an asset catalog using an asset map associated with a virtual machine; generates a lifecycle policy of the lifecycle policies using the asset catalog; and generates a backup for the virtual machine using the lifecycle policy. The lifecycle policy prioritizes generating the backup for the virtual machine over generating a second backup for a second virtual machine.

Abstract: In certain embodiments, resource usage in a data retrieval process may be reduced. In some embodiments, a graph query related to a data request may be obtained. The graph query may be transformed into a query set based on a graph data model and patterns of the graph query. Upon generation, the query set may include queries and query operators linking the queries, where the query operators include a first query operator linking first and second queries of the queries or other query operators. Prior to execution of the first and second queries, a satisfiability issue may be predicted, where the satisfiability issue is related to combining results derived from the first and second queries. Based on the prediction, the first query operator may be removed from the query set to update the query set. The updated query set may be executed to satisfy the graph query.

Abstract: A storage unit stores first data including the processing target information and second data including processing history information obtained by processing the processing target information based on a processing request; the first data and the second data include a plurality of data associated with different transactions; servers include a first server and a plurality of second servers; the plurality of second servers synchronize and hold the first data and the second data; and the first server that has received the processing request reads the first data of a processing target from a second server, processes the processing request, stores the second data including the processing history information and the first data reflecting a processing result in an own server, and transmits the second data configured to reflect the processing in the first data of the second server to the second server.

Abstract: Certain aspects described herein are directed to methods and systems for updating a status of a first process. In certain aspects, a method includes periodically examining a first table stored in a consistent and distributed database, wherein the table includes a first indication of a status of the first process and a second indication of a status of a second process and the first process and the second process are clustered for implementing functions of a distributed application in a distributed manner. The method further includes determining that the first indication has not changed during a first time period and changing the status of the first process in a second table to reflect that the first process is non-operational, wherein a different share of workload associated with the distributed application is performed by the second process as compared to when the first process was operational.

Abstract: An apparatus acquires a first input-table, based on target table information, and acquires a script for generating a first output-table from the first input-table, and a constraint condition between columns included in the first input-table and the first output-table. The apparatus converts the first input-table into a second input-table such that the second input-table obtained by converting a column structure of the first input-table and a second output-table to be obtained by converting a column structure of the target table comply with the constraint condition, and generates assignment information indicating a correspondence relationship between columns to be included in the second output-table and the target table. The apparatus generates the second output-table from the script and the second input-table, and converts the second output-table into the target table, based on the assignment information.

Abstract: Disclosed is a technique that can be performed in a distributed computer network. The technique can include a worker node that receives search instructions defined by a search service based on at least a portion of a search scheme defined by a data intake and query system, to cause the worker node to obtain search results from distributed data storage systems communicatively coupled to the worker node over a network. The distributed data storage systems include an external data storage system and/or an internal data storage system of the data intake and query system. The worker node obtains the search results by searching the distributed data storage systems in accordance with the search instructions, and communicating, over the network to the search service, a combination of search results based on the search results to cause an output by the data intake and query system in accordance with the search scheme.