公开(公告)号：US08458129B2

公开(公告)日：2013-06-04

申请号：US12144486

申请日：2008-06-23

Applicant: Kapil Surlaker ,  Ravi Krishnamurthy ,  Krishnan Meiyyappan ,  Alan Beck ,  Hung Tran ,  Jeremy Branscome ,  Joseph I. Chamdani

Inventor： Kapil Surlaker ,  Ravi Krishnamurthy ,  Krishnan Meiyyappan ,  Alan Beck ,  Hung Tran ,  Jeremy Branscome ,  Joseph I. Chamdani

IPC: G06F7/00

CPC classification number: G06F17/30356 ,  G06F17/30551

Abstract: Embodiments of the present invention provide fine grain concurrency control for transactions in the presence of database updates. During operations, each transaction is assigned a snapshot version number or SVN. A SVN refers to a historical snapshot of the database that can be created periodically or on demand. Transactions are thus tied to a particular SVN, such as, when the transaction was created. Queries belonging to the transactions can access data that is consistent as of a point in time, for example, corresponding to the latest SVN when the transaction was created. At various times, data from the database stored in a memory can be updated using the snapshot data corresponding to a SVN. When a transaction is committed, a snapshot of the database with a new SVN is created based on the data modified by the transaction and the snapshot is synchronized to the memory. When a transaction query requires data from a version of the database corresponding to a SVN, the data in the memory may be synchronized with the snapshot data corresponding to that SVN.

Abstract translation: 在存在数据库更新的情况下，本发明的实施例为事务提供细粒度并行性控制。 在操作期间，为每个事务分配一个快照版本号或SVN。 SVN是指可以定期或按需创建的数据库的历史快照。 因此，事务与特定的SVN相关联，例如，当事务被创建时。 属于事务的查询可以访问一个时间点一致的数据，例如对应于创建事务时的最新SVN。 在不同时间，可以使用对应于SVN的快照数据来更新存储在存储器中的数据库的数据。 提交事务时，将根据事务修改的数据创建具有新SVN的数据库快照，并将快照与内存同步。 当事务查询需要来自与SVN对应的数据库的版本的数据时，存储器中的数据可以与对应于该SVN的快照数据同步。

公开(公告)号：US20100005077A1

公开(公告)日：2010-01-07

申请号：US12168821

申请日：2008-07-07

Applicant: Ravi Krishnamurthy ,  Chi-Young Ku ,  James Shau ,  Chun Zhang ,  Kapil Surlaker ,  Jeremy Branscome ,  Michael Corwin ,  Joseph I. Chamdani

Inventor： Ravi Krishnamurthy ,  Chi-Young Ku ,  James Shau ,  Chun Zhang ,  Kapil Surlaker ,  Jeremy Branscome ,  Michael Corwin ,  Joseph I. Chamdani

IPC: G06F17/30

CPC classification number: G06F16/24542

Abstract: Embodiments of the present invention generate and optimize query plans that are at least partially executable in hardware. Upon receiving a query, the query is rewritten and optimized with a bias for hardware execution of fragments of the query. A template-based algorithm may be employed for transforming a query into fragments and then into query tasks. The various query tasks can then be routed to either a hardware accelerator, a software module, or sent back to a database management system for execution. For those tasks routed to the hardware accelerator, the query tasks are compiled into machine code database instructions. In order to optimize query execution, query tasks may be broken into subtasks, rearranged based on available resources of the hardware, pipelined, or branched conditionally

Abstract translation: 本发明的实施例生成和优化在硬件中至少部分可执行的查询计划。 在接收到查询后，查询将被重写和优化，以便查询的片段的硬件执行偏差。 可以采用基于模板的算法将查询转换成片段，然后转换为查询任务。 然后可以将各种查询任务路由到硬件加速器，软件模块，或者发送回数据库管理系统以执行。 对于路由到硬件加速器的任务，将查询任务编译为机器码数据库指令。 为了优化查询执行，查询任务可能被分解为子任务，根据硬件的可用资源，流水线或有条件的分支进行重新排列

公开(公告)号：US20090319550A1

公开(公告)日：2009-12-24

申请号：US12144303

申请日：2008-06-23

Applicant: James Shau ,  Krishnan Meiyyappan ,  Hung Tran ,  Ravi Krishnamurthy ,  Kapil Surlaker ,  Jeremy Branscome ,  Joseph I. Chamdani

Inventor： James Shau ,  Krishnan Meiyyappan ,  Hung Tran ,  Ravi Krishnamurthy ,  Kapil Surlaker ,  Jeremy Branscome ,  Joseph I. Chamdani

IPC: G06F17/30

CPC classification number: G06F17/30595

Abstract: Embodiments of the present invention provide for batch and incremental loading of data into a database. In the present invention, the loader infrastructure utilizes machine code database instructions and hardware acceleration to parallelize the load operations with the I/O operations. A large, hardware accelerator memory is used as staging cache for the load process. The load process also comprises an index profiling phase that enables balanced partitioning of the created indexes to allow for pipelined load. The online incremental loading process may also be performed while serving queries.

Abstract translation: 本发明的实施例提供数据批量和增量加载到数据库中。 在本发明中，装载机基础设施利用机器码数据库指令和硬件加速来将加载操作与I / O操作并行化。 大型的硬件加速器内存用作加载进程的分段缓存。 加载过程还包括一个索引分析阶段，可以对所创建的索引进行平衡分区，以允许流水线负载。 在提供查询时也可以执行在线增量加载过程。

公开(公告)号：US06917719B2

公开(公告)日：2005-07-12

申请号：US10317697

申请日：2002-12-12

Applicant: Ravi Krishnamurthy ,  Sriram Sethuraman ,  Ya-Qin Zhang

Inventor： Ravi Krishnamurthy ,  Sriram Sethuraman ,  Ya-Qin Zhang

IPC: G06T9/00 ,  H04N7/26 ,  H04N7/34 ,  H04N7/50 ,  G06K9/36 ,  H04N7/14

CPC classification number: H04N19/85 ,  H04N19/126 ,  H04N19/149 ,  H04N19/156 ,  H04N19/162 ,  H04N19/17 ,  H04N19/186 ,  H04N19/46 ,  H04N19/523 ,  H04N19/55 ,  H04N19/593 ,  H04N19/61

Abstract: Apparatus and method for classifying regions of an image, based on the relative “importance” of the various areas and to adaptively use the importance information to allocate processing resources and input image formation.

Abstract translation: 基于各个区域的相对“重要性”对图像区域进行分类的装置和方法，并且自适应地使用重要性信息来分配处理资源并输入图像形成。

公开(公告)号：US06434196B1

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

申请号：US09285582

申请日：1999-04-02

Applicant: Sriram Sethuraman ,  Tihao Chiang ,  Xudong Song ,  Ravi Krishnamurthy ,  Paul Hatrack ,  Ya-Qin Zhang

Inventor： Sriram Sethuraman ,  Tihao Chiang ,  Xudong Song ,  Ravi Krishnamurthy ,  Paul Hatrack ,  Ya-Qin Zhang

IPC: H04B166

CPC classification number: H04N19/53 ,  H04N19/107 ,  H04N19/114 ,  H04N19/115 ,  H04N19/13 ,  H04N19/14 ,  H04N19/146 ,  H04N19/147 ,  H04N19/152 ,  H04N19/172 ,  H04N19/176 ,  H04N19/177 ,  H04N19/182 ,  H04N19/186 ,  H04N19/42 ,  H04N19/61 ,  H04N19/91

Abstract: A method and apparatus for encoding, illustratively, a video information stream to produce an encoded information stream according to a group of frames (GOF) information structure where the GOF structure and, optionally, a bit budget are modified in response to, respectively, information discontinuities and the presence of redundant information in the video information stream (due to, e.g., 3:2 pull-down processing).

Abstract translation: 一种用于编码视频信息流以根据一组帧（GOF）信息结构编码视频信息流的方法和装置，其中GOF结构和可选地，位预算分别响应于信息被修改 视频信息流中的不连续性和冗余信息的存在（由于例如3：2下拉处理）。

公开(公告)号：US06304295B1

公开(公告)日：2001-10-16

申请号：US09227520

申请日：1999-01-08

Applicant: Ravi Krishnamurthy ,  Sriram Sethuraman

Inventor： Ravi Krishnamurthy ,  Sriram Sethuraman

IPC: H04N712

CPC classification number: H04N19/69 ,  H04N19/107 ,  H04N19/126 ,  H04N19/132 ,  H04N19/149 ,  H04N19/15 ,  H04N19/152 ,  H04N19/154 ,  H04N19/162 ,  H04N19/17 ,  H04N19/176 ,  H04N19/192 ,  H04N19/196 ,  H04N19/198 ,  H04N19/30 ,  H04N19/503 ,  H04N19/523 ,  H04N19/587 ,  H04N19/60 ,  H04N19/61 ,  H04N19/65 ,  H04N19/66 ,  H04N19/68 ,  H04N19/895

Abstract: Frames in a video sequence are divided into two or more regions and a specified number of macroblocks are selected in each region for intra-coding. Depending on the particular implementation, for one or more of the regions, the intra-macroblocks are selected randomly, while at least one other region is dividing into a specified number of slices with the least-recently intra-coded macroblock in each slice selected for intra-coding. When an error is detected at the decoder, the decoder discards data in the corresponding packet and applies a concealment strategy that involves using motion-compensated data if the motion vectors were accurately decoded; otherwise, using non-motion-compensated reference data for the macroblocks affected by the discarding of data. The refresh strategy of the present invention can be used to provide the resulting encoded bitstream with resilience to transmission errors, while maintaining an acceptable degree of video compression.

Abstract translation: 视频序列中的帧被划分为两个或更多个区域，并且在每个区域中选择指定数量的宏块用于帧内编码。 根据具体的实施方案，对于一个或多个区域，宏块内随机选择，而至少一个其它区域被划分成指定数量的片，每个切片中的最近最近帧内编码的宏块被选择用于 帧内编码。 当在解码器处检测到错误时，解码器丢弃相应分组中的数据，并且如果运动矢量被精确解码，则应用涉及使用运动补偿数据的隐藏策略; 否则，对丢弃数据影响的宏块使用非运动补偿参考数据。 本发明的刷新策略可以用于在维持可接受的视频压缩程度的同时提供所得到的编码比特流对传输错误的弹性。

公开(公告)号：US06256423B1

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

申请号：US09212025

申请日：1998-12-15

Applicant: Ravi Krishnamurthy ,  Sriram Sethuraman

Inventor： Ravi Krishnamurthy ,  Sriram Sethuraman

IPC: G06K936

CPC classification number: H04N19/198 ,  H04N19/126 ,  H04N19/149 ,  H04N19/15 ,  H04N19/152 ,  H04N19/154 ,  H04N19/162 ,  H04N19/17 ,  H04N19/192 ,  H04N19/196 ,  H04N19/30 ,  H04N19/60

Abstract: An image is divided into one or more (e.g., foreground) regions of interest with transition regions defined between each region of interest and the relatively least-important (e.g., background) region. Each region is encoded using a single selected quantization level, where quantizer values can differ between different regions. In general, in order to optimize video quality while still meeting target bit allocations, the quantizer assigned to a region of interest is preferably lower than the quantizer assigned to the corresponding transition region, which is itself preferably lower than the quantizer assigned to the background region. The present invention can be implemented iteratively to adjust the quantizer values as needed to meet the frame's specified bit target. The present invention can also be implemented using a non-iterative scheme that can be more easily implemented in real time. The present invention enables a video compression algorithm to meet a frame-level bit target, while ensuring spatial and temporal smoothness in frame quality, thus resulting in improved visual perception during playback.

Abstract translation: 图像被划分为感兴趣的一个或多个（例如，前景）区域，其中在每个感兴趣区域和相对最不重要的（例如，背景）区域之间定义过渡区域。 使用单个选择的量化级别对每个区域进行编码，其中量化器值在不同区域之间可以不同。 通常，为了在仍然满足目标比特分配的情况下优化视频质量，分配给感兴趣区域的量化器优选地低于分配给相应过渡区域的量化器，其本身优选地低于分配给背景区域的量化器 。 可以迭代地实现本发明以根据需要调整量化器值以满足帧的指定比特目标。 本发明也可以使用可以更容易实时实现的非迭代方案来实现。 本发明使得视频压缩算法能够在确保帧质量的空间和时间平滑性的同时满足帧级比特目标，从而导致在回放期间改善的视觉感知。

公开(公告)号：US6141380A

公开(公告)日：2000-10-31

申请号：US196821

申请日：1998-11-20

Applicant: Ravi Krishnamurthy ,  Sriram Sethuraman

Inventor： Ravi Krishnamurthy ,  Sriram Sethuraman

IPC: H04N5/92 ,  G06T9/00 ,  H04N7/15 ,  H04N7/24 ,  H04N19/00 ,  H04N19/895 ,  H04N21/4402 ,  H04N7/50

CPC classification number: H04N19/69 ,  H04N19/107 ,  H04N19/126 ,  H04N19/132 ,  H04N19/149 ,  H04N19/15 ,  H04N19/152 ,  H04N19/154 ,  H04N19/162 ,  H04N19/17 ,  H04N19/176 ,  H04N19/192 ,  H04N19/196 ,  H04N19/198 ,  H04N19/30 ,  H04N19/503 ,  H04N19/523 ,  H04N19/587 ,  H04N19/60 ,  H04N19/61 ,  H04N19/66 ,  H04N19/68 ,  H04N19/895

Abstract: The algorithm assumes a constant bit rate over a timing window of specified duration (e.g., a specified number of consecutive frames), where the current frame to be encoded lies in the interior of the timing window. A target bit rate for the current frame is initially selected by calculating the number of bits already used to encode other frames within the window and then assuming that the remaining available bits allocated to the timing window will be evenly distributed to the remaining unencoded frames in the timing window. The target bit rate may then be optionally adjusted based on scene content, encoder state, and buffer considerations. Through a combination of target bit allocation and frame skipping, spatial and temporal resolutions are maintained within acceptable ranges while meeting buffer delay constraints. The algorithm has also been extended to include PB frames in addition to P-only coders.

Abstract translation: 该算法假设在指定持续时间的定时窗口（例如，指定数量的连续帧）上的恒定比特率，其中当前被编码的帧位于定时窗口的内部。 最初通过计算已经用于编码窗口内的其他帧的比特数来选择当前帧的目标比特率，然后假设分配给定时窗口的剩余可用比特将被均匀地分配给剩余的未编码帧 定时窗口 然后可以基于场景内容，编码器状态和缓冲器考虑来可选地调整目标比特率。 通过目标比特分配和跳帧的组合，空间和时间分辨率保持在可接受的范围内，同时满足缓冲器延迟约束。 除了仅P编码器之外，该算法还被扩展到包括PB帧。

公开(公告)号：US20110099155A1

公开(公告)日：2011-04-28

申请号：US12984284

申请日：2011-01-04

Applicant: James Shau ,  Krishnan Meiyyappan ,  Hung Tran ,  Ravi Krishnamurthy ,  Kapil Surlaker ,  Jeremy Branscome ,  Joseph I. Chamdani

Inventor： James Shau ,  Krishnan Meiyyappan ,  Hung Tran ,  Ravi Krishnamurthy ,  Kapil Surlaker ,  Jeremy Branscome ,  Joseph I. Chamdani

IPC: G06F17/30

CPC classification number: G06F17/30595

Abstract: Embodiments of the present invention provide for batch and incremental loading of data into a database. In the present invention, the loader infrastructure utilizes machine code database instructions and hardware acceleration to parallelize the load operations with the I/O operations. A large, hardware accelerator memory is used as staging cache for the load process. The load process also comprises an index profiling phase that enables balanced partitioning of the created indexes to allow for pipelined load. The online incremental loading process may also be performed while serving queries.

Abstract translation: 本发明的实施例提供数据批量和增量加载到数据库中。 在本发明中，装载机基础设施利用机器码数据库指令和硬件加速来将加载操作与I / O操作并行化。 大型的硬件加速器内存用作加载进程的分段缓存。 加载过程还包括一个索引分析阶段，可以对所创建的索引进行平衡分区，以允许流水线负载。 在提供查询时也可以执行在线增量加载过程。

公开(公告)号：US20090254516A1

公开(公告)日：2009-10-08

申请号：US12099133

申请日：2008-04-07

Applicant: Krishnan Meiyyappan ,  Liuxi Yang ,  Jeremy Branscome ,  Michael Corwin ,  Ravi Krishnamurthy ,  Kapil Surlaker ,  James Shau ,  Joseph I. Chamdani

Inventor： Krishnan Meiyyappan ,  Liuxi Yang ,  Jeremy Branscome ,  Michael Corwin ,  Ravi Krishnamurthy ,  Kapil Surlaker ,  James Shau ,  Joseph I. Chamdani

IPC: G06F7/06 ,  G06F17/30

CPC classification number: G06F17/30442 ,  G06F17/30094 ,  G06F17/30315 ,  G06F17/30492 ,  G06F17/30504

Abstract: Embodiments of the present invention provide hardware-friendly indexing of databases. In particular, forward and reverse indexing are utilized to allow for easy traversal of primary key to foreign key relationships. A novel structure known as a hit list also allows for easy scanning of various indexes in hardware. Group indexing is provided for flexible support of complex group key definition, such as for date range indexing and text indexing. A Replicated Reordered Column (RRC) may also be added to the group index to convert random I/O pattern into sequential I/O of only needed column elements.

Abstract translation: 本发明的实施例提供数据库的硬件友好索引。 特别地，正向和反向索引被用于允许轻松地遍历主键到外键关系。 被称为命中列表的新颖结构还允许在硬件中容易地扫描各种索引。 提供组索引，用于复杂组密钥定义的灵活支持，如日期范围索引和文本索引。 还可以将复制的重新排列（RRC）添加到组索引中以将随机I / O模式转换为仅需要的列元素的顺序I / O。