Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2005-06-30
2008-08-05
Alam, Shahid Al (Department: 2164)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C707S793000
Reexamination Certificate
active
07409397
ABSTRACT:
A method and apparatus for performing network file system (NFS) operations across a plurality of servers is provided. At a first server, a filehandle for a particular file is generated based, at least in part, on an identifier that uniquely identifies the particular file relative to all other files within a file system repository. The file system repository may be implemented in a database. The identifier may also be stored in the database. The first server sends a client the filehandle. The client may thereafter send another request for the performance of a file operation, containing the filehandle, to a different server. The second server may read the filehandle and use the identifier to locate the file within the repository against which to perform the file operation without receiving, from the first server, information that associates the filehandle with the file.
REFERENCES:
patent: 5956712 (1999-09-01), Bennett et al.
patent: 5987506 (1999-11-01), Carter et al.
patent: 6032216 (2000-02-01), Schmuck et al.
patent: 6304873 (2001-10-01), Klein et al.
patent: 6453313 (2002-09-01), Klein et al.
patent: 6564215 (2003-05-01), Hsiao et al.
patent: 6728709 (2004-04-01), Plasek et al.
patent: 6732124 (2004-05-01), Koseki et al.
patent: 6772155 (2004-08-01), Stegelmann
patent: 6799188 (2004-09-01), Weedon
patent: 6850938 (2005-02-01), Sadjadi
patent: 6948039 (2005-09-01), Blessener et al.
patent: 6959313 (2005-10-01), Kapoor et al.
patent: 6973455 (2005-12-01), Vahalia et al.
patent: 7076509 (2006-07-01), Chen et al.
patent: 7085785 (2006-08-01), Sawdon et al.
patent: 7139781 (2006-11-01), Young et al.
patent: 7177866 (2007-02-01), Holenstein et al.
patent: 2003/0033328 (2003-02-01), Cha et al.
patent: 2003/0069902 (2003-04-01), Narang et al.
patent: 2003/0172149 (2003-09-01), Edsall et al.
patent: 2004/0107225 (2004-06-01), Rudoff
patent: 2004/0111422 (2004-06-01), Devarakonda et al.
patent: 2004/0133607 (2004-07-01), Miloushev et al.
patent: 2004/0133652 (2004-07-01), Miloushev et al.
patent: 2004/0167932 (2004-08-01), Edmonds
patent: 2004/0199540 (2004-10-01), Nojima
patent: 2004/0255048 (2004-12-01), Lev Ran et al.
patent: 2005/0004925 (2005-01-01), Stahl et al.
patent: 2005/0050054 (2005-03-01), Clark et al.
patent: 2005/0120040 (2005-06-01), Williams et al.
patent: 2005/0203903 (2005-09-01), Rajan et al.
patent: 2005/0210034 (2005-09-01), Howard
patent: 2005/0223047 (2005-10-01), Shah et al.
patent: 2005/0234867 (2005-10-01), Shinkai
patent: 2005/0283504 (2005-12-01), Suzuki et al.
patent: 2005/0289143 (2005-12-01), Oshri et al.
patent: 2006/0129513 (2006-06-01), Nakatani et al.
patent: 2006/0136376 (2006-06-01), Jain et al.
patent: 2006/0136508 (2006-06-01), Idicula et al.
patent: 2006/0136509 (2006-06-01), Pannala et al.
patent: 2006/0136516 (2006-06-01), Jain et al.
patent: 2006/0173851 (2006-08-01), Singh et al.
patent: 0 398 495 (1990-11-01), None
patent: 2 269 920 (1994-02-01), None
International Preliminary Examining Authority, “Notification of Transmittal of the International Preliminary Report on Patentability,” PCT/US2005/015033, received Feb. 21, 2007, 7 pages.
Claims as filed on Oct. 13, 2006 for PCT/US2005/015033, 5 pages (attached).
International Preliminary Examining Authority, “Notification of Transmittal of the International Preliminary Report on Patentability,” PCT/US2005/044134, dated Mar. 3, 2007, 6 pages.
Claims as filed on Jun. 29, 2006 for PCT/US2005/044134, 3 pages (attached).
Interantional Searching Authority, “Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration,” PCT/US2005/044134, dated Mar. 29, 2006, 11 pages.
Current Claims, PCT/US2005/044134, 5 pages, Mar. 29, 2006.
Lu, Hongjun, et al., “T-Tree or B-Tree: Main Memory Database Index Structure Revisited,” Database Conference, 2000, IEEE Jan. 31, 2000, XP 010370177, pp. 65-73.
Pullin, D.J., “B-Tree index in a Binary Relational Database,” IBM Technical Disclosure Bulletin, IBM Corp., New York, vol. 26, No. 7A, Dec. 1983, XP-000714328, pp. 3423-3426.
Interantional Searching Authority, “Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration,” PCT/US2005/015033, dated Aug. 5, 2005, 12 pages.
Current Claims, PCT/US2005/015033, 5 pages.
No, Jaechun et al., “A Locking Protocol for Distributed File Systems,” Parallel and Distributed Computing; Applications and Technologies 5thInternational Conference, 2004, XP-002337237, pp. 527-530.
Satyanarayanan, Mahadev, “Scalable, Secure, and Highly Available Distributed File Access”, Carnegie Mellon University, Computer, vol. 23, No. 5, 12 pages.
Thekkath, Chandramohan A. et al., “Frangipani: A Scalable Distributed File System,” ACM Press, Systems Research Center, SIGOPS Operation System, Rev. 31, Dec. 1997, 14 pages.
Gupta, Sandeep K.S. et al., “A Strategy to Manage Cache Consistency in a Disconnected Distributed Environment”, Parallel and Distributed Systems, IEEE Transactions, vol. 12, No. 7, Jul. 2001, 15 pages.
Agarwal Nipun
Idicula Sam
Jain Namit
Kapoor Vikram
Pannala Syam
Al Alam Shahid
Cheung Rhys W.
Hickman Palermo & Truong & Becker LLP
Mahmood Rezwanul
Oracle International Corporation
LandOfFree
Supporting replication among a plurality of file operation... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Supporting replication among a plurality of file operation..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Supporting replication among a plurality of file operation... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4012636