会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Digital cable broadcast system, TV receiver, and method
    • 数字有线广播系统,电视接收机和方法
    • US20060026666A1
    • 2006-02-02
    • US11178317
    • 2005-07-12
    • Sang ChaBong Kim
    • Sang ChaBong Kim
    • H04N7/173H04N7/16
    • H04N21/2362H04N5/50H04N7/102H04N21/4345H04N21/4383
    • A digital cable broadcast system includes a broadcast transmitter and a digital cable TV receiver. The TV receiver includes a POD module which receives a generic feature control message from the broadcast transmitter. The generic feature control message includes cable band information identifying a cable band selected by the broadcast transmitter. The POD module generates application protocol data including the cable band information. The TV receiver further includes a host device which parses the cable band information from the application protocol data and tunes to a channel based on the cable band identified by the parsed band information in order to receive a cable broadcast signal from the transmitter.
    • 数字有线广播系统包括广播发射机和数字有线电视接收机。 TV接收机包括从广播发射机接收通用特征控制消息的POD模块。 通用特征控制消息包括标识由广播发射机选择的有线频带的有线频带信息。 POD模块生成包括有线频带信息的应用协议数据。 电视接收机还包括主机设备,其从应用协议数据解析有线频带信息,并且基于由解析频带信息标识的有线频带调谐到频道,以便从发射机接收有线广播信号。
    • 2. 发明申请
    • CACHE-CONSCIOUS CONCURRENCY CONTROL SCHEME FOR DATABASE SYSTEMS
    • 数据库系统的高速缓存控制方案
    • US20080065670A1
    • 2008-03-13
    • US11934986
    • 2007-11-05
    • Sang ChaSangyong HwangKihong KimKeunjoo Kwon
    • Sang ChaSangyong HwangKihong KimKeunjoo Kwon
    • G06F17/30
    • G06F17/30356G06F17/30351Y10S707/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 +树的许多索引结构。
    • 10. 发明申请
    • COMPRESSION SCHEME FOR IMPROVING CACHE BEHAVIOR IN DATABASE SYSTEMS
    • 用于改进数据库系统中的缓存行为的压缩方案
    • US20080033989A1
    • 2008-02-07
    • US11867115
    • 2007-10-04
    • Sang ChaKi-Hong KimKeun-Joo Kwon
    • Sang ChaKi-Hong KimKeun-Joo Kwon
    • G06F17/30
    • G06F17/30321G06F17/30327G06F17/30333Y10S707/99931Y10S707/99932Y10S707/99933Y10S707/99942
    • A scheme for accessing a multi-dimensional index structure resident in main memory to refer to data objects stored in a database is disclosed. To reduce the amount of accessed index data, the scheme compresses a minimum bounding rectangle (“MBR”). The first step to compress the MBR is to represent the MBR relatively to a reference MBR. The relative representation of an MBR (“RMBR”) is coordinates of the MBR represented relative to coordinates of the reference MBR. In addition, quantization may be performed as an additional step for further compression. In this step, the RMBR is quantized using a finite level of quantization chosen from a given set of quantization levels. Alternatively, a proper node size can be chosen to reduce the index search time. The present invention also includes several alternative embodiments of the accessing scheme including whether to eliminate pointer in internal node's entries except the first entry, whether to store a reference MBR in non-root nodes, whether to apply the proposed compression technique by quantization to leaf nodes or not, and whether to place the database in main memory or in disk. Also, the present invention includes an apparatus, a system and a computer readable medium for accomplishing the same scheme as described above.
    • 公开了一种访问存储在主存储器中的多维索引结构以引用存储在数据库中的数据对象的方案。 为了减少访问的索引数据量,该方案压缩最小边界矩形(“MBR”)。 压缩MBR的第一步是相对于参考MBR来表示MBR。 MBR的相对表示(“RMBR”)是相对于参考MBR的坐标表示的MBR的坐标。 此外,可以执行量化作为用于进一步压缩的附加步骤。 在这一步骤中,使用从给定的一组量化级选择的有限的量化量来量化RMBR。 或者,可以选择适当的节点大小以减少索引搜索时间。 本发明还包括访问方案的若干替代实施例,包括是否消除除第一条目之外的内部节点条目中的指针,是否在非根节点中存储引用MBR,是否将所提出的压缩技术通过量化应用于叶节点 是否将数据库放在主内存或磁盘中。 而且,本发明包括用于实现与上述相同方案的装置,系统和计算机可读介质。