1. A computer-implemented method, comprising:
receiving a search query for a particular application from an input field of a user interface;
performing a keyword search based on the search query to generate keyword search results;
performing a natural language search of a frequently-asked question database based on the search query to generate frequently-asked question search results; and
outputting a first display page, wherein the first display page categorizes the keyword search results and the frequently-asked question search results into a plurality of categories, wherein each category of the first display page is associated with a category title, a first display region, and a second display region that is separate from the first display region, wherein the first display region of a particular category includes one or more keyword search results associated with the particular category and does not include any of the frequently-asked question search results, and wherein the second display region associated with the particular category includes one or more frequently-asked question search results associated with the particular category and does not include any of the keyword search results;
wherein a statistical cluster analysis is performed to determine the plurality of categories for the particular application based on group assignments and name assignments.
2. The computer-implemented method of claim 1, wherein the group assignments and the name assignments are determined using a card sort method.
3. The computer-implemented method of claim 2, wherein at least one of the group assignments and the name assignments are validated via a reverse card sort method.
4. The computer-implemented method of claim 3, wherein the reverse card sort method is performed by a second set of individuals.
5. The computer-implemented method of claim 1, wherein an order of the categories shown in the first page is a fixed order.
6. The computer-implemented method of claim 1, wherein an order of the categories shown in the first page is a variable based on how well results in each category match the search query.
7. The computer-implemented method of claim 1, wherein the first display page includes a second user interface that enables refinement of the search query.
8. The computer-implemented method of claim 1, wherein the first display page includes a user-selectable option to output a second display page that displays additional keyword search results associated with at least one category and additional frequently-asked question search results associated with the at least one category.
9. The computer-implemented method of claim 8, wherein the keyword search results of the second display page are displayed in a first column and the frequently-asked question search results of the second display page are displayed in a second column.
10. The computer-implemented method of claim 1, wherein the first display region associated with the particular category is a first column and wherein the second display region associated with the particular category is a second column adjacent to the first column.
11. The computer-implemented method of claim 10, wherein a keyword search result of the one or more keyword search results associated with the particular category that best matches the search query is in a first row of the first column.
12. A non-transitory computer-readable storage medium comprising instructions that, when executed by a processor, cause the processor to:
receive a search query for a particular application from an input field of a user interface;
perform a keyword search based on the search query to generate keyword search results;
perform a natural language search of a frequently-asked question database based on the search query to generate frequently-asked question search results; and
output a first display page, wherein the first display page categorizes the keyword search results and the frequently-asked question search results into a plurality of categories, wherein each category of the first display page is associated with a category title, a first display region, and a second display region that is separate from the first display region, wherein the first display region of a particular category includes one or more keyword search results associated with the particular category and does not include any of the frequently-asked question search results, and wherein the second display region of the particular category includes one or more frequently-asked question search results associated with the particular category and does not any of the keyword search results;
wherein a statistical cluster analysis is performed to determine the plurality of categories for the particular application based on group assignments and name assignments.
13. The non-transitory computer-readable storage medium of claim 12, wherein a card sort method is used to perform the group assignments and the name assignments.
14. The non-transitory computer-readable storage medium of claim 13, wherein the group assignment performed by the at least one set of individuals is validated via a reverse card sort method.
15. The non-transitory computer-readable storage medium of claim 13, further comprising instructions that, when executed by the processor, cause the processor to:
determine a first category that best matches the search query and a second category with a next best match to the search query; and
display information associated with the first category in a row separate from information associated with the second category.
16. A system, comprising:
a processor; and
a memory including computer program code executable by the processor to:
receive a search query for a particular application from an input field of a user interface;
perform a keyword search based on the search query to generate keyword search results;
perform a natural language search of a frequently-asked question database based on the search query to generate frequently-asked question search results; and
output a first display page, wherein the first display page categorizes the keyword search results and the frequently-asked question search results into a plurality of categories, wherein each category includes:
a category title associated with the category;
a first column with a first listing of one or more of the keyword search results associated with the category, wherein the first listing does not include any of the frequently-asked question search results; and
a second column with a second listing of one or more of the frequently-asked question search results associated with the category, wherein the second listing does not include any of the keyword search results;
wherein a statistical cluster analysis is performed to determine the plurality of categories for the particular application based on group assignments and name assignments.
17. The system of claim 16, wherein a card sort method is used to perform the group assignments and the name assignments.
18. The system of claim 17, wherein the group assignment performed by the at least one set of individuals is validated via a reverse card sort method.
19. The system of claim 16, wherein the memory includes computer program code executable by the processor to output a second display page that displays additional keyword search results associated with a particular category from the keyword search results and additional frequently-asked question search results associated with the particular category from the frequently-asked question results in response to selection of a user-selectable option associated with the particular category.
20. The system of claim 19, wherein a frequently-asked question search result associated with the particular category is shown in a first row of the second column associated with the particular category when the frequently-asked question search result best matches the search query compared to other frequently-asked question search results associated with the particular category.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method for dynamically moving orders within a category of logical volumes stored in a data storage library, comprising:
a) retrieving an identification of a first category of a plurality of categories of logical volumes stored in the data storage library, the first category including a first plurality of orders in sequential locations, each order indicative of a location in the first category to which a logical volume is assignable;
b) determining if the first category includes at least one vacant order to which a logical volume is not assigned and if a number of vacant orders in the first category is greater than a predetermined vacancy level;
c) if the number of vacant orders in the first category is greater than the predetermined vacancy level, retrieving an identification number of a first vacant order in the first category;
d) retrieving an identification number of a first non-vacant order to which a first logical volume is assigned of the first category following the first vacant order;
e) moving the identified first non-vacant order to the first vacant order whereby the first vacant order is indicative of the location in the first category to which the first logical volume is assigned;
f) if a predetermined amount of time has elapsed, storing the identification of the first category and the identification number of the first vacant order of the first category, whereby moving the orders in the first category is resumed at a later time;
g) if the predetermined amount of time has not elapsed, repeating steps b)-f); and
h) if at step c) the first category does not include at least one vacant order or the number of vacant orders in the first category is not greater than a predetermined vacancy level, retrieving an identification of a second category of the plurality of categories in the data storage library, the second category including a second plurality of orders in sequential locations, and repeating steps b)-g) for the orders in the second category.
2. A manager in a data storage library, comprising:
a database of logical volume categories, each category capable of containing a plurality of sequentially appended orders;
a processor; and
memory storing program instructions executable in the processor and operable for:
a) retrieving an identification of a first category of a plurality of categories of logical volumes stored in the data storage library, the first category including a first plurality of orders in sequential locations, each order indicative of a location in the first category to which a logical volume is assignable;
b) determining if the first category includes at least one vacant order to which a logical volume is not assigned and if a number of vacant orders in the first category is greater than a predetermined vacancy level;
c) if the number of vacant orders in the first category is greater than the predetermined vacancy level, retrieving an identification number of a first vacant order in the first category;
d) retrieving an identification number of a first non-vacant order to which a logical volume is assigned of the first category following the first vacant order;
e) moving the identified first non-vacant order to the first vacant order whereby the first vacant order is indicative of the location in the first category to which the first logical volume is assigned;
f) if a predetermined amount of time has elapsed, storing the identification of the first category and the identification number of the first vacant order of the first category, whereby moving the orders in the first category is resumed at a later time;
g) if the predetermined amount of time has not elapsed, repeating steps b)-f); and
h) if at step c) the first category does not include at least one vacant order or the number of vacant orders in the first category is not greater than a predetermined vacancy level, retrieving an identification of a second category of the plurality of categories in the data storage library, the second category including a second plurality of orders in sequential locations, and repeating steps b)-g) for the orders in the second category.
3. A data storage library attached to a host device, the library comprising:
a plurality of removable data cartridges;
a data drive for reading and writing logical volumes from and to a data cartridge loaded therein;
an accessor for transporting data cartridges between storage slots and the data drive;
a database storing a plurality of volume categories to which the volumes are assigned, each volume being associated with a sequentially designated order entry appended to an end of the category to which the volume is assigned; and
a library manager operatively coupled to the data drive, the accessor and an external host device, the library manager comprising a memory operable for:
a) retrieving an identification of a first category of a plurality of categories of logical volumes stored in the data storage library, the first category including a first plurality of orders in sequential locations, each order indicative of a location in the first category to which a logical volume is assignable;
b) determining if the first category includes at least one vacant order to which a logical volume is not assigned and if a number of vacant orders in the first category is greater than a predetermined vacancy level;
c) if the number of vacant orders in the first category is greater than the predetermined vacancy level, retrieving an identification number of a first vacant order in the first category;
d) retrieving an identification number of a first non-vacant order to which a logical volume is assigned of the first category following the first vacant order;
e) moving the identified first non-vacant order to the first vacant order whereby the first vacant order is indicative of the location in the first category to which the first logical volume is assigned;
f) if a predetermined amount of time has elapsed, storing the identification of the first category and the identification number of the first vacant order of the first category, whereby moving the orders in the first category is resumed at a later time;
g) if the predetermined amount of time has not elapsed, repeating steps b)-f); and
h) if at step c) the first category does not include at least one vacant order or the number of vacant orders in the first category is not greater than a predetermined vacancy level, retrieving an identification of a second category of the plurality of categories in the data storage library, the second category including a second plurality of orders in sequential locations, and repeating steps b)-g) for the orders in the second category.
4. A computer program product of a computer readable storage medium usable with a programmable computer, the computer program product having computer-readable code embodied therein for dynamically moving orders within a category of logical volumes stored in a data storage library, the computer-readable code comprising instructions for:
a) retrieving an identification of a first category of a plurality of categories of logical volumes stored in the data storage library, the first category including a plurality of orders in sequential locations, each order indicative of a location in the first category to which a logical volume is assignable;
b) determining if the first category includes at least one vacant order to which a logical volume is not assigned and if a number of vacant orders in the first category is greater than a predetermined vacancy level;
c) if the number of vacant orders in the first category is greater than the predetermined vacancy level, retrieving an identification number of a first vacant order in the first category;
d) retrieving an identification number of a first non-vacant order to which a logical volume is assigned of the first category following the first vacant order;
e) moving the identified first non-vacant order to the first vacant order whereby the first vacant order is indicative of the location in the first category to which the first logical volume is assigned;
f) if a predetermined amount of time has elapsed, storing the identification of the first category and the identification number of the first vacant order of the first category, whereby moving the orders in the first category is resumed at a later time;
g) if the predetermined amount of time has not elapsed, repeating steps b)-f); and
h) if at step c) the first category does not include at least one vacant order or the number of vacant orders in the first category is not greater than a predetermined vacancy level, retrieving an identification of a second category of the plurality of categories in the data storage library, the second category including a second plurality of orders in sequential locations, and repeating steps b)-g) for the orders in the second category.
5. A method for deploying computing infrastructure, comprising integrating computer readable code into a computing system, wherein the code, in combination with the computing system, is capable of performing the following:
a) retrieving an identification of a first category of a plurality of categories of logical volumes stored in the data storage library, the first category including a first plurality of orders in sequential locations, each order indicative of a location in the first category to which a logical volume is assignable;
b) determining if the first category includes at least one vacant order to which a logical volume is not assigned and if a number of vacant orders in the first category is greater than a predetermined vacancy level;
c) if the number of vacant orders in the first category is greater than the predetermined vacancy level, retrieving an identification number of a first vacant order in the first category;
d) retrieving an identification number of a first non-vacant order to which a logical volume is assigned of the first category following the first vacant order;
e) moving the identified first non-vacant order to the first vacant order whereby the first vacant order is indicative of the location in the first category to which the first logical volume is assigned;
f) if a predetermined amount of time has elapsed, storing the identification of the first category and the identification number of the first vacant order of the first category, whereby moving the orders in the first category is resumed at a later time;
g) if the predetermined amount of time has not elapsed, repeating steps b)-f); and
h) if at step c) the first category does not include at least one vacant order or the number of vacant orders in the first category is not greater than a predetermined vacancy level, retrieving an identification of a second category of the plurality of categories in the data storage library, the second category including a second plurality of orders in sequential locations, and repeating steps b)-g) for the orders in the second category.
6. The method of claim 1, further comprising retrieving an identification of the second category of the plurality of categories in the data storage library and repeating steps b)-g) for orders in the second category if the first category is in use.
7. The method of claim 1, further comprising retrieving an identification of the second category of the plurality of categories in the data storage library and repeating steps b)-g) for orders in the second category if the first category is a reserved category.
8. The manager of claim 2, wherein the instructions further comprise instructions for retrieving an identification of the second category of the plurality of categories in the data storage library and repeating steps b)-g) for orders in the second category if the first category is in use.
9. The manager of claim 2, wherein the instructions further comprise instructions for retrieving an identification of the second category of the plurality of categories in the data storage library and repeating steps b)-g) for orders in the second category if the first category is a reserved category.
10. The library of claim 3, further comprising retrieving an identification of the second category of the plurality of categories in the data storage library and repeating steps b)-g) for orders in the second category if the first category is in use.
11. The library of claim 3, further comprising retrieving an identification of the second category of the plurality of categories in the data storage library and repeating steps b)-g) for orders in the second category if the first category is a reserved category.
12. The program product of claim 4 wherein the instructions further comprise instructions for retrieving an identification of the second category of the plurality of categories in the data storage library and repeating steps b)-g) for orders in the second category if the first category is in use.
13. The program product of claim 4, wherein the instructions further comprise instructions for retrieving an identification of the second category of the plurality of categories in the data storage library and repeating steps b)-g) for orders in the second category if the first category is a reserved category.
14. The method of claim 5, further comprising retrieving an identification of the second category of the plurality of categories in the data storage library and repeating steps b)-g) for orders in the second category if the first category is in use.
15. The method of claim 5, further comprising retrieving an identification of the second category of the plurality of categories in the data storage library and repeating steps b)-g) for orders in the second category if the first category is a reserved category.