公开(公告)号：US20110246432A1

公开(公告)日：2011-10-06

申请号：US13107399

申请日：2011-05-13

申请人： Liuxi Yang ,  Kapil Surlaker ,  Ravi Krishnamurthy ,  Michael Corwin ,  Jeremy Branscome ,  Krishnan Meiyyappan ,  Joseph I. Chamdani

发明人： Liuxi Yang ,  Kapil Surlaker ,  Ravi Krishnamurthy ,  Michael Corwin ,  Jeremy Branscome ,  Krishnan Meiyyappan ,  Joseph I. Chamdani

IPC分类号： G06F17/30

CPC分类号： G06F17/30315

摘要： Embodiments of the present invention provide one or more hardware-friendly data structures that enable efficient hardware acceleration of database operations. In particular, the present invention employs a column-store format for the database. In the database, column-groups are stored with implicit row ids (RIDs) and a RID-to-primary key column having both column-store and row-store benefits via column hopping and a heap structure for adding new data. Fixed-width column compression allow for easy hardware database processing directly on the compressed data. A global database virtual address space is utilized that allows for arithmetic derivation of any physical address of the data regardless of its location. A word compression dictionary with token compare and sort index is also provided to allow for efficient hardware-based searching of text. A tuple reconstruction process is provided as well that allows hardware to reconstruct a row by stitching together data from multiple column groups.

摘要翻译： 本发明的实施例提供了一个或多个能够有效地加速数据库操作的硬件友好的数据结构。 特别地，本发明采用数据库的列存储格式。 在数据库中，列组通过列跳转和用于添加新数据的堆结构存储隐式行ids（RID）和具有列存储和行存储优势的RID至主键列。 固定宽度列压缩允许直接对压缩数据进行硬件数据库处理。 使用全局数据库虚拟地址空间，允许对数据的任何物理地址的算术推导，而不管其位置如何。 还提供了具有令牌比较和排序索引的单词压缩字典，以允许对文本进行高效的基于硬件的搜索。 还提供了一个元组重建过程，允许硬件通过将来自多个列组的数据进行拼接来重建行。

公开(公告)号：US07761413B2

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

申请号：US11471405

申请日：2006-06-19

申请人： Kapil Surlaker ,  Shailendra Mishra

发明人： Kapil Surlaker ,  Shailendra Mishra

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

CPC分类号： G06F17/30368

摘要： A method of ensuring availability of event notification registrations of a database management system is described and provided. The method comprises creating the event notification registrations and storing the event notification registrations in a database of the database management system. Further, the event notification registrations are replicated in a designated database management system to create replicated event notification registrations. If the database management system fails, the replicated event notification registrations are utilized.

摘要翻译： 描述并提供确保数据库管理系统的事件通知注册的可用性的方法。 该方法包括创建事件通知注册并将事件通知注册存储在数据库管理系统的数据库中。 此外，事件通知注册被复制在指定的数据库管理系统中以创建复制的事件通知注册。 如果数据库管理系统发生故障，则使用复制事件通知注册。

公开(公告)号：US20090254532A1

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

申请号：US12099131

申请日：2008-04-07

申请人： Liuxi Yang ,  Kapil Surlaker ,  Ravi Krishnamurthy ,  Michael Corwin ,  Jeremy Branscome ,  Krishnan Meiyyappan ,  Joseph I. Chamdani

发明人： Liuxi Yang ,  Kapil Surlaker ,  Ravi Krishnamurthy ,  Michael Corwin ,  Jeremy Branscome ,  Krishnan Meiyyappan ,  Joseph I. Chamdani

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

CPC分类号： G06F17/30315

摘要： Embodiments of the present invention provide one or more hardware-friendly data structures that enable efficient hardware acceleration of database operations. In particular, the present invention employs a column-store format for the database. In the database, column-groups are stored with implicit row ids (RIDs) and a RID-to-primary key column having both column-store and row-store benefits via column hopping and a heap structure for adding new data. Fixed-width column compression allow for easy hardware database processing directly on the compressed data. A global database virtual address space is utilized that allows for arithmetic derivation of any physical address of the data regardless of its location. A word compression dictionary with token compare and sort index is also provided to allow for efficient hardware-based searching of text. A tuple reconstruction process is provided as well that allows hardware to reconstruct a row by stitching together data from multiple column groups.

摘要翻译： 本发明的实施例提供了一个或多个能够有效地加速数据库操作的硬件友好的数据结构。 特别地，本发明采用数据库的列存储格式。 在数据库中，列组通过列跳转和用于添加新数据的堆结构存储隐式行ids（RID）和RID至主键列，具有列存储和行存储优势。 固定宽度列压缩允许直接对压缩数据进行硬件数据库处理。 使用全局数据库虚拟地址空间，允许对数据的任何物理地址的算术推导，而不管其位置如何。 还提供了具有令牌比较和排序索引的单词压缩字典，以允许对文本进行高效的基于硬件的搜索。 还提供了一个元组重建过程，允许硬件通过将来自多个列组的数据进行拼接来重建行。

公开(公告)号：US20070240169A1

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

申请号：US11401560

申请日：2006-04-10

申请人： Kapil Surlaker ,  Neerja Bhatt

发明人： Kapil Surlaker ,  Neerja Bhatt

IPC分类号： G06F9/46

CPC分类号： G06F9/542 ,  G06F2209/544

摘要： A computer implemented method and system for automatically removing an event registration within an event notification infrastructure of a database system is disclosed. The method includes removing an event registration from an event queue automatically if a specified active period of time has elapsed. Further, the method includes removing an event registration from an event queue automatically if the event occurred N times where N can be specified at event registration. Also, the method includes removing an event registration from an event queue automatically if either the event occurred N times where N can be specified at event registration or a specified active period of time has elapsed. Moreover, the method includes removing an event registration from an event queue if a client explicitly requests removal of said event registration.

摘要翻译： 公开了一种用于在数据库系统的事件通知基础设施内自动移除事件注册的计算机实现的方法和系统。 该方法包括如果指定的活动时间段已经过去，则自动从事件队列中删除事件注册。 此外，该方法包括如果事件发生在事件注册时可以指定N的N次，则自动从事件队列中移除事件注册。 此外，该方法包括如果事件发生N次，则在事件注册时可以指定N或经过指定的活动时间段，则自动从事件队列中移除事件注册。 此外，该方法包括如果客户端明确地请求移除所述事件注册，则从事件队列中移除事件注册。

公开(公告)号：US20060149787A1

公开(公告)日：2006-07-06

申请号：US11192869

申请日：2005-07-29

申请人： Kapil Surlaker ,  Neerja Bhatt ,  Shailendra Mishra

发明人： Kapil Surlaker ,  Neerja Bhatt ,  Shailendra Mishra

IPC分类号： G06F17/30

CPC分类号： G06F9/546

摘要： Techniques for managing messages in computer systems are provided. In one embodiment, in response to a publisher attempting to enqueue a message in a queue, a determination is made whether a condition is satisfied. The condition is based on the current usage of the queue by the publisher. Based on whether the condition is satisfied, a decision is made whether to enqueue the message in the queue. The decision whether to enqueue the message may comprise restricting the publisher from enqueueing any more messages in the queue until the same or a different condition is satisfied.

公开(公告)号：US08458129B2

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

申请号：US12144486

申请日：2008-06-23

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

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

IPC分类号： G06F7/00

CPC分类号： G06F17/30356 ,  G06F17/30551

摘要： 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.

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

公开(公告)号：US20100281491A1

公开(公告)日：2010-11-04

申请号：US12835726

申请日：2010-07-13

申请人： Kapil Surlaker ,  Neerja Bhatt ,  Shailendra Mishra

发明人： Kapil Surlaker ,  Neerja Bhatt ,  Shailendra Mishra

IPC分类号： G06F9/44

CPC分类号： G06F9/546

摘要： Techniques for managing messages in computer systems are provided. In one embodiment, in response to a publisher attempting to enqueue a message in a queue, a determination is made whether a condition is satisfied. The condition is based on the current usage of the queue by the publisher. Based on whether the condition is satisfied, a decision is made whether to enqueue the message in the queue. The decision whether to enqueue the message may comprise restricting the publisher from enqueueing any more messages in the queue until the same or a different condition is satisfied.

摘要翻译： 提供了在计算机系统中管理消息的技术。 在一个实施例中，响应于发布者尝试在队列中排队消息，确定是否满足条件。 条件是基于发布者当前使用的队列。 根据条件是否满足，决定是否将队列中的消息排队。 是否排入消息的决定可能包括限制发布者排队队列中的任何更多消息，直到满足相同或不同的条件。

公开(公告)号：US20100005077A1

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

申请号：US12168821

申请日：2008-07-07

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

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

IPC分类号： G06F17/30

CPC分类号： G06F16/24542

摘要： 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

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

公开(公告)号：US20090319550A1

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

申请号：US12144303

申请日：2008-06-23

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

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

IPC分类号： G06F17/30

CPC分类号： G06F17/30595

摘要： 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.

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

公开(公告)号：US07610351B1

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

申请号：US10144083

申请日：2002-05-10

申请人： Sreenivas Gollapudi ,  Lakshminarayanan Chidambaran ,  Debashis Saha ,  Kapil Surlaker

发明人： Sreenivas Gollapudi ,  Lakshminarayanan Chidambaran ,  Debashis Saha ,  Kapil Surlaker

IPC分类号： G06F15/167

CPC分类号： H04L67/2847 ,  H04L67/289 ,  H04L67/2895 ,  Y10S707/99932 ,  Y10S707/99933

摘要： A method and mechanism for implementing pipelined prefetching in a computer system is disclosed. Data prefetching is utilized to predictably retrieve information between multiple levels of nodes in the computer system, in which a first server may receive prefetched data from a second server, the second server receives prefetched data from a third server, with the chain of prefetching extending as long as needed/desired to effect efficient data transfers between the nodes.

摘要翻译： 公开了一种在计算机系统中实现流水线预取的方法和机制。 数据预取用于可预测地在计算机系统中的多级节点之间检索信息，其中第一服务器可以从第二服务器接收预取数据，第二服务器从第三服务器接收预取数据，预取链延伸为 需要/期望能够在节点之间实现有效的数据传输。