US5454102A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for transferring structured data using a self-generating node network
Assignee: Canon Inc
•
Filing: 1993-01-19
•
Granted: 1995-09-26
•
Expires: 2013-01-19
Abstract
Abstract A self-generating node network (or directed graph) which represents the structure and contents of structured data. The node network creates itself from a root node by querying the structured data for structural-type elements and data-type elements. In response to the query, the root node builds one of two types of nodes: a list node and a data node. Data nodes are built in response to queries indicating data-type elements, and they store pointer tags to pieces of data in the structured data. List nodes are built in response to queries indicating structural-type elements. List nodes can build and contain further list nodes and data nodes, and they store a list of the nodes that they contain. Communication within the node network is carried out only between directly adjacent nodes, that is, between a parent node and a child node. Commands issued to the network, such as commands to write out the node network, are issued to the network via the root node. If the root node cannot execute the command, it relays the command to nodes it contains which, in turn, either executes the command or relays the command further into the network. Likewise, commands from within the network, such as commands from a list node to query the structured data, are relayed upwards to a parent node which, in turn, either executes the command or relays the command further upward in the network.
Inventors
- 👤 Hien Tang
- 👤 Randy A. Cwikowski
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 20:08
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/40; G06F16/20; G06F16/22; G06F16/2228; G06F16/2246; G06F16/48; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99941; Y10S707/99944; Y10S707/99945
Claims Analysis
Total Claims: 56
Claim 1
Independent Claim
260 words
A method for creating a self-generating node network from structured data, the structured data having data-type elements and structural-type elements, the method comprising the steps of: building a root node, the root node including communication capabilities with the structured data and with output means, and the root node further including process steps to build both (1) data nodes which include pointer tags to data, and (2) list nodes which contain other list nodes and data nodes and which include process steps to build those other list nodes and data nodes, both the list nodes and the data nodes including communication capabilities with immediate parent nodes and children nodes; querying the structured data from the root node and building a list node or a data node in accordance with whether a data-type element or a structural-type element is encountered; wherein in a case where a data-type element is encountered, a data node is built to store a pointer tag for the data type element; and wherein in a case where a structural-type element is encountered, a list node is built which can issue further queries to the structured data via the root node; and continuing to query the structured data via the root node from one of either the root node and a list node, with the one of the root node and the list node building further list nodes and data nodes in accordance with whether a data-type element or a structural-type element is encountered, said continuing to query step continuing until all of the structured data has been queried.
Claim 2
Independent Claim
260 words
A method for creating a self-generating node network from structured data, the structured data having data-type elements and structural-type elements, the method comprising the steps of: building a root node, the root node including communication capabilities with the structured data and with output means, and the root node further including process steps to build both (1) data nodes which include pointer tags to data, and (2) list nodes which contain other list nodes and data nodes and which include process steps to build those other list nodes and data nodes, both the list nodes and the data nodes including communication capabilities with immediate parent nodes and children nodes; querying the structured data from the root node and building a list node or a data node in accordance with whether a data-type element or a structural-type element is encountered; wherein in a case where a data-type element is encountered, a data node is built to store a pointer tag for the data type element; and wherein in a case where a structural-type element is encountered, a list node is built which can issue further queries to the structured data via the root node; and continuing to query the structured data via the root node from one of either the root node and a list node, with the one of the root node and the list node building further list nodes and data nodes in accordance with whether a data-type element or a structural-type element is encountered, said continuing to query step continuing until all of the structured data has been queried.
Claim 3
Dependent Claim
30 words
A method according to claim 1, further comprising the step of manipulating data tagged by data nodes to create new data nodes which are contained by a common list node.
Claim 4
Dependent Claim
24 words
A method according to claim 2, wherein each data node includes manipulation capabilities and wherein said manipulation step is performed by respective data nodes.
Claim 5
Dependent Claim
34 words
A method according to claim 1, wherein the list nodes and the data nodes include customized functionality tailored to meet characteristics of the data-type elements and the structural-type elements encountered in the structured data.
Claim 6
Dependent Claim
18 words
A method according to claim 4, wherein the customized functionality includes functionality to communicate with the structured data.
Claim 7
Dependent Claim
24 words
A method according to claim 4, wherein the customized functionality of a data node includes functionality to manipulate data tagged by the data node.
Claim 8
Dependent Claim
27 words
A method according to claim 1, further comprising the step of instructing the root node to write its contents selectively to file in accordance with selection criteria.
Claim 9
Dependent Claim
34 words
A method according to claim 7, wherein the root node writes its contents and then, in turn, instructs nodes contained in the root node to write their contents in accordance with the selection criteria.
Claim 10
Dependent Claim
29 words
A method according to claim 8, wherein nodes contained in the root node write their contents via the root node in a case where they meet the selection criteria.
Claim 11
Dependent Claim
41 words
A method according to claim 9, wherein a data node writes a header and writes data from the structured data in accordance with the pointer tag in the data node in the case where the data node meets the selection criteria.
Claim 12
Dependent Claim
34 words
A method according to claim 9, wherein a list node writes a header and, in turn, instructs contained nodes to write their contents in a case where the list node meets the selection criteria.
Claim 13
Dependent Claim
13 words
A method according to claim 11, wherein the header includes a length code.
Claim 14
Dependent Claim
19 words
A method according to claim 11, wherein the list node also writes a list of the nodes it contains.
Claim 15
Dependent Claim
16 words
A method according to claim 11, wherein contained nodes write their contents through respective list nodes.
Claim 16
Dependent Claim
23 words
A method according to claim 1, further comprising the step of instructing the root node to write its contents to the output means.
Claim 17
Dependent Claim
45 words
A method according to claim 15, wherein in response to an instruction to write its contents to the output means, the root node writes its contents and then, in turn, instructs nodes contained in the root node to write their contents to the output means.
Claim 18
Dependent Claim
16 words
A method according to claim 16, wherein contained nodes write their contents through respective list nodes.
Claim 19
Dependent Claim
20 words
A method according to claim 16, wherein contained nodes write their contents to the output means via the root node.
Claim 20
Dependent Claim
29 words
A method according to claim 18, wherein a data node writes a header and writes data from the structured data to output means in accordance with the pointer tag.
Claim 21
Dependent Claim
31 words
A method according to claim 18, wherein a list node writes a header to the output means and, in turn, instructs contained nodes to write their contents to the output means.
Claim 22
Dependent Claim
13 words
A method according to claim 20, wherein the header includes a length code.
Claim 23
Dependent Claim
19 words
A method according to claim 20, wherein the list node also writes a list of the nodes it contains.
Claim 24
Dependent Claim
16 words
A method according to claim 20, wherein contained nodes write their contents via respective list nodes.
Claim 25
Independent Claim
237 words
A method for creating a self-generating node network from input, the input having data-type headers and list-type headers, the method comprising the steps of: building a root node, the root node including communication capabilities with structured data and with the input, and the root node further including process steps to build both (1) data nodes which include pointer tags to data, and (2) list nodes which contain other list nodes and data nodes and which include process steps to build those other list nodes and data nodes, both the list nodes and the data nodes including communication capabilities with immediate parent nodes and children nodes; reading the input with the root node and building a list node or a data node in accordance with whether a data-type header or a list-type header is encountered; wherein in a case where a data-type header is encountered, a data node is built to store a pointer tag for the input; and wherein in a case where a list-type header is encountered, a list node is built which can accept further input via the root node; and continuing to read the input with the root node, with one of either the root node and a list node building further list nodes and data nodes in accordance with whether a data-type header or a structural-type header is encountered, said continuing to read step continuing until all of the input has been read.
Claim 26
Independent Claim
237 words
A method for creating a self-generating node network from input, the input having data-type headers and list-type headers, the method comprising the steps of: building a root node, the root node including communication capabilities with structured data and with the input, and the root node further including process steps to build both (1) data nodes which include pointer tags to data, and (2) list nodes which contain other list nodes and data nodes and which include process steps to build those other list nodes and data nodes, both the list nodes and the data nodes including communication capabilities with immediate parent nodes and children nodes; reading the input with the root node and building a list node or a data node in accordance with whether a data-type header or a list-type header is encountered; wherein in a case where a data-type header is encountered, a data node is built to store a pointer tag for the input; and wherein in a case where a list-type header is encountered, a list node is built which can accept further input via the root node; and continuing to read the input with the root node, with one of either the root node and a list node building further list nodes and data nodes in accordance with whether a data-type header or a structural-type header is encountered, said continuing to read step continuing until all of the input has been read.
Claim 27
Dependent Claim
30 words
A method according to claim 24, further comprising the step of manipulating data tagged by data nodes to create new data nodes which are contained by a common list node.
Claim 28
Dependent Claim
24 words
A method according to claim 25, wherein each data node includes manipulation capabilities and wherein said manipulation step is performed by respective data nodes.
Claim 29
Dependent Claim
33 words
A method according to claim 24, wherein the list nodes and the data nodes include customized functionality tailored to meet characteristics of the data-type headers and the list-type headers encountered in the input.
Claim 30
Dependent Claim
17 words
A method according to claim 27, wherein the customized functionality includes functionality to communicate with the input.
Claim 31
Dependent Claim
24 words
A method according to claim 27, wherein the customized functionality of a data node includes functionality to manipulate data tagged by the data node.
Claim 32
Dependent Claim
28 words
A method according to claim 24, further comprising the step of instructing the root node to write its contents selectively to structured data in accordance with selection criteria.
Claim 33
Dependent Claim
34 words
A method according to claim 30, wherein the root node writes its contents and then, in turn, instructs nodes contained in the root node to write their contents in accordance with the selection criteria.
Claim 34
Dependent Claim
29 words
A method according to claim 31, wherein nodes contained in the root node write their contents via the root node in a case where they meet the selection criteria.
Claim 35
Dependent Claim
48 words
A method according to claim 32, wherein a data node writes to structured data in accordance with a header from input and writes data from the input in accordance with the pointer tag in the data node in the case where the data node meets the selection criteria.
Claim 36
Dependent Claim
42 words
A method according to claim 32, wherein a list node writes structured data in accordance with a header from input and, in turn, instructs the contained nodes to write their contents in a case where the list node meets the selection criteria.
Claim 37
Dependent Claim
13 words
A method according to claim 34, wherein the header includes a length code.
Claim 38
Dependent Claim
19 words
A method according to claim 34, wherein the list node also reads a list of the nodes it contains.
Claim 39
Dependent Claim
23 words
A method according to claim 24, further comprising the step of instructing the root node to write its contents to the structured data.
Claim 40
Dependent Claim
43 words
A method according to claim 37, wherein in response to an instruction to write its contents to structured data, the root node writes its contents and then, in turn, instructs nodes contained in the root node to write their contents to structured data.
Claim 41
Dependent Claim
16 words
A method according to claim 38, wherein contained nodes write their contents via the root node.
Claim 42
Dependent Claim
34 words
A method according to claim 39, wherein a list node writes to structured data in accordance with a header from input and, in turn, instructs contained nodes to write their contents to structured data.
Claim 43
Dependent Claim
33 words
A method according to claim 39, wherein a data node writes to structured data in accordance with a header from input and writes data from the input in accordance with the pointer tag.
Claim 44
Dependent Claim
13 words
A method according to claim 41, wherein the header includes a length code.
Claim 45
Dependent Claim
19 words
A method according to claim 41, wherein the list node also reads a list of the nodes it contains.
Claim 46
Dependent Claim
16 words
A method according to claim 41, wherein contained nodes write their contents via respective list nodes.
Claim 47
Independent Claim
420 words
An apparatus for creating and outputting a self-generating node network from structured data which includes structural-type elements and data-type elements, comprising: a memory including a first memory region for storing the structured data, and a second memory region for storing (1) program instructions for building a root node for the self-generating node network, (2) a root node containing (i) process steps for building list nodes, (ii) process steps for building data nodes, and (iii) process steps for querying the structured data, (3) list nodes, each of which contains (i) process steps for building list nodes, (ii) process steps for building data nodes, and (iii) process steps for querying structured data and (4) data nodes, each of which contains (i) pointer tags to structured data and (ii) process steps for manipulating tagged data; and a processor for (1) building a root node by executing the program instructions for building a root node, (2) querying the structured data from the root node by executing the process steps for querying the structured data contained in the root node, (3) building a list node by executing the process steps for building a list node contained in the root node and building a data node by executing the process steps for building a data node contained in the root node in accordance with whether a date-type element or a structural-type element is encountered in the structured data, (4) continuing to query the structured data from the root node by continuing to execute the process steps for querying the structured data contained in the root node and in a case where a list node has been built, continuing to query the structured data from the list node by continuing to execute the process steps for querying the structured data contained in the list node until all of the structured data has been queried, and (5) continuing to build list nodes and data nodes by continuing to execute one of either the process steps for building a list node and the process steps for building a data node, contained in one of the root node and a list node in the case where a list node has been built, in accordance with whether a data-type element or a structural-type element is encountered in the structural data; wherein in a case where a data-type element is encountered, stored process steps for building a data node are executed; and wherein in a case where a structural-type element is encountered, stored process steps for building a list node are executed.
Claim 48
Independent Claim
420 words
An apparatus for creating and outputting a self-generating node network from structured data which includes structural-type elements and data-type elements, comprising: a memory including a first memory region for storing the structured data, and a second memory region for storing (1) program instructions for building a root node for the self-generating node network, (2) a root node containing (i) process steps for building list nodes, (ii) process steps for building data nodes, and (iii) process steps for querying the structured data, (3) list nodes, each of which contains (i) process steps for building list nodes, (ii) process steps for building data nodes, and (iii) process steps for querying structured data and (4) data nodes, each of which contains (i) pointer tags to structured data and (ii) process steps for manipulating tagged data; and a processor for (1) building a root node by executing the program instructions for building a root node, (2) querying the structured data from the root node by executing the process steps for querying the structured data contained in the root node, (3) building a list node by executing the process steps for building a list node contained in the root node and building a data node by executing the process steps for building a data node contained in the root node in accordance with whether a date-type element or a structural-type element is encountered in the structured data, (4) continuing to query the structured data from the root node by continuing to execute the process steps for querying the structured data contained in the root node and in a case where a list node has been built, continuing to query the structured data from the list node by continuing to execute the process steps for querying the structured data contained in the list node until all of the structured data has been queried, and (5) continuing to build list nodes and data nodes by continuing to execute one of either the process steps for building a list node and the process steps for building a data node, contained in one of the root node and a list node in the case where a list node has been built, in accordance with whether a data-type element or a structural-type element is encountered in the structural data; wherein in a case where a data-type element is encountered, stored process steps for building a data node are executed; and wherein in a case where a structural-type element is encountered, stored process steps for building a list node are executed.
Claim 49
Dependent Claim
17 words
An apparatus according to claim 45, wherein list nodes query the structured data via the root node.
Claim 50
Dependent Claim
26 words
An apparatus according to claim 45, wherein list nodes contain a list of contained nodes, and wherein the root node contains a list of contained nodes.
Claim 51
Dependent Claim
43 words
An apparatus according to claim 45, wherein the processor manipulates tagged data contained in a data node to build new data nodes which are contained in a common list node by executing process steps for manipulating tagged data contained in the data node.
Claim 52
Dependent Claim
35 words
An apparatus according to claim 45, wherein the processor sends a write command to the root node to output the node network and wherein the root node outputs the node network in a predetermined order.
Claim 53
Dependent Claim
89 words
An apparatus according to claim 49, wherein the predetermined order includes outputting nodes contained in the root node, then, in a case that there are no list nodes contained in the root node, outputting structured data according to the pointer tags to the structured data contained in data nodes, and in a case that there are list nodes contained in the root node, for each list node, outputting its children list nodes until a data node is output, and repeating the process until all structured data has been output.
Claim 54
Dependent Claim
27 words
An apparatus according to claim 50, wherein each node contains a header, and wherein, for each node, the node's header is output before its contents are output.
Claim 55
Independent Claim
361 words
A method for creating and outputting a self-generating node network stored in a hierarchical tree structure from structured data which includes structural-type elements and data-type elements, comprising the steps of: generating a root node, capable of communicating with the structured data and of outputting the generated node network, which stores process steps for generating further nodes, a list of nodes contained in the root node, and process steps for querying the structured data; sending a query from the root node to the structured data, the query being created by the root node according to the process steps for querying the structured data stored in the root node; in a case where a data-type element is encountered by the query, generating a data node from the process steps for generating further nodes stored in the root node, the data node (1) storing pointer tags to the structured data and process steps to manipulate the tagged data, and (2) including process steps to communicate with a parent node for that data node; in a case where a structural-type element is encountered by the query, generating a list node from the process steps for generating further nodes stored in the root node, the list node (1) storing process steps for generating further nodes, a list of nodes contained in the list node, and process steps for querying the structured data, (2) communicating with its parent node and its children nodes, (3) querying the structured data via the root node, and (4) generating one of a data node and a list node based on a response to the query; issuing a completion signal to indicate that a node network has been generated from the structured data; sending a command to the root node for the root node to output the node network; and outputting the node network, through the root node, in the following predetermined order: (1) a root node header, (2) children nodes of the root node, and (3) for each child node of the root node, (i) a header, and (ii) the child node's children nodes if the node is a list node, and structured data if the node is a data node.
Claim 56
Independent Claim
361 words
A method for creating and outputting a self-generating node network stored in a hierarchical tree structure from structured data which includes structural-type elements and data-type elements, comprising the steps of: generating a root node, capable of communicating with the structured data and of outputting the generated node network, which stores process steps for generating further nodes, a list of nodes contained in the root node, and process steps for querying the structured data; sending a query from the root node to the structured data, the query being created by the root node according to the process steps for querying the structured data stored in the root node; in a case where a data-type element is encountered by the query, generating a data node from the process steps for generating further nodes stored in the root node, the data node (1) storing pointer tags to the structured data and process steps to manipulate the tagged data, and (2) including process steps to communicate with a parent node for that data node; in a case where a structural-type element is encountered by the query, generating a list node from the process steps for generating further nodes stored in the root node, the list node (1) storing process steps for generating further nodes, a list of nodes contained in the list node, and process steps for querying the structured data, (2) communicating with its parent node and its children nodes, (3) querying the structured data via the root node, and (4) generating one of a data node and a list node based on a response to the query; issuing a completion signal to indicate that a node network has been generated from the structured data; sending a command to the root node for the root node to output the node network; and outputting the node network, through the root node, in the following predetermined order: (1) a root node header, (2) children nodes of the root node, and (3) for each child node of the root node, (i) a header, and (ii) the child node's children nodes if the node is a list node, and structured data if the node is a data node.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-09-25 | 1999-03-27 | 1999-09-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-09-25 | 2003-03-27 | 2003-09-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-09-25 | 2007-03-27 | 2007-09-26 | $7700.00 | Window Closed / Lapsed |