CN101950307A - User resource-oriented customization mechanism - Google Patents
User resource-oriented customization mechanism Download PDFInfo
- Publication number
- CN101950307A CN101950307A CN2010102988845A CN201010298884A CN101950307A CN 101950307 A CN101950307 A CN 101950307A CN 2010102988845 A CN2010102988845 A CN 2010102988845A CN 201010298884 A CN201010298884 A CN 201010298884A CN 101950307 A CN101950307 A CN 101950307A
- Authority
- CN
- China
- Prior art keywords
- user
- node
- content
- title
- child node
- 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.)
- Granted
Links
Images
Abstract
The invention discloses a user resource-oriented customization mechanism, which comprises a node storage table, wherein the table stores the initial contents of resources and contents customized by a user; and every time the user logs on a system, the system sequentially traverses father nodes and child nodes according to a logical structure of the nodes and the contents of the node storage table to finally form the contents customized by the user. Therefore, once a system manager modifies the logical structure of the nodes or the contents of the node storage table, the customization user may be directly influenced and unified management can be conveniently performed on system contents. In the customization of the user, only the nodes and the association information of left associated nodes of the nodes are copied and the resources per se are not copied, so that the customization mechanism has higher efficiency and higher capacity of presenting advantages in performance under the condition of larger resource numbers.
Description
Technical background
The present invention relates to a kind of self-defined mechanism of user oriented resource.
Background technology
At present a lot of application systems can provide custom feature.During User Defined, system is first with whole node document copying portion, and the content of duplicating is made amendment, deleted and adds.The system manager can't directly have influence on the modification of system self-defining user, cause the application system maintenance difficulty big, and under the big situation of resource data amount, a large amount of User Defineds will have a strong impact on system performance, efficient can be more and more lower, self-definedly become function gaudy.
Summary of the invention
The object of the present invention is to provide a kind of self-defined mechanism of user oriented resource of efficient, What You See Is What You Get, realized to carry out self-defined to user oriented resource platform or the application system from system manager, unit management person and individual, the user need not to refresh the interface and just can directly see self-defined effect after self-defined the finishing, and has improved self-defined performance, has significantly reduced system manager's the workload of maintenance and the difficulty of self-defined configuration.
A kind of self-defined mechanism of user oriented resource comprises a node storage list, comprises left associated nodes title, nodename, child node title and user ID, the original records of preserving each node in this node storage list in the described node storage list at least; In original records, nodename is consistent with the content of left associated nodes title, comprises the initial child node that this node is all in the child node title, and user ID is empty;
When the user carries out self-defined, need delete, add or change when putting in order the child node of node, duplicate this node earlier, left associated nodes is set, in the child node title, insert the content of the child node after deletion, interpolation or change put in order, and insert this user's ID, form self-defined content that should user ID;
When the user imported the user ID login, system began to travel through successively to child node from father node according to the logical organization of node and the content of corresponding node storage list; When the content of nodename in the node storage list and left associated nodes title is consistent, directly call the content of child node title; When there are inconsistent content in nodename and left associated nodes title, continue match user ID, if the match is successful, then call the content of this record neutron nodename, if coupling is unsuccessful, then call the content of child node in the original records, finish to form user-defined content until traversal.
After adopting technical scheme of the present invention, the related information of replica node and left associated nodes thereof only during User Defined, rather than resource itself are so under the big more situation of resource data amount, take this self-defined machine-processed efficient will be high more, can embody the advantage of aspect of performance more.Simultaneously,, both stored the initial content of resource in this table, also included user-defined content because system only preserves a node storage list.When each user logined, system just formed user's self-defined content according to the content of the logical organization of node and node storage list.Like this,, can both directly have influence on self-defined user, make things convenient for the unified management of system for content in case the system manager has revised the logical organization of node or the content of node storage list.
Description of drawings
Fig. 1 is the node logical organization synoptic diagram of user oriented resource among the present invention;
Fig. 2 is the node storage list of user oriented resource among the present invention.
The invention will be further described below in conjunction with the drawings and specific embodiments.
Embodiment
As shown in Figure 1, be the node logical organization synoptic diagram of user oriented resource of the present invention.Adopt tree-shaped logical organization (node in concrete the application is not limited to this kind logical organization) in the specific embodiments of the invention, wherein A is a father node, and its child node is A1, A2, A3...An; The child node of this A1 is A11, A12, A13..A1n; By that analogy.
As shown in Figure 2, comprise left associated nodes title (UNID), nodename (PUNID), child node title (CHILDREN) and user ID (OBJECTID) in the node storage list at least.Preserved the original records of each node in the node storage list.In original records, nodename is consistent with the content of left associated nodes title, comprises the initial child node that this node is all in the child node title, and user ID is empty, the 1st record as shown in Figure 2.With node A1 is example, when user 1 need delete the child node of A1, just duplicates an A1 node earlier, and its left associated nodes name is called B1, inserts the content of the child node after the deletion in the child node title, inserts user 1 ID in the user ID; If user 2 need increase child node to A1, duplicate an A1 node equally earlier, its left associated nodes name is called C1, inserts the content that has increased child node in the child node title, inserts user 2 ID in the user ID; If user 3 need revise putting in order of its child node to A1, also be to duplicate an A1 node earlier, its left associated nodes name is called D1, inserts the content of having revised the child node that puts in order in the child node title, inserts user 3 ID in the user ID.
The self-defined mechanism of a kind of user oriented resource of the present invention, comprise a node storage list, at least comprise left associated nodes title, nodename, child node title and user ID in the described node storage list, the original records of preserving each node in this node storage list; In original records, nodename is consistent with the content of left associated nodes title, comprises the initial child node that this node is all in the child node title, and user ID is empty;
When the user carries out self-defined, need delete, add or change when putting in order the child node of node, duplicate this node earlier, left associated nodes is set, in the child node title, insert the content of the child node after deletion, interpolation or change put in order, and insert this user's ID, form self-defined content that should user ID.
When the user imported the user ID login, system began to travel through successively to child node from father node according to the logical organization of node and the content of corresponding node storage list; When the content of nodename in the node storage list and left associated nodes title is consistent, directly call the content of child node title; When there are inconsistent content in nodename and left associated nodes title, continue match user ID, if the match is successful, then call the content of this record neutron nodename, if coupling is unsuccessful, then call the content of child node in the original records, finish to form user-defined content until traversal.
Of the present invention focusing on: during User Defined, the just related information of replica node and left associated nodes thereof, rather than resource itself is so under the big more situation of resource data amount, take this self-defined machine-processed efficient will be high more, can embody the advantage of aspect of performance more.Simultaneously,, both stored the initial content of resource in this table, also included user-defined content because system only preserves a node storage list.When each user logined, system just formed user's self-defined content according to the content of the logical organization of node and node storage list.Like this,, can both directly have influence on self-defined user, make things convenient for the unified management of system for content in case the system manager has revised the logical organization of node or the content of node storage list.
Claims (1)
1. the self-defined mechanism of a user oriented resource, it is characterized in that: comprise a node storage list, at least comprise left associated nodes title, nodename, child node title and user ID in the described node storage list, the original records of preserving each node in this node storage list; In original records, nodename is consistent with the content of left associated nodes title, comprises the initial child node that this node is all in the child node title, and user ID is empty;
When the user carries out self-defined, need delete, add or change when putting in order the child node of node, duplicate this node earlier, left associated nodes is set, in the child node title, insert the content of the child node after deletion, interpolation or change put in order, and insert this user's ID, form self-defined content that should user ID;
When the user imported the user ID login, system began to travel through successively to child node from father node according to the logical organization of node and the content of corresponding node storage list; When the content of nodename in the node storage list and left associated nodes title is consistent, directly call the content of child node title; When there are inconsistent content in nodename and left associated nodes title, continue match user ID, if the match is successful, then call the content of this record neutron nodename, if coupling is unsuccessful, then call the content of child node in the original records, finish to form user-defined content until traversal.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010298884A CN101950307B (en) | 2010-09-26 | 2010-09-26 | User resource-oriented customization mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010298884A CN101950307B (en) | 2010-09-26 | 2010-09-26 | User resource-oriented customization mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101950307A true CN101950307A (en) | 2011-01-19 |
| CN101950307B CN101950307B (en) | 2012-10-10 |
Family
ID=43453809
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010298884A Active CN101950307B (en) | 2010-09-26 | 2010-09-26 | User resource-oriented customization mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101950307B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108052493A (en) * | 2017-12-27 | 2018-05-18 | 福建南威软件有限公司 | A kind of read-do unijunction closes the design system and method for writing signing |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1781102A (en) * | 2003-04-30 | 2006-05-31 | 诺基亚有限公司 | Low memory decision tree |
| CN1940914A (en) * | 2005-09-29 | 2007-04-04 | 国际商业机器公司 | Method and device for copying and pasting a plurality of data items as a group |
| US20080147722A1 (en) * | 2006-12-18 | 2008-06-19 | Microsoft Corporation | Metadata for searching within first degree contacts |
-
2010
- 2010-09-26 CN CN201010298884A patent/CN101950307B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1781102A (en) * | 2003-04-30 | 2006-05-31 | 诺基亚有限公司 | Low memory decision tree |
| CN1940914A (en) * | 2005-09-29 | 2007-04-04 | 国际商业机器公司 | Method and device for copying and pasting a plurality of data items as a group |
| US20080147722A1 (en) * | 2006-12-18 | 2008-06-19 | Microsoft Corporation | Metadata for searching within first degree contacts |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108052493A (en) * | 2017-12-27 | 2018-05-18 | 福建南威软件有限公司 | A kind of read-do unijunction closes the design system and method for writing signing |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101950307B (en) | 2012-10-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8346722B2 (en) | Replica placement strategy for distributed data persistence | |
| Grover et al. | Hadoop Application Architectures: Designing Real-World Big Data Applications | |
| CN107045422A (en) | Distributed storage method and equipment | |
| CA2913036C (en) | Index update pipeline | |
| US7734585B2 (en) | Updateable fan-out replication with reconfigurable master association | |
| CN104321739B (en) | The system and method for individual-layer data container | |
| CN104065685B (en) | Data migration method towards in the bedding storage system of cloud computing environment | |
| CN103493024B (en) | For the method and system of cache hierarchy | |
| CN106874066B (en) | Virtual machine migration method and device and electronic equipment | |
| CN108351885A (en) | Reduce resource consumption associated with the storage of container and operation | |
| CN103473298B (en) | Data archiving method and device and storage system | |
| CN102035865B (en) | Data storing and addressing methods, systems and equipment | |
| CN101997911A (en) | Data migration method and system | |
| CN104205095A (en) | Platform for continuous graph update and computation | |
| CN106407355A (en) | Data storage method and device | |
| CN101446966A (en) | Data storage method and system | |
| US20100223231A1 (en) | Merging Records From Different Databases | |
| CN102170460A (en) | Cluster storage system and data storage method thereof | |
| CN107800808A (en) | A kind of data-storage system based on Hadoop framework | |
| CN103761262A (en) | Repetition log control method based on syslogd | |
| CN110389942A (en) | A kind of the key assignments separate-storage method and system of no garbage reclamation | |
| Strauss et al. | Device transparency: a new model for mobile storage | |
| CN104869140A (en) | Multi-cluster system and method for controlling data storage of multi-cluster system | |
| CN101986276A (en) | Methods and systems for storing and recovering files and server | |
| CN109063192A (en) | A kind of high-performance mass file storage system working 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 | ||
| C56 | Change in the name or address of the patentee | ||
| CP02 | Change in the address of a patent holder |
Address after: 362000 Fujian province Quanzhou Fengze District Feng Road South Building 2 building 16-22 layer Patentee after: Linewell Software Co., Ltd. Address before: 362000 Fujian city of Quanzhou province Quanxiu Street modern square modern furniture enterprise office building on the eighth floor Patentee before: Linewell Software Co., Ltd. |