中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

20 records (took 0.019 seconds)

    고차원 색인구조의 동시성 제어방법
    1.
    发明公开
    고차원 색인구조의 동시성 제어방법 失效
    控制高阶索引结构一致性的方法

    公开(公告)号：KR1020010066737A

    公开(公告)日：2001-07-11

    申请号：KR1020000008238

    申请日：2000-02-21

    Applicant: 한국전자통신연구원

    Inventor： 이장선 ,  이진수 ,  이훈순 ,  김명준 ,  유재수 ,  송석일 ,  이석희

    IPC: G06F17/40

    Abstract: PURPOSE: A method for controlling a consistency of a higher-order index structure is provided to increase the performance of a search by obtaining a latch of a common mode in case that a search operation is performed, thereby preventing a delay from being generated from an insertion to a node or a lock of a deletion operation. CONSTITUTION: A route node is stored in a queue(910). A common lock is obtained(912). It is judged whether the queue is empty(914). In case that the queue isn't empty, a node is picked out from the queue and set as a current node(916). In case that the queue is empty, a lock to a reinsertion node is released. In addition, a search is terminated(938). It is judged whether a level of the current node is lower than a present level(918). A common latch is obtained(928). It is judged whether the current node is a terminal(930). In case that the current node isn't the terminal, child nodes in a range of question are put in(932). The common latch is released(936).

    Abstract translation: 目的：提供一种用于控制高阶索引结构的一致性的方法，用于通过在进行搜索操作的情况下获得共模的锁存来增加搜索的性能，从而防止从 插入节点或锁定的删除操作。 构成：路由节点存储在队列（910）中。 获得公共锁（912）。 判断队列是否空（914）。 如果队列不为空，则从队列中选出一个节点并设置为当前节点（916）。 如果队列为空，则会释放对重新插入节点的锁定。 此外，搜索终止（938）。 判断当前节点的电平是否低于当前电平（918）。 获得一个共同的锁存器（928）。 判断当前节点是否为终端（930）。 在当前节点不是终端的情况下，将问题范围内的子节点放入（932）中。 公共锁存器被释放（936）。

    고차원 색인 구조의 동시성 제어 방법
    2.
    发明公开
    고차원 색인 구조의 동시성 제어 방법 失效
    控制高维索引结构同时性的方法

    公开(公告)号：KR1020000027101A

    公开(公告)日：2000-05-15

    申请号：KR1019980044943

    申请日：1998-10-27

    Applicant: 한국전자통신연구원

    Inventor： 이장선 ,  송영기 ,  김명준 ,  유재수 ,  송석일

    IPC: G06F15/00

    CPC classification number: G06F17/30362 ,  G06F17/30592 ,  Y10S707/99938 ,  Y10S707/99953

    Abstract: PURPOSE: A method for controlling simultaneity of high dimensional index structure is provided to perform a search of a high accuracy to objects removed for a reinsertion by performing the reinsertion to a part of object located in a node when overflowing occurred by an excess of a node capacitance. CONSTITUTION: A most suitable terminal node is searched for inserting an object(601). It is judged whether an object(e) is capable of inserting into the searched node(602). The object(e) is inserted into the searched node when the object(e) is capable of inserting into the searched node(603). A minimum boundary region is adjusted and then all process is completed(604). A node overflow is processed when the object(e) is not capable of inserting into the searched node and then all process is completed(605).

    Abstract translation: 目的：提供一种用于控制高维度索引结构同时性的方法，以便通过在超出节点发生溢出时对位于节点中的对象的一部分执行重新插入，以高精度地搜索被重新插入的对象 电容。 构成：搜索最合适的终端节点插入对象（601）。 判断对象（e）是否能够插入到搜索到的节点（602）中。 当对象（e）能够插入到搜索到的节点（603）中时，对象（e）被插入到所搜索的节点中。 调整最小边界区域，然后完成所有过程（604）。 当对象（e）不能插入搜索到的节点，然后所有进程完成（605）时，处理节点溢出。

    재삽입 연산을 수행하는 고차원 색인구조를 위한 회복방법
    9.
    发明授权
    재삽입 연산을 수행하는 고차원 색인구조를 위한 회복방법 有权
    有效恢复使用REINSERT操作的高维索引结构的恢复方法

    公开(公告)号：KR100327122B1

    公开(公告)日：2002-03-13

    申请号：KR1019990061940

    申请日：1999-12-24

    Applicant: 한국전자통신연구원

    Inventor： 이장선 ,  김준 ,  이훈순 ,  김명준 ,  오길록 ,  유재수 ,  송석일

    IPC: G06F7/00

    CPC classification number: G06F11/1474 ,  Y10S707/99933 ,  Y10S707/99953

    Abstract: 본발명은재삽입연산을수행하는고차원색인구조를위한회복방법과상기방법을실현시키기위한프로그램을기록한컴퓨터로읽을수 있는기록매체에관한것으로, 'ARIES'(Algorithm for Recovery and Isolation Exploiting Semantics)에기반하고, 페이지지향재시행및 페이지지향복귀를기본으로하여, 재삽입연산시효율적인회복을보장하는재삽입연산을수행하는고차원색인구조를위한회복방법과상기방법을실현시키기위한프로그램을기록한컴퓨터로읽을수 있는기록매체를제공하기위하여, 노드에엔트리를삽입하고, 최소경계영역을조정하고, 넘침을처리를하며, 해당하는로그레코드를저장하는제 1 단계; 및상기저장된로그레코드를회복시키는제 2 단계를포함하며, 고차원색인구조회복장치등에이용됨.

    로컬버스 콘트롤 서브 유니트
    10.
    发明授权
    로컬버스 콘트롤 서브 유니트 失效
    本地总线控制子

    公开(公告)号：KR1019920002667B1

    公开(公告)日：1992-03-31

    申请号：KR1019890019505

    申请日：1989-12-26

    Applicant: 한국전자통신연구원

    Inventor： 이규호 ,  이장선

    IPC: G06F13/00

    Abstract: The sub-unit includes a local memory (1) consisting of a ROM, RAM, RTC (real time clocks) and a plurality of registers. Data latches (2a)(2b)(2c)(2d) separate addresses and data signals, and a space decoder (4) discriminates transaction call regions. A local decoder (5) outputs signals to select the respective devices of the local memory (1), and a controller (3) executes a next step when reading/writing transactions are carried out. The signal transmissions between the system bus and the local bus are rendered more efficient, because of the simplicity of the constitution.

    Abstract translation: 子单元包括由ROM，RAM，RTC（实时时钟）和多个寄存器组成的本地存储器（1）。 数据锁存器（2a）（2b）（2c）（2d）分离地址和数据信号，并且空间解码器（4）区分交易呼叫区域。 本地解码器（5）输出信号以选择本地存储器（1）的相应设备，并且当执行读/写交易时，控制器（3）执行下一步骤。 由于构造的简单性，系统总线和本地总线之间的信号传输变得更有效率。

Patent Agency Ranking