CN101201826A - Distributed relational tree platform for information management - Google Patents

Distributed relational tree platform for information management Download PDF

Info

Publication number
CN101201826A
CN101201826A CNA2006101653053A CN200610165305A CN101201826A CN 101201826 A CN101201826 A CN 101201826A CN A2006101653053 A CNA2006101653053 A CN A2006101653053A CN 200610165305 A CN200610165305 A CN 200610165305A CN 101201826 A CN101201826 A CN 101201826A
Authority
CN
China
Prior art keywords
information
node
platform
tree
relational tree
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.)
Pending
Application number
CNA2006101653053A
Other languages
Chinese (zh)
Inventor
何庆
周海筹
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
HE QING KONG WEI
Original Assignee
HE QING KONG WEI
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by HE QING KONG WEI filed Critical HE QING KONG WEI
Priority to CNA2006101653053A priority Critical patent/CN101201826A/en
Publication of CN101201826A publication Critical patent/CN101201826A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention provides a platform of a distributed relational tree used for information management. The platform consists of nodes and connecting lines, wherein, the nodes are information units, the connecting lines are logical relation among the information units and all the nodes form a relational tree-shaped information organization structure; the information of the distributed relational tree platform is text type and all the nodes carry out information processing by unidirectional search and replacement. The distributed relational tree platform makes use of tree-shaped structure to organize all the information of and represents all the information by a text string, thus realizing the uniform description and operation of the information and having the ability of organization and the ability of representing for expanding information unlimitedly.

Description

The distributed relational tree platform that is used for information management
Technical field
The present invention relates to a kind of distributed relational tree platform (DistributedRelation-Tree ' s Platform abbreviates DRTP as) that is used for information management, belong to computer software technical field.
Background technology
Current era is called as the information age, and the importance of information resources has surmounted the matter and energy resource.Therefore, the information economy activity that is purpose with abundant exploitation information resources enlarges rapidly.Particularly in recent ten years, along with developing rapidly of Internet technology, information resources are Exponential growth.People are being faced with unprecedented information processing pressure.How to organize the network information data of magnanimity rationally and effectively, become the problem that people have to face.
At present, the organizational form of the network information mainly contains file mode, database mode, subject tree mode, hypermedia mode etc.In fact, online information organization is not to adopt single mode, and often multiple mode is used in combination, and has adopted hypermedia mode and the database mode that marks off above as search engine and discipline information door; And in the hypermedia mode, file and database all can be used as the node of link.
The internet is maximum at present network information database.In the internet, each information node interconnects in the hypermedia mode, to offer the connection facility of user's maximum.But, owing to can connect between any information node in network, therefore to exist between the information logical relation not strong for this information organization mode, problems such as the boundary between information and the information is not obvious, thereby cause the information organization in the internet very at random, be difficult to management, be easy to cause the serious waste of information resources.
Be faced with today that quantity of information increases rapidly people, how to provide a kind of can be more reasonable, high-efficiency information institutional framework more, the rambling information classification of the magnanimity of sending all the time every day, be processed to form one to people's Useful Information, remain needs problem anxious to be solved.
At present, the someone has broken through the natural mode of organization and administration information in the traditional computer, has creatively proposed some new technical solutions.For example publication number is that the Chinese invention patent application of CN1811775 " is set up the method for tree file structure " in the computing machine, a kind of tree file structure method of setting up in computing machine has been proposed, carry out following steps: step 1, computing machine are when opening a file, call the panel generator program, create a panel that is used to show the tree structure of described file; Step 2, described routine call file tree generate subprocess, add one and described file corresponding file node in described panel, and the displaying contents of this document node is the file name of described file; Step 3, described subprocess are root node with described Archive sit, generate the tree structure of described file in described panel.This method can show file and the information of document and the relation of opening each other, thereby has supported the switching between each profile window, avoids the generation of faulty operation.
In addition, be in the Chinese patent application " a kind of subitem drag and drop method of tree structure " of CN1690936 at publication number, a kind of method of operating of tree structure subitem has been proposed.When carrying out drag and drop in order to overcome in the prior art subitem to tree structure with more group or subitem, often needing rolls selects the shortcoming of drag and drop purpose group, and the present invention proposes a kind of drag and drop method of subitem of tree structure.This method comprises the steps: that (a) drags in the tree structure subitem to be dragged; (b) this tree structure of indentation only shows its group structure so that the subitem of this tree structure is hidden; (c) subitem that this is dragged is put into the purpose group; (d) launch this tree structure so that the subitem that should hide shows again.The inventive method also can be applied to have the subitem of the tree structure of visualization interface, file for example, the drag-and-drop operation of sub-directory etc.
But above-mentioned technical scheme has just proposed some specific implementations of tree-shaped information organization structure from concrete operating level, fundamentally do not solve the problem that magnanimity information is difficult to manage.
Summary of the invention
The object of the present invention is to provide a kind of distributed relational tree information platform that is used for information management.This platform is with the node carrying magnanimity information of tree, concerns with concerning between the statement information between the node, and be between the development and application platform between operating system and the development environment and between operating system and the user.
For realizing above-mentioned goal of the invention, the present invention adopts following technical scheme:
A kind of distributed relational tree platform that is used for information management is characterized in that:
Described platform is made up of node and line, and described node is a message unit, and described line is the logical relation between the message unit, and each groups of nodes is made into the information organization structure of relational tree shape;
Information in the described distributed relational tree platform all is text, and each node is replaced by unidirectional search and carried out information processing.
Described node has three kinds of base attributes, is respectively title, text and link.
The loop that does not exist certain several node to form in the described relational tree platform.
Distributed relational tree platform provided by the present invention utilizes tree structure to organize all information, and explains all information with text string, thereby the unification of the information of realization is described and operation, and has the tissue and the statement ability of infinite expanding information.
Description of drawings
Below in conjunction with drawings and Examples the present invention is further described.
Fig. 1 is the basic structure synoptic diagram of distributed relational tree platform provided by the present invention;
Fig. 2 is the synoptic diagram that concerns of distributed relational tree platform and software and hardware.
Embodiment
At the problem that exists in the existing information institutional framework, the present invention organizes information to concern tree-shaped institutional framework.The what is called relational tree is exactly to be basic composition unit with node (message unit), and node is organized with tree-shaped layer of structure.Fig. 1 is the relational tree structural representation.Relational tree is a kind of institutional framework of being made up of node and line as seen from the figure, and characteristics maximum in this structure are exactly not have circle, promptly do not have the loop of sealing.Each node is each independently node, and node and the internodal logical relation of promptly having represented between interdependent node that is connected.A relational tree has a node initial, and promptly node O among the figure becomes head node.Head node is the core processing information that whole tree finally will be finished.For informational needs node A, the B that handles head node O, the information of three child nodes of C, these three nodes are called the one-level node of this relational tree.Need A and obtain the A nodal information 1, A 2Two sub-nodal informations.The B node needs B 1Nodal information.The C node needs C 1, C 2, C 3Nodal information.A 1, A 2, B 1, C 1, C 2, C 3The two-level node that is called this relational tree.The rest may be inferred, is established to node always and no longer is provided with downstream site, and this relational tree is set up and finishes.This node that is not provided with downstream site is called terminal node.In this relational tree, logical relation specific between each node is represented in the connection between each node.That is to say that this relational tree is connected to form by nodes at different levels and each internodal logical relation, can clearly show logical relation and level between a whole tree information.In addition, C node and C among the figure 1, C 2, C 3Node is separated from whole tree the out, and can regard one as is the new tree of head node with the C node, is called the subtree of former O node tree.
In above-mentioned relational tree platform, node has three kinds of base attributes, is respectively title, text and link.Other attribute can also be set in addition, as required.
This distributed relational tree platform has following technical characterstic:
1. the information of handling in the relational tree platform all is text
Information type in the reality may be varied, both may be text message, also may be binary message, also may be program information or the like.This is divided into a lot of different types in detail in existing information organization structure.But in this relational tree platform, various information are unified into a kind of information type, i.e. text message.Because the work that relational tree will be finished is that information is handled, in treatment project, various information all is considered as text message and handles.This represents that by language various things exchange just as people.
2. each node is replaced by unidirectional search and is carried out information processing
In relational tree platform, information processing is to replace realization by by downstream site the superior node that is attached thereto being carried out unidirectional search.In the search replacement process, each node types is that same text message is to replace the prerequisite of being implemented.
3. there is not circle in this relational tree platform
There is not circle in structure by relational tree in the relational tree as can be seen, and promptly certain several node forms the loop of sealing.Restriction on this dot structure and above-mentioned characteristics 2 have just guaranteed not exist in the relational tree situation of superior node as the child node of downstream site, have also just eradicated the possibility that the logic endless loop occurs from structure.In relational tree, strictness is keeping by downstream site by replacing the single direction of replacement superior node.
4. subtree has independence
Above-mentioned characteristics have guaranteed not exist in the relational tree downstream site that superior node is had dependence, that is to say that the subtree of any one nonterminal node sub-department is arranged, and all have the possibility that independently becomes a new tree.This subtree can break away from elite tree fully and independently carry out information processing.Like this,,, can generate a new tree at any time and carry out local information management work according to the needs of practical application in different occasions, among the present invention that Here it is with the reason place of this platform called after distributed platform.
5. the extendability of relational tree is strong
Can know in this relational tree platform by These characteristics 4, each subtree have very high independence.These characteristics not only are embodied in subtree and have very high independent processing ability, and also being embodied in relational tree can develop the subtree that makes new advances downwards freely by each node, and the structure of whole relational tree does not need corresponding the adjustment.
Generally speaking, distributed relational tree platform provided by the present invention is with the basic composition unit of node as tree, so the boundary between each node is very obvious, and logical relation is very clear.By this relational tree structure information is organized, made to have very strong logicality between each node.Therefore, the information organization structure that this relation is tree-shaped compared to the network-like information organization structure of often seeing at present, more meets common language of people and cognitive custom, has stronger readability.And owing to independence between each nodal information in the relational tree and the subtree is very strong, this feasible message structure by the relational tree tissue has very strong alterability.
Need to prove, though be based on tree structure at distributed relational tree platform provided by the present invention, but owing to the node in the tree can be received on another tree by articulating mode, and the node on another tree also may articulate, and the relation of quoting mutually between the therefore this different trees still may constitute netted information organization form.
Fig. 2 is the synoptic diagram that concerns of distributed relational tree platform and software and hardware.This relational tree platform generates and editor DRTP shell script, so that carry out alternately with the user, changes and generate computerese or descriptive language (html, postscript etc.) simultaneously.On the other hand, tissue generates the magnanimity information tree, so that user and program are carried out interface.
Information organization work when this distributed relational tree platform especially is fit to software programming.It can be used as the platform of software programming, and itself does not have own independent language and grammer this programming platform, but a kind of redevelopment platform that relies on existing language and program.
In this distributed relational tree platform, can be provided with structural design panel and function storehouse.The structural design panel offers development environment that makes up the corresponding relation tree construction according to the design needs of user.The function storehouse then is that the program of specific function that other language are write out is as a node.Node or subtree store the function storehouse for use in other exploitation.During actual exploitation, the user only need select suitable node or subtree in the function storehouse, according to the logical relation of own institute development sequence these nodes or subtree is organized into a new relational tree and gets final product.Why can accomplish that this point is in this distributed relational tree platform, each node or subtree have higher independence.
Distributed relational tree platform provided by the present invention has following characteristics as programming platform:
1. the developer no longer needs to be familiar with various development language, and only need to understand function The function of each existing node or subtree in the storehouse. This is so that the developer can be from writing the work of code In free, the program development personnel can be placed on bigger energy in the logical design of program. Simultaneously, also can make some people that do not understand programming language can finish easily appointing of program development Be engaged in.
2. because the design feature of relational tree, so that the programmed logic of developing relation is clear, no Be prone to the normal logic error that occurs in the common programming language. Because each subtree can be independently as one Therefore individual tree operation also is convenient to the debugging that the developer carries out subprogram, no longer needs design specially The debugging routine of door.
For example, in the prior art, for the logical level that clearly embodies between the variable concerns, Often need to utilize multiple bracket to be distinguished, and in the present invention, utilize relational tree platform originally Body is hierarchical structure very clearly, can avoid using too much bracket.
3. development platform has very strong extensibility. The user can be according to own needs in the function storehouse Middle oneself the required node with new function or subtree of adding. The expansion of this function even need not Understand the specific code that this new function realizes, and the function that only need to understand this function and outwards provide connects Mouthful. Equally, the program of developing in this development platform also has very strong extensibility. This be because of The program of serving as reasons and developing in this platform has well been inherited the design feature of relational tree. Can By the structure of relational tree, the subtree that the cofree downward development of any node in program makes new advances, Original program is expanded.
4. eliminated the aphasis in the programming language. As everyone knows, nearly all programming language All be based upon on the english foundation, and in this relational tree platform, because the information of processing all is The text type, it also is feasible therefore using Chinese or other Languages. In addition, exploit person The main work of member is that the node in the function storehouse or subtree are organized in according to internodal logical relation On the relational tree. The developer does not need to understand the code implication of node in the function storehouse or subtree, Only need to understand the function that the node that provides or subtree provide.
5. because the node that the function storehouse of this development platform provides or subtree are unified edits. This so that the program development personnel again can be because of the partial code mistake but whole program can't move. This will improve developer's development efficiency greatly.
7. be convenient to the mutual interchange between the developer.
The developer can by the method in supplementary functions storehouse, utilize other developers to open easily Send out good existing program.
By above-mentioned advantage based on the programming platform that concerns tree-shaped information organization structure, as can be seen by this orderly structure organization of relational tree, make program development become more efficient, reasonable, make the program development personnel more energy can be placed on the tissue of the prior logical relation of program development.
Above the distributed relational tree platform that is used for information management of the present invention is had been described in detail.For one of ordinary skill in the art, any conspicuous change of under the prerequisite that does not deviate from connotation of the present invention it being done all will constitute to infringement of patent right of the present invention, with corresponding legal responsibilities.

Claims (3)

1. distributed relational tree platform that is used for information management is characterized in that:
Described platform is made up of node and line, and described node is a message unit, and described line is the logical relation between the message unit, and each groups of nodes is made into the information organization structure of relational tree shape;
Information in the described distributed relational tree platform all is text, and each node is replaced by unidirectional search and carried out information processing.
2. the distributed relational tree platform that is used for information management as claimed in claim 1 is characterized in that:
Described node has three kinds of base attributes, is respectively title, text and link.
3. the distributed relational tree platform that is used for information management as claimed in claim 1 is characterized in that:
The loop that does not exist certain several node to form in the described relational tree platform.
CNA2006101653053A 2006-12-15 2006-12-15 Distributed relational tree platform for information management Pending CN101201826A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNA2006101653053A CN101201826A (en) 2006-12-15 2006-12-15 Distributed relational tree platform for information management

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNA2006101653053A CN101201826A (en) 2006-12-15 2006-12-15 Distributed relational tree platform for information management

Publications (1)

Publication Number Publication Date
CN101201826A true CN101201826A (en) 2008-06-18

Family

ID=39516996

Family Applications (1)

Application Number Title Priority Date Filing Date
CNA2006101653053A Pending CN101201826A (en) 2006-12-15 2006-12-15 Distributed relational tree platform for information management

Country Status (1)

Country Link
CN (1) CN101201826A (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103455476A (en) * 2012-05-29 2013-12-18 阿里巴巴集团控股有限公司 Processing method and device for network information and establishing method and device for abstract syntax tree
CN103678263A (en) * 2013-12-31 2014-03-26 吕奇森 Graphical interface display method and system for incidence relations among document chapters
CN103955468A (en) * 2012-03-06 2014-07-30 北京奇虎科技有限公司 Method and device for displaying documents based on browser
CN104765787A (en) * 2015-03-24 2015-07-08 中国银行股份有限公司 Method and system for analyzing association relation of element files in software system
CN105989050A (en) * 2015-02-05 2016-10-05 天脉聚源(北京)科技有限公司 Search method and system for trade information management system
CN105989434A (en) * 2015-02-06 2016-10-05 天脉聚源(北京)科技有限公司 Transaction information management method and system

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103955468A (en) * 2012-03-06 2014-07-30 北京奇虎科技有限公司 Method and device for displaying documents based on browser
CN103955468B (en) * 2012-03-06 2017-12-19 北京奇虎科技有限公司 Document display method and device based on browser
CN103455476A (en) * 2012-05-29 2013-12-18 阿里巴巴集团控股有限公司 Processing method and device for network information and establishing method and device for abstract syntax tree
CN103455476B (en) * 2012-05-29 2016-11-23 阿里巴巴集团控股有限公司 The processing method of the network information and the method for building up of abstract syntax tree and device thereof
CN103678263A (en) * 2013-12-31 2014-03-26 吕奇森 Graphical interface display method and system for incidence relations among document chapters
CN105989050A (en) * 2015-02-05 2016-10-05 天脉聚源(北京)科技有限公司 Search method and system for trade information management system
CN105989434A (en) * 2015-02-06 2016-10-05 天脉聚源(北京)科技有限公司 Transaction information management method and system
CN104765787A (en) * 2015-03-24 2015-07-08 中国银行股份有限公司 Method and system for analyzing association relation of element files in software system
CN104765787B (en) * 2015-03-24 2017-11-14 中国银行股份有限公司 Salt file association relationship analysis method and system in software systems

Similar Documents

Publication Publication Date Title
Fischer et al. Supporting indirect collaborative design with integrated knowledge-based design environments
JP4139391B2 (en) Selective multi-level expansion of databases with pivot point data
CN101201826A (en) Distributed relational tree platform for information management
JP5063890B2 (en) System that facilitates object model design
US5712960A (en) System and methods for intelligent database management using abductive reasoning
US20140109007A1 (en) Method And System For Defining Relationships Among Labels
Simone et al. A notation for malleable and interoperable coordination mechanisms for CSCW systems
CN103279458B (en) A kind of structure of domain body and instantiation method
CN110221858A (en) Analogue data generation method, device, equipment and computer readable storage medium
Nürnberg et al. What was the question? Reconciling open hypermedia and World Wide Web research
Devedzic Software Patterns
CN110110972A (en) Workflow information service system
Rossi et al. Metamodeling editor as a front end tool for a CASE shell
de Oliveira et al. Conceptual Workflow Modelling for Remote Courses.
Blair et al. The Challenges of CSCW for Open Distributed Processing.
JP3615280B2 (en) Network information retrieval system
Whitescarver et al. A network environment for computer-supported cooperative work
Kremer Toward a multi-user, programmable web concept mapping" shell" to handle multiple formalisms
Hasso et al. A theoretically-based process for organizing design patterns
US20030142202A1 (en) Method and system for automated call graph layout
Raguenaud et al. Implementation of the Prometheus Taxonomic Model: a comparison of database models and query languages and an introduction to the Prometheus ObjectOriented Model
Malone et al. Two design principles for collaboration technology: Examples of semiformal systems and radical tailorability
Lockemann et al. Future database technology: Driving forces and directions
Komorowski et al. The use of fisheye views for displaying semantic relationships in a medical taxonomy
CN107391674A (en) A kind of new class method for digging and device

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Open date: 20080618