Method for performing a modularization of a hypertext

• US 20060156223A1
• Filed: 01/12/2006
• Published: 07/13/2006
• Est. Priority Date: 01/12/2005
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP AG (SAP SE)
• Inventors: Theilmann, Wolfgang
• Granted Patent: US 7,792,848 B2
• Time in Patent Office: Days
• US Class Current: 715/205
• CPC Class Codes: G06F 16/958 Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
• CPC Class Codes: G06F 40/134 Hyperlinking
• CPC Class Codes: G06F 40/143 Markup, e.g. Standard Generalized Markup Language [SGML] or Document Type Definition [DTD]
• CPC Class Codes: G09B 19/0053 Computers, e.g. programming
• CPC Class Codes: Y10S 707/913 Multimedia
• CPC Class Codes: Y10S 707/942 Legal/academic

Abstract

A method for performing a modularization of an arbitrary structured hypertext with a physical structure and an organizational structure description is disclosed. The hypertext is decomposed into a set of separate modules with specific definable boundaries based on both, the physical structure and the organizational structure description, each module of the set of modules is computed methodically and gradually with respect to coaction with the other modules until forming a completed functional unit reusable and invocable separately. Furthermore, a corresponding hypertext, a module, a computer system, a computer program product and a computer program are disclosed.

Claims

1. A method for performing a modularization of an arbitrary structured hypertext with a physical structure and an organizational structure description, wherein the hypertext is decomposed into a set of separate modules with specific definable boundaries based on both the physical structure and the organizational structure description, each module of the set of modules is computed methodically and gradually with respect to coaction with the other modules until forming a completed functional unit reusable and invocable separately.

2. The method according to claim 1, wherein the arbitrary structured hypertext is chosen as an e-learning course.

3. The method according to claim 1, wherein the organizational structure description of the hypertext comprises several items, each item references at least one file called primary file, the method comprising the following operations:

defining nodes, which can be either an item or a file;

defining sub-nodes, which in the case that an item is represented by a node are either sub-items or files referenced by the corresponding primary file;

defining sub-nodes, which in the case that a file is represented by a node are files referenced by the given file;

computing specific module boundaries for each sub-node;

checking for an overlap between sub-nodes;

creating preliminary modules based on the module boundaries and detected overlaps;

for each file commonly used in several sub-nodes opting for replication of said file, movement to a further preliminary module, movement to an existing preliminary module or putting said several sub-nodes within one preliminary module;

making a final module decision;

moving files accordingly; and

adapting appropriate hyperlinks.

4. The method according to claim 3, the method further comprising a recursion operation when a decomposition is continued at a further granularity level.

5. The method according to claim 1, wherein a targeted decomposition level is configured.

6. The method according to claim 1, wherein specific allowed conflict resolution operations are configured.

16. A computer program product with a computer-readable medium and a computer program stored on the computer-readable medium with a program code which is suitable for carrying out a method according to claim 1 when the computer program is run on a computer.

17. A computer program with program code which is suitable for carrying out a method according to claim 1 when the computer program is run on a computer.

18. A computer-readable medium with a computer program stored thereon, the computer program comprising a program code which is suitable for carrying out a method according to claim 1 when the computer program is run on a computer.

7. A hypertext with an organizational structure description, the hypertext is compartmentalized into a set of separate modules with specific well-defined boundaries based on the organizational structure description, each module of the set of modules forming a completed functional unit reusable and invocable separately.

8. The hypertext according to claim 7, wherein the hypertext is used as an e-learning course.

9. The hypertext according to claim 7, wherein the modules of the set of separate modules can be directly reused for the configuration of a further hypertext.

10. A module with well-shaped boundaries integrable within an overall hypertext comprising a plurality of modules, the module forming a completed functional unit reusable and invocable separately and irrespective of the hypertext.

11. A computer system for performing and providing a modularization of an arbitrary structured hypertext with a physical structure and an organizational structure description, the system comprising:

a storage and editing unit configured to store, provide and edit the arbitrary structured hypertext,

a defining and decomposing unit configured to define nodes and sub-nodes, each comprising at least one file, and to decompose the hypertext into said nodes and sub-nodes, and

a computing unit configured to compute based on said nodes and sub-nodes methodically and gradually modules with specific definable boundaries with respect to coaction with other modules until the computed modules form completed functional units which are reusable and invocable separately.

12. The computer system according to claim 11, wherein the computing unit further comprises a determining unit configured to determine most specific boundaries for each node or sub-node, respectively, and a generating unit configured to generate preliminary and final modules.

13. The computer system according to claim 11, further comprising a detecting unit configured to detect an existing overlap among the nodes and sub-nodes and a selecting unit configured to select for each file commonly used in several sub-nodes or nodes with respect of a given action replication of said file, movement to a further preliminary module, movement to an existing preliminary module or putting said several sub-nodes within one preliminary module.

14. The computer system according to claim 11, further comprising a distributing unit configured to distribute the files to the respective finally computed modules and adapt hyperlinks from/to the distributed files.

15. A computer system for performing and providing a modularization of an arbitrary structured hypertext with a physical structure and an organizational structure description, the system comprising:

a storage and editing unit configured to store, provide and edit the arbitrary structured hypertext,

a defining and decomposing unit configured to define nodes and sub-nodes, each comprising at least one file, and to decompose the hypertext into said nodes and sub-nodes,

a computing unit configured to compute based on said nodes and sub-nodes methodically and gradually modules with specific definable boundaries with respect to coaction with other modules until the computed modules form completed functional units which are reusable and invocable separately, and

a distributing unit configured to distribute the files to the respective finally computed modules and adapt hyperlinks from/to the distributed files, wherein the computing unit comprises a determining unit configured to determine most specific boundaries for each node or sub-node, respectively, a generating unit configured to generate preliminary and final modules, a detecting unit configured to detect an existing overlap among the nodes and sub-nodes and a selecting unit configured to select for each file commonly used in several sub-nodes or nodes with respect of a given action replication of said file, movement to a further preliminary module, movement to an existing preliminary module or putting said several sub-nodes within one preliminary module.