-
公开(公告)号：CA1303747C
公开(公告)日：1992-06-16
申请号：CA558110
申请日：1988-02-04
Applicant: IBM
Inventor： CHRISTOPHER KENNETH W JR , FEIGENBAUM BARRY A , KIM JIN , LOVE DOUGLAS C
Abstract: METHOD OF RAPIDLY OPENING DISK FILES IDENTIFIED BY PATH NAMES A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache in main memory. The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be gotten from a disk. When the cache is full, a new entry replaces the least recently used entry.
-
公开(公告)号：HK33892A
公开(公告)日：1992-05-15
申请号：HK33892
申请日：1992-05-07
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
公开(公告)号：GB2204161B
公开(公告)日：1991-09-18
申请号：GB8728924
申请日：1987-12-10
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
公开(公告)号：GB2204161A
公开(公告)日：1988-11-02
申请号：GB8728924
申请日：1987-12-10
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
公开(公告)号：FR2613505A1
公开(公告)日：1988-10-07
申请号：FR8717530
申请日：1987-12-09
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
Patent Agency Ranking
公开(公告)号：DE3780807T2
公开(公告)日：1993-03-11
申请号：DE3780807
申请日：1987-12-15
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
公开(公告)号：AT78943T
公开(公告)日：1992-08-15
申请号：AT87118540
申请日：1987-12-15
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
公开(公告)号：BR8801438A
公开(公告)日：1988-11-01
申请号：BR8801438
申请日：1988-03-29
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
公开(公告)号：DE3743890A1
公开(公告)日：1988-10-27
申请号：DE3743890
申请日：1987-12-23
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
公开(公告)号：DE3780807D1
公开(公告)日：1992-09-03
申请号：DE3780807
申请日：1987-12-15
Applicant: IBM
Abstract: A data processing system has files stored on disks in a tree structure of directories and files. The system is operated to rapidly open files which have been recently opened or for which partial path information is available, by accessing a drive cache (30) in main memory (16). The cache has entries chained in a tree structure which is then searched to provide the same information during the opening process as that information which would otherwise have to be obtained from a disk (22). When the cache is full, a new entry replaces the least recently used entry.
-
-
-
-
-
-
-
-
-
Search Results
11
records
(took 0.017 seconds)
