公开(公告)号：KR1020030013619A

公开(公告)日：2003-02-15

申请号：KR1020010047715

申请日：2001-08-08

Applicant: 한국전자통신연구원

Inventor： 박춘서 ,  김창수 ,  김경배 ,  신범주 ,  유재수 ,  송석일 ,  신재룡

IPC: G06F17/30

Abstract: PURPOSE: A method for inserting and searching data of a parallel higher index structure is provided to search a higher index effectively by transforming a higher index structure which uses a parallel property of a SAN(Storage Area Network) thereby increasing a fan out, reducing a height of a tree, and maximizing a parallel property of an input/output at searching a range in searching a similarity. CONSTITUTION: For performing a partial K-most access query in a main server and all sub servers simultaneously, if a K-access query is entered, all servers access to a root node(1300). It is judged whether the accessed root node is a non-terminal node or not(1301). If the accessed root node is a non-terminal node, all servers calculates a similarity with a query and an entry, and each entry is sorted in a list in order of similarity(1302). All servers access to a child node of the first entry stored in the list in parallel and allocate the current node as a root node(1303), and the current stage is returned to the above stage (1301) for judging a non-terminal node of not of the root node.

Abstract translation: 目的：提供一种用于插入和搜索并行较高索引结构的数据的方法，通过转换使用SAN（存储区域网络）的并行属性的较高索引结构，有效地搜索较高索引，从而增加扇出，减少 在搜索相似度的范围内最大化输入/输出的并行属性。 规定：为了在主服务器和所有子服务器中同时执行部分K最多访问查询，如果输入K访问查询，则所有服务器都访问根节点（1300）。 判断所访问的根节点是否是非终端节点（1301）。 如果所访问的根节点是非终端节点，则所有服务器计算与查询和条目的相似性，并且每个条目按照相似度的顺序排列在列表中（1302）。 所有服务器并行地存储在列表中的第一条目的子节点并分配当前节点作为根节点（1303），并且当前阶段返回到上述阶段（1301），以判断非终端节点 不是根节点。