公开(公告)号：US07181482B2

公开(公告)日：2007-02-20

申请号：US10443206

申请日：2003-05-21

申请人： Namit Jain ,  Neerja Bhatt ,  Kapil Surlaker ,  Krishnan Meiyyappan ,  Sanjay Kaluskar ,  Shailendra Mishra

发明人： Namit Jain ,  Neerja Bhatt ,  Kapil Surlaker ,  Krishnan Meiyyappan ,  Sanjay Kaluskar ,  Shailendra Mishra

IPC分类号： G06F17/30

CPC分类号： G06F17/30289 ,  Y10S707/99931 ,  Y10S707/99957

摘要： A buffered message queue architecture for managing messages in a database management system is disclosed. A “buffered message queue” refers to a message queue implemented in a volatile memory, such as a RAM. The volatile memory may be a shared volatile memory that is accessible by a plurality of processes. The buffered message queue architecture supports a publish and subscribe communication mechanism, where the message producers and message consumers may be decoupled from and independent of each other. The buffered message queue architecture provides all the functionality of a persistent publish-subscriber messaging system, without ever having to store the messages in persistent storage. The buffered message queue architecture provides better performance and scalability since no persistent operations are needed and no UNDO/REDO logs need to be maintained. Messages published to the buffered message queue are delivered to all eligible subscribers at least once, even in the event of failures, as long as the application is “repeatable.” The buffered message queue architecture also includes management mechanisms for performing buffered message queue cleanup and also for providing unlimited size buffered message queues when limited amounts of shared memory are available. The architecture also includes “zero copy” buffered message queues and provides for transaction-based enqueue of messages.

摘要翻译： 公开了一种用于管理数据库管理系统中的消息的缓冲消息队列架构。 “缓冲消息队列”是指在诸如RAM的易失性存储器中实现的消息队列。 易失性存储器可以是可由多个进程访问的共享易失性存储器。 缓冲消息队列架构支持发布和订阅通信机制，消息生成器和消息消费者可以彼此分离并且彼此独立。 缓冲消息队列体系结构提供了持久性发布 - 订阅者消息系统的所有功能，而无需将消息存储在持久存储中。 缓冲消息队列架构提供更好的性能和可扩展性，因为不需要持续的操作，并且不需要维护UNDO / REDO日志。 只要应用程序是“可重复的”，发布到缓冲消息队列的消息至少发送一次，即使发生故障。 缓冲消息队列架构还包括用于执行缓冲消息队列清理的管理机制，并且还用于当有限量的共享存储器可用时提供无限大小的缓冲消息队列。 该架构还包括“零拷贝”缓冲消息队列，并提供基于事务的消息队列。

公开(公告)号：US07185033B2

公开(公告)日：2007-02-27

申请号：US10443175

申请日：2003-05-21

申请人： Namit Jain ,  Neerja Bhatt ,  Kapil Surlaker ,  Krishnan Meiyyappan ,  Shailendra Mishra

发明人： Namit Jain ,  Neerja Bhatt ,  Kapil Surlaker ,  Krishnan Meiyyappan ,  Shailendra Mishra

IPC分类号： G06F17/30

CPC分类号： G06F9/546 ,  G06F11/1471 ,  G06F11/1474 ,  G06F17/30289 ,  G06F2201/80 ,  Y10S707/99957

摘要： A buffered message queue architecture for managing messages in a database management system is disclosed. A “buffered message queue” refers to a message queue implemented in a volatile memory, such as a RAM. The volatile memory may be a shared volatile memory that is accessible by a plurality of processes. The buffered message queue architecture supports a publish and subscribe communication mechanism, where the message producers and message consumers may be decoupled from and independent of each other. The buffered message queue architecture provides all the functionality of a persistent publish-subscriber messaging system, without ever having to store the messages in persistent storage. The buffered message queue architecture provides better performance and scalability since no persistent operations are needed and no UNDO/REDO logs need to be maintained. Messages published to the buffered message queue are delivered to all eligible subscribers at least once, even in the event of failures, as long as the application is “repeatable.” The buffered message queue architecture also includes management mechanisms for performing buffered message queue cleanup and also for providing unlimited size buffered message queues when limited amounts of shared memory are available. The architecture also includes “zero copy” buffered message queues and provides for transaction-based enqueue of messages.

摘要翻译： 公开了一种用于管理数据库管理系统中的消息的缓冲消息队列架构。 “缓冲消息队列”是指在诸如RAM的易失性存储器中实现的消息队列。 易失性存储器可以是可由多个进程访问的共享易失性存储器。 缓冲消息队列架构支持发布和订阅通信机制，消息生成器和消息消费者可以彼此分离并且彼此独立。 缓冲消息队列体系结构提供了持久性发布 - 订阅者消息系统的所有功能，而无需将消息存储在持久存储中。 缓冲消息队列架构提供更好的性能和可扩展性，因为不需要持续的操作，并且不需要维护UNDO / REDO日志。 只要应用程序是“可重复的”，发布到缓冲消息队列的消息至少发送一次，即使发生故障。 缓冲消息队列架构还包括用于执行缓冲消息队列清理的管理机制，并且还用于当有限量的共享存储器可用时提供无限大小的缓冲消息队列。 该架构还包括“零拷贝”缓冲消息队列，并提供基于事务的消息队列。

公开(公告)号：US07818386B2

公开(公告)日：2010-10-19

申请号：US11192830

申请日：2005-07-29

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

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

IPC分类号： G06F15/16

CPC分类号： H04L1/1874 ,  H04L49/90 ,  H04L2001/0093

摘要： Techniques for propagating messages in a distributed system are provided. A set of messages enqueued in a source queue are sent to one or more destination queues. An acknowledgement is received from each of the one or more destination queues, where the acknowledgement indicates which messages of the set of messages have been consumed at the particular destination queue. Based on the acknowledgements, one or more messages of the set messages are ceased to be maintained in the source queue.

摘要翻译： 提供了在分布式系统中传播消息的技术。 在源队列中排队的一组消息被发送到一个或多个目的地队列。 从一个或多个目的地队列中的每一个接收到确认，其中确认指示该特定目的地队列消息的消息集合的消息。 基于确认，集合消息中的一个或多个消息在源队列中停止维护。

公开(公告)号：US07203706B2

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

申请号：US10443207

申请日：2003-05-21

申请人： Namit Jain ,  Neerja Bhatt ,  Kapil Surlaker ,  Krishnan Meiyyappan ,  Shailendra Mishra

发明人： Namit Jain ,  Neerja Bhatt ,  Kapil Surlaker ,  Krishnan Meiyyappan ,  Shailendra Mishra

IPC分类号： G06F17/30

CPC分类号： G06F9/544 ,  G06F17/30371 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99944 ,  Y10S707/99945 ,  Y10S707/99948

摘要： A buffered message queue architecture for managing messages in a database management system is disclosed. A “buffered message queue” refers to a message queue implemented in a volatile memory, such as a RAM. The volatile memory may be a shared volatile memory that is accessible by a plurality of processes. The buffered message queue architecture supports a publish and subscribe communication mechanism, where the message producers and message consumers may be decoupled from and independent of each other. The buffered message queue architecture provides all the functionality of a persistent publish-subscriber messaging system, without ever having to store the messages in persistent storage. The buffered message queue architecture provides better performance and scalability since no persistent operations are needed and no UNDO/REDO logs need to be maintained. Messages published to the buffered message queue are delivered to all eligible subscribers at least once, even in the event of failures, as long as the application is “repeatable.” The buffered message queue architecture also includes management mechanisms for performing buffered message queue cleanup and also for providing unlimited size buffered message queues when limited amounts of shared memory are available. The architecture also includes “zero copy” buffered message queues and provides for transaction-based enqueue of messages.

摘要翻译： 公开了一种用于管理数据库管理系统中的消息的缓冲消息队列架构。 “缓冲消息队列”是指在诸如RAM的易失性存储器中实现的消息队列。 易失性存储器可以是可由多个进程访问的共享易失性存储器。 缓冲消息队列架构支持发布和订阅通信机制，消息生成器和消息消费者可以彼此分离并且彼此独立。 缓冲消息队列体系结构提供了持久性发布 - 订阅者消息系统的所有功能，而无需将消息存储在持久存储中。 缓冲消息队列架构提供更好的性能和可扩展性，因为不需要持续的操作，并且不需要维护UNDO / REDO日志。 只要应用程序是“可重复的”，发布到缓冲消息队列的消息至少发送一次，即使发生故障。 缓冲消息队列架构还包括用于执行缓冲消息队列清理的管理机制，并且还用于当有限量的共享存储器可用时提供无限大小的缓冲消息队列。 该架构还包括“零拷贝”缓冲消息队列，并提供基于事务的消息队列。

公开(公告)号：US07185034B2

公开(公告)日：2007-02-27

申请号：US10443323

申请日：2003-05-21

申请人： Namit Jain ,  Neerja Bhatt ,  Kapil Surlaker ,  Krishnan Meiyyappan ,  Shailendra Mishra ,  Bhagat Nainani

发明人： Namit Jain ,  Neerja Bhatt ,  Kapil Surlaker ,  Krishnan Meiyyappan ,  Shailendra Mishra ,  Bhagat Nainani

IPC分类号： G06F17/30

CPC分类号： G06F17/30289 ,  Y10S707/99957

摘要： A buffered message queue architecture for managing messages in a database management system is disclosed. A “buffered message queue” refers to a message queue implemented in a volatile memory, such as a RAM. The volatile memory may be a shared volatile memory that is accessible by a plurality of processes. The buffered message queue architecture supports a publish and subscribe communication mechanism, where the message producers and message consumers may be decoupled from and independent of each other. The buffered message queue architecture provides all the functionality of a persistent publish-subscriber messaging system, without ever having to store the messages in persistent storage. The buffered message queue architecture provides better performance and scalability since no persistent operations are needed and no UNDO/REDO logs need to be maintained. Messages published to the buffered message queue are delivered to all eligible subscribers at least once, even in the event of failures, as long as the application is “repeatable.” The buffered message queue architecture also includes management mechanisms for performing buffered message queue cleanup and also for providing unlimited size buffered message queues when limited amounts of shared memory are available. The architecture also includes “zero copy” buffered message queues and provides for transaction-based enqueue of messages.

摘要翻译： 公开了一种用于管理数据库管理系统中的消息的缓冲消息队列架构。 “缓冲消息队列”是指在诸如RAM的易失性存储器中实现的消息队列。 易失性存储器可以是可由多个进程访问的共享易失性存储器。 缓冲消息队列架构支持发布和订阅通信机制，消息生成器和消息消费者可以彼此分离并且彼此独立。 缓冲消息队列体系结构提供了持久性发布 - 订阅者消息系统的所有功能，而无需将消息存储在持久存储中。 缓冲消息队列架构提供更好的性能和可扩展性，因为不需要持续的操作，并且不需要维护UNDO / REDO日志。 只要应用程序是“可重复的”，发布到缓冲消息队列的消息至少发送一次，即使发生故障。 缓冲消息队列架构还包括用于执行缓冲消息队列清理的管理机制，并且还用于当有限量的共享存储器可用时提供无限大小的缓冲消息队列。 该架构还包括“零拷贝”缓冲消息队列，并提供基于事务的消息队列。

公开(公告)号：US20060168080A1

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

申请号：US11192830

申请日：2005-07-29

申请人： Kapil Surlaker ,  Krishnan Meiyyappan ,  Neerja Bhatt

发明人： Kapil Surlaker ,  Krishnan Meiyyappan ,  Neerja Bhatt

IPC分类号： G06F15/16

CPC分类号： H04L1/1874 ,  H04L49/90 ,  H04L2001/0093

摘要： Techniques for propagating messages in a distributed system are provided. A set of messages enqueued in a source queue are sent to one or more destination queues. An acknowledgement is received from each of the one or more destination queues, where the acknowledgement indicates which messages of the set of messages have been consumed at the particular destination queue. Based on the acknowledgements, one or more messages of the set messages are ceased to be maintained in the source queue.

摘要翻译： 提供了在分布式系统中传播消息的技术。 在源队列中排队的一组消息被发送到一个或多个目的地队列。 从一个或多个目的地队列中的每个接收到确认，其中确认指示消息集合中哪些消息已经在特定目的地队列中被消费。 基于确认，集合消息中的一个或多个消息在源队列中停止维护。

公开(公告)号：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至主键列。 固定宽度列压缩允许直接对压缩数据进行硬件数据库处理。 使用全局数据库虚拟地址空间，允许对数据的任何物理地址的算术推导，而不管其位置如何。 还提供了具有令牌比较和排序索引的单词压缩字典，以允许对文本进行高效的基于硬件的搜索。 还提供了一个元组重建过程，允许硬件通过将来自多个列组的数据进行拼接来重建行。

公开(公告)号：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.