A data processing system for producing a subset of data from a plurality of data sources, including: memory storing a plurality of data sources to be represented in an editor interface; a data structure modification module that selects a plurality of data sources to be represented in an editor interface and generates a subset of data included in the plurality of data sources; memory that stores the selected data structures included in the subset, with at least one of the stored data structures including the one or more modified attributes of the one or more respective fields; rendering module that displays, in the editor interface, representations of the stored data structures; and a segmentation modules that segments a plurality of received data records.

In an example embodiment, rather than passing SQL statements directly from an application runtime to a relational database, the SQL statements are first passed to a wrapper functionality. The wrapper functionality takes the uncompelled SQL statements and arguments that need to be passed for the SQL statement as input parameters, executes the statement, and returns the results. This is accomplished by generating a hash identification out of the string SQL statement. The wrapper functionality then looks for a hash identification of an input SQL statement. If it exists, then a corresponding object in the database can be retrieved and executed. If the hash identification is not found, a database object is created that performs the same functionality as the SQL statement. At this time, the SQL statement is also precompiled, and an execution plan created either by the wrapper functionality or the relational database, or both).

The disclosure relates to, among other things, systems and methods for facilitating the verification of the integrity of digital content. Embodiments of the disclosed systems and methods may provide mechanisms for generating a secure and unambiguous record of the creation and/or modification of digital content and/or other media associated with events. Further embodiments may provide for a ledger configured to capture a record of creation and/or modification actions performed in connection with digital content.

A system and method for accelerating relational functions between tables. The method includes: determining a plurality of first index values for a plurality of first unique keys in a first column of a first table; determining a plurality of second index values for a plurality of second unique keys in a second column of a second table; generating a hashed third table based on the first column of the first table and the plurality of first index values; generating a hashed fourth table based on the second column of the first table and the plurality of first index values; and generating a fifth table by performing a JOIN operation between the third table and the fourth table based on at least one third column, wherein each of third column includes a plurality of third unique keys that are common between the third table and the fourth table.

The present invention relates to a container-based network function virtualization (NFV) platform, comprising at least one master node and at least one slave node, the master node is configured to, based on interference awareness, assign container-based network functions (NFs) in a master-slave-model-based, distributed computing system that has at least two slave nodes to each said slave node in a manner that relations among characteristics of the to-be-assigned NFs, info of load flows of the to-be-assigned NFs, communication overheads between the individual slave nodes, processing performance inside individual slave nodes, and load statuses inside individual said slave nodes are measured.

Systems and method for implementing deduplication process based on performance analyses. The system may include a processing device to determine a first performance metric associated with retrieving a second stored data block that is within a specified range of a duplicate of the first data block and a second performance metric associated with retrieving a hash value corresponding to the second stored data block. The processing device further to retrieve the second stored data block within a specified range of the duplicate of the first data block in response to the first performance metric not exceeding the second performance metric.

Embodiments of the invention utilize an optimized key-value storage engine to strike the optimal balance between cloud-cost and performance and supports queries, including updates, lookups, range queries, inserts, and read-modify-writes. Cloud cost is manifested in purchasing both storage and processing resources. The improved approach has the ability to self-design and instantiate holistic configurations given a workload, a cloud budget, and optionally performance goals and a set of Service Level Agreement (SLA) specifications. A configuration reflects an optimized storage engine design in terms of, for example, the individual data structures design (in-memory and on-disk) in the engine as well as their algorithms and interactions, a cloud provider, and the exact virtual machines to be used.

A method for storing of at least one dataset in a distributed data processing network includes: sending, from a specific network node to all close network nodes, an ADD message for adding a value to a dataset, wherein the ADD message comprises the key of the dataset and the value to be added; based on a close network node receiving the ADD message and the key not being known to the close network node, creating a new dataset in an internal table of the close network node comprising the key and the value; and based on the close network node receiving the ADD message and the key being known to the close network node, adding the value to the one or more values in the dataset of the key in the internal table of the close network.

Embodiments are directed to collision-free hashing for accessing cryptographic computing metadata and for cache expansion. An embodiment of an apparatus includes one or more processors to: receive a physical address; compute a set of hash functions using a set of different indexes corresponding to the set of hash functions, wherein the set of hash functions combine additions, bit-level reordering, bit-linear mixing, and wide substitutions, wherein the plurality of hash functions differ in the bit-linear mixing; access a plurality of cache units utilizing the set of hash functions; read different sets of the plurality of cache units in parallel, where a set of the different sets is obtained from each cache unit of the plurality of cache units; and responsive to the physical address being located one of the different sets, return cache line data of the set corresponding to the set of the cache unit having the physical address.

A data management system includes a management apparatus including a processor, and plural storage devices. The processor is configured to generate hash values corresponding to data to be managed according to a predetermined calculation rule, the plural storage devices stores first hash values that are hash values generated by the processor at a first point in time, and the processor is configured to perform determination of invariance related to the plural first hash values or the data by comparing sets including the plural of first hash values read out from the plural storage devices and second hash values that are hash values regenerated according to the calculation rule at a second point in time later than the first point in time.