会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明专利
    • DATA BASE SYSTEM
    • JPH0863479A
    • 1996-03-08
    • JP19425294
    • 1994-08-18
    • HITACHI LTD
    • TAKAYAMA HIROSHIMASAI KAZUO
    • G06F17/30
    • PURPOSE: To improve the throughput of retrieval processing by lowering the frequency of reading from an external storage device as to the data base system where an all-text retrieval request for the same data is made frequently. CONSTITUTION: The parallel execution type data base system consisting of plural processors 102 is provided with a dictionary management part 106, a buffer management part 109, and a retrieval execution control part 104. The buffer management part 109 transfers a data block which is already read in to other processors 102 as a new data block are read in from an external storage device. The dictionary management part 106 records and manages address information indicating the whereabouts of a data block that is read in once and transferred to the respective processors 102. The retrieval execution control part 104 performs execution control over retrieval as to data blocks in the respective processors 102 on the basis of the address information. Consequently, the frequency of reading from the external storage device is lowered to improve the all-text retrieval performance of the system.
    • 3. 发明专利
    • SIMULTANEOUS FULL DATA RETRIEVING METHOD FOR DATA BASE
    • JPH086829A
    • 1996-01-12
    • JP13546494
    • 1994-06-17
    • HITACHI LTD
    • TAKAYAMA HIROSHIMIYAZAKI MITSUOMASAI KAZUOYAMASHITA KUNIAKI
    • G06F12/00G06F17/30
    • PURPOSE:To efficiently perform full data retrieval by waiting a retrieval processing for plural following full data retrieval requests until full data retrieval in execution ends, and starting their execution at the same time after the full data retrieval processing ends. CONSTITUTION:A retrieval request analysis part 104 analyzes a user's retrieval request inputted from a retrieval request input part 101 and determines a retrieving method for the data base. A request holding control part 107 decides whether or not a table decided as a current object of retrieval at a current new retrieval request is currently in full data retrieval processing and places the request in a wait state when the table is in full data retrieval at another request. After the precedent full data retrieval processing ends, the held retrieval request is started at the same time. A synchronous retrieval control part 108 decides whether or not the table decided as the current object of retrieval is currently in full data retrieval processing in response to a user's retrieval request inputted from the input part 101, sets a current access page in retrieval start position information when so, and starts the full data retrieval processing from the halfway page.
    • 5. 发明专利
    • Data retrieval system
    • 数据检索系统
    • JPS61141035A
    • 1986-06-28
    • JP26275684
    • 1984-12-14
    • Hitachi Ltd
    • GOSHO HIROYUKITAKAYAMA HIROSHI
    • G06F7/24
    • PURPOSE: To process a sort request in descending and ascending orders at a high speed by installing a pointer capable of pointing data in right and left directions between nodes of the same depth on an index of a tree structure.
      CONSTITUTION: The titled system is of an index model having a tree structure, and formed with a route page 1, an index page 2, leaf pages 3W5 and data 7 and 8 of one line on a table, which include a key value. In order to attain the retrieval in descending and ascending orders by such an index, the pointer capable of pointing in both directions is given between nodes on pages having the same depth. Owing to the installation of the pointer, data can be obtained by specifying one index key value, and the result sorted in the ascending or descending order can be obtained with the use of the index having the tree structure.
      COPYRIGHT: (C)1986,JPO&Japio
    • 目的:通过安装指向树结构索引上相同深度的节点之间的左右方向的数据的指针,以高速递减顺序处理排序请求。 标准:标题系统是具有树结构的索引模型,并且形成有一个路由页面1,索引页2,叶子页3-5以及表上的一行的数据7和8,其中包括一个键值 。 为了通过这样的索引以递减顺序获得检索,能够在具有相同深度的页面上的节点之间给出能够指向两个方向的指针。 由于指针的安装,可以通过指定一个索引键值来获得数据,并且可以使用具有树结构的索引获得按升序或降序排序的结果。