利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

7 条记录 (耗时 0.014 秒)

    METHOD OF DESIGNING QUERY CLASSIFICATION COMPONENT FOR MULTILEVEL DBMS
    1.
    发明申请
    METHOD OF DESIGNING QUERY CLASSIFICATION COMPONENT FOR MULTILEVEL DBMS 审中-公开
    设计用于多数据库的查询分类组件的方法

    公开(公告)号：US20070260579A1

    公开(公告)日：2007-11-08

    申请号：US11554066

    申请日：2006-10-30

    申请人： Hae Young BAE ,  Gyoung Bae KIM ,  Ho Seok KIM ,  Yong Il JANG ,  Byeong Seob YOU ,  Sang Hun EO ,  Dong Wook LEE ,  Seok Kyu JANG

    发明人： Hae Young BAE ,  Gyoung Bae KIM ,  Ho Seok KIM ,  Yong Il JANG ,  Byeong Seob YOU ,  Sang Hun EO ,  Dong Wook LEE ,  Seok Kyu JANG

    IPC分类号： G06F17/30

    CPC分类号： G06F16/24542

    摘要： Disclosed herein is a method of designing a query classificaton component for a multilevel DataBase Management System (DBMS). The method includes determining whether a plan tree, which is used for query processing, is input; if the plan tree is input, designing the query classification component to output locations for respective tables, at which data must be referenced in conjunction with the plan tree, and corresponding predicates; and transferring the locations for respective tables and the corresponding predicates to respective storage managers and causing each of the storage managers to process corresponding data.

    摘要翻译： 本文公开了一种为多级数据库管理系统（DBMS）设计查询分类组件的方法。 该方法包括确定是否输入用于查询处理的计划树; 如果输入了计划树，则设计查询分类组件以输出各个表的位置，在该表中必须连同计划树引用数据以及相应的谓词; 以及将各个表的位置和相应的谓词传送到相应的存储管理器，并使每个存储管理器处理对应的数据。

    System and method for index reorganization using partial index transfer in spatial data warehouse
    2.
    发明授权
    System and method for index reorganization using partial index transfer in spatial data warehouse 有权
    在空间数据仓库中使用部分索引转移的索引重组系统和方法

    公开(公告)号：US07634487B2

    公开(公告)日：2009-12-15

    申请号：US11433258

    申请日：2006-05-12

    申请人： Hae Young Bae ,  Jae Dong Lee ,  Young Hwan Oh ,  Kyoung Bae Kim ,  Myoung Keun Kim ,  Soon Young Park ,  Ho Seok Kim ,  Yong Il Jang ,  Byeong Seob You ,  Sang Hoon Eo ,  Young Cheol Jeong

    发明人： Hae Young Bae ,  Jae Dong Lee ,  Young Hwan Oh ,  Kyoung Bae Kim ,  Myoung Keun Kim ,  Soon Young Park ,  Ho Seok Kim ,  Yong Il Jang ,  Byeong Seob You ,  Sang Hoon Eo ,  Young Cheol Jeong

    IPC分类号： G06F17/00

    CPC分类号： G06F17/30592 ,  G06F17/30333 ,  G06F17/30336 ,  Y10S707/99942

    摘要： The present invention is to provide a system and a method for index reorganization using a partial index transfer in a spatial data warehouse that minimize costs of search, split and readjustment for the index reorganization by organizing and transferring clusters with partial indexes in conformity with an index structure so that the partial indexes can be inserted directly into the existing index, thus ensuring continuous and stable data processes, the index reorganization method comprising: a first step of clustering data extracted from the source database in conformity with an index structure via the builder; a second step of generating partial indexes and transferring the partial indexes to a cluster generated according to the clustering; a third step of recording the transferred partial indexes in physically consecutive spaces, not allocated, in the spatial data warehouse server; and a fourth step of inserting the recorded partial indexes in an existing index.

    摘要翻译： 本发明是提供一种使用在空间数据仓库中部分索引转移的索引重组的系统和方法，其通过组织和转移具有符合索引的部分索引的簇来最小化用于索引重组的搜索，拆分和重新调整的成本 结构，使得部分索引可以直接插入到现有索引中，从而确保连续和稳定的数据处理，索引重组方法包括：通过构建器将从源数据库提取的数据聚类成与索引结构一致的第一步; 产生部分索引并将部分索引传送到根据聚类生成的集群的第二步骤; 在空间数据仓库服务器中记录未分配的物理连续空间中传送的部分索引的第三步骤; 以及在现有索引中插入记录的部分索引的第四步骤。

    Recovery method using extendible hashing-based cluster logs in shared-nothing spatial database cluster
    4.
    发明授权
    Recovery method using extendible hashing-based cluster logs in shared-nothing spatial database cluster 有权
    在无共享空间数据库集群中使用可扩展散列集群日志的恢复方法

    公开(公告)号：US07440977B2

    公开(公告)日：2008-10-21

    申请号：US11157885

    申请日：2005-06-20

    申请人： Hae-Young Bae ,  Jae-Dong Lee ,  Young-Hwan Oh ,  Gyoung-Bae Kim ,  Myoung-Keun Kim ,  Soon-Young Park ,  Ho-Seok Kim ,  Yong-Il Jang

    发明人： Hae-Young Bae ,  Jae-Dong Lee ,  Young-Hwan Oh ,  Gyoung-Bae Kim ,  Myoung-Keun Kim ,  Soon-Young Park ,  Ho-Seok Kim ,  Yong-Il Jang

    IPC分类号： G06F17/30

    CPC分类号： G06F11/1658 ,  G06F11/2048 ,  Y10S707/99931 ,  Y10S707/99953

    摘要： The present invention provides a recovery method using extendible hashing-based cluster logs in a shared-nothing spatial database cluster, which eliminates the duplication of cluster logs required for cluster recovery in a shared-nothing database cluster, so that recovery time is decreased, thus allowing the shared-nothing spatial database cluster system to continuously provide stable service. In the recovery method, if a failure occurs in a predetermined node, a second node in a group, including the node, records cluster logs in main memory on the basis of extendible hashing. If the node that has failed recovers itself using a local log, the second node in the group transmits cluster logs in packets to a recovery node that is the failed node. If the recovery node reflects the received cluster logs and maintains consistency with other nodes in the group, the recovery node resumes normal service.

    摘要翻译： 本发明提供了一种在无共享空间数据库集群中使用可扩展散列集群日志的恢复方法，其消除了在无共享数据库集群中集群恢复所需的集群日志的重复，从而减少了恢复时间 使无共享的空间数据库集群系统不断提供稳定的服务。 在恢复方法中，如果在预定节点中发生故障，则包括该节点在内的组中的第二节点基于可扩展哈希在主存储器中记录集群日志。 如果失败的节点使用本地日志恢复自身，则该组中的第二个节点将分组中的群集日志传输到作为故障节点的恢复节点。 如果恢复节点反映接收的群集日志并维护与组中其他节点的一致性，则恢复节点恢复正常服务。

    LAZY BULK INSERTION METHOD FOR MOVING OBJECT INDEXING
    5.
    发明申请
    LAZY BULK INSERTION METHOD FOR MOVING OBJECT INDEXING 审中-公开
    用于移动目标索引的LAZY BULK插入方法

    公开(公告)号：US20070233720A1

    公开(公告)日：2007-10-04

    申请号：US11611284

    申请日：2006-12-15

    申请人： Hae Young BAE ,  Young Hwan OH ,  Ho Seok KIM ,  Yong Il JANG ,  Byeong Seob YOU ,  Sang Hun EO ,  Dong Wook LEE ,  John Hyeon CHEON

    发明人： Hae Young BAE ,  Young Hwan OH ,  Ho Seok KIM ,  Yong Il JANG ,  Byeong Seob YOU ,  Sang Hun EO ,  Dong Wook LEE ,  John Hyeon CHEON

    IPC分类号： G06F7/00

    CPC分类号： G06F16/2264 ,  G06F16/2246 ,  G06F16/29

    摘要： The present invention relates to a lazy bulk insertion method for moving object indexing, which utilizes a hash-based data structure to overcome the disadvantages of an R-tree, and uses two buffers to simultaneously store operations in the buffers and process queries stored in the buffers, so that the overall update cost can be reduced. In the lazy bulk insertion method, a buffer is substituted and a state of the buffer is changed to a deactivated state if an input query cannot be stored in the buffer. Operations stored in the deactivated buffer are sequentially analyzed, information about objects corresponding to respective operations is obtained from a direct link to analyze the operations, and thus the operations are aligned on the basis of object IDs. Operations, aligned in ascending order of spatial objects, are identified depending on respective objects, effectiveness of the operations is determined, and thus the operations are realigned on the basis of terminal node IDs. The number of insert operations and the number of delete operations are counted for each terminal node, and variation in the number of empty spaces in the terminal node is obtained, thus splitting and merging of the terminal nodes is predicted. A processing sequence of queries is reorganized so as to reduce variation in the node on the basis of the predicted information.

    摘要翻译： 本发明涉及一种用于移动对象索引的延迟批量插入方法，其利用基于散列的数据结构来克服R树的缺点，并且使用两个缓冲器来同时存储缓冲器中的操作和存储在 缓冲区，从而可以降低总体更新成本。 在惰性批量插入方法中，如果输入查询不能存储在缓冲区中，则替换缓冲区，并将缓冲区的状态更改为禁用状态。 顺序地分析存储在去激活缓冲器中的操作，从直接链接获得关于对应于各个操作的对象的信息，以分析操作，因此基于对象ID来对齐操作。 根据各个对象来识别按空间对象的升序排列的操作，确定操作的有效性，并且因此基于终端节点ID对操作进行重新排列。 对每个终端节点计数插入操作次数和删除次数，得到终端节点空闲空间数量的变化，从而预测终端节点的分裂和合并。 重新组织查询的处理顺序，以便基于预测信息来减少节点的变化。

    Recovery method using extendible hashing-based cluster logs in shared-nothing spatial database cluster
    6.
    发明申请
    Recovery method using extendible hashing-based cluster logs in shared-nothing spatial database cluster 有权
    在无共享空间数据库集群中使用可扩展散列集群日志的恢复方法

    公开(公告)号：US20060259525A1

    公开(公告)日：2006-11-16

    申请号：US11157885

    申请日：2005-06-20

    申请人： Hae-Young Bae ,  Jae-Dong Lee ,  Young-Hwan Oh ,  Gyoung-Bae Kim ,  Myoung-Keun Kim ,  Soon-Young Park ,  Ho-Seok Kim ,  Yong-Il Jang

    发明人： Hae-Young Bae ,  Jae-Dong Lee ,  Young-Hwan Oh ,  Gyoung-Bae Kim ,  Myoung-Keun Kim ,  Soon-Young Park ,  Ho-Seok Kim ,  Yong-Il Jang

    IPC分类号： G06F17/30

    CPC分类号： G06F11/1658 ,  G06F11/2048 ,  Y10S707/99931 ,  Y10S707/99953

    摘要： The present invention provides a recovery method using extendible hashing-based cluster logs in a shared-nothing spatial database cluster, which eliminates the duplication of cluster logs required for cluster recovery in a shared-nothing database cluster, so that recovery time is decreased, thus allowing the shared-nothing spatial database cluster system to continuously provide stable service. In the recovery method, if a failure occurs in a predetermined node, a second node in a group, including the node, records cluster logs in main memory on the basis of extendible hashing. If the node that has failed recovers itself using a local log, the second node in the group transmits cluster logs in packets to a recovery node that is the failed node. If the recovery node reflects the received cluster logs and maintains consistency with other nodes in the group, the recovery node resumes normal service.

    摘要翻译： 本发明提供了一种在无共享空间数据库集群中使用可扩展散列集群日志的恢复方法，其消除了在无共享数据库集群中集群恢复所需的集群日志的重复，从而减少了恢复时间 使无共享的空间数据库集群系统不断提供稳定的服务。 在恢复方法中，如果在预定节点中发生故障，则包括该节点在内的组中的第二节点基于可扩展哈希在主存储器中记录集群日志。 如果失败的节点使用本地日志恢复自身，则该组中的第二个节点将分组中的群集日志传输到作为故障节点的恢复节点。 如果恢复节点反映接收的群集日志并维护与组中其他节点的一致性，则恢复节点恢复正常服务。