-
公开(公告)号：US06732107B1
公开(公告)日：2004-05-04
申请号：US09817566
申请日：2001-03-26
申请人： Gang Luo , Curt J. Ellmann , Jeffrey F. Naughton
发明人： Gang Luo , Curt J. Ellmann , Jeffrey F. Naughton
IPC分类号： G06F700
CPC分类号： G06F17/30498 , G06F17/30241 , G06F17/30421 , Y10S707/99931 , Y10S707/99943 , Y10S707/99945
摘要： A non-blocking parallel spatial join algorithm generates the spatial join result tuples continuously even in the event of memory overflow. The algorithm employs duplicate avoidance techniques to avoid the blocking and time-consuming removal of duplicates. The algorithm also uses parallelism to improve performance.
摘要翻译： 即使在存储器溢出的情况下，非阻塞并行空间连接算法连续生成空间连接结果元组。 该算法采用重复的避免技术来避免重复的阻塞和耗时的删除。 该算法还使用并行性来提高性能。
-
公开(公告)号：US07155434B1
公开(公告)日：2006-12-26
申请号：US10117503
申请日：2002-04-04
CPC分类号： G06F17/30362 , G06F17/30383 , Y10S707/99938 , Y10S707/99939
摘要： A database system includes a locking mechanism for a materialized view defined on base relations. In response to updates of a base relation, a name lock is placed on the materialized view. The name lock is a type of exclusive lock and is associated with a data structure containing a first parameter to identify a base relation of the materialized view being updated, and a second parameter to indicate a number of transactions updating the base relation. With locking mechanisms according to some embodiments of the invention, transaction concurrency is enhanced by enabling concurrent updates of a materialized view by plural transactions in certain cases.
摘要翻译： 数据库系统包括用于在基础关系上定义的物化视图的锁定机制。 响应于基础关系的更新，物理视图上放置一个名称锁。 名称锁是一种排他锁，并且与包含用于标识被更新的物化视图的基本关系的第一参数的数据结构相关联，以及指示更新基础关系的事务数量的第二参数。 使用根据本发明的一些实施例的锁定机制，通过在某些情况下能够通过多个事务实现物化视图的并发更新来增强事务并发性。
-
公开(公告)号：US07085769B1
公开(公告)日：2006-08-01
申请号：US09842991
申请日：2001-04-26
申请人： Gang Luo , Curt J. Ellmann , Jeffrey F. Naughton
发明人： Gang Luo , Curt J. Ellmann , Jeffrey F. Naughton
IPC分类号： G06F17/30
CPC分类号： G06F17/30445 , Y10S707/99943
摘要： A parallel hash ripple join algorithm partitions tuples of two relations for localized processing. The algorithm is non-blocking and may be performed in a parallel, multi-processor environment. At each processing node, the tuples are further partitioned such that join operations may be performed as tuples are redistributed to each node during the partitioning.
摘要翻译： 并行散列波纹连接算法对本地化处理的两个关系进行分组。 该算法是非阻塞的，并且可以在并行的多处理器环境中执行。 在每个处理节点处，元组被进一步分区，使得可以执行连接操作，因为元组在分区期间被重新分配给每个节点。
-
公开(公告)号：US06745198B1
公开(公告)日：2004-06-01
申请号：US09878569
申请日：2001-06-11
申请人： Gang Luo , Curt J. Ellmann , Jeffrey F. Naughton
发明人： Gang Luo , Curt J. Ellmann , Jeffrey F. Naughton
IPC分类号： G06F1730
CPC分类号： G06F17/30333 , G06F17/30471 , G06F17/30498 , Y10S707/99943
摘要： A parallel spatial join index is used for efficient join operations involving spatial data, including polygon data. The join operations between spatial data from two different tables are performed in parallel in a multi-processor environment. Join indices are created, based upon spatial object attributes from the two tables. Auxiliary relations are constructed from the two tables as well, and further include data for avoiding duplicate join results. R-trees index the auxiliary relations and B-trees index the join indices.
摘要翻译： 并行空间连接索引用于涉及包括多边形数据在内的空间数据的有效连接操作。 来自两个不同表格的空间数据之间的连接操作在多处理器环境中并行执行。 基于两个表中的空间对象属性创建连接索引。 辅助关系也由两个表构成，还包括避免重复连接结果的数据。 索引辅助关系和B树索引连接索引。
-
5.发明授权Rescheduling of modification operations for loading data into a database system 有权重新安排将数据加载到数据库系统中的修改操作公开(公告)号：US08156110B1
公开(公告)日：2012-04-10
申请号：US10767681
申请日：2004-01-29
CPC分类号： G06F17/30345
摘要： A method or apparatus for use with a database system that stores a join view associated with plural base relations includes receiving modification operations to modify at least two of the base relations of the join view, and re-ordering the received modification operations to avoid concurrent execution of modification operations of more than one of at least two base relations.
摘要翻译： 一种与存储与多个基本关系相关联的联接视图的数据库系统一起使用的方法或装置包括接收修改操作以修改连接视图的基本关系中的至少两个，并重新排序接收到的修改操作以避免并发执行 至少两个基本关系中的一个以上的修改操作。
-
公开(公告)号：US07418706B1
公开(公告)日：2008-08-26
申请号：US10431751
申请日：2003-05-08
CPC分类号： G06F17/3046 , G06F17/30362 , G06F17/30371
摘要： A database system includes a rescheduler that performs rescheduling of transactions in a scheduling queue based on one or more criteria. One criterion is whether a first transaction in the queue can be performed as a synchronized scan of a table with a second transaction that is currently executing. This enables the first and second transactions to share a segment of a buffer storage pool.
摘要翻译： 数据库系统包括基于一个或多个标准执行调度队列中的事务的重新调度的重新调度器。 一个标准是队列中的第一个事务是否可以作为当前正在执行的第二个事务的表的同步扫描执行。 这使得第一和第二事务能够共享缓冲存储池的段。
-
公开(公告)号：US07174331B1
公开(公告)日：2007-02-06
申请号：US10349855
申请日：2003-01-23
CPC分类号： G06F17/30498 , G06F17/30362 , G06F17/30383 , Y10S707/99933 , Y10S707/99938 , Y10S707/99939
摘要： A database system includes a locking mechanism for a view defined on one or more base relations. A B-tree index is defined on the view. In response to updates of a base relation, predefined locks are placed on the view. With locking mechanisms according to some embodiments of the invention, concurrency of transactions that access the view and B-tree index is enhanced by enabling concurrent updates of the materialized view by plural transactions in certain cases, while avoiding read-write and write-read conflicts.
摘要翻译： 数据库系统包括用于在一个或多个基本关系上定义的视图的锁定机构。 视图中定义了B树索引。 响应于基础关系的更新，预定义的锁被放置在视图上。 利用根据本发明的一些实施例的锁定机制，通过在某些情况下允许通过多个事务同时更新物化视图，同时避免读写和冲突冲突，来增强访问视图和B树索引的事务的并发性 。
-
8.发明授权Locking mechanism using a predefined lock for materialized views in a database system 有权使用数据库系统中物化视图的预定义锁定的锁定机制公开(公告)号：US07149737B1
公开(公告)日：2006-12-12
申请号：US10117497
申请日：2002-04-04
CPC分类号： G06F17/30498 , G06F17/30362 , G06F17/30383 , Y10S707/99933 , Y10S707/99938 , Y10S707/99939
摘要： A database system includes a locking mechanism for a materialized view defined on base relations. In response to updates of a base relation, a predefined lock (e.g., Y lock or IY lock) is placed on the materialized view. With the locking mechanism, transaction concurrency is enhanced by enabling concurrent updates of a materialized view by plural transactions in certain cases.
摘要翻译： 数据库系统包括用于在基础关系上定义的物化视图的锁定机制。 响应于基础关系的更新，在物化视图上放置预定义的锁（例如，Y锁或IY锁）。 通过锁定机制，通过在某些情况下允许通过多个事务并行更新物化视图来增强事务并发性。
-
公开(公告)号：US06990503B1
公开(公告)日：2006-01-24
申请号：US10121190
申请日：2002-04-12
IPC分类号： G06F17/30
CPC分类号： G06F17/30362 , G06F17/30371
摘要： A database system includes a transaction rescheduling mechanism that reorders pending transactions based on whether one or more of the pending transactions conflict with any transactions that have been scheduled for execution. In one arrangement, the received pending transactions are stored in a first queue. The transactions that are scheduled for execution are stored in a second queue. The transactions are moved from the first queue to the second queue based on the reordering by the transaction rescheduling mechanism.
摘要翻译： 数据库系统包括事务重新调度机制，其基于一个或多个待处理事务与已被调度执行的任何事务冲突来重新排列等待的事务。 在一种安排中，接收到的待处理事务被存储在第一队列中。 计划执行的事务存储在第二个队列中。 基于事务重新调度机制的重新排序，事务从第一个队列移动到第二个队列。
-
公开(公告)号：US07761477B1
公开(公告)日：2010-07-20
申请号：US10848349
申请日：2004-05-18
申请人： Gang Luo , Curt J. Ellmann , Jeffrey F. Naughton
发明人： Gang Luo , Curt J. Ellmann , Jeffrey F. Naughton
CPC分类号： G06F17/30457 , G06F17/30498 , Y10S707/99932 , Y10S707/99945 , Y10S707/99953
摘要： Auxiliary relations are used to maintain a materialized view. The materialized view comprises results of some operation performed between two or more base relations of a parallel database management system comprising a plurality of nodes. The two or more base relations are distributed to the nodes according to some partitioning strategy. Each auxiliary relation is partitioned according to the join attribute in the materialized view definition. During join or other operations involving the relations, the auxiliary relations, not the base relations, are used to construct join results and to maintain the materialized view.
摘要翻译： 辅助关系用于维护物化视图。 物化视图包括在包括多个节点的并行数据库管理系统的两个或多个基本关系之间执行的一些操作的结果。 根据一些划分策略，将两个或多个基本关系分配给节点。 每个辅助关系根据物化视图定义中的连接属性进行分区。 在涉及关系的连接或其他操作过程中，辅助关系而不是基础关系被用于构建连接结果并维护物化视图。
-
-
-
-
-
-
-
-
-
搜索结果
21 条记录 (耗时 0.029 秒)
