Systems and methods for efficiently locating object names in a large index of records containing object names
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-007/00
G06F-017/00
출원번호
US-0448391
(2012-04-16)
등록번호
US-8938428
(2015-01-20)
발명자
/ 주소
Ozekinci, Yasemin Ugur
Papadakis, Thomas
출원인 / 주소
EMC Corporation
대리인 / 주소
Chen, Theodore A.
인용정보
피인용 횟수 :
0인용 특허 :
34
초록▼
A method, article of manufacture, and apparatus for tracking a plurality of objects being stored are disclosed. In an embodiment, this comprises computing the hash value of the name of each object being stored, setting the corresponding bits in a bitmap, and storing the bitmap as a hint in an index.
A method, article of manufacture, and apparatus for tracking a plurality of objects being stored are disclosed. In an embodiment, this comprises computing the hash value of the name of each object being stored, setting the corresponding bits in a bitmap, and storing the bitmap as a hint in an index. The size of the bitmap is determined by the space available for storing the hint, and the range of hash values is determined by the size of the bitmap. The range may be determined by choosing a prime number smaller than the space available for storing the bitmap. Either the hint or the longest pathname containing the objects can be stored, and this may be selected based on the application.
대표청구항▼
1. A method of tracking a plurality of file system objects being stored, wherein the plurality of objects is associated with a saveset, comprising: providing a bitmap;applying a hash function to a name of each file system object to generate a hash value k;setting the kth bit in the bitmap to ON; and
1. A method of tracking a plurality of file system objects being stored, wherein the plurality of objects is associated with a saveset, comprising: providing a bitmap;applying a hash function to a name of each file system object to generate a hash value k;setting the kth bit in the bitmap to ON; andstoring the bitmap as a hint in an index, wherein the hint is associated with the saveset, wherein the index contains at least a second hint stored as a second bitmap and associated with a second saveset, wherein the bitmap and the second bitmap are identical; and wherein the saveset and the second saveset are different. 2. The method as recited in claim 1, further comprising storing in the index a longest pathname containing the plurality of objects. 3. The method as recited in claim 1, wherein the index comprises descriptors for a plurality of savesets. 4. The method as recited in claim 3, wherein storing the hint includes storing the hint in one of the descriptors. 5. The method as recited in claim 1, wherein the index comprises a savepoint configured to store information about a longest pathname containing the plurality of objects. 6. The method as recited in claim 5, wherein storing the hint includes storing the hint in the savepoint. 7. The method as recited in claim 1, further comprising determining a size of the bitmap. 8. The method as recited in claim 7, wherein determining the size of the bitmap includes choosing a largest prime number smaller than a space available for storing the bitmap. 9. The method as recited in claim 8, further comprising storing, in the hint, information relating to the size of the bitmap. 10. The method as recited in claim 9, further comprising storing, in the hint, information indicating a type of algorithm being used for the hint. 11. The method as recited in claim 1, wherein applying the hash function includes applying an equation s[0]*xk+s[1]*xk-1+s[2]*xk-2+ . . . +s[k−1]*x1+s[k]*x0 wherein x equals 231. 12. The method as recited in claim 11, wherein applying the hash function further includes applying an equation h(k)=k mod m. 13. The method as recited in claim 12, wherein m is a largest prime number smaller than a largest number that can be represented by the space available for storing the bitmap. 14. A method of tracking a plurality of file system objects being stored, wherein the plurality of objects is associated with a saveset, comprising: providing a bitmap;applying a hash function to a name of each file system object to generate a hash value k;setting the kth bit in the bitmap to ON; andstoring in an index, the bitmap as a hint or a longest pathname containing the plurality of objects, wherein the hint is associated with the saveset, wherein the index contains at least a second hint stored as a second bitmap and associated with a second saveset, wherein the bitmap and the second bitmap are identical; and wherein the saveset and the second saveset are different. 15. The method as recited in claim 14, further comprising determining whether to store the hint or the longest pathname containing the plurality of objects. 16. The method as recited in claim 15, wherein determining whether to store includes determining an application associated with the plurality of objects. 17. The method as recited in claim 16, wherein applying the hash function further includes applying an equation h(k)=k mod m. 18. The method as recited in claim 17, wherein m is a largest prime number smaller than a space available for storing the bitmap. 19. A computer program product for tracking a plurality of file system objects being stored, wherein the plurality of objects is associated with a saveset, comprising a non-transitory computer usable medium having machine readable code embodied therein for: providing a bitmap;applying a hash function to a name of each file system object to generate a hash value k;setting the kth bit in the bitmap to ON; andstoring the bitmap as a hint in an index, wherein the hint is associated with the saveset, wherein the index contains at least a second hint stored as a second bitmap and associated with a second saveset, wherein the bitmap and the second bitmap are identical; and wherein the saveset and the second saveset are different.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (34)
Mattis Peter ; Plevyak John ; Haines Matthew ; Beguelin Adam ; Totty Brian ; Gourley David, Alias-free content-indexed object cache.
Hopwood Rene S. ; Sipes Bradley S. ; Wayne Thomas P. ; Quarton John E. ; Milus Stewart M., Computer system and method to track and control element changes throughout application development.
Farber David A. ; Lachman Ronald D., Data processing system using substantially unique identifiers to identify data items, whereby identical data items hav.
Mattis Peter ; Plevyak John ; Haines Matthew ; Beguelin Adam ; Totty Brian ; Gourley David, Delivering alternate versions of objects from an object cache.
Nagral Ajit S. ; Bush ; III Fitzhugh Gordon ; Bayiates Edward Lawrence ; Gregory Carey Edwin ; Dos Santos Carl Philip Emmanuel ; Kaulgud Milind, Information storage and retrieval system for storing and retrieving the visual form of information from an application in a database.
Matena Vladimir ; Bernabeu-Auban Jose M. ; Khalidi Yousef A. ; Shirriff Kenneth W. ; Thadani Moti N., Memory efficient directory coherency maintenance.
Pace,Charles P.; Pizzorni,Paolo R.; Chen,Shuang, Method, system, and structure for distributing and executing software and data on different network and computer devices, platforms, and environments.
Day Mark S. ; Brady Donald J. ; Horn Deric S., System and method for reducing file name length and for retrieving the reduced file name entitled files.
Kowalski, Stephen Francis; Jensen, Richard Prentiss; Darling, Damon Andrew; Sharfman, Joshua Dov Joseph, System and method for simultaneously encoding data in multiple formats and at different bit rates.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.