A raw policy set is received for the network processor and a dimension bitmap corresponding to the raw policy set. From the raw policy set, a policy tree builder generates a policy tree image from a set of recursive operations on the raw policy set including selecting boundaries of the raw policy set from cuts on a given dimension of the raw policy set, the dimension cut based on a dimension selection and a partition number selection for the raw policy set. Network processor hardware is configured according to the policy tree image including at least one set of registers, at least one set of tables, and at least one sequence of instructions. At runtime, the network processor applies the optimized policy set to processing of the packet session from the data communication network by the network processor hardware.

Versions of a schema may be maintained for application to hierarchical data structures. Updates to include in a new version of a schema may be received. The updates may be evaluated for compatibility with a current version of the schema. Compatible updates may be included in the new version of the schema. Incompatible updates may not be included in the new version of the schema. The new version of the schema may be made available for application to hierarchical data structures inclusive of the compatible updates to the schema.

According to some embodiments, systems and methods are provided, comprising a payload source; a memory storing processor-executable program code; and a processing unit to execute the processor-executable program code to cause the system to: receive a payload structure from the payload source; traverse the payload structure; identify one or more key-value pairs via the traversal; identify, for each identified key-value pair, a first attribute for each key; create a node for each key-value pair based on the identified first attribute and a value of the key-value pair; generate a data-entry field in a user interface for each created node; and render the user interface, wherein the rendered user interface includes a label for each created node, and the label is linked to a respective data-entry field. Numerous other aspects are provided.

The invention describes a method for determining a storage location of a database object of a specific version, wherein indexes for each version of the database object are stored in a trie having a root node corresponding to the specific version, the method comprising: determining a trie corresponding to the specific version by accessing the root node of the trie corresponding to the specific version; determining an object identifier of the database object by traversing the trie corresponding to the specific version using a secondary key related to the database object as search key; determining the storage location of the database object by traversing the trie corresponding to the specific version using the determined object identifier as search key.

A system and process for generalizing an evolutionary process applied to a particular domain involving different problems includes a researcher module for generating a configuration specification applicable to a particular problem. An evolution module parses the configuration specification into a representative tree structure, assembles policies for each node in the tree structure, and generates candidate genomes using the policies for each node in the tree structure. The policies may be applied to new data or data from prior runs to generate candidate genomes. The evolution module translates internal representations of the generated candidate genomes into known representations of the candidate genome for evaluation in accordance with the particular domain parameters by a candidate evaluation module.

A size associated with a content file is determined to be greater than a threshold size. Contents of the content file split across a plurality of component files are stored. Metadata, for the content file, is updated to reference a plurality of component file metadata structures for the component files. A node of the metadata is configured to track different sizes of portions of the content file stored in different component files of the plurality of component files. File metadata of the content file is split across the plurality of component file metadata structures and each component file metadata structure of the plurality of component file metadata structures specifies a corresponding structure organizing data components for a corresponding portion of the content file.

A time information coding method is provided, to solve the problem of coded values low calculation efficiency, which is resulted by adopting the existing time information coding schemes. The method comprises: determining time information to be coded; coding the time information to be coded to a first integer with a specified number of bits under a first time scale; coding the first integer into a second integer with a specified number of bits under a second time scale, the second integer being as a coded value under the second time scale of the time information to be coded. A time information coding device, a searching method for coded values, a decoding method and device are also provided.

A system (100) for Partial Unstructured Information Processing, constituting storing, indexing, querying and retrieval of partially specified unstructured data, the system (100) comprising: Quantum Clustering Algorithm (101) that partitions data records in different clusters such that the data in each cluster can be indexed efficiently, a Compressed Ternary Tree (111, 112, 113) that replaces all conceivable indices for each cluster thereby solving the Unthinkable Query Problem (110) for each cluster, and a Virtual Query Processor (120) that converts traditional data base queries to raw Compressed Ternary Tree queries and appropriate filters (121, 122, 123).

Methods, systems, and computer storage media for providing a set of common flat files in a composite image that can be mounted as a container (i.e. composite container) to support isolation and interoperation of computing resources. Container management is provided for a container management system based on a composite image file system engine that executes composite operations. In particular, a remote sharing manager operates with a composite engine interface to support generating composite images configured for split layer memory sharing, split layer direct access memory sharing, and dynamic base images. In operation, a plurality of files and a selection of a remote sharing configuration for generating a composite image are accessed. The composite image for the plurality of files and the remoting sharing configuration is generated. The composite image is communicated to cause sharing of the composite image, sharing of the composite image is based on the remote sharing configuration.

A method of improving computing efficiency of a computing device for language-independent problem solving and reasoning includes receiving a query from a user, which is decomposed into one or more sub-queries arranged according to a tree structure. The one or more sub-queries are executed in a knowledge base. The results of the executed one or more sub-queries are received and composed into a query response. The query response is transmitted to the user.