A method of smart path finding for a file operation is disclosed. A data structure is provided to store reference points, file paths and use counts. Each of the reference points is a URL or an email ID and is associated with at least one of the file paths. Each of the use counts is tied to one of th
A method of smart path finding for a file operation is disclosed. A data structure is provided to store reference points, file paths and use counts. Each of the reference points is a URL or an email ID and is associated with at least one of the file paths. Each of the use counts is tied to one of the file paths. The data structure is searched when a reference point is hit for downloading, uploading, attaching or detaching a file. When the reference point is found to be or to be similar to one of the reference points, one or more file paths associated with the one of the reference points are ordered, by one or more use counts tied to the one or more file paths, to form a list including one or more suggested file paths for downloading, uploading, attaching or detaching the file.
대표청구항▼
1. A computer implemented method, comprising: storing a first reference point and at least one file path, said at least one file path comprising a location, associated with said first reference point in a data structure, wherein a first file associated with said first reference point is one of downl
1. A computer implemented method, comprising: storing a first reference point and at least one file path, said at least one file path comprising a location, associated with said first reference point in a data structure, wherein a first file associated with said first reference point is one of downloaded by a user to said at least one file path, uploaded by said user from said at least one file path, attached by said user from said at least one file path, and detached by said user to said at least one file path;storing a use count associated with a corresponding one of said at least one file path, said use count indicating a number of times said at least one file path has been utilized for downloading, uploading, attaching or detaching a file through web browsing, file transfer protocol (FTP) download, email files detachment, or email file attachment operations;receiving a file operation for a second file associated with a second reference point, the file operation being one of downloading, uploading, attaching, and detaching said second file;comparing the second reference point to said first reference point when said second reference point is accessed for one of downloading, uploading, attaching, and detaching the second file;generating an ordered list comprising said at least one file path when said second reference point is determined to be similar to said first reference point, said ordered list ordered utilizing said use count associated with said corresponding one of said at least one file path;presenting said ordered list to the user; andreceiving input from the user for one of downloading said second file to one of said at least one file path presented in said ordered list, uploading said second file from one of said at least one file path presented in said ordered list, attaching said second file from one of said at least one file path presented in said ordered list, and detaching said second file to one of said at least one file path presented in said ordered list,wherein the at least one file path is ordered at a top of said ordered list when said use count associated with said at least one file path is greater than another use count associated with another file path in said ordered list. 2. The method of claim 1, wherein said data structure is a flat file or a database. 3. The method of claim 1, wherein said data structure includes an array of at least one uniform resource locator (URL) entry, each URL array entry pointing to a linked list of at least one file path node, each file path node storing file path information and a use count. 4. The method of claim 3, further comprising searching through said array for a URL and, when said URL is included in said array, reading and displaying said at least one file path node associated with said URL. 5. The method of claim 4, further comprising inserting a new file path into said at least one file path node associated with said URL. 6. The method of claim 4, further comprising adding said URL to said array when said URL is not found in said array. 7. The method of claim 1, further comprising maintaining said data structure by at least one of updating said use count, inserting a new reference point, and inserting a new file path. 8. The method of claim 1, wherein the first reference point comprises at least one of a uniform resource locator (URL) and an email identifier and the second reference point comprises at least one of a uniform resource locator (URL) and an email identifier. 9. A non-transitory computer-readable storage medium having a computer program product stored thereon and executed by a computer system, causes the computer system to: store a first reference point and at least one file path associated with said first reference point in a data structure, wherein a file associated with said first reference point is one of downloaded by a user to said at least one file path, uploaded by said user from said at least one file path, attached by said user from said at least one file path, and detached by said user to said at least one file path;store a use count associated with a corresponding one of said at least one file path, said use count indicating a number of times said at least one file path has been utilized for downloading, uploading, attaching or detaching a file through web browsing, file transfer protocol (FTP) download, email files detachment, or email file attachment operations;receive a file operation for a second file associated with a second reference point, the file operation being one of downloading, uploading, attaching, and detaching said second file;compare the second reference point to said first reference point when said second reference point is accessed for one of downloading, uploading, attaching, and detaching the second file;generate an ordered list comprising said at least one file path when said second reference point is determined to be similar to said first reference point, said ordered list ordered utilizing said use count associated with said corresponding one of said at least one file path;present said ordered list to the user; andreceive input from the user for one of downloading said second file to one of said at least one file path presented in said ordered list, uploading said second file from one of said at least one file path presented in said ordered list, attaching said second file from one of said at least one file path presented in said ordered list, and detaching said second file to one of said at least one file path presented in said ordered list,wherein the at least one file path is ordered at a top of said ordered list when said use count associated with said at least one file path is greater than another use count associated with another file path in said ordered list. 10. The non-transitory computer readable storage medium of claim 9, wherein said data structure is a flat file or a database. 11. The non-transitory computer readable storage medium of claim 9, wherein said data structure includes an array of at least one uniform resource locator (URL) entry, each URL array entry pointing to a linked list of at least one file path node, each file path node storing file path information and a use count. 12. The non-transitory computer readable storage medium of claim 11, wherein the computer readable program product when executed on the computer system further causes the computer system to search through said array for a URL and, when said URL is included in said array, read and display said at least one file path node associated with said URL. 13. The non-transitory computer readable storage medium of claim 12, wherein the computer program product when executed on the computer system further causes the computer system to insert a new file path into said at least one file path node associated with said URL. 14. The non-transitory computer readable storage medium of claim 12, wherein the computer program product when executed on the computer system further causes the computer system to add said URL to said array when said URL is not found in said array. 15. The non-transitory computer readable storage medium of claim 9, wherein the computer program product when executed on the computer system further causes the computer system to maintain said data structure by at least one of updating said use count, inserting a new reference point, and inserting a new file path. 16. The non-transitory computer readable storage medium of claim 9, wherein the first reference point comprises at least one of a uniform resource locator (URL) and an email identifier and the second reference point comprises at least one of a uniform resource locator (URL) and an email identifier.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (8)
Pechanek Gerald G. (Cary NC) Larsen Larry D. (Raleigh NC) Glossner Clair John (Durham NC) Vassiliaadis Stamatis (Zoetermeer NLX), Array processor communication architecture with broadcast processor instructions.
Muldoon,John M.; Adams,Mark S.; Goldstein,Leonard G.; Markovitz,Craig; Wack, Jr.,Patrick J., Computerized method and system for managing the exchange and distribution of confidential documents.
Abburi,Rajasekhar; Alkove,James M.; McNeill,William P.; McKune,Jeffrey R., Enforcement architecture and method for digital rights management system for roaming a license to a plurality of user devices.
Xu Yikang ; Vahalia Uresh K. ; Jiang Xiaoye ; Gupta Uday ; Tzelnic Percy, File server system using file system storage, data movers, and an exchange of meta data among data movers for file locking and direct access to shared file systems.
Lewak Jerzy (Del Mar CA) Grzechnik Slawek (La Mesa CA) Matousek Jon (San Diego CA), Method for accessing computer files and data, using linked categories assigned to each data file record on entry of the.
Blair David Kim (Bennion UT) Curtis Scott Karl (Salt Lake City UT) Lucht Philip Harrison (Salt Lake City UT), System for storing data and for providing simultaneous plural access to data by connecting each access channel to each a.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.