公开(公告)号：US20090132518A1

公开(公告)日：2009-05-21

申请号：US11986593

申请日：2007-11-21

申请人： Brian Shaun Vickery ,  Anoop Sharma ,  Vinita Subramanian

发明人： Brian Shaun Vickery ,  Anoop Sharma ,  Vinita Subramanian

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

CPC分类号： G06F17/30339 ,  G06F17/30486

摘要： An automated method to align column values to proper byte boundaries for rapid scanning in a parallel processing database system. A table definition is received having a logical order of fields. The fields are re-ordered to create a physical order of fields. The physical order of fields has fixed length fields having a same byte alignment requirement positioned adjacent to each other in descending order from largest size to smallest size, and wherein a first fixed length field in the physical order is aligned on a proper byte boundary. Other embodiments, aspects and features are also disclosed.

摘要翻译： 一种自动化方法，用于将列值对齐到适当的字节边界，以便在并行处理数据库系统中进行快速扫描。 接收到具有字段的逻辑顺序的表定义。 这些字段被重新排序以创建字段的物理顺序。 场的物理顺序具有固定长度字段，其具有相对于彼此相邻的字节对齐要求，从最大尺寸到最小尺寸的降序，并且其中物理顺序上的第一固定长度字段在适当的字节边界上对齐。 还公开了其它实施例，方面和特征。

公开(公告)号：US08140961B2

公开(公告)日：2012-03-20

申请号：US11986593

申请日：2007-11-21

申请人： Brian Shaun Vickery ,  Anoop Sharma ,  Vinita Subramanian

发明人： Brian Shaun Vickery ,  Anoop Sharma ,  Vinita Subramanian

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

CPC分类号： G06F17/30339 ,  G06F17/30486

摘要： An automated method to align column values to proper byte boundaries for rapid scanning in a parallel processing database system. A table definition is received having a logical order of fields. The fields are re-ordered to create a physical order of fields. The physical order of fields has fixed length fields having a same byte alignment requirement positioned adjacent to each other in descending order from largest size to smallest size, and wherein a first fixed length field in the physical order is aligned on a proper byte boundary. Other embodiments, aspects and features are also disclosed.

摘要翻译： 一种自动化方法，用于将列值对齐到适当的字节边界，以便在并行处理数据库系统中进行快速扫描。 接收到具有字段的逻辑顺序的表定义。 这些字段被重新排序以创建字段的物理顺序。 场的物理顺序具有固定长度字段，其具有相对于彼此相邻的相同字节对齐要求，从最大尺寸到最小尺寸的降序，并且其中物理顺序上的第一固定长度字段在适当的字节边界上对齐。 还公开了其它实施例，方面和特征。

公开(公告)号：US08019779B2

公开(公告)日：2011-09-13

申请号：US10709416

申请日：2004-05-04

申请人： James Zu-Chia Teng ,  Brian Shaun Vickery ,  Guogen Zhang

发明人： James Zu-Chia Teng ,  Brian Shaun Vickery ,  Guogen Zhang

IPC分类号： G06F17/30

CPC分类号： G06F17/30362

摘要： A system and method for concurrency control of hierarchically structured data is provided. Lock requests on a target node are processed by exploiting ancestor-descendant information encoded into prefix encoded node identifiers (IDs). A set of implicit locks on ancestor nodes along a path from an immediate parent of a target node to a root node is derived from an explicit lock request on a target node. A logical lock tree describing existing lock modes for ancestor nodes is consulted to determine compatibility with the derived set of implicit locks. If existing lock modes for ancestor nodes are compatible with the derived set of implicit locks, a lock request on a target node is granted. Otherwise, the lock request is denied. A lock release request follows the reverse process; a target node in a particular transaction is released, as are subsequent locks on its ancestors made by the same transaction.

摘要翻译： 提供了一种用于分级结构化数据并发控制的系统和方法。 通过利用编码为前缀编码节点标识符（ID）的祖先 - 后代信息来处理目标节点上的锁定请求。 从目标节点的直接父节点到根节点的路径上的祖先节点上的一组隐式锁派生自目标节点上的显式锁定请求。 查询描述祖先节点的现有锁模式的逻辑锁树，以确定与导出的隐式锁定集的兼容性。 如果祖先节点的现有锁定模式与导出的隐式锁定集合兼容，则会授予目标节点上的锁定请求。 否则，锁请求被拒绝。 锁定释放请求遵循相反的过程; 特定事务中的目标节点被释放，同一事务由其祖先的后续锁也被释放。