63 results about "Nested data" patented technology

A method and a system process a stream of data in parallel across a plurality of nodes. The log processing system has a log module, a query language module, and a query processing module. The log module receives and organizes the stream of data into a sequential and nested data structure. The query language operator module defines operators that operate on the sequential and nested data structure. The query processing module processes in parallel across a plurality of nodes a query based on an operator on the stream of data.

Provided are a method for parsing a bit stream including multiple data formats, and an apparatus and computer program including a set of parsers and parser-selection and invocation capabilities for handling parsing of multiple data formats. A first parser is selected and invoked to handle a first formatted component of the bit stream, and this selected parser selects and invokes a next parser which is capable of handling a differently formatted next component of the bit stream. This is differentiated from systems which rely on a single generic parser or a single high-level parser selection process, and is especially advantageous when parsing messages to enable message processing in systems in which a message can include multiple different, nested data formats.

A nesting data generation device generates nesting data for cutting off a part from a work supported by plural support projections. The nesting data generation device includes a nesting data generating unit that generates the nesting data by arranging a geometry of the part on the work. The nesting data generating unit performs, upon arranging the geometry of the part on the work, an avoidance process for avoiding an impediment due to the support projections. According to the nesting data generation device, the part can be prevented from welding on the support projections and the support projections can be prevented from welding upon arranging the geometry on the work by considering positions of the support projections, so that a drop-off and an inclination of the cut part can be prevented.

An embodiment of the present invention discloses a method for converting a tree-like nested data into a plane data table. The method comprises: A. separately locating each information field contained in a to-be-converted information field set onto each leaf node, which corresponds to the information field, in a tree-like data nested structure; B. acquiring each path from a root node to each leaf node; C. generating each primitive chained list according to each path; D. combining the primitive chained lists into a single primitive tree; E. traversing each node the single primitive tree, so as to acquire each extracted primitive tree; and F. executing each extracted primitive tree, so as to acquire each plane data table corresponding to each extracted primitive tree. Therefore, the method disclosed by the embodiment of the present invention is beneficial for automatically carrying out the structure conversion process of converting the tree-like nested data into the plane data table, thereby effectively reducing costs of subsequent data usage.

A method and apparatus for creating a schema definition from a language-specific metamodel of a data structure written in a legacy computer language involves walking through the nodes of the metamodel, and creating corresponding schema element objects in a schema tree that is serialized to create the schema definition. The creation of the schema element objects follows rules, and permits the definition of nested data structures having conjunctive-type and disjunctive-type membership.

A method and apparatus for creating a schema definition from a language-specific metamodel of a data structure written in a legacy computer language involves walking through the nodes of the metamodel, and creating corresponding schema element objects in a schema tree that is serialized to create the schema definition. The creation of the schema element objects follows rules, and permits the definition of nested data structures having conjunctive-type and disjunctive-type membership.

A method and a system process a stream of data in parallel across a plurality of nodes. The log processing system has a log module, a query language module, and a query processing module. The log module receives and organizes the stream of data into a sequential and nested data structure. The query language operator module defines operators that operate on the sequential and nested data structure. The query processing module processes in parallel across a plurality of nodes a query based on an operator on the stream of data.

Systems and methods for facilitating on-demand delivery and processing of one or more programs and program-compatible applications on a plurality of different machines. In an embodiment, a metadata-driven command processor on a machine sends a request for a booting program and application to an agent. In response to the request, the agent invokes a resource to generate a booting program dataset that defines the booting program and an application dataset that defines the application, generates a response dataset comprising two or more nested datasets, wherein the two or more nested datasets comprise at least the booting program dataset and the application dataset, and sends the response dataset to the metadata-driven command processor. The metadata-driven command processor copies the booting program dataset and the application dataset into a process dataset comprising two or more nested datasets, and processes the first process dataset to execute the booting program and application on the machine.

A method and system for processing and managing requests for concurrent use of data. Nested databases are utilized in order to create different environments in which the data can be accessed and modified. For each transaction which is in existence, there is an indication or reference to a database or subdatabase associated with that transaction. There are also data structures which indicate, for each data item at issue, which database or subdatabase is associated with that item. The use of data structures relating the transactions, subdatabases, and data items allows the creation of spheres of control for the various transactions and subdatabases. Thus, data can be readily shared among a plurality of users. The creation of the subdatabases does not require plural copies of data and the database management system may be implemented using one copy of the data, although multiple copies may be utilized, if desired.

The invention discloses a method for graphically displaying ICD [IED (intelligent electronic device) capability description] virtual terminals of intelligent substations. The method includes reading N ICD files, parsing each ICD file, constructing IED objects and expressing objects such as LD (logical devices), control blocks, input virtual terminals and output virtual terminals of each IED by the aid of nested data structures; displaying names of the various ICD files in lists; drawing integral layout charts of the input and output virtual terminals of each IED corresponding to a certain ICD in a graphical mode; responding to events such as click arrows and rectangular frames on graphical interfaces, respectively displaying description and quotation of GOOSE (generic object oriented substation event) or SV (sample value) types of input virtual terminals in tables and displaying description and quotation of various output virtual terminals of transmission data sets corresponding to the control blocks. The method has the advantage that a technical effect of quickly and visually switching the graphical interfaces of the integral layout charts into the input virtual terminal and output virtual terminal tables to check details of the input virtual terminal and output virtual terminal tables can be realized.

A method for generating a copy of a first message in a messaging system, wherein the first message includes a nested data item comprising data items, the method comprising the steps of: creating a second message as a deferred copy of the first message; responsive to a determination that one of said data items addressed at the second message location is to be updated, creating an actual copy of the updated data item in the second message.

Automated end-to-end exporting of XML-based data and uploading in tabular format to target databases. Primary / foreign keys are intelligently created to associate / tie together the hierarchal relationships that exist in the nested XML data. As such, the data can be loaded into the databases while maintaining the requisite hierarchal relationships of the data elements. In addition, the exporting and upload process is independent of target database schema as the invention provides for generating and deploying scripts that define the database schema within the target database.

The invention discloses a method and system for multi-base station positioning. The method for multi-base station positioning includes the steps: performing hierarchical division of the master and theslave on each base station in an LE positioning engine; setting an adjacent minimum calculation unit in each direction of each minimum calculation unit; calculating a first coordinate value of the minimum calculation unit for at least N times; if the difference between the second coordinate values is within a preset first threshold, acquiring an average value of coordinates corresponding to the second coordinate value; and taking the average value of the coordinates as a static coordinate value of a positioning tag, and using a map-nested data structure to quickly find the positioning tag according to a key value Key and move the positioning tag to the next minimum unit. The system for multi-base station positioning is a typical distributed system, so that the system needs precise time synchronization, and the adjacent level node time synchronization mode satisfies this requirement.

The invention provides a multistage nested data drive calculation method matched with a high-performance computer structure. The method is mainly used for adapting to the high-performance computer system structure. The method comprises the first step of three-stage nested parallel calculation organization of courses, thread groups and threads matched with calculation resources namely calculation nodes, processors and processor cores, wherein the static data distribution method is adopted in the two stages of the courses and the thread groups and the thread groups support the task dynamic dispatching; the second step of three-stage nested data communication and data partitioning matched with the network, an internal storage and a cache. The method solves the problem that when data drive parallel calculation is implemented in the prior art, calculation parallelism and data locality are low in efficiency, and achieves the technical effects of effectively balancing loads and improving communication, internal storage access and calculation efficiency.