利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

10 条记录 (耗时 0.044 秒)

    Efficient recovery method for high-dimensional index structure employing reinsert operation
    1.
    发明授权
    Efficient recovery method for high-dimensional index structure employing reinsert operation 有权
    采用重新插入操作的高维索引结构的有效恢复方法

    公开(公告)号：US06631385B2

    公开(公告)日：2003-10-07

    申请号：US09497136

    申请日：2000-02-03

    申请人： Jang Sun Lee ,  June Kim ,  Hun Soon Lee ,  Myung Joon Kim ,  Gil Rok Oh ,  Jae Soo Yoo ,  Seok Il Song

    发明人： Jang Sun Lee ,  June Kim ,  Hun Soon Lee ,  Myung Joon Kim ,  Gil Rok Oh ,  Jae Soo Yoo ,  Seok Il Song

    IPC分类号： G06F1730

    CPC分类号： G06F11/1474 ,  Y10S707/99933 ,  Y10S707/99953

    摘要： A recovery method for a high-dimensional index structure is disclosed, in which a reinsert operation is employed based on ARIES (algorithm for recovery and isolation exploiting semantics) and a page-oriented redo and a logical undo. Further, a recording medium on which a program for carrying out the above method is recorded is disclosed, the program being readable by a computer. The recovery method for a high-dimensional index structure employing a reinsert operation according to the present invention includes the following steps. At a first step, an entry is inserted into a node, a minimum bounding region is adjusted, an overflow is processed, and a log record is stored. At a second step, the log record thus stored is recovered.

    摘要翻译： 公开了一种高维度索引结构的恢复方法，其中基于ARIES（用于恢复和隔离开发语义的算法）和面向页面的重做和逻辑撤销来采用重新插入操作。 此外，公开了记录有用于执行上述方法的程序的记录介质，该程序可由计算机读取。 根据本发明的采用重新插入操作的高维索引结构的恢复方法包括以下步骤。 在第一步，将条目插入节点，调整最小边界区域，处理溢出，并存储日志记录。 在第二步，恢复如此存储的日志记录。

    Concurrency control method for high-dimensional index structure using latch and lock
    2.
    发明授权
    Concurrency control method for high-dimensional index structure using latch and lock 有权
    用于使用锁存和锁定的高维索引结构的并发控制方法

    公开(公告)号：US06484172B1

    公开(公告)日：2002-11-19

    申请号：US09497345

    申请日：2000-02-03

    申请人： Jang Sun Lee ,  Jin Soo Lee ,  Hun Soon Lee ,  Myung Joon Kim ,  Jae Soo Yoo ,  Seok Il Song ,  Seok Hee Lee

    发明人： Jang Sun Lee ,  Jin Soo Lee ,  Hun Soon Lee ,  Myung Joon Kim ,  Jae Soo Yoo ,  Seok Il Song ,  Seok Hee Lee

    IPC分类号： G06F1730

    CPC分类号： G06F17/30327 ,  G06F17/30362 ,  Y10S707/99933 ,  Y10S707/99938

    摘要： A concurrency control method for searching the high-dimensional index tree of a database is disclosed. The concurrency control includes: a) adding a root node to the queue and acquiring the shared lock for reinsertion node; b) determining whether the queue is empty or not, fetching a node from the queue and assigning the fetched node as a current node if queue is not empty, releasing the shared lock and terminating the search process if queue is empty; c) acquiring the shared latch in the current node, selecting the lower nodes which are within the query range and adding the selected nodes to the queue if current node is not leaf or to the result set if current node is leaf; and d) returning to the step b).

    摘要翻译： 公开了一种用于搜索数据库的高维索引树的并发控制方法。 并发控制包括：a）将根节点添加到队列并获取重新插入节点的共享锁; b）确定队列是否为空，如果队列不为空，则从队列中获取节点并将获取的节点分配为当前节点，如果队列为空，则释放共享锁并终止搜索进程; c）获取当前节点中的共享锁存器，选择查询范围内的下级节点，如果当前节点不为叶，则将所选节点添加到队列中，如果当前节点为叶，则将其添加到队列中; 和d）返回步骤b）。

    Efficient concurrency control method for high dimensional index structures
    3.
    发明授权
    Efficient concurrency control method for high dimensional index structures 有权
    高维度索引结构的高效并发控制方法

    公开(公告)号：US06480849B1

    公开(公告)日：2002-11-12

    申请号：US09409814

    申请日：1999-09-30

    申请人： Jang Sun Lee ,  Young-Kee Song ,  Myung-Joon Kim ,  Jae Soo Yoo ,  Seok Il Song

    发明人： Jang Sun Lee ,  Young-Kee Song ,  Myung-Joon Kim ,  Jae Soo Yoo ,  Seok Il Song

    IPC分类号： G06F1730

    CPC分类号： G06F17/30362 ,  G06F17/30592 ,  Y10S707/99938 ,  Y10S707/99953

    摘要： A concurrency control method for a high dimensional index structure that provides efficient concurrency control method for a high dimensional index structure, which performs reinsertion of certain objects to cope with node overflow. The concurrency controlled searching method includes the following steps. First, an entry is obtained from a queue storing the root node and an object relating to the entry is selected. Second, whether a logic sequence number (LSN) of a lower level node is larger than an expected LSN stored in the upper node is determined. Third, the process moves to a neighbor node of the lower level node if the LSN is bigger than an expected LSN stored in the upper node in the second step, selects a relating object, and performs from the second step repeatedly. Fourth, an object of a node of a level corresponding to the lower level node in a reinsertion table is selected when a search on an index tree is finished if the LSN is not bigger than the expected LSN stored in the upper node in the second step.

    摘要翻译： 一种用于高维度索引结构的并发控制方法，为高维度索引结构提供有效的并发控制方法，该方法执行某些对象的重新插入以应对节点溢出。 并发控制搜索方法包括以下步骤。 首先，从存储根节点的队列中获得条目，并且选择与该条目相关的对象。 第二，确定较低级节点的逻辑序列号（LSN）是否大于存储在上级节点中的预期LSN。 第三，如果在第二步中LSN大于存储在上层节点中的预期LSN，则该过程移动到下级节点的邻居节点，选择相关对象，并从第二步重复执行。 第四，当在第二步骤中如果LSN不大于存储在上层节点中的预期LSN的情况下，当索引树上的搜索完成时，选择与重新插入表中的较低级节点相对应的级别的节点的对象 。

    Insertion method in a high-dimensional index structure for content-based image retrieval
    4.
    发明授权
    Insertion method in a high-dimensional index structure for content-based image retrieval 失效
    用于基于内容的图像检索的高维索引结构中的插入方法

    公开(公告)号：US06389424B1

    公开(公告)日：2002-05-14

    申请号：US09429300

    申请日：1999-10-28

    申请人： June Kim ,  Dae Young Hur ,  Jin Soo Lee ,  Jae Soo Yoo ,  Seok Hee Lee

    发明人： June Kim ,  Dae Young Hur ,  Jin Soo Lee ,  Jae Soo Yoo ,  Seok Hee Lee

    IPC分类号： G06F1730

    CPC分类号： G06F17/30256 ,  Y10S707/99942

    摘要： An insertion method in a high-dimensional index structure for a content-based image retrieval is disclosed, in which a desired image can be efficiently searched when there is formed a high-dimensional image database. In the present invention, the basic properties of the CIR tree are utilized, and at the same time, a splitting algorithm having a superior search efficiency over the conventional CIR tree is employed. Further, an effective standard for choosing lower nodes is provided, and a re-insertion algorithm capable of re-inserting based on a weighted center is employed, thereby forming an ECIR (Extended CIR) as a high-dimensional index structure supporting efficient retrieval performance. That is, a splitting algorithm for the branch nodes and the terminal nodes are adopted so as to improve the efficiency when carrying out the search and insertion. The re-insertion objects are chose based on the weighted center when the nodes overflow. According to the present invention, the images can be efficiently searched when an image information containing many feature dimensions is formed into a database.

    摘要翻译： 公开了一种用于基于内容的图像检索的高维索引结构中的插入方法，其中当形成高维图像数据库时可以有效地搜索期望的图像。 在本发明中，利用了CIR树的基本特性，同时采用了比常规CIR树具有更好的搜索效率的分割算法。 此外，提供了用于选择较低节点的有效标准，并且采用能够基于加权中心重新插入的重新插入算法，从而形成作为支持有效检索性能的高维索引结构的ECIR（扩展CIR） 。 也就是说，采用分支节点和终端节点的分割算法，以便在进行搜索和插入时提高效率。 当节点溢出时，基于加权中心选择重新插入对象。 根据本发明，当将包含许多特征维度的图像信息形成数据库时，可以有效地搜索图像。