公开(公告)号：US20100161573A1

公开(公告)日：2010-06-24

申请号：US12340569

申请日：2008-12-19

申请人： Wilson Chan ,  Angelo Pruscino ,  Michael Zoll

发明人： Wilson Chan ,  Angelo Pruscino ,  Michael Zoll

IPC分类号： G06F17/30

CPC分类号： G06F9/52 ,  G06F17/30362

摘要： Described herein are techniques for time limited lock ownership. In one embodiment, in response to receiving a request for a lock on a shared resource, the lock is granted and a lock lease period associated with the lock is established. Then, in response to determining that the lock lease period has expired, one or more lock lease expiration procedures are performed. In many cases, the time limited lock ownership may prevent system hanging, timely detect system deadlocks, and/or improve overall performance of the database.

摘要翻译： 这里描述的是用于限时锁定所有权的技术。 在一个实施例中，响应于接收到对共享资源的锁定的请求，该锁被授予并且与该锁相关联的锁租约期间被建立。 然后，响应于确定锁租约期已经过期，执行一个或多个锁租约期过程。 在许多情况下，限时锁定所有权可能会阻止系统挂起，及时检测系统死锁，和/或提高数据库的整体性能。

公开(公告)号：US07917596B2

公开(公告)日：2011-03-29

申请号：US12350182

申请日：2009-01-07

申请人： Wilson Chan ,  Angelo Pruscino ,  Michael Zoll

发明人： Wilson Chan ,  Angelo Pruscino ,  Michael Zoll

IPC分类号： G06F15/16 ,  G06F12/00

CPC分类号： G06F17/30362

摘要： Described herein are techniques for using super masters to coordinate accesses by nodes in a database server cluster to data stored in a database. In many cases, the number of inter-nodal messages is reduced, thereby saving the overheads attendant to coordinating accesses in such a system.

摘要翻译： 这里描述的是使用超级主人来协调数据库服务器集群中的节点到存储在数据库中的数据的访问的技术。 在许多情况下，减少节点间消息的数量，从而节省了在这种系统中协调访问的开销。

公开(公告)号：US07209990B2

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

申请号：US11099771

申请日：2005-04-05

申请人： Angelo Pruscino ,  Michael Zoll ,  Wilson Chan

发明人： Angelo Pruscino ,  Michael Zoll ,  Wilson Chan

IPC分类号： G06F13/36 ,  G06F13/362 ,  G06F9/46 ,  G06F12/00

CPC分类号： G06F9/526 ,  Y10S707/99938

摘要： Locks are placed in a convert queue in a way that compensates for queue bias. Rather than always placing a remote lock in a queue at the tail, a remote lock can be placed further up in the queue, and possibly be interleaved with local locks. As a result, remote processes are granted locks more frequently and swiftly. Locks are placed in a convert queue according based on queue placement factors, which are factors accounted for when placing a lock in a queue.

摘要翻译： 锁定以一种补偿队列偏差的方式放置在转换队列中。 而不是总是将远程锁放置在尾部的队列中，远程锁可以进一步放置在队列中，并且可能与本地锁交错。 因此，远程进程被更频繁和迅速地被授予锁定。 根据队列放置因子将锁放置在转换队列中，这些因素是将锁放置在队列中时考虑的因素。

公开(公告)号：US20060224805A1

公开(公告)日：2006-10-05

申请号：US11099771

申请日：2005-04-05

申请人： Angelo Pruscino ,  Michael Zoll ,  Wilson Chan

发明人： Angelo Pruscino ,  Michael Zoll ,  Wilson Chan

IPC分类号： G06F12/14

CPC分类号： G06F9/526 ,  Y10S707/99938

摘要： Locks are placed in a convert queue in a way that compensates for queue bias. Rather than always placing a remote lock in a queue at the tail, a remote lock can be placed further up in the queue, and possibly be interleaved with local locks. As a result, remote processes are granted locks more frequently and swiftly. Locks are placed in a convert queue according based on queue placement factors, which are factors accounted for when placing a lock in a queue.

摘要翻译： 锁定以一种补偿队列偏差的方式放置在转换队列中。 而不是总是将远程锁放置在尾部的队列中，远程锁可以进一步放置在队列中，并且可能与本地锁交错。 因此，远程进程被更频繁和迅速地被授予锁定。 根据队列放置因子将锁放置在转换队列中，这些因素是将锁放置在队列中时考虑的因素。

公开(公告)号：US07921090B2

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

申请号：US11450179

申请日：2006-06-09

申请人： Eugene Ho ,  Kotaro Ono ,  Neil Macnaughton ,  Michael Zoll ,  Herbert van den Bergh

发明人： Eugene Ho ,  Kotaro Ono ,  Neil Macnaughton ,  Michael Zoll ,  Herbert van den Bergh

IPC分类号： G06F17/00 ,  G06F7/00 ,  G06F15/16

CPC分类号： G06F17/30362

摘要： Methods and apparatuses for providing access to data in a cluster database are described. Embodiments of the invention include identifying situations in which many nodes require relatively equal access to a data block, and taking appropriate measures to improve the performance of the system in these situations. For example, a node may automatically downgrade its lock from an X lock to an S lock as soon as it has finished a modification of the data. S locks are sent to other nodes in the system as soon as a modification is complete. Modifications to the data are also sent to other nodes in the system as soon as a modification is complete. Depending on the size of the data modification, the entire data block may be sent, or only the modifications to the data may be sent.

摘要翻译： 描述了用于提供对群集数据库中的数据的访问的方法和装置。 本发明的实施例包括识别许多节点需要对数据块相对相等的访问的情况，并且在这些情况下采取适当的措施来提高系统的性能。 例如，一旦节点完成数据的修改，节点就可以自动将其锁定从X锁降级到S锁。 一旦修改完成，S锁将被发送到系统中的其他节点。 一旦修改完成，对数据的修改也将发送到系统中的其他节点。 根据数据修改的大小，可以发送整个数据块，或者仅可以发送对数据的修改。

公开(公告)号：US20070288463A1

公开(公告)日：2007-12-13

申请号：US11450179

申请日：2006-06-09

申请人： Eugene Ho ,  Kotaro Ono ,  Neil Macnaughton ,  Michael Zoll ,  Herbert van den Bergh

发明人： Eugene Ho ,  Kotaro Ono ,  Neil Macnaughton ,  Michael Zoll ,  Herbert van den Bergh

IPC分类号： G06F17/30

CPC分类号： G06F17/30362

摘要： Methods and apparatuses for providing access to data in a cluster database are described. Embodiments of the invention include identifying situations in which many nodes require relatively equal access to a data block, and taking appropriate measures to improve the performance of the system in these situations. For example, a node may automatically downgrade its lock from an X lock to an S lock as soon as it has finished a modification of the data. S locks are sent to other nodes in the system as soon as a modification is complete. Modifications to the data are also sent to other nodes in the system as soon as a modification is complete. Depending on the size of the data modification, the entire data block may be sent, or only the modifications to the data may be sent.

摘要翻译： 描述了用于提供对群集数据库中的数据的访问的方法和装置。 本发明的实施例包括识别许多节点需要对数据块相对相等的访问的情况，并且在这些情况下采取适当的措施来提高系统的性能。 例如，一旦节点完成数据的修改，节点就可以自动将其锁定从X锁降级到S锁。 一旦修改完成，S锁将被发送到系统中的其他节点。 一旦修改完成，对数据的修改也将发送到系统中的其他节点。 根据数据修改的大小，可以发送整个数据块，或者仅可以发送对数据的修改。

公开(公告)号：US08429133B2

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

申请号：US11956287

申请日：2007-12-13

申请人： Tirthankar Lahiri ,  Dheeraj Pandey ,  Juan R. Loaiza ,  Michael Zoll ,  Kiran B. Goyal ,  Neil J. S. Macnaughton

发明人： Tirthankar Lahiri ,  Dheeraj Pandey ,  Juan R. Loaiza ,  Michael Zoll ,  Kiran B. Goyal ,  Neil J. S. Macnaughton

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

CPC分类号： G06F17/30327

摘要： A partial reverse key index is described, which allows distributed contention as resources vie to insert data into an index as well as allows range scans to be performed on the index. To do so, before an index entry for a key value is inserted into an index, the key value is transformed using a transformation operation that affects a subset of the order of the key value. The index entry is then inserted based on the transformed key value. Because the transformation operation affects the order of the key value, the transformed values associated with two consecutive key values will not necessarily be consecutive. Therefore, the index entries associated with the consecutive key values may be inserted into unrelated portions of the index.

摘要翻译： 描述了部分反向密钥索引，其允许分布式争用作为将数据插入到索引中的资源，并且允许在索引上执行范围扫描。 为此，在将键值的索引条目插入索引之前，将使用影响键值顺序子集的转换操作来转换键值。 然后基于转换的键值插入索引条目。 由于转换操作影响键值的顺序，与两个连续的键值相关联的变换值不一定是连续的。 因此，可以将与连续键值相关联的索引条目插入索引的无关部分。

公开(公告)号：US08391295B2

公开(公告)日：2013-03-05

申请号：US11868317

申请日：2007-10-05

申请人： Carol Colrain ,  Michael Zoll ,  Rajkumar Irudayaraj

发明人： Carol Colrain ,  Michael Zoll ,  Rajkumar Irudayaraj

IPC分类号： H04L12/56

CPC分类号： H04L67/322 ,  H04L45/121 ,  H04L45/306 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/327

摘要： Techniques for routing client requests among a group of nodes offering a service are described. A coordinator determines that performance could be improved by using affinity-based routing. In one embodiment, the coordinator calculates a Time-to-Live (TTL) metric whereby clients benefit by returning to the same cache and posts this hint to subscribers. Client's start preserving locality data in an affinity context, such that later requests for a connection can be routed to the location last visited. The coordinator measures the system over subsequent intervals. If the gradient of the goodness (viz service quality and capacity) is stable or improving, then the coordinator continues to advise subscribers to use the affinity-based technique. Alternatively, if the gradient of the goodness is deteriorating, then the coordinator posts advice to the subscribers to stop using the affinity-based technique for any instance during the next intervals.

摘要翻译： 描述了在提供服务的一组节点之间路由客户端请求的技术。 协调者决定通过使用基于亲和性的路由可以提高性能。 在一个实施例中，协调器计算生存时间（TTL）度量，由此客户端通过返回到相同的高速缓存并且向用户发布该提示而受益。 客户端启动在亲和性上下文中保留位置数据，以便稍后的连接请求可以路由到上次访问的位置。 协调员在随后的时间间隔内测量系统。 如果善意的梯度（服务质量和容量）稳定或改善，协调员将继续建议用户使用基于亲和力的技术。 或者，如果善意的渐变正在恶化，则协调器向订阅者发布建议以在下一间隔期间停止对任何实例使用基于亲和力的技术。

公开(公告)号：US20090157701A1

公开(公告)日：2009-06-18

申请号：US11956287

申请日：2007-12-13

申请人： Tirthankar Lahiri ,  Dheeraj Pandey ,  Juan R. Loaiza ,  Michael Zoll ,  Kiran B. Goyal ,  Neil J.S. Macnaughton

发明人： Tirthankar Lahiri ,  Dheeraj Pandey ,  Juan R. Loaiza ,  Michael Zoll ,  Kiran B. Goyal ,  Neil J.S. Macnaughton

IPC分类号： G06F17/30

CPC分类号： G06F17/30327

摘要： A partial reverse key index is described, which allows distributed contention as resources vie to insert data into an index as well as allows range scans to be performed on the index. To do so, before an index entry for a key value is inserted into an index, the key value is transformed using a transformation operation that affects a subset of the order of the key value. The index entry is then inserted based on the transformed key value. Because the transformation operation affects the order of the key value, the transformed values associated with two consecutive key values will not necessarily be consecutive. Therefore, the index entries associated with the consecutive key values may be inserted into unrelated portions of the index.

摘要翻译： 描述了部分反向密钥索引，其允许分布式争用作为将数据插入到索引中的资源，并且允许在索引上执行范围扫描。 为此，在将键值的索引条目插入索引之前，将使用影响键值顺序子集的转换操作来转换键值。 然后基于转换的键值插入索引条目。 由于转换操作影响键值的顺序，与两个连续的键值相关联的变换值不一定是连续的。 因此，可以将与连续键值相关联的索引条目插入索引的无关部分。

公开(公告)号：US09189295B2

公开(公告)日：2015-11-17

申请号：US13309356

申请日：2011-12-01

申请人： Fulu Li ,  Chern Yih Cheah ,  Michael Zoll

发明人： Fulu Li ,  Chern Yih Cheah ,  Michael Zoll

IPC分类号： G06F9/52 ,  G06F17/30

CPC分类号： G06F9/52 ,  G06F17/30348 ,  G06F2209/521

摘要： A method, system, and computer program product is disclosed for generating an ordered sequence from a predetermined sequence of symbols using protected interleaved caches, such as semaphore protected interleaved caches. The approach commences by dividing the predetermined sequence of symbols into two or more interleaved caches, then mapping each of the two or more interleaved caches to a particular semaphore of a group of semaphores. The group of semaphores is organized into bytes or machine words for storing the group of semaphores into a shared memory, the shared memory accessible by a plurality of session processes. Protected (serialized) access by the session processes is provided by granting access to one of the two or more interleaved caches only after one of the plurality of session processes performs a semaphore altering read-modify-write operation (e.g., a CAS) on the particular semaphore. The interleaved caches are assigned values successively from the predetermined sequence using a round-robin assignment technique.

摘要翻译： 公开了一种方法，系统和计算机程序产品，用于使用受保护的交错高速缓存（例如信号量保护的交错高速缓存）从预定的符号序列生成有序序列。 该方法通过将预定的符号序列划分成两个或多个交织的高速缓存，然后将两个或多个交织的高速缓存中的每一个映射到一组信号量的特定信号量来开始。 信号组被组织成字节或机器字，用于将信号组存储到共享存储器中，共享存储器可由多个会话进程访问。 只有在多个会话进程中的一个会话处理执行信号量改变读取 - 修改 - 写入操作（例如CAS）之后，才允许访问两个或多个交织高速缓存中的一个的缓存 特别的信号量。 使用循环分配技术，从预定序列连续地分配交织的高速缓存。