会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • COMPRESSION SCHEME FOR IMPROVING CACHE BEHAVIOR IN DATABASE SYSTEMS
    • 用于改进数据库系统中的缓存行为的压缩方案
    • US20120124010A1
    • 2012-05-17
    • US13360483
    • 2012-01-27
    • Sang K. ChaKi-Hong KimKeun-Joo Kwon
    • Sang K. ChaKi-Hong KimKeun-Joo Kwon
    • G06F17/30
    • G06F17/30321G06F17/30327G06F17/30333Y10S707/99931Y10S707/99932Y10S707/99933Y10S707/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.
    • 本文描述的装置和方法可以操作以从存储在存储器中的索引结构中识别包围至少一个最小边界形状的参考最小边界形状。 所述至少一个最小边界形状中的每一个可对应于与所述索引结构的叶节点相关联的数据对象。 所述至少一个最小边界形状的点的坐标可以与一组第一值相关联,以产生所述至少一个最小边界形状的相对表示。 可以相对于参考最小限制形状的参考点的坐标来计算第一值集合,使得该组第一值中的每一个包括少于第二数量的有效位,第二数量的有效位少于表示相关联的第二值的第二数量的有效位 与点的绝对坐标相对应。
    • 8. 发明授权
    • Compression scheme for improving cache behavior in database systems
    • 用于提高数据库系统中缓存行为的压缩方案
    • US07797296B2
    • 2010-09-14
    • US11867115
    • 2007-10-04
    • Sang K. ChaKi-Hong KimKeun-Joo Kwon
    • Sang K. 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,是否将所提出的压缩技术通过量化应用于叶节点 是否将数据库放在主内存或磁盘中。 而且,本发明包括用于实现与上述相同方案的装置,系统和计算机可读介质。
    • 10. 发明申请
    • METHOD OF INSERTING VECTOR INFORMATION FOR ESTIMATING VOICE DATA IN KEY RE-SYNCHRONIZATION PERIOD, METHOD OF TRANSMITTING VECTOR INFORMATION, AND METHOD OF ESTIMATING VOICE DATA IN KEY RE-SYNCHRONIZATION USING VECTOR INFORMATION
    • 在关键重新同步期间插入用于估计语音数据的矢量信息的方法,发送矢量信息的方法以及使用向量信息的关键重新同步估计语音数据的方法
    • US20080112565A1
    • 2008-05-15
    • US11745402
    • 2007-05-07
    • TaekJun NamByeong-Ho AhnKi-Hong KimYongick ChungSang-Yi Yi
    • TaekJun NamByeong-Ho AhnKi-Hong KimYongick ChungSang-Yi Yi
    • H04K1/00
    • G10L19/167
    • Disclosed are a method of inserting vector information for estimating voice data in a key re-synchronization period, a method of transmitting vector information, and a method of estimating voice data in a key re-synchronization period using vector information, capable of estimating the voice data that corresponds to a silent period occurring in a key re-synchronization process when an encrypted digital voice is transmitted in a unidirectional wireless communication environment. A transmitter side inserts accumulation information (i.e., vector information) of a voice change direction of the transmitted previous frame in a key re-synchronization frame, using a voice feature that draws a sine wave, when making the key re-synchronization frame for the re-synchronization, and transmits the key re-synchronization frame with the vector information inserted thereto. A receiver side estimates the voice data value in the key re-synchronization period using the accumulation information (i.e., vector information) in the voice change direction and slopes of the received voice data, to minimize the difference between the original voice and the estimated voice.
    • 公开了一种在密钥重新同步期间插入用于估计语音数据的矢量信息的方法,发送矢量信息的方法以及使用能够估计语音的矢量信息来估计密钥再同步时段中的语音数据的方法 当在单向无线通信环境中发送加密的数字语音时,对应于在密钥重新同步过程中发生的静默时段的数据。 发射机侧在使用绘制正弦波的语音特征时,在密钥再同步帧中插入所发送的前一帧的语音改变方向的累积信息(即矢量信息),当为 重新同步,并且发送具有插入到其中的向量信息的密钥重新同步帧。 接收机侧使用语音改变方向上的累积信息(即,向量信息)和所接收的语音数据的斜率来估计密钥再同步周期中的语音数据值,以最小化原始语音和估计语音之间的差异 。