公开(公告)号：US07293028B2

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

申请号：US10162731

申请日：2002-06-04

申请人： Sang K. Cha ,  Sangyong Hwang ,  Kihong Kim ,  Keunjoo Kwon

发明人： Sang K. Cha ,  Sangyong Hwang ,  Kihong Kim ,  Keunjoo Kwon

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30356 ,  G06F17/30351 ,  Y10S707/99933

摘要： An optimistic, latch-free index traversal (“OLFIT”) concurrency control scheme is disclosed for an index structure for managing a database system. In each node of an index tree, the OLFIT scheme maintains a latch, a version number, and a link to the next node at the same level of the index tree. Index traversal involves consistent node read operations starting from the root. To ensure the consistency of node read operations without latching, every node update operation first obtains a latch and increments the version number after update of the node contents. Every node read operation begins with reading the version number into a register and ends with verifying if the current version number is consistent with the register-stored version number. If they are the same, the read operation is consistent. Otherwise, the node read is retried until the verification succeeds. The concurrency control scheme of the present invention is applicable to many index structures such as the B+-tree and the CSB+-tree.

摘要翻译： 公开了一种用于管理数据库系统的索引结构的乐观，无锁定索引遍历（“OLFIT”）并发控制方案。 在索引树的每个节点中，OLFIT方案维护锁存器，版本号和到索引树的同一级别的下一个节点的链接。 索引遍历涉及从根开始的一致的节点读取操作。 为了确保节点读取操作的一致性，无需锁存，每个节点更新操作首先获取锁存器，并在更新节点内容后增加版本号。 每个节点读取操作都从读取寄存器中的版本号开始，并结束验证当前版本号是否与寄存器存储的版本号一致。 如果它们相同，则读取操作是一致的。 否则，重新尝试节点读取，直到验证成功。 本发明的并发控制方案适用于诸如B +树和CSB +树的许多索引结构。

公开(公告)号：US09454560B2

公开(公告)日：2016-09-27

申请号：US11934986

申请日：2007-11-05

申请人： Sang K. Cha ,  Sangyong Hwang ,  Kihong Kim ,  Keunjoo Kwon

发明人： Sang K. Cha ,  Sangyong Hwang ,  Kihong Kim ,  Keunjoo Kwon

IPC分类号： G06F17/30

CPC分类号： G06F17/30356 ,  G06F17/30351 ,  Y10S707/99933

摘要： An optimistic, latch-free index traversal (“OLFIT”) concurrency control scheme is disclosed for an index structure for managing a database system. In each node of an index tree, the OLFIT scheme maintains a latch, a version number, and a link to the next node at the same level of the index tree. Index traversal involves consistent node read operations starting from the root. To ensure the consistency of node read operations without latching, every node update operation first obtains a latch and increments the version number after update of the node contents. Every node read operation begins with reading the version number into a register and ends with verifying if the current version number is consistent with the register-stored version number. If they are the same, the read operation is consistent. Otherwise, the node read is retried until the verification succeeds. The concurrency control scheme of the present invention is applicable to many index structures such as the B+-tree and the CSB+-tree.

摘要翻译： 公开了一种用于管理数据库系统的索引结构的乐观，无锁定索引遍历（“OLFIT”）并发控制方案。 在索引树的每个节点中，OLFIT方案维护锁存器，版本号和到索引树的同一级别的下一个节点的链接。 索引遍历涉及从根开始的一致的节点读取操作。 为了确保节点读取操作的一致性，无需锁存，每个节点更新操作首先获取锁存器，并在更新节点内容后增加版本号。 每个节点读取操作都从读取寄存器中的版本号开始，并结束验证当前版本号是否与寄存器存储的版本号一致。 如果它们相同，则读取操作是一致的。 否则，重新尝试节点读取，直到验证成功。 本发明的并发控制方案适用于诸如B +树和CSB +树的许多索引结构。

公开(公告)号：US20080065670A1

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

申请号：US11934986

申请日：2007-11-05

申请人： Sang Cha ,  Sangyong Hwang ,  Kihong Kim ,  Keunjoo Kwon

发明人： Sang Cha ,  Sangyong Hwang ,  Kihong Kim ,  Keunjoo Kwon

IPC分类号： G06F17/30

CPC分类号： G06F17/30356 ,  G06F17/30351 ,  Y10S707/99933

摘要： An optimistic, latch-free index traversal (“OLFIT”) concurrency control scheme is disclosed for an index structure for managing a database system. In each node of an index tree, the OLFIT scheme maintains a latch, a version number, and a link to the next node at the same level of the index tree. Index traversal involves consistent node read operations starting from the root. To ensure the consistency of node read operations without latching, every node update operation first obtains a latch and increments the version number after update of the node contents. Every node read operation begins with reading the version number into a register and ends with verifying if the current version number is consistent with the register-stored version number. If they are the same, the read operation is consistent. Otherwise, the node read is retried until the verification succeeds. The concurrency control scheme of the present invention is applicable to many index structures such as the B+-tree and the CSB+-tree.

摘要翻译： 公开了一种用于管理数据库系统的索引结构的乐观，无锁定索引遍历（“OLFIT”）并发控制方案。 在索引树的每个节点中，OLFIT方案维护锁存器，版本号和到索引树的同一级别的下一个节点的链接。 索引遍历涉及从根开始的一致的节点读取操作。 为了确保节点读取操作的一致性，无需锁存，每个节点更新操作首先获取锁存器，并在更新节点内容后增加版本号。 每个节点读取操作都从读取寄存器中的版本号开始，并结束验证当前版本号是否与寄存器存储的版本号一致。 如果它们相同，则读取操作是一致的。 否则，重新尝试节点读取，直到验证成功。 本发明的并发控制方案适用于诸如B +树和CSB +树的许多索引结构。

公开(公告)号：US20140081930A1

公开(公告)日：2014-03-20

申请号：US14083209

申请日：2013-11-18

申请人： Sang K. Cha ,  Kihong Kim ,  Keun-Joo Kwon

发明人： Sang K. Cha ,  Kihong Kim ,  Keun-Joo Kwon

IPC分类号： G06F17/30

CPC分类号： G06F17/30321 ,  G06F17/30327 ,  G06F17/30333 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99942

摘要： The apparatuses and methods described herein may operate to identify, from an index structure stored in memory, a reference minimum bounding shape that encloses at least one minimum bounding shape. Each of the at least one minimum bounding shape may correspond to a data object associated with a leaf node of the index structure. Coordinates of a point of the at least one minimum bounding shape may be associated with a set of first values to produce a relative representation of the at least one minimum bounding shape. The set of first values may be calculated relative to coordinates of a reference point of the reference minimum bounding shape such that each of the set of first values comprises a first number of significant bits fewer than a second number of significant bits representing a second value associated with a corresponding one of absolute coordinates of the point.

摘要翻译： 本文描述的装置和方法可以操作以从存储在存储器中的索引结构中识别包围至少一个最小边界形状的参考最小边界形状。 所述至少一个最小边界形状中的每一个可对应于与所述索引结构的叶节点相关联的数据对象。 所述至少一个最小边界形状的点的坐标可以与一组第一值相关联，以产生所述至少一个最小边界形状的相对表示。 可以相对于参考最小限制形状的参考点的坐标来计算第一值集合，使得该组第一值中的每一个包括少于第二数量的有效位，第二数量的有效位少于表示相关联的第二值的第二数量的有效位 与点的绝对坐标相对应。

公开(公告)号：US08121987B2

公开(公告)日：2012-02-21

申请号：US12847475

申请日：2010-07-30

申请人： Sang K. Cha ,  Kihong Kim ,  Keun-Joo Kwon

发明人： Sang K. Cha ,  Kihong Kim ,  Keun-Joo Kwon

IPC分类号： G06F17/00

CPC分类号： G06F17/30321 ,  G06F17/30327 ,  G06F17/30333 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99942

摘要： A scheme for accessing an index structure using a reference minimum bounding shape is disclosed. In one example embodiment, a reference minimum bounding shape that encloses two or more minimum bounding shapes may be identified from an index structure stored in memory. Each of the two or more minimum bounding shapes may correspond to a data object associated with a corresponding leaf node of the index structure. In one example embodiment, the index structure may be accessed using the reference minimum bounding shape. In one example embodiment, at least one minimum bounding shape of the two or more minimum bounding shapes may be represented in a relative representation calculated relative to the reference minimum bounding shape. Also disclosed are a method, a system and a non-transitory computer-readable storage medium for accomplishing the same scheme as described above.

摘要翻译： 公开了一种使用参考最小边界形状访问索引结构的方案。 在一个示例实施例中，可以从存储在存储器中的索引结构来识别包围两个或更多个最小边界形状的参考最小边界形状。 两个或更多个最小边界形状中的每一个可以对应于与索引结构的相应叶节点相关联的数据对象。 在一个示例实施例中，索引结构可以使用参考最小边界形状来访问。 在一个示例性实施例中，可以以相对于参考最小边界形状计算的相对表示来表示两个或更多个最小边界形状的至少一个最小边界形状。 还公开了用于实现如上所述的相同方案的方法，系统和非暂时的计算机可读存储介质。

公开(公告)号：US07305421B2

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

申请号：US10195822

申请日：2002-07-15

申请人： Sang K. Cha ,  Juchang Lee ,  Kihong Kim

发明人： Sang K. Cha ,  Juchang Lee ,  Kihong Kim

IPC分类号： G06F17/30

CPC分类号： G06F11/2094 ,  G06F11/1471 ,  G06F11/1662 ,  G06F2201/80 ,  Y10S707/99933 ,  Y10S707/99953

摘要： A parallel logging and recovery scheme for highly available main-memory database systems is presented. A preferred embodiment called parallel redo-only logging (“PROL”) combines physical logging and selective replay of redo-only log records. During physical logging, log records are generated with an update sequence number representing the sequence of database update. The log records are replayed selectively during recovery based on the update sequence number. Since the order of replaying log records doesn't matter in physical logging, PROL makes parallel operations possible. Since the physical logging does not depend on the state of the object to which the log records are applied, the present invention also makes it easy to construct a log-based hot standby system.

摘要翻译： 提出了一种用于高可用性主内存数据库系统的并行日志记录和恢复方案。 称为并行重做日志记录（“PROL”）的优选实施例组合物理记录和仅重做日志记录的选择性重放。 在物理日志记录期间，生成日志记录，其中更新序列号表示数据库更新的顺序。 基于更新序列号在恢复期间有选择地重播日志记录。 由于重放日志记录的顺序在物理日志记录中无关紧要，因此PROL使并行操作成为可能。 由于物理日志记录不依赖于应用日志记录的对象的状态，本发明还使得易于构建基于日志的热备用系统。

公开(公告)号：US20120168890A1

公开(公告)日：2012-07-05

申请号：US12984589

申请日：2011-01-04

申请人： Yu Hin Desmond Cheung ,  Kihong Kim ,  Yang Wu

发明人： Yu Hin Desmond Cheung ,  Kihong Kim ,  Yang Wu

IPC分类号： H01L31/05

CPC分类号： H01L27/14629 ,  H01L27/14636

摘要： An image sensor structure, which comprises: a pixel; a first metal line; a second metal line, located under the first metal line; a conductive region, located under the second metal line; and at least one dummy contact, provided between the second metal line and the conductive region, wherein the second metal line and the conductive region are not electrically connected to each other via the dummy contact

摘要翻译： 一种图像传感器结构，包括：像素; 第一条金属线 位于第一金属线下方的第二金属线; 位于所述第二金属线下方的导电区域; 以及设置在所述第二金属线和所述导电区之间的至少一个虚拟触点，其中所述第二金属线和所述导电区经由所述虚拟触点彼此不电连接

公开(公告)号：US07528751B2

公开(公告)日：2009-05-05

申请号：US11778557

申请日：2007-07-16

申请人： Jongmin Park ,  Taejoong Song ,  Kyutae Lim ,  Chang-Ho Lee ,  Jeongsuk Lee ,  Kihong Kim ,  Seongsoo Lee ,  Haksun Kim ,  Joy Laskar

发明人： Jongmin Park ,  Taejoong Song ,  Kyutae Lim ,  Chang-Ho Lee ,  Jeongsuk Lee ,  Kihong Kim ,  Seongsoo Lee ,  Haksun Kim ,  Joy Laskar

IPC分类号： H03M1/00

CPC分类号： H04B17/382

摘要： Embodiments of the invention may provide for a long delay generator for the spectrum sensing of cognitive radio systems. The long delay generator may include an Analog-to-Digital Converter (ADC), memory element, and Digital-to-Analog Converter (DAC). The memory element may utilize shift register bank or Random-Access Memory (RAM) cells. The long delay generator may provide for a selectable delay by digitizing the received signal, delaying the received signal in the digital domain, and reconstructing the delayed signal as an analog. The analog delayed signal may then be compared or otherwise correlated with the original input signal using an analog auto-correlation technique to determine whether a meaningful signal type has been identified or otherwise detected.

摘要翻译： 本发明的实施例可以提供用于认知无线电系统的频谱感测的长延迟发生器。 长延迟发生器可以包括模数转换器（ADC），存储器元件和数模转换器（DAC）。 存储器元件可以利用移位寄存器组或随机存取存储器（RAM）单元。 长延迟发生器可以通过数字化接收的信号，延迟数字域中的接收信号，并将延迟的信号重建为模拟来提供可选择的延迟。 然后可以使用模拟自相关技术将模拟延迟信号与原始输入信号进行比较或相关，以确定是否已识别或以其他方式检测到有意义的信号类型。

公开(公告)号：US06819914B2

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

申请号：US10072374

申请日：2002-02-07

申请人： Kelvin Kai Tuan Yan ,  Kihong Kim ,  Luke Joseph

发明人： Kelvin Kai Tuan Yan ,  Kihong Kim ,  Luke Joseph

IPC分类号： H04B126

CPC分类号： H04B1/28 ,  H03D7/145 ,  H03D7/1458 ,  H03D7/165 ,  H03D2200/0025 ,  H03G1/0088

摘要： A differential RF input signal drives the plus and minus terminals of a center tapped primary winding, which couples the differential RF input signal to the plus and minus terminals of a center tapped secondary winding. From the secondary winding, the coupled, differential RF signal drives a double-balanced mixer core operating in response to a differential local oscillator signal. The output of the mixer core is a differential IF signal representative of the differential RF input signal down-converted at the local oscillator frequency. A step reduction in gain associated with the RF input signal may be implemented using bypass circuitry coupled across the primary of the transformer, wherein a relatively small resistance or impedance is coupled across the primary to effectively reduce the load of the differential amplifiers driving the primary.

摘要翻译： 差分RF输入信号驱动中心抽头初级绕组的正负端子，将初级绕组的差分RF输入信号耦合到中心抽头次级绕组的正负端子。 从次级绕组，耦合的差分RF信号驱动响应于差分本地振荡器信号而工作的双平衡混频器核。 混频器内核的输出是表示以本地振荡器频率下变频的差分RF输入信号的差分IF信号。 与RF输入信号相关联的增益的阶跃降低可以使用跨越变压器的初级绕组耦合的旁路电路来实现，其中相对较小的电阻或阻抗跨越初级耦合，以有效地减小驱动初级的差分放大器的负载。

公开(公告)号：US06623268B2

公开(公告)日：2003-09-23

申请号：US09942151

申请日：2001-08-29

申请人： George B. Diamond ,  Ralph H. Helmrich ,  Kihong Kim ,  Chung Han Kim

发明人： George B. Diamond ,  Ralph H. Helmrich ,  Kihong Kim ,  Chung Han Kim

IPC分类号： F23D1100

CPC分类号： F23D14/28

摘要： A butane fuel supply container for a cooking stove, the container has a thin side wall held rigid by the vapor pressure of the fuel, but the side wall can be finger deformed when the can has been depressurized or hand crushed with the exit valve of the container open, the vapor therein being expelled as the container is deformed or crushed. The vapor tube has a vapor entrance in the vapor pocket above the pool of liquid fuel when the container is correctly oriented in the stove. The vapor tube passes vapor through a valve at the dome of the container.