Selecting a tape drive having a shortest relative unmount and unload time
US-2019187913-A1 · Jun 20, 2019 · US
US11354359B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11354359-B2 |
| Application number | US-201916701199-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 3, 2019 |
| Priority date | Dec 3, 2019 |
| Publication date | Jun 7, 2022 |
| Grant date | Jun 7, 2022 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Embodiments are disclosed for a method for ordering search results. The method includes identifying a plurality of archived search results generated by a keyword search. The method also includes searching a plurality of indices of a plurality of corresponding tape libraries comprising a plurality of tapes storing the archived search results. The method additionally includes determining a plurality of estimated access times corresponding to the archived search results based on the indices. Further, the method includes sorting the archived search results based on the estimated access times to create a time-based order.
Opening claim text (preview).
What is claimed is: 1. A computer-implemented method for search results, comprising: identifying a plurality of archived search results generated by a keyword search, wherein the keyword search generates a plurality of search results comprising the archived search results, and wherein the archived search results are identified by their corresponding rankings fall below a predetermined ranking threshold; the keyword search generates a plurality of rankings corresponding to the plurality of search results, wherein the plurality of rankings is associated with a relevance of the plurality of search results, and the plurality of search results are sorted in ascending order based on the plurality of rankings to create a rankings-based order; searching a plurality of indices of a plurality of corresponding tape libraries comprising a plurality of tapes storing the archived search results; determining a plurality of estimated access times corresponding to the archived search results based on the indices; sorting the archived search results based on the estimated access times to create a time-based order; displaying, in the rankings-based order, search results of the plurality of search results wherein their corresponding rankings meet or exceed the predetermined ranking threshold before displaying the sorted archived search results in the time-based order. 2. The method of claim 1 , wherein determining an estimated access time comprises identifying one or more tape drives upon which one or more of the tapes is loaded. 3. A computer program product comprising program instructions stored on a computer readable storage medium, wherein the computer readable storage medium is not a transitory signal per se, the program instructions executable by a processor to cause the processor to perform a method comprising: identifying a plurality of archived search results generated by a keyword search, wherein the keyword search generates a plurality of search results comprising the archived search results, and wherein the archived search results are identified by their corresponding rankings fall below a predetermined ranking threshold; the keyword search generates a plurality of rankings corresponding to the plurality of search results, wherein the plurality of rankings is associated with a relevance of the plurality of search results, and the plurality of search results are sorted in ascending order based on the plurality of rankings to create a rankings-based order; searching a plurality of indices of a plurality of corresponding tape libraries comprising a plurality of tapes storing the archived search results; determining a plurality of estimated access times corresponding to the archived search results based on the indices; sorting the archived search results based on the estimated access times to create a time-based order; displaying, in the rankings-based order, search results of the plurality of search results wherein their corresponding rankings meet or exceed the predetermined ranking threshold before displaying the sorted archived search results in the time-based order. 4. The computer program product of claim 3 , wherein determining an estimated access time comprises identifying one or more tape drives upon which one or more of the tapes is loaded. 5. The computer program product of claim 3 , the method further comprising displaying a re-order button, wherein, in response to a selection of the re-order button, the sorted archived search results are sorted in a different order. 6. A system comprising: a computer processing circuit; and a computer-readable storage medium storing instruction, which, when executed by the computer processing circuit, are configured to cause the computer processing circuit to perform a method comprising: identifying a plurality of archived search results generated by a keyword search, wherein the keyword search generates a plurality of search results comprising the archived search results, and wherein the archived search results are identified by their corresponding rankings fall below a predetermined ranking threshold; the keyword search generates a plurality of rankings corresponding to the plurality of search results, wherein the plurality of rankings is associated with a relevance of the plurality of search results, and the plurality of search results are sorted in ascending order based on the plurality of rankings to create a rankings-based order; searching a plurality of indices of a plurality of corresponding tape libraries comprising a plurality of tapes storing the archived search results; determining a plurality of estimated access times corresponding to the archived search results based on the indices; sorting the archived search results based on the estimated access times to create a time-based order; displaying, in the rankings-based order, search results of the plurality of search results wherein their corresponding rankings meet or exceed the predetermined ranking threshold before displaying the sorted archived search results in the time-based order. 7. The system of claim 6 , wherein determining an estimated access time comprises identifying one or more tape drives upon which one or more of the tapes is loaded. 8. The system of claim 6 , the method further comprising displaying a re-order button, wherein, in response to a selection of the re-order button, the search results are sorted in a different order.
Libraries, e.g. tape libraries, jukebox · CPC title
by searching ordered data, e.g. alpha-numerically ordered data · CPC title
Command handling arrangements, e.g. command buffers, queues, command scheduling · CPC title
Access to data in other repository systems, e.g. legacy data or dynamic Web page generation · CPC title
Tape device · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.