公开(公告)号：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）设计查询分类组件的方法。 该方法包括确定是否输入用于查询处理的计划树; 如果输入了计划树，则设计查询分类组件以输出各个表的位置，在该表中必须连同计划树引用数据以及相应的谓词; 以及将各个表的位置和相应的谓词传送到相应的存储管理器，并使每个存储管理器处理对应的数据。

公开(公告)号：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对操作进行重新排列。 对每个终端节点计数插入操作次数和删除次数，得到终端节点空闲空间数量的变化，从而预测终端节点的分裂和合并。 重新组织查询的处理顺序，以便基于预测信息来减少节点的变化。