公开(公告)号：EP0463874A2

公开(公告)日：1992-01-02

申请号：EP91305813.7

申请日：1991-06-27

申请人： DIGITAL EQUIPMENT CORPORATION

发明人： Ramakrishnan, Kadangode K. ,  Biswas, Prabuddha

IPC分类号： G06F12/08 ,  G06F12/12 ,  G06F15/413

CPC分类号： G06F17/30955 ,  G06F12/0802 ,  G06F12/0862 ,  G06F12/0866 ,  G06F12/128

摘要： A method for caching information needed by application programs from a secondary storage in which the cache memory is organized in multiple levels, each level having multiple entries, the entries of each level receiving information of a predetermined category, each entry being accessible independently. Links are defined between entries of one level of the cache memory and entries at another level of the cache memory, the links corresponding to information relationships specified by a user of information stored in the secondary storage. The use and reuse of the cache entries is based on the links. In response to a request to a file system from an application for needed information, the needed information is fetched into the cache, and in connection with fetching the needed information, other information is prefetched from the system of files which is not immediately needed. Quotas are established on information which may be fetched from a secondary storage into the cache, the quotas being applicable to file contents within a file and to the number of files within a directory. The fetching of information from secondary storage into the cache is regulated based on the quotas. Upon a request from an application program to open a file, an entry is created in a cache corresponding to the file, the entry including file header information. The file header information is retained in the cache so long as the file remains open, whether or not any file contents of the file remain in cache. The entries of three level of the cache respectively receive directory information, file header information, and file contents information.

摘要翻译： 一种用于缓存应用程序所需的信息的方法，所述辅助存储器中的高速缓存存储器被组织在多个级别中，每个级别具有多个条目，每个级别的条目接收预定类别的信息，每个条目是可独立访问的。 链接在高速缓冲存储器的一个级别的条目和高速缓冲存储器的另一级别的条目之间定义，链接对应于由用户存储在辅助存储器中的信息指定的信息关系。 缓存条目的使用和重用基于链接。 响应于来自应用程序的文件系统对所需信息的请求，将所需的信息提取到高速缓存中，并且与获取所需信息相关联，从不是立即需要的文件的系统中预取其他信息。 配额是建立在可以从辅助存储器提取到高速缓存中的信息上，配额适用于文件内的文件内容和目录中的文件数量。 从二级存储到缓存的信息获取是根据配额进行调整的。 在来自应用程序打开文件的请求时，在与文件相对应的高速缓存中创建条目，该条目包括文件头信息。 只要文件保持打开，文件头信息就保留在缓存中，无论文件的任何文件内容是否保留在缓存中。 三级缓存的条目分别接收目录信息，文件头信息和文件内容信息。

公开(公告)号：EP0453193A2

公开(公告)日：1991-10-23

申请号：EP91303254.6

申请日：1991-04-12

申请人： International Business Machines Corporation

发明人： Frey, Alexander H., Jr. ,  Mosteller, Richard C.

IPC分类号： G06F15/413 ,  G06F11/14

CPC分类号： G06F17/30091 ,  G06F11/1402

摘要： A distributed network contains a plurality of interconnected nodes 10, each node including a processor 16 and data storage apparatus 26. A plurality of key-index data identifiers are distributed among the nodes, with each node including a tree data structure in non-volatile storage defining locations of the key-index data identifiers. The tree data structure includes a ROOT data structure 31 for the top level of the tree, comprising two lists, "NEW ROOT" and "OLD ROOT", each comprised of an ordered array of boundaries assigned to the nodes. The tree data structure is balanced by determining when a first node contains an excess of key-index data identifiers, and moving the excess of key-index data identifiers to a second node. The first node/second node boundary value in "NEW ROOT" of the ROOT data structure is updated to record the movement of the data file identifiers, so that in the event of a malfunction of one of the nodes, a record exists in both of the nodes of both an updated and non-updated ROOT data structure to enable data recovery.

摘要翻译： 分布式网络包含多个互连节点10，每个节点包括处理器16和数据存储装置26.多个密钥索引数据标识符分布在节点之间，每个节点在非易失性存储器中包括树状数据结构 定义密钥索引数据标识符的位置。 树数据结构包括用于树的顶层的ROOT数据结构31，其包括两个列表“NEW ROOT”和“OLD ROOT”，每个列表分配给节点的有序边界阵列。 通过确定第一节点何时包含多余的密钥索引数据标识符并将多余的密钥索引数据标识符移动到第二节点来平衡树数据结构。 更新ROOT数据结构的“NEW ROOT”中的第一节点/第二节点边界值，以记录数据文件标识符的移动，以便在节点之一发生故障的情况下，存在两个 更新和不更新ROOT数据结构的节点，以实现数据恢复。

公开(公告)号：EP0578204A3

公开(公告)日：1994-03-23

申请号：EP93110796.5

申请日：1993-07-06

申请人： MICROSOFT CORPORATION

发明人： Atkinson, Robert G. ,  Bliss, Andrew L. ,  Lafornara, Philip J. ,  Ljubicich, Philip ,  Tilles, Alexander G. ,  Williams, Antony S.

IPC分类号： G06F15/413 ,  G06F15/403

CPC分类号： G06F17/30952 ,  G06F3/0605 ,  G06F3/0643 ,  G06F3/0674 ,  G06F17/30011 ,  G06F17/30067 ,  Y10S707/956 ,  Y10S707/99931

摘要： A method and system for interfacing an application program with a compound document storage system. The present invention provides an interface which an application program uses to manipulate compound documents. In a preferred embodiment, this interface is implemented in a multilayered architecture. The first layer provides methods which an application program uses to access a compound document using the functions of the second layer. The second layer maps requests to store data in the compound document to a storage format using the functions of the third layer. The third layer maps requests to write to a file to an arbitrary storage medium.

摘要翻译： 一种用于将应用程序与复合文档存储系统连接的方法和系统。 本发明提供了应用程序用来操纵复合文档的界面。 在一个优选实施例中，该接口以多层体系结构实现。 第一层提供了应用程序使用第二层功能访问复合文档的方法。 第二层使用第三层的功能将请求存储在复合文档中的存储格式。 第三层将写入文件的请求映射到任意存储介质。

公开(公告)号：EP0557736A3

公开(公告)日：1994-02-09

申请号：EP93101396.5

申请日：1993-01-29

申请人： MICROSOFT CORPORATION

发明人： Krueger, William J. ,  Rajagopalan, Sriram

IPC分类号： G06F15/413

CPC分类号： G06F17/30952 ,  G06F11/1435 ,  G06F12/0246 ,  G06F17/30067 ,  G06F2212/7205 ,  Y10S707/99956

摘要： The present invention relates to a manager for a computer memory comprising:
   a block allocation routine, the memory divided into blocks of memory locations, each block having an allocation table and a data region divided into data areas, each allocation table having entries corresponding to region data areas, the block allocation routine for selecting a block in which to store data;
   a data area allocation routine for selecting a data area within the data region for the selected block in which to store data, for selecting an allocation table entry to correspond to the selected data area, and for setting the selected allocation table entry to correspond to the selected data area and to an allocated state; and
   a storage routine for storing data in the selected data area.

摘要翻译： 计算机存储器管理器本发明涉及一种计算机存储器管理器，包括：块分配例程，该存储器被划分成存储器位置块，每个块具有分配表和被分成数据区的数据区，每个分配表具有对应于区 数据区域，用于选择要在其中存储数据的块的块分配例程; 数据区域分配例程，用于选择数据区域内用于存储数据的所选块的数据区域，用于选择分配表项目以对应于所选数据区域，以及用于将所选分配表项设置为对应于 选定的数据区域和分配状态; 以及用于将数据存储在所选数据区域中的存储例程。

公开(公告)号：EP0426189A3

公开(公告)日：1993-03-17

申请号：EP90121002.1

申请日：1990-11-02

申请人： E-SYSTEMS INC.

发明人： Martin, Charles W. ,  Reid, Frederick S. ,  Forbus, Gary L. ,  Adams, Steve M. ,  Shannon, C. Pat ,  Pirpich, Eric A.

IPC分类号： G06F15/401 ,  G06F15/413

CPC分类号： G06F17/30315 ,  G06F3/0601 ,  G06F2003/0697 ,  G11B27/002 ,  G11B27/11 ,  G11B27/36 ,  G11B2220/41 ,  G11B2220/90

摘要： A mass data storage unit includes a plurality of first data storage modules for containing tape cassettes that form a mass information storage library, a data directory archive comprising a data storage medium for maintaining a directory of the information contained on each data storage module tape cassette, and data record/playback modules for receiving any selected tape cassette from any data storage module in the mass storage library, thus providing global access to the media. A plurality of interface computers are coupled to a plurality of host computers for receiving data and for generating request signals to access information stored on said tape cassette. A file directory is coupled to the interface computers and the data directory archive for receiving the request signals, locating in the data directory archive the address of the tape cassette containing the stored information and generating a data address location output signal for the tape cassette containing the stored information. A control computer is coupled to the file directory and the mass storage library for receiving the data address location output signal from the file directory and in response thereto generating a signal for causing the selected tape cassette in the data storage module containing the requested information to be loaded into a selected data record/playback unit. An input/output data channel couples the interface computer generating the access request signal to the selected data record/playback module for selectively reading the stored information from and writing data to the selected tape cassette.

公开(公告)号：EP0410210A3

公开(公告)日：1993-03-17

申请号：EP90113238.1

申请日：1990-07-11

申请人： International Business Machines Corporation

发明人： Baird, Robert ,  Berbec, Robert Ryan ,  Bozman, Gerald Parks ,  Lett, Alexander Stafford ,  Myers, James Joseph ,  Tetzlaff, William Harold ,  Unger, Jay Harold

IPC分类号： G06F15/413 ,  G06F15/419 ,  G06F15/40 ,  G06F9/44

CPC分类号： G06F17/30091 ,  G06F17/30171 ,  G06F17/30952

摘要： A computer-implemented method for the name-oriented accessing of files having at least zero records, any access path to files and records through an external store coupling the computer being defined by a pair of related directories. A first directory of record entries is sorted on a two-part token. The token consists of a unique sequence number assigned to the record and the sequence number of any parent record entry. Each record entry includes the token, file or record name, and external store address or pointer. A traverse through the tokens constitutes a leaf-searchable B-tree. Rapid access to target records is by way of a name- sorted, inverted directory of names and tokens as a subset and which is reconstitutable from the first directory in the event of unavailability.

公开(公告)号：EP0351388A3

公开(公告)日：1992-10-14

申请号：EP89850195.2

申请日：1989-06-14

申请人： International Business Machines Corporation

发明人： Miu-Kung Cheng, Josephine ,  Wang, Yun ,  Shibamiya, Akira

IPC分类号： G06F15/413 ,  G06F15/40

CPC分类号： G06F17/30336 ,  G06F17/30327 ,  G06F17/30463 ,  Y10S707/99932

摘要： This invention measures the degree of clustering of an index for a relational data base table, estimates the number of physical page accesses required to access the table using a partial index scan using the index, and selects the index providing the fastest access path to the table. The degree of clustering is measured as follows:
DC = Number of clustered rows (NCR) / Total rows (NR)
A multiplier greater than 1 can be applied to the degree of clustering to reflect the benefit of having consecutively accessed rows on adjacent or nearby data pages. The degree of clustering so calculated is used to estimate the number of random and sequential page accesses required for a partial index scan. These numbers of access­es are then multiplied by the unit time required for each, and added to the total CPU processing time required to arrive at the estimated total time for the scan. The total time is calculated for each index which could be used as an access path for the query or other operation being optimiz­ed, and the index with the shortest overall time is selected as the access path.

公开(公告)号：EP0419889A2

公开(公告)日：1991-04-03

申请号：EP90116841.9

申请日：1990-09-03

申请人： Bull HN Information Systems Inc.

发明人： Nickel, Steven P.

IPC分类号： G06F15/413 ,  G06F15/419

CPC分类号： G06F17/30961 ,  G06F17/30955 ,  G06F17/30985 ,  Y10S707/99933

摘要： A prefix index tree structure for locating data records stored through keys related to information stored in data records. Each node includes a prefix field for a prefix string of length p of the longest string of key characters shared by all subtrees of the node and a data record field for a reference to a data record whose key is completed by the prefix string. A node may include one or more branch fields when the prefix string is a prefix of keys stored in at least one subtree of the node, with a branch field for each distinct p+1 st key character in the keys, wherein each p+1 st key character is a branch character. Each branch field includes a branch character and a branch pointer field for a reference to a node containing at least one key whose p+1 st character is the branch character. Each node further includes a field for storing the number of key characters in the prefix string and a field for storing the number of branch fields in the node. Also disclosed are methods for constructing and searching a prefix index tree of the present invention, and for inserting nodes into the tree and deleting nodes from the tree.

摘要翻译： 用于定位通过与存储在数据记录中的信息相关的密钥存储的数据记录的前缀索引树结构。 每个节点包括用于节点的所有子树共享的最长的密钥字符串的长度为p的前缀字符串的前缀字段和用于引用其前缀字符串完成其密钥的数据记录的数据记录字段。 当前缀字符串是存储在节点的至少一个子树中的键的前缀时，节点可以包括一个或多个分支字段，其中键中的每个不同的p + 1个密钥字符具有分支字段，其中每个p +1字符是一个分支字符。 每个分支字段包括分支字符和分支指针字段，用于引用包含至少一个键的节点，其中p + 1 字符是分支字符。 每个节点还包括用于存储前缀字符串中的关键字符的数量的字段和用于存储节点中的分支字段的数量的字段。 还公开了用于构建和搜索本发明的前缀索引树的方法，并且用于将节点插入到树中并从树中删除节点。

公开(公告)号：EP0389399A2

公开(公告)日：1990-09-26

申请号：EP90480027.3

申请日：1990-02-20

申请人： International Business Machines Corporation

发明人： Freeman, Harrison L. ,  Hoag, Thomas Marshall ,  Mustain, Richard Glen

IPC分类号： G06F15/413

CPC分类号： G06F17/30955 ,  G06F17/30067

摘要： A directory structure for WORM optical media which supports a multi-level tree structure containing several paths is disclosed. When a user defines the first path on the WORM volume, a first file directory group (140) is created for that path. A path directory entry pointing to this file directory group is written to the path directory group (130). Files having this path name are initially written into the first data file area (150) next to this file directory group. The first data file area grows as data is written into it. When a second path is defined, the first data file area is closed and a second file directory group (160) is created on the WORM volume next to the first data file area, thereby wasting little if any space. The path directory group is updated with a new path directory entry that points to this new file directo­ry group. Files having this second path name are written into a growing second data area. If the user now wants a file having the first path name to be written to the disk, a file directory entry is placed in the first file direc­tory group, but the file itself is written into the grow­ing second data file area. In this manner, files are associated with directory entries by a common path name, not necessarily physical location on the disk, although files tend to be relatively close to their associated directory entry.

摘要翻译： 公开了一种支持包含多个路径的多层树结构的WORM光学介质的目录结构。 当用户定义WORM卷上的第一个路径时，将为该路径创建第一个文件目录组（140）。 指向该文件目录组的路径目录条目将被写入路径目录组（130）。 具有该路径名的文件最初被写入该文件目录组旁边的第一数据文件区域（150）。 随着数据被写入，第一个数据文件区域增长。 当定义第二路径时，第一数据文件区域被关闭，并且在第一数据文件区域旁边的WORM卷上创建第二文件目录组（160），从而浪费很少的空间。 路径目录组使用指向此新文件目录组的新路径目录条目进行更新。 具有该第二路径名的文件被写入不断增长的第二数据区。 如果用户现在想要将具有第一路径名称的文件写入磁盘，则文件目录条目被放置在第一文件目录组中，但是文件本身被写入不断增长的第二数据文件区域中。 以这种方式，文件通过公用路径名称与目录条目相关联，但不一定是磁盘上的物理位置，尽管文件往往相对靠近其相关联的目录条目。

公开(公告)号：EP0363135A2

公开(公告)日：1990-04-11

申请号：EP89310077.6

申请日：1989-10-03

申请人： ALPHATRONIX INC.

发明人： Whisler, John W.

IPC分类号： G06F15/413 ,  G06F12/08

CPC分类号： G06F17/30952 ,  G06F17/30067

摘要： The present invention is a system and method which follows a directory tree of a random access disk 20 to obtain file location information and the contents for multiple files. For each file found an entry is created on a file description ring 90 and the file location information is stored in the entry. An insert pointer indicates the next available entry on the ring 90. The system then stores the different type location information (for example file headers, directories and directory headers are different types) for each of the files in corresponding segmented ring buffers 172, 176 and 192 dedicated to storing information of only a single type. The file content is also stored in a dedicated segmented file content ring buffer 132. Each time a ring is updated with information for a file, a corresponding operation pointer (96, 100 and 102) for the ring 90 is advanced. When a ring segment is full, the system transfers the segment to a corresponding location on a destination disk 24 and updates a file allocation list ring 162. The writing of file contents from ring 132 advances a write operation pointer 98. When all files have been written the file allocation list ring 162 is written out to the disk 24. The buffering of the different types of information until a ring segent is full reduces the number of write operations and, not only enhances source read out speed since the read operation does not have to wait for the write operation to occur before the next read operation can start because the data read is stored in the segmented buffer rings, but also enhances 'write speed by writing segments and increases drive life expectancy by reducing mechanical motion.

摘要翻译： 本发明是跟随随机存取盘20的目录树以获取文件位置信息和多个文件的内容的系统和方法。 对于每个找到的文件，在文件描述环90上创建条目，并且文件位置信息被存储在条目中。 插入指针指示环90上的下一个可用条目。然后，系统为对应的分段环形缓冲器172,176中的每个文件存储不同类型的位置信息（例如，文件头，目录和目录头是不同类型的），以及 192专用于存储仅一种类型的信息。 文件内容也存储在专用分段文件内容环形缓冲器132中。每当环形信息用文件更新时，环90的对应操作指针（96,100和102）被提前。 当环段已满时，系统将段传送到目标磁盘24上的对应位置，并更新文件分配列表环162.从环132写入文件内容使写操作指针98前进。当所有文件已经被 将写入的文件分配列表环162写入磁盘24.不同类型的信息的缓冲直到环形段已满才减少写入操作的数量，并且不仅增强了源读取速度，因为读取操作不是 必须等待写入操作发生，才能开始下一次读取操作，因为数据读取存储在分段缓冲环中，而且还通过写入段来增强写入速度，并通过减少机械运动来提高驱动器的预期寿命。