Method and apparatus for rapid tagging of elements in a facet tree

• US 20060271565A1
• Filed: 05/24/2005
• Published: 11/30/2006
• Est. Priority Date: 05/24/2005
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Handy-Bosma, John Hans, Hawley, J. Christopher, Lee, Raymond, Ceste, Mario Gerald Jr., Roy, Matthew Norman, Acevedo-Aviles, Joel C.
• Granted Patent: US 7,502,810 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/176 Support for shared access to files; File sharing support
• CPC Class Codes: G06F 16/24564 Applying rules; Deductive queries
• CPC Class Codes: G06F 16/24573 using data annotations, e.g. user-defined metadata
• CPC Class Codes: G06F 16/322 Trees
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing

Abstract

A tagging application (TA) is disclosed that comprises a web interface program (WIP) and a tagging program (TP). The WIP presents the facet tree by displaying elements of the facet tree selected by the user along with a known activation method for the user to select a facet element and to assign a value to the selected facet or facet element. The user may proceed to manually tag each facet and facet element by selecting a value representing the facet element to be tagged. The user may also eliminate manual selection of many of the facets and facet elements by choosing a tagging scenario and then applying the tagging scenario. Once the user has selected a tagging scenario, and has indicated that it is to be applied to the facet element, the TP takes the selected value and applies the selected tagging scenario to populate the tagging for the user in accordance with the tagging scenario. Once the tagging has been populated, the tagging program returns the tagged facet tree to the user at the user interface. Explanatory notes may be provided to the user along with the tagged tree.

Claims

1. An apparatus comprising:

a computer having a first storage electronically connected to a second storage;

a tagging program in the first storage;

a facet tree database, a rule database, and a scenario database in the second storage;

wherein responsive to a first user selection of an element of the facet tree and a second user selection of a scenario from the scenario database, the tagging program populates tags in the facet tree in accordance with the selected facet and in accordance with the scenario.

2. The apparatus of claim 1 wherein the scenario comprises:

starting with a leaf node and populating selections upward to a root.

3. The apparatus of claim 1 wherein the scenario comprises:

starting a root node and populating downward to all child nodes.

4. The apparatus of claim 1 wherein the scenario comprises:

populating upward along all elements of a given path.

6. The apparatus of claim 1 wherein the scenario comprises:

selecting all peer elements of a given node.

7. The apparatus of claim 1 wherein the scenario comprises:

starting with a given, non-leaf node and populating upward along a path.

8. The apparatus of claim 1 wherein the scenario comprises:

starting with a given, non-leaf node and populating downward along a path.

5. The apparatus of claim I wherein the scenario comprises:

populating downward along all elements of a given path.

9. A method for tagging a facet tree comprising:

Using a server computer connected to a storage;

displaying a facet tree selected by a user;

responsive to a selection of a facet element by the user, displaying a plurality of scenarios;

responsive to a selection of a scenario by the user, tagging the facet tree in accordance with the scenario.

10. The method of claim 9 wherein tagging the facet tree in accordance with the scenario comprises:

starting with a leaf node and populating selections upward to a root.

11. The method of claim 9 wherein tagging the facet tree in accordance with the scenario comprises:

starting a root node and populating downward to all child nodes.

12. The method of claim 9 wherein tagging the facet tree in accordance with the scenario comprises:

populating upward along all elements of a given path.

13. The method of claim 9 wherein tagging the facet tree in accordance with the scenario comprises:

populating downward along all elements of a given path.

14. The method of claim 9 wherein tagging the facet tree in accordance with the scenario comprises:

selecting all peer elements of a given node.

15. The method of claim 9 wherein tagging the facet tree in accordance with the scenario comprises:

starting with a given, non-leaf node and populating upward along a path.

16. The method of claim 9 wherein tagging the facet tree in accordance with the scenario comprises:

starting with a given, non-leaf node and populating downward along a path.

17. A program product comprising:

a web interface program; and

a tagging program;

wherein the web interface program and the tagging program contain instructions for accessing a facet tree database, a rule database, and a scenario database; and

wherein responsive to a user selection of an element of a facet tree from the facet tree database, and a scenario from the scenario database, the tagging program applies tags to the facet tree in accordance with the scenario and the element.

18. The computer program product of claim 17 wherein the instructions include one of the following:

starting with a leaf node and populating selections upward to a root;

starting a root node and populating downward to all child nodes;

populating upward along all elements of a given path;

populating downward along all elements of a given path;

selecting all peer elements of a given node;

starting with a given, non-leaf node and populating upward along a path;

starting with a given, non-leaf node and populating downward along a path.