CN100403316C - Data source establishment and processing method - Google Patents
Data source establishment and processing method Download PDFInfo
- Publication number
- CN100403316C CN100403316C CNB2006101536204A CN200610153620A CN100403316C CN 100403316 C CN100403316 C CN 100403316C CN B2006101536204 A CNB2006101536204 A CN B2006101536204A CN 200610153620 A CN200610153620 A CN 200610153620A CN 100403316 C CN100403316 C CN 100403316C
- Authority
- CN
- China
- Prior art keywords
- node
- conditional statement
- tree structure
- structure data
- judgment
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to a method for building tree structure data with logic relationship, wherein it comprises: first, increasing one node in tree data to record one condition description; judging the logic relationship between secondary condition description and the recorded condition description in the tree structure data; when the logic relationship is AND, adding another node in tree structure data under said node, to record the secondary condition description; or else, when the logic relationship is OR, adding another node in the tree structure data under the father node of said node, to record the second condition description.
Description
Technical field
The present invention is about a kind of method for building up and disposal route of data structure, especially in regard to a kind of method for building up and disposal route of utilizing the tree structure data.
Background technology
Along with the progress of information industry, be stored in the database after all types of Data Digital, and the user can look for data or allow database automatically send data according to Rule of judgment via assigning suitable Rule of judgment in database.On the other hand, because the prosperity of the Internet and universal, the user also can be at terminating machine by the data in network access or the operating database server.
As shown in Figure 1, a terminating machine 11 and a service end 12 are passed through network 14 and line, and (Hyper Text Transfer Protocol HTTP) carries out exchanges data with super literal transfer protocol.In addition, a database 13 be arranged on the server 12 or with server 12 lines.Under this structure, the user can utilize terminating machine 11 operating window browsers, screens and revise the data in the database 13.
As shown in Figure 2, the user can choose the condition project that will inquire about such as date, author, name of product or the like (step S01) on the form browser of terminating machine.Import each condition entry purpose conditional statement (for example date＞20050221, authority=Eric, product=car, product=bike or priority=high or the like) then, use and in database, find out the data (step S02) that meet these conditional statements.Then, terminating machine is combined into Rule of judgment with these conditional statements, and Rule of judgment is converted to resource localizer (Uniform Resource Locator, URL) (step S03) among the HTTP.Terminating machine is mixed in these conditional statements and is sent to server (step S04) among the URL then.Server extracts Rule of judgment (step S05) from URL, and whether the judgment data storehouse has the data (step S06) that meet Rule of judgment.If have, then judged result is true.Then, server is transmitted back to terminating machine with judged result, and terminating machine represents that search result consults (step S07) for the user.In addition, server can be stored in (step S08) in the database with the form among the URL with this Rule of judgment.When the user reused database, Rule of judgment and URL that the last time operation that database write down produces can be shown in terminating machine by server table.The user can choose a Rule of judgment wherein, takes out the Rule of judgment (step S09) that last inquiry is assigned with command server from database read.Then server is handled loaded URL as abovementioned steps.Thus, the user can use same Rule of judgment to inquire about or operating database in different time easily.
Yet when if the user changes condition project in the aforementioned Rule of judgment, to step S08, terminating machine must produce Rule of judgment in URL again at step S03, and server also must be again according to the Rule of judgment Query Database after upgrading.Rule of judgment after the renewal also can be stored in the database, inquires about once more for the user.Yet, have logical relation between these two Rule of judgment, if only write down Rule of judgment, can't write down this logical relation in the URL mode.Because it is structural that this mode does not more possess, also make that the program of handling Rule of judgment is not easy to write.On the other hand, though can read out last time Rule of judgment via program in step S09, the Rule of judgment that writes down in the URL mode then can't provide the user to revise condition project and content.
Summary of the invention
Because above-mentioned problem the invention provides a kind of method for building up and disposal route that can show the tree structure data of the logical relation between each conditional statement.
The invention provides a kind of method for building up with tree structure data of logical relation.At first, set the root node in the tree structure data, the node of addition record one conditional statement is under this root node.Then, judge a time conditional statement and be recorded in a logical relation between conditional statement in these tree structure data.When the above-mentioned logic judged close for " with " when (AND) concern, in the tree structure data additional another node under this node to write down this time conditional statement.Otherwise, when logic close for " or " when (OR) concern, in the tree structure data additional another node under the father node of this node to write down an inferior conditional statement.
The invention provides the tree structure processing method of data that a kind of use has conditional statement.At first, read a conditional statement that a node of tree structure data write down and another conditional statement that at least one child node write down of this node.According to the conditional statement of the conditional statement of this node and child node " with " (AND) relation and produce a Rule of judgment, wherein when this node has a plurality of child node, Rule of judgment also according to the conditional statement of these child nodes " or " (OR) relation and producing.
The invention provides a kind of disposal route of Rule of judgment.At first, write down a conditional statement in a node of tree structure data.Then, judge one time one conditional statement and be recorded in a logical relation between the conditional statement of this node in the tree structure data.When the above-mentioned logical relation of judging for " with " when (AND) concern, in the tree structure data newly-increased another node under this node to write down an inferior conditional statement.Otherwise, when the above-mentioned logical relation of judging for " or " when (OR) concern, in the tree structure data newly-increased another node under the father node of this node to write down an inferior conditional statement.Transmit tree structure data to a server, and read the conditional statement that this node write down of tree structure data and another conditional statement that at least one child node write down of this node in server.In server according to the conditional statement of the conditional statement of this node and child node " with " (AND) relation and produce a Rule of judgment, wherein when this node has a plurality of child node, Rule of judgment also according to the conditional statement of this a plurality of child nodes " or " (OR) concern and produce.
From the above, in method for building up and disposal route according to the tree structure data with logical relation of the present invention, a plurality of conditional statements are positioned over the father and son's node or the brotgher of node in the tree structure data respectively according to each other logical relation, therefore conditional statement can structuredly be recorded in the tree structure data, and can be, and make the program of Rule of judgment be easier to write and safeguard with the logical relation between each conditional statement with internodal connected mode record.
Description of drawings
Fig. 1 is the block diagram of the applied system of disposal route of the known Rule of judgment of expression;
Fig. 2 is the synoptic diagram of the disposal route of the known Rule of judgment of expression;
Fig. 3 is the process flow diagram of expression according to the disposal route of the Rule of judgment of one embodiment of the invention;
Fig. 4 sets up the process flow diagram of the tree structure data with logical relation in the disposal route of expression according to the Rule of judgment of one embodiment of the invention;
Fig. 5 is in the disposal route of expression according to the Rule of judgment of one embodiment of the invention, and the tree structure data are established a synoptic diagram of process;
Fig. 6 is in the disposal route of expression according to the Rule of judgment of one embodiment of the invention, and the tree structure data are established a synoptic diagram of process;
Fig. 7 handles the process flow diagram of the tree structure data with logical relation in the disposal route of expression according to the Rule of judgment of one embodiment of the invention; And
Fig. 8 is in the disposal route of expression according to the Rule of judgment of one embodiment of the invention, has the synoptic diagram that the tree structure data of logical relation are established and handle.
The component symbol explanation:
11: terminating machine
12: service end
13: database
14: network
2: the tree structure data
20: root node
21-2n: node
CS
1-CS
n: conditional statement
Embodiment
Hereinafter with reference to relevant drawings, method for building up and disposal route according to the tree structure data with logical relation of one embodiment of the invention are described.
In present embodiment, a user operates a form browser before a terminating machine, and assigns Rule of judgment in this form browser.One server and terminating machine line also receive the Rule of judgment that the user assigns and search a database, or server is carried out the operation that transmits data or send Email according to Rule of judgment.
The disposal route of the Rule of judgment that Fig. 3 is assigned for the processing terminal user.Choose the condition project (step S11) that to inquire about on the form browser of user prior to terminating machine.And then import each condition entry purpose conditional statement (step S12), use the data of in database, finding out eligible statement.Then, terminating machine is created as the tree structure data (step S13) with logical relation with the conditional statement data earlier.If the pass of above-mentioned two conditional statements be " with " (AND) relation, then be stored in two conditional statements in the tree structure data and be respectively conditional statement in father and son's node.Otherwise, if the pass of two conditional statements be " or " (OR) relation, then two conditional statements are stored in the conditional statement that is respectively in the tree structure data in the brotgher of node.Then, terminating machine conditional statement that these tree structure data are stored is sent to the server (step S14) of far-end.Then, server receives and reads the conditional statement that these tree structure data are stored.According to each father and son's node and the pairing conditional statement of the brotgher of node, conditional statement is combined as Rule of judgment (step S15), and whether the judgment data storehouse there are the data (step S16) that meet Rule of judgment.If database has the data that meet Rule of judgment, then judged result is true (true).If database does not meet the data of Rule of judgment, then judged result is for denying (false).Then, server is transmitted back to terminating machine with above-mentioned judged result, and terminating machine is represented judged result, consults (step S17) for the user.In addition, server can be with tree structure data storage (step S18) in database.If user next time is when still having identical Rule of judgment during operating database again, Rule of judgment and tree structure data that the preceding single job that database write down produces can be shown in terminating machine by server table, the user can choose a Rule of judgment wherein, directly be written into the tree structure data (step S19) that are stored in database with command server, then server is handled loaded tree structure data as abovementioned steps.
Please refer to Fig. 3 and Fig. 4, step S13 also comprises the step S21-S26 of Fig. 4, and each step is set up different tree structure data such as Fig. 5 and shown in Figure 6.At first, terminating machine is set a root node (step S21) of tree structure data.The node that records conditional statement is additional under the node that continues of root node or root node.Then terminating machine increases under the root node of a node in the tree structure data, wherein nodes records one conditional statement CS
1(step S22).A time conditional statement CS of terminating machine decision node
2And be recorded in the logical relation (step S23) between the conditional statement that each node write down in the tree structure data, with confirm logical relation between conditional statement be " with " (AND) relation or " or " (OR) concern.A because time conditional statement CS
2Only with conditional statement CS
1Relativeness is arranged, so in step S23, only judge a time conditional statement CS
2With conditional statement CS
1Logical relation." " when the logical relation of two conditional statements be " with " when (AND) concerning (as shown in Figure 5), terminating machine in tree structure data 2 additional node 22 under node 21, with at node 22 record time conditional statement CS
2(step S24).In this embodiment, node 21 is father and son's node with node 22, that is node 22 is additional under the node 21.
Otherwise, when the logical relation of two conditional statements be " or " when (OR) concerning (as shown in Figure 6), the node 22 of terminating machine in tree structure data 2 all is positioned under the root node 20 with node 21, to write down a time conditional statement CS
1With an inferior conditional statement CS
2(step S25).In this embodiment, node 21 and node 22 be the brotgher of node each other, that is node 22 is positioned under the root node 20 all on an equal basis with node 21.Then, terminating machine judges whether that pending conditional statement CS is still arranged
3-CS
n(step S26).If terminating machine has pending conditional statement, then get back to step S23 once more.Step S23-S26 can be again treatment conditions statement CS one by one in regular turn
3-CS
n
Please refer to Fig. 7, its step S31-S34 separates step for the thin part of the step S15 of Fig. 3.Please cooperate with reference to figure 5, server begin to look for tree structure data 2 from root node 20 first record the node (step S31) of conditional statement.Then, server reads a conditional statement CS of the node 22 (child node of node 21) that node 21 connected
2(step S32).Server is according to a conditional statement CS of node 21
1Conditional statement CS with node 22
2" with " (AND) relation and produce a Rule of judgment (step S33).Because root node 20 is a special node, it does not have the record condition statement, so only when handling root node 20, Rule of judgment only produces according to the conditional statement of child node.In addition, when root node 20 has a plurality of child node (as shown in Figure 6), Rule of judgment is also according to the conditional statement CS of these child nodes 21,22
1, CS
2" or " (OR) relation and produce.Then, server judges whether to still have the node (step S34) in the tree structure data of not looking for as yet, then is back to step S32 and looks for next node and all looked for up to each node if having.The priority of looking for node is to look for earlier with the node of one deck, and then looks for down the node of one deck, that is is the dark mode of looking in wide earlier back.
Above-mentioned step S32 can realize via the circulation or the letter formula of pulling over to step S34.If the letter formula realizes that the letter formula of pulling over reads the conditional statement (step S32) of the child node of existing node when looking for existing node, and produces Rule of judgment (step S33) according to the logical relation between this node and the child node to pull over.Then call out this letter formula of pulling over again, to look for next node (step S34).
For the feature that makes present embodiment is more obvious, below describe for example with Fig. 8.When the user has chosen the condition project that will inquire about, and reach conditional statement CS now at each condition entry
1-CS
6And during the logical relation between the conditional statement, this moment, terminating machine was set up tree structure data 2 with record condition statement CS
1-CS
6Setting up in the process of tree structure data, terminal organ is set up root node 20 earlier, and then sets up node 21 with record condition statement CS
1Then, terminating machine is judged conditional statement CS
1With conditional statement CS
2Be " with " (AND) concern, thereby under node 21, set up node 22 with record condition statement CS
2Terminating machine is judged and is still had conditional statement not to be recorded in as yet in the tree structure data 2 then, so continue to handle next conditional statement CS
3
At treatment conditions statement CS
3The time, terminal organ is judged conditional statement CS
3Be recorded in the conditional statement CS in the tree structure data 2
2Be " with " (AND) concern.Therefore terminal organ is recording conditional statement CS
2Node 22 under set up node 23, with record condition statement CS
3Terminating machine continues to handle next conditional statement CS then
4At treatment conditions statement CS
4The time, terminal organ is judged conditional statement CS
4Be recorded in the conditional statement CS in the tree structure data 2
3Be " or " (OR) concern, so terminal organ is recording conditional statement CS
3The father node 22 of node 23 under set up node 24 with record condition statement CS
4In other words, node 23 be the child node of node 22 with node 24, and node 23 and node 24 brotgher of node each other, terminating machine is set up node 2n again as the aforementioned processing mode then, states CS with record condition
n
After finishing, 2 foundation of tree structure data just are transferred into server end, in this special instruction be, the tree structure data have been widely used among now the program, and the program actuating code that transmits the tree structure data can be realized by technology such as JAVA, ASP, PHP or CGI.
Logical relation between all conditional statements can be via tree structure data representation as shown in Figure 8.Server begins to look for from root node 20, and reads the conditional statement CS of the child node 21 of root node 20
1Then, server is according to the conditional statement CS of child node 21
1Produce a Rule of judgment.Server is judged and is still had the node 21-26 that does not look for as yet in the tree structure data, and is back to step S32 and looks for next node 21.
When server is looked for node 21, the conditional statement CS that its child node 22 that reads node 21 is write down
2Then, server is according to conditional statement CS
1, CS
2" with " (AND) concern the generation Rule of judgment, then, server is judged the tree structure data and is still had the node 22-26 that does not look for, thereby returns again and look for next node 22.Server is looked for node 22 and is read the conditional statement CS of its child node 23,24
3, CS
4Because node 22 has two child nodes 23,24, so server is except foundation conditional statement CS
2And CS
3" with " (AND) concern and conditional statement CS
2And CS
4" with " (AND) relation outside, also according to conditional statement CS
3And CS
4" or " (OR) relation produce Rule of judgment, and this Rule of judgment is additional to after last time the Rule of judgment.In addition, server is looked for each node and the content of the Rule of judgment that produces is (the data＞20050221) ﹠amp of Fig. 8; () ﹠amp authority=Eric; (((product=car) ﹠amp; () ﹠amp priority=high; (customer=Q)) | (product=bike))), “ ﹠amp wherein; " for aforementioned carry " with " (AND) relation, and " | " for aforementioned carry " or " (OR) relation.
Then, server is looked for other nodes in the tree structure in regular turn according to aforesaid mode.Be owing to be the dark mode of looking in earlier wide back,, can look for the node 24 of conditional statement earlier and can not look for node 25 earlier in what this paid special attention to so looked for after the node 23.After aforementioned processing, the search condition that the user assigns can recover fully.Via step S31 after step S34 handles, each conditional statement CS
1-CS
6Be reconstituted among the Rule of judgment, then server according to Rule of judgment from database search data.
In the present embodiment, the conditional statement that the corresponding user of each node of tree structure data sets, each node can have a selected value SEL and whether choose this conditional statement with the record user.If the user chooses this condition project, selected value SEL is " enabling (enable) ".Otherwise if the user does not choose this condition project, selected value SEL is " forbidding (disable) ".After user's command server was written into last time tree structure data, the user can revise the conditional statement of choosing in terminating machine.Therefore server must judge whether the selected value SEL of the child node of existing node is " enable " in step S32, to read the conditional statement of child node.
In addition, again with the tree structure data instance of Fig. 8.If the user is with conditional statement CS
3Change into and not choosing, that is the Rule of judgment that the person of being to use sets is (conditional statement CS
1AND conditional statement CS
2AND conditional statement CS
4), then the selected value SEL of node 23 is corrected for " disable ", and the selected value SEL of other nodes still is " enable ".At this moment, server is judged node 22 when looking for node 21 selected value SEL is " enable ", with reading conditions statement CS
2When looking for node 22, the selected value SEL that server is judged node 23 is " disable ", so server reading conditions statement CS not
3Because in step S32-S34, server is also no longer looked for the later node of node 23, so node 25,26 also can not be read and handle, and has only the conditional statement CS of node 24
4Can be processed, last server can be combined as the amended Rule of judgment of user with conditional statement from tree structure data 2.
In sum, in foundation and disposal route according to the tree structure data with logical relation of the present invention, a plurality of conditional statements are positioned over the father and son's node or the brotgher of node of tree structure data respectively according to logical relation to each other, therefore conditional statement can structuredly be recorded among the tree structure data, and can make the program of Rule of judgment be easier to write and safeguard with the logical relation between each conditional statement according to the connected mode record between the node.
The above only is the preferred embodiments of the present invention, and all equivalences of carrying out according to claim of the present invention change and revise, and all should belong to covering scope of the present invention.
Claims (9)
1. method for building up with tree structure data of logical relation comprises:
Set the root node in the tree structure data;
The node of addition record one conditional statement is under this root node;
Judge one time one conditional statement and be recorded in a logical relation between this conditional statement of this node in these tree structure data;
When this logical relation be " with " when (AND) concerning, newly-increased another node in these tree structure data, and under this node this time of record conditional statement; And
When this logical relation be " or " when (OR) concerning, newly-increased another node in these tree structure data, and under the father node of this node with this time of record conditional statement.
2. the method for building up of tree structure data as claimed in claim 1, wherein this conditional statement " with " (AND) with " or " (OR) relation be used for searching a database data.
3. a use has the tree structure processing method of data of conditional statement, comprises:
Read a conditional statement that the node in the tree structure data write down and another conditional statement that at least one child node write down of this node; And
According to this conditional statement of this conditional statement of this node and this child node " with " (AND) relation and produce a Rule of judgment, wherein when this node has a plurality of child node, this Rule of judgment also according to this a plurality of conditional statements of this a plurality of child nodes " or " (OR) concern and produce.
4. whether use as claimed in claim 3 has the tree structure processing method of data of conditional statement, and wherein this node has a selected value, be selected to write down this conditional statement.
5. use as claimed in claim 4 has the tree structure processing method of data of conditional statement, wherein this read step when this selected value of this node when enabling, read this conditional statement of this node.
6. use as claimed in claim 4 has the tree structure processing method of data of conditional statement, and wherein this read step does not read the following conditional statement of child node of this node and this node when this selected value of this node is non-enabling.
7. the disposal route of a Rule of judgment comprises:
Write down in the node of a conditional statement in tree structure data;
Judge one time one conditional statement and be recorded in a logical relation between this conditional statement of this node in these tree structure data, wherein when this logical relation be " with " when (AND) concerning, in these tree structure data newly-increased another node under this node with this time of record conditional statement, and when this logical relation be " or " when (OR) concerning, in these tree structure data, increase newly another node under the father node of this node to write down this time conditional statement;
Transmit this tree structure data to a server;
Read this conditional statement that this node write down in these tree structure data and another conditional statement that at least one child node write down of this node in this server; And
In this server according to this conditional statement of this conditional statement of this node and this child node " with " (AND) relation and produce a Rule of judgment, wherein when this node has a plurality of child node, this Rule of judgment also according to this a plurality of conditional statements of this a plurality of child nodes " or " (OR) concern and produce.
8. the disposal route of Rule of judgment as claimed in claim 7 also comprises:
Set the root node in these tree structure data; And
Addition record has this node of this conditional statement under this root node.
9. the disposal route of Rule of judgment as claimed in claim 7, wherein these a plurality of conditional statements " with " (AND) relation and " or " (OR) the relation data that are used for searching a database.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006101536204A CN100403316C (en) | 2006-09-12 | 2006-09-12 | Data source establishment and processing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006101536204A CN100403316C (en) | 2006-09-12 | 2006-09-12 | Data source establishment and processing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1920833A CN1920833A (en) | 2007-02-28 |
| CN100403316C true CN100403316C (en) | 2008-07-16 |
Family
ID=37778556
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006101536204A Active CN100403316C (en) | 2006-09-12 | 2006-09-12 | Data source establishment and processing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100403316C (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103092889B (en) * | 2011-11-07 | 2016-01-06 | 阿里巴巴集团控股有限公司 | The defining method of entity object, the method for building up of condition node tree and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1279440A (en) * | 1999-07-06 | 2001-01-10 | 佳能株式会社 | System for searching on network |
| CN1339748A (en) * | 2000-08-21 | 2002-03-13 | 叶柯 | Method for imformation releasing sorting and access |
-
2006
- 2006-09-12 CN CNB2006101536204A patent/CN100403316C/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1279440A (en) * | 1999-07-06 | 2001-01-10 | 佳能株式会社 | System for searching on network |
| CN1339748A (en) * | 2000-08-21 | 2002-03-13 | 叶柯 | Method for imformation releasing sorting and access |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1920833A (en) | 2007-02-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101133712B1 (en) | A Method and System for Content Synchronization and Detecting Synchronization Recursion in Networks | |
| EP2005634B1 (en) | Method and apparatus for synchronizing contents of home network devices | |
| CN1173671A (en) | Preserving state in stateless network protocols | |
| CN102365636A (en) | Apparatus and methods for rendering a page | |
| EP1850231B1 (en) | Systems and methods of accessing information across distributed computing components | |
| KR20040028956A (en) | Configurable connector adapted to convey data between a first application and a second application | |
| JP2007026441A (en) | Apparatus and method for reaching agreement on web service policy | |
| CN102130843B (en) | Intelligent-document-platform-based multi-channel information acquisition and exchange method | |
| CN102480510A (en) | Realization method of C/S and B/S mixed architecture and apparatus thereof | |
| CN105718307B (en) | Process management method and management of process device | |
| Haselwanter et al. | Wsmx: A semantic service oriented middleware for b2b integration | |
| JP5488349B2 (en) | Relay device, relay method, and relay program | |
| US6976030B2 (en) | System and method for synchronizing distributed stored documents | |
| CN100403316C (en) | Data source establishment and processing method | |
| CN103907311B (en) | Remote access from mobile equipment | |
| JP4641506B2 (en) | Session management program, session management method, and session management apparatus | |
| JP2003141002A (en) | Url length conversion system and program | |
| WO2001065766A1 (en) | Method for accessing webpage using telephone number and system for servicing the same | |
| CN103475630A (en) | Session preservation method and apparatus thereof | |
| US20080307432A1 (en) | Method and apparatus for exchanging data using data transformation | |
| US20040049558A1 (en) | System and method for synchronizing unstructured documents | |
| JP5294261B2 (en) | Call recording system | |
| JP4643292B2 (en) | User information management system and user information management method | |
| JPH10171727A (en) | Method and device for repeating and converting information | |
| US20050198331A1 (en) | Seamless system and recording medium, and computer system process continuing method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |