# US 2014/0207753 A1 · Method and system that routes requests for electronic files > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2014/0207753 A1 - Document ID: US20140207753A1 - Status: Published application - Kind: A1 - Application number: 13/744,542 - Filed: 2013-01-18 - Published: 2014-07-24 - Earliest claimed: 2013-01-18 - Assignees: Sonatype, Inc. - Applicants: Sonatype, Inc. - Inventors: Brian Edward Fox - Web page: https://patentgrep.com/patent/US20140207753A1 ## CPC - G06F 16/16: File or folder operations, e.g. details of user interfaces specifically adapted to file systems - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract A system, method, or computer-readable medium provide a look-up table having information on roots in repositories managed by a repository manager, the roots information in the look-up table being only n-levels deep. A file request is received, including filename and filepath with root. Before checking repositories managed by the repository manager for the requested file, the look-up table is referenced to determine whether the root of the requested file exists on one of the repositories managed by the repository manager. A check of the repository is bypassed when the look-up table does not indicate that the root exists on the repository. The repository is checked for the requested file, when the root is indicated as existing on the repository. The requested file is returned, if actually found on one repository. A “fail” response is returned, if the root is not indicated as existing in the look-up table. ## Claims ### Claim 1 A computer system that manages requests for files, comprising: a look-up table storage configured to store a look-up table having information on roots that are stored on repositories managed by a repository manager, the information on the roots in the look-up table being only n-levels deep; and a processor cooperatively operable with the look-up table storage, and configured to facilitate: receiving a request for a file, the request including a file name and a file path with a root; before checking repositories managed by the repository manager for the requested file, determining by reference to the look-up table whether the root of the requested file exists on one of the repositories managed by the repository manager; bypassing a check of the one of the repositories when the look-up table does not indicate that the root exists on the repository; checking the repository for the requested file, when the root is indicated as existing on the repository; returning the requested file, if found on at least one of the repositories; and returning a “fail” response to the request for the file, if the root of the requested file is not indicated as existing in the look-up table. ### Claim 2 (depends on 1) The computer system of claim 1, wherein the n-levels is two or three levels. ### Claim 3 (depends on 1) The computer system of claim 1, wherein the processor is further configured to build the look-up table by crawling remote systems that host the repositories to only n-levels, and store the look-up table that is built, in the look-up table storage. ### Claim 4 (depends on 1) The computer system of claim 1, wherein the processor is further configured to build the look-up table by receiving an advertisement from a remote system that hosts the one of the repositories, the advertisement indicating the remote system lookup table to the repository manager. ### Claim 5 (depends on 1) The computer system of claim 1, wherein the processor is further configured to build the look-up table at two or three levels deep only. ### Claim 6 (depends on 1) The computer system of claim 1, wherein the processor is further configured to periodically refresh the look-up table, by at least one of sending a request to a remote system that hosts one of the repositories, for a refresh of the look-up table of the remote system, and re-crawling folders at the remote system that hosts one of the repositories to only n-levels to re-confirm content in the look-up table. ### Claim 7 (depends on 1) The computer system of claim 1, wherein the processor is further configured to send, to a remote system that hosts one of the repositories, a request for an advertisement, the advertisement indicating to the repository what part of the path the repository manager does not have, so that the repository manager can be updated; and build the look-up table by receiving the advertisement from the remote system that hosts the one of the repositories, the advertisement indicating the remote system lookup table to the repository manager. ### Claim 8 A computer-implemented method, comprising: receiving, at a repository manager, a request for a file, the request including a file name and a file path with a root; before checking repositories managed by the repository manager for the requested file, determining, at the repository manager, by reference to a look-up table whether the root of the requested file exists on one of the repositories managed by the repository manager, information on the roots in the look-up table being only n-levels deep; bypassing, at the repository manager, a check of the one of the repositories when the look-up table does not indicate that the root exists on the repository; checking, at the repository manager, the repository for the requested file, when the root is indicated as existing on the repository; returning, in the repository manager, the requested file if found on at least one of the repositories; and returning, in the repository manager, a “fail” response to the request for the file, if the root of the requested file is not indicated as existing in the look-up table. ### Claim 9 (depends on 8) The computer implemented method of claim 8, wherein the n-levels is two or three levels. ### Claim 10 (depends on 8) The computer-implemented method of claim 8, further comprising building, at the repository manager, the look-up table by crawling remote systems that host the repositories to only n-levels, and storing the look-up table that is built. ### Claim 11 (depends on 8) The computer-implemented method of claim 8, further comprising building, at the repository manager, the look-up table by receiving an advertisement from a remote system that hosts the one of the repositories, the advertisement indicating the remote system lookup table to the repository manager. ### Claim 12 (depends on 8) The computer-implemented method of claim 8, further comprising building the look-up table at two or three levels deep only. ### Claim 13 (depends on 8) The computer-implemented method of claim 8, further comprising periodically refreshing the look-up table, by at least one of sending, from the repository manager, a request to a remote system that hosts one of the repositories, for a refresh of the look-up table of the remote system, and re-crawling, in the repository manager, folders at the remote system that hosts one of the repositories to only n-levels to re-confirm content in the look-up table. ### Claim 14 (depends on 8) The computer-implemented method of claim 8, further comprising sending, from the repository manager to a remote system that hosts one of the repositories, a request for an advertisement, the advertisement indicating to the repository what part of the path the repository manager does not have, so that the repository manager can be updated; and building, at the repository manager, the look-up table by receiving the advertisement from the remote system that hosts the one of the repositories, the advertisement indicating the remote system lookup table to the repository manager. ### Claim 15 A non-transitory computer-readable medium comprising instructions for execution by a computer, the instructions including a computer-implemented method to manage requests for files, the instructions for implementing: storing, in a look-up table storage, a look-up table having information on roots that are stored on repositories managed by a repository manager, the information on the roots in the look-up table being only n-levels deep; receiving a request for a file, the request including a file name and a file path with a root; before checking repositories managed by the repository manager for the requested file, determining by reference to the look-up table whether the root of the requested file exists on one of the repositories managed by the repository manager; bypassing a check of the one of the repositories when the look-up table does not indicate that the root exists on the repository; checking the repository for the requested file, when the root is indicated as existing on the repository; returning the requested file, if found on at least one of the repositories; and returning a “fail” response to the request for the file, if the root of the requested file is not indicated as existing in the look-up table. ### Claim 16 (depends on 15) The non-transitory computer-readable medium of claim 15, wherein the n-levels is two or three levels. ### Claim 17 (depends on 15) The non-transitory computer-readable medium of claim 15, further comprising building the look-up table by crawling remote systems that host the repositories to only n-levels, and storing the look-up table that is built, in the look-up table storage. ### Claim 18 (depends on 15) The non-transitory computer-readable medium of claim 15, further comprising building the look-up table by receiving an advertisement from a remote system that hosts the one of the repositories, the advertisement indicating the remote system lookup table to the repository manager. ### Claim 19 (depends on 15) The non-transitory computer-readable medium of claim 15, further comprising building the look-up table at two or three levels deep only. ### Claim 20 (depends on 15) The non-transitory computer-readable medium of claim 15, further comprising periodically refreshing the look-up table, by at least one of sending a request to a remote system that hosts one of the repositories, for a refresh of the look-up table of the remote system, or re-crawling folders at the remote system that hosts one of the repositories to only n-levels to re-confirm content in the look-up table. ### Claim 21 (depends on 15) The non-transitory computer-readable medium of claim 15, further comprising sending, to a remote system that hosts one of the repositories, a request for an advertisement, the advertisement indicating to the repository what part of the path the repository manager does not have, so that the repository manager can be updated; and building the look-up table by receiving the advertisement from the remote system that hosts the one of the repositories, the advertisement indicating the remote system lookup table to the repository manager.