Method and means for managing space re-use in a shadow written B-tree via free space lists
    2.
    发明公开
    Method and means for managing space re-use in a shadow written B-tree via free space lists 失效
    用于通过免费空间列表管理在书面书写B树中的空间重新使用的方法和手段

    公开(公告)号:EP0453707A3

    公开(公告)日:1992-12-02

    申请号:EP91100537.9

    申请日:1991-01-18

    摘要: A method for managing space re-use with respect to the indices (nodes) of shadow written tree organized dynamic random accessed files/records/pages located in the external store of a CPU. The method reserves space in all non-leaf nodes and maintains a list of available node addresses. When a new node is required then space, if available, is obtained from the parent node list. Only when the parent list becomes exhausted is space (node) obtained from a node inventory manager. Deletion of a node causes its address to be placed on the free or available list maintained by that node's parent. If there is no space, then space on the parent node list is obtained by returning to the inventory manager that node on the list having the least locality with the existing subordinate (children) nodes of the parent.

    Retrieving files from disk storage
    3.
    发明公开
    Retrieving files from disk storage 失效
    从磁盘存储检索文件

    公开(公告)号:EP0354645A3

    公开(公告)日:1992-10-07

    申请号:EP89305428.8

    申请日:1989-05-30

    IPC分类号: G06F15/413 G06F15/419

    摘要: A method of retrieving files from a rotating disk storage, where portions (extents) of each file are stored at different logical addresses on the disk; information about the logical addresses of the extents is also stored on the disk in a prearranged order that is not necessarily the same as the logical order of the logical addresses of the file extents; the logical ordering of the file portions is determined from the stored location information and then the file portions are scanned in logical location order to retrieve the file.

    Information searching apparatus
    4.
    发明公开
    Information searching apparatus 失效
    信息搜索设备

    公开(公告)号:EP0369829A3

    公开(公告)日:1992-01-08

    申请号:EP89312010.5

    申请日:1989-11-20

    IPC分类号: G06F15/403 G06F15/413

    摘要: The information searching apparatus in accord­ance with the present invention comprises: a memory device having a plurality of banks and containing a plurality of types of information data to be searched, as arranged in block; a table memory device con­taining, in table, the banks serving as the basis of the information to be searched, the number of changed banks and address data; and a table reading device for reading tabled information from the table memory device. This information searching apparatus is so ar­ranged as to search the target information to be searched by obtaining the base bank information based on the tabled information from the table memory device, and by obtaining the number of changed banks and the address data of the base bank information. Further, this apparatus is arranged such that the user may learn synonyms and antonyms, or the translated terms, the phonetic symbols or the like of index words in dictionary data. Such data may be searched in a short period of time without any complicate opera­tions, thereby to improve the learning efficiency.

    Method and means for managing space re-use in a shadow written B-tree via free space lists
    5.
    发明公开
    Method and means for managing space re-use in a shadow written B-tree via free space lists 失效
    方法和通过自由空间列在双书面B-树管理空间复用的手段。

    公开(公告)号:EP0453707A2

    公开(公告)日:1991-10-30

    申请号:EP91100537.9

    申请日:1991-01-18

    摘要: A method for managing space re-use with respect to the indices (nodes) of shadow written tree organized dynamic random accessed files/records/pages located in the external store of a CPU. The method reserves space in all non-leaf nodes and maintains a list of available node addresses. When a new node is required then space, if available, is obtained from the parent node list. Only when the parent list becomes exhausted is space (node) obtained from a node inventory manager. Deletion of a node causes its address to be placed on the free or available list maintained by that node's parent. If there is no space, then space on the parent node list is obtained by returning to the inventory manager that node on the list having the least locality with the existing subordinate (children) nodes of the parent.

    摘要翻译: 一种用于管理空间再利用与阴影书面树对于指数(节点)方法组织动态随机访问的文件/记录/位于CPU的外部商店页面。 在所有非叶节点的方法保留空间和维护可用节点地址的列表。 当需要一个新的节点,然后空间,如果有的话,从父节点列表获得。 只有当父目录变为疲惫是从节点库存经理获得空间(节点)。 节点的缺失导致被做了节点的父维护的免费或可用列表上放置它的地址。 如果没有空间,则父节点列表上的空间被返回到库存管理器获得确实节点,其具有与现有的下级(孩子)的至少所在地父节点列表上。

    Mass data storage library
    6.
    发明公开
    Mass data storage library 失效
    Massedatenspeicherbibliothek。

    公开(公告)号:EP0426189A2

    公开(公告)日:1991-05-08

    申请号:EP90121002.1

    申请日:1990-11-02

    申请人: E-SYSTEMS INC.

    IPC分类号: G06F15/401 G06F15/413

    摘要: 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.

    摘要翻译: 大容量数据存储单元包括多个第一数据存储模块,用于容纳形成大容量信息存储库的磁带盒,数据目录存档包括用于维护包含在每个数据存储模块磁带盒中的信息的目录的数据存储介质, 以及用于从大容量存储库中的任何数据存储模块接收任何所选择的磁带盒的数据记录/重放模块,从而提供对媒体的全局访问。 多个接口计算机耦合到多个主计算机,用于接收数据并产生用于访问存储在所述磁带盒上的信息的请求信号。 将文件目录耦合到接口计算机和用于接收请求信号的数据目录存档,在数据目录中定位存储包含存储信息的磁带的地址,并产生用于包含存储信息的磁带的数据地址位置输出信号 存储信息。 控制计算机耦合到文件目录和大容量存储库,用于从文件目录接收数据地址位置输出信号,并且响应于此产生用于使包含请求的信息的数据存储模块中的所选磁带的信号为 加载到选定的数据记录/播放单元中。 输入/输出数据信道将产生访问请求信号的接口计算机与选择的数据记录/重放模块耦合,用于选择性地读取所存储的信息并将数据写入所选择的磁带盒。

    Cache arrangement for file system in digital data processing system
    8.
    发明公开
    Cache arrangement for file system in digital data processing system 失效
    数字数据处理系统中文件系统的缓存设置

    公开(公告)号:EP0463874A3

    公开(公告)日:1994-04-20

    申请号:EP91305813.7

    申请日:1991-06-27

    摘要: 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.

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

    Operating system and data base having an access structure formed by a plurality of tables
    9.
    发明公开
    Operating system and data base having an access structure formed by a plurality of tables 失效
    操作系统和数据库与形成为从多个表的访问的结构。

    公开(公告)号:EP0588445A2

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

    申请号:EP93203195.8

    申请日:1990-09-04

    IPC分类号: G06F15/413 G06F15/40

    摘要: An object access system for retrieving objects in response to requests identifying requested objects, the system comprising an access structure consisting of a plurality of tables where each table is identified by a unique table identifier and has a plurality of rows where each row has a plurality of fields and is identified by an unique primary key in one of the fields and where a field may also contain objects; a row index for each table, each row index having entries ordered on the primary key of the rows in the table where each entry points to a row of fields in the table; a table index ordered on the table identifier for the tables, the table index having an entry for each table which point to the row index for that table and access means, responsive to requests for an object having an associated table identifier and primary key, for searching the table index for the requested table identifier and for retrieving from the table index entry for the requested table identifier the pointer to the row index for the requested table identifier,searching the pointed to row index for the requested primary key and retrieving from the row index entry for the requested primary key the pointer to the row of fields and searching the pointed to row of field for the requested object and retrieving the requested object.

    摘要翻译: 用于响应于识别请求的对象的请求检索对象的对象的访问的系统,所述系统接入结构的包括,其中每个表被标识由唯一的表标识符,并且具有行中的多个,其中每个行具有多个表的多个由......组成 字段和在所述字段中的一个,并且其中一个,因此字段可以包含对象鉴定到唯一主密钥; 每个表中的行索引,其具有下令在表中的行的主键条目每行索引,其中每个入口点表中的字段的行; 下令该表中的表识别符的表索引,其具有用于每一个指向该表和访问装置的行索引表,以请求用于在对象具有相关联的表标识符和主密钥的条目,反应灵敏,该表索引 搜索所请求的表识别符和用于从所述表索引项指针检索针对所请求的表标识符到行索引为所请求的表标识符,搜索所指向的行索引为所请求的主键和从行中检索表索引 indexentry针对所请求的主键的指针字段的行和搜索尖为请求的对象行场和检索被请求对象。

    Prefix search tree with partial key branching
    10.
    发明公开
    Prefix search tree with partial key branching 失效
    前缀搜索树与部分关键分支

    公开(公告)号:EP0419889A3

    公开(公告)日:1993-04-21

    申请号:EP90116841.9

    申请日:1990-09-03

    发明人: Nickel, Steven P.

    IPC分类号: G06F15/413 G06F15/419

    摘要: 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.