专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07991745B2 Database log capture that publishes transactions to multiple targets to handle unavailable targets by separating the publishing of subscriptions and subsequently recombining the publishing 有权
标题翻译：通过分离发布订阅并随后重新组合发布，将事务发布到多个目标来处理不可用目标的数据库日志捕获
公开(公告)号：US07991745B2
公开(公告)日：2011-08-02
申请号：US12344207
申请日：2008-12-24
申请人： Serge Bourbonnais , Siqun Li , Bruce Gilbert Lindsay
发明人： Serge Bourbonnais , Siqun Li , Bruce Gilbert Lindsay
IPC分类号： G06F17/30
CPC分类号： G06F17/30575 , G06F11/2056 , G06F2201/80 , G06Q40/12 , Y10S707/99938 , Y10S707/99953
摘要： A first log reader publishes first messages to a plurality of queues. The messages comprise changes for transactions extracted from a log by the first log reader. In response to one of the queues becoming unavailable, a second log reader is launched to read and extract from the log, and to publish second messages comprising changes for transactions extracted from the log by the second log reader to the unavailable queue as a catch-up queue. In response to the catch-up queue becoming available and the second log reader reaching the end of the log, the publishing of the second messages for the catch-up queue is transferred from the second log reader to the first log reader.
摘要翻译：第一个日志读取器将第一消息发布到多个队列。消息包括由第一个日志读取器从日志中提取的事务的更改。响应于其中一个队列变得不可用，启动第二个日志读取器以从日志读取和解压缩，并且发布包括由第二个日志读取器从日志中提取的事务的更改的第二个消息作为捕获 - up队列响应追赶队列变为可用，第二个日志读取器到达日志结束，追踪队列的第二个消息的发布从第二个日志读取器传输到第一个日志读取器。

2. 发明授权

US07302441B2 System and method for gradually bringing rolled in data online with incremental deferred integrity processing 失效
标题翻译：系统和方法逐渐使用增量延迟完整性处理在网上滚动数据
公开(公告)号：US07302441B2
公开(公告)日：2007-11-27
申请号：US10896154
申请日：2004-07-20
申请人： Petrus Kai Chung Chan , Miroslaw Adam Flasza , Dieu Quang La , Bruce Gilbert Lindsay , William T. O'Connell
发明人： Petrus Kai Chung Chan , Miroslaw Adam Flasza , Dieu Quang La , Bruce Gilbert Lindsay , William T. O'Connell
IPC分类号： G06F17/00
CPC分类号： G06F17/3051 , G06F17/30312 , G06F17/30371 , Y10S707/99942 , Y10S707/99943 , Y10S707/99944 , Y10S707/99945
摘要： Disclosed is a data processing system, a data processing system-implemented method and an article of manufacture for providing general user availability while integrity processing of rolled-in data is deferred and performed incrementally. The data processing system includes a data warehouse administration module for administering a data warehouse to include a table dividable into portions for containing rows of rolled-in data, a first and a second delimiter delimiting the start and the end respectively of each portion, a metadata element having an entry corresponding to the start and end delimiters delimiting each portion, a third delimiter for delimiting, between the first delimiter and the third delimiter, a sub-portion of the portion, and an operations management module having operation mechanisms for performing operations on the data warehouse responsive to the delimiters.
摘要翻译：公开了一种数据处理系统，数据处理系统实现的方法和用于提供一般用户可用性的制品，并且递推数据的完整性处理被延迟并执行。数据处理系统包括数据仓库管理模块，用于管理数据仓库以将可分割的表分成用于包含滚动数据行的部分，分隔每个部分的开始和结束的第一和第二定界符，元数据元素，其具有对应于限定每个部分的开始和结束分隔符的条目，用于在第一定界符和第三分隔符之间划分第三分隔符的第三分隔符，该部分的子部分，以及具有用于执行操作的操作机制的操作管理模块数据仓库响应分隔符。

3. 发明授权

US06665663B2 Outerjoin and antijoin reordering using extended eligibility lists 失效
标题翻译：使用扩展资格清单进行外联和反连接重新排序
公开(公告)号：US06665663B2
公开(公告)日：2003-12-16
申请号：US09809846
申请日：2001-03-15
申请人： Bruce Gilbert Lindsay , Guy Maring Lohman , Mir Hamid Pirahesh , Jun Rao
发明人： Bruce Gilbert Lindsay , Guy Maring Lohman , Mir Hamid Pirahesh , Jun Rao
IPC分类号： G06F1730
CPC分类号： G06F17/30466 , G06F17/30469 , Y10S707/99934
摘要： An optimization technique that reorders outerjoins and antijoins with inner joins in a bottom-up optimizer of a relational database management system (RDBMS). Each join predicate is associated with a normal eligibility list (NEL) that includes tables that are referenced in the join predicate and an extended eligibility list (EEL) that includes additional tables that are referenced in conflicting join predicates. An EEL includes all the tables needed by a predicate to preserve the semantics of the original query. During join enumeration, the optimizer determines whether a join predicate's EEL is a subset of all the tables in two subplans to be merged, i.e., whose EEL is covered. If so, the two subplans are combined using the join predicate. Otherwise, the two subplans cannot be joined. Two approaches are used to reordering: without compensation and with compensation. The “without compensation” approach only allows join reorderings that are valid under associative rules. Thus, the optimizer will not combine subplans using a join predicate whose EEL is not covered. The “with compensation” approach allows two subplans to be combined using the join predicate, when a join predicate's EEL is not covered, as long as the join predicate's NEL is covered. Compensation is performed through nullification and best match. Multiple compensations may be merged and performed at any time.
摘要翻译：在关系数据库管理系统（RDBMS）的自下而上优化器中，通过内部联接重新排列外部联结和反联合的优化技术。每个连接谓词与正常资格列表（NEL）相关联，包括在连接谓词中引用的表以及扩展资格列表（EEL），其中包括在冲突的连接谓词中引用的其他表。 EEL包括谓词所需的所有表，以保留原始查询的语义。在连接枚举期间，优化器确定连接谓词的EEL是否是要合并的两个子计划中的所有表的子集，即其EEL被覆盖。如果是这样，则使用连接谓词组合两个子计划。否则，两个子计划不能加入。两种方法用于重新排序：无补偿和补偿。 “无补偿”方法仅允许在关联规则下有效的连接重排序。因此，优化器不会使用不包括EEL的连接谓词来组合子计划。只要连接谓词的NEL被覆盖，“附加补偿”方法允许使用连接谓词组合两个子计划，当连接谓词的EEL不被覆盖时。赔偿通过无效和最佳匹配执行。可以随时合并和执行多重补偿。

4. 发明授权

US06389425B1 Embedded storage mechanism for structured data types 失效
标题翻译：结构化数据类型的嵌入式存储机制
公开(公告)号：US06389425B1
公开(公告)日：2002-05-14
申请号：US09112464
申请日：1998-07-09
申请人： Linda Gail DeMichiel , Gene Y. C. Fuh , Bruce Gilbert Lindsay , Nelson Mendonca Mattos , Brian Thinh-Vinh Tran , Yun Wang
发明人： Linda Gail DeMichiel , Gene Y. C. Fuh , Bruce Gilbert Lindsay , Nelson Mendonca Mattos , Brian Thinh-Vinh Tran , Yun Wang
IPC分类号： G06F1730
CPC分类号： G06F17/30607 , Y10S707/99932 , Y10S707/99933 , Y10S707/99943 , Y10S707/99944
摘要： A method, apparatus, and article of manufacture for a computer-implemented embedded storage mechanism for structured data types. A statement is stored in a database stored on a data storage device connected to a computer. At compile-time, specific methods for a structured data type are mapped to generic methods using parse trees. At run-time, an in-memory representation of the structured data type is generated using information conveyed in the parse trees. Then, linearization of the generated in-memory representation is performed.
摘要翻译：一种用于结构化数据类型的计算机实现的嵌入式存储机制的方法，装置和制品。语句存储在存储在与计算机连接的数据存储设备上的数据库中。在编译时，结构化数据类型的具体方法使用解析树映射到通用方法。在运行时，使用解析树中传达的信息生成结构化数据类型的内存中表示。然后，执行生成的存储器内表示的线性化。

5. 发明授权

US6105020A System and method for identifying and constructing star joins for execution by bitmap ANDing 失效
标题翻译：用于识别和构建星形连接以通过位图对准执行的系统和方法
公开(公告)号：US6105020A
公开(公告)日：2000-08-15
申请号：US415799
申请日：1999-10-11
申请人： Bruce Gilbert Lindsay , Eugene Jon Shekita , David Everett Simmen , Kaarel Truuvert
发明人： Bruce Gilbert Lindsay , Eugene Jon Shekita , David Everett Simmen , Kaarel Truuvert
IPC分类号： G06F17/30
CPC分类号： G06F17/30466 , G06F17/30471 , Y10S707/99932 , Y10S707/99933
摘要： A system and method for a relational database system for identifying star joins in a query and for breaking the query down for bitmap ANDing. The fact table of the star join is located, and cycles between and within dimension tables are broken. Then, the minimal set of tables necessary to execute the star join is identified, and the dimension tables that should appear in the bitmap ANDing plan are also identified. A bitmap ANDing plan is then generated, or, if the query does not qualify for bitmap ANDing, a conventional execution plan is generated.
摘要翻译：一种关系数据库系统的系统和方法，用于识别查询中的星形连接，并将查询中断用于位图“和”运算。星形连接的事实表位于，尺寸表之间和内部之间的循环被破坏。然后，确定执行星形连接所需的最小的一组表，并且还会识别出现在位图“安全”计划中的维度表。然后生成位图“和”计划，或者如果该查询不符合位图“与”功能，则会生成常规执行计划。

6. 发明授权

US5696973A Index-based method for supporting multimethod function overloading with compile-time type checking and run-time dispatch 失效
标题翻译：基于索引的方法，支持使用编译时类型检查和运行时调度的多方法函数重载
公开(公告)号：US5696973A
公开(公告)日：1997-12-09
申请号：US390886
申请日：1995-02-17
申请人： Rakesh Agrawal , Linda Gail DeMichiel , Bruce Gilbert Lindsay
发明人： Rakesh Agrawal , Linda Gail DeMichiel , Bruce Gilbert Lindsay
IPC分类号： G06F9/42 , G06F9/45
CPC分类号： G06F8/437 , G06F9/4431
摘要： Programming language systems commonly allow for the use of function calls within a body of program source code. Since function names are generally descriptive, it is sometimes the case that two different functions ("function instances") will have the same name, and be distinguishable by having either a different number of arguments ("arity"), or arguments of different types. Both at compile time and at run time, the possibility of error exists if there is a mismatch between the arguments required by a function and the arguments provided to the function by the function call. Methods and related apparatus, for use in programming language systems, are set forth which support compile-time type checking and run-time dispatch for overloaded functions in an environment supporting subtypes with multiple inheritance. At both compile time and run time, the method of the invention takes into consideration the types of all arguments of a function call, to select a proper function instance to execute, for a given function invocation. In accordance with the invention, a precedence ordering is made from among multiple function instances having the same name and arity. Furthermore, the methods contemplated by the invention identify at compile time the set of function instances which might be invoked due to subtype substitutions for the actual arguments. Since type errors on function invocations or variable assignments are usually indicative of a programming error, program reliability can be improved and faults that would otherwise result in run-time errors can be corrected through the use of the invention prior to program deployment.
摘要翻译：编程语言系统通常允许在程序源代码体内使用函数调用。由于函数名通常是描述性的，有时两种不同的函数（“函数实例”）将具有相同的名称，并且可以通过使用不同数量的参数（“arity”）或不同类型的参数来区分。在编译时和运行时，如果函数所需的参数与通过函数调用提供给函数的参数之间存在不匹配，则存在错误的可能性。阐述了在编程语言系统中使用的方法和相关设备，其支持在支持具有多重继承的子类型的环境中的重载函数的编译时类型检查和运行时调度。在编译时和运行时，本发明的方法考虑到函数调用的所有参数的类型，以便为给定的函数调用选择要执行的正确的函数实例。根据本发明，从具有相同名称和特征的多个功能实例中进行优先级排序。此外，本发明考虑的方法在编译时识别由于实际参数的子类型替换而可能调用的一组函数实例。由于功能调用或变量分配上的类型错误通常表示编程错误，因此程序可靠性可以提高，否则会导致运行时错误的故障可以在程序部署之前通过使用本发明来纠正。

7. 发明授权

US08910176B2 System for distributed task dispatch in multi-application environment based on consensus for load balancing using task partitioning and dynamic grouping of server instance 有权
标题翻译：基于使用任务分区和服务器实例的动态分组的负载平衡一致的多应用环境中的分布式任务分派系统
公开(公告)号：US08910176B2
公开(公告)日：2014-12-09
申请号：US12688337
申请日：2010-01-15
申请人： Bruce Gilbert Lindsay , Roger C. Raphael , Paul Sherwood Taylor
发明人： Bruce Gilbert Lindsay , Roger C. Raphael , Paul Sherwood Taylor
IPC分类号： G06F15/16 , G06F17/30 , G06F9/50
CPC分类号： G06F9/5011 , G06F9/505 , G06F9/5061 , G06F9/5066 , G06F9/5088 , G06F9/54 , G06F17/30345
摘要： A method and system for distributing tasks from an external application among concurrent database application server instances in a database system for optimum load balancing, based on consensus among the instances. Each application instance identifies a task partition ownership by those in a membership group based on a time window and generates a new membership group and partition ownership based on the current partition ownership. The instance makes the new membership group and partition ownership known to other members by recoding them in the membership table and partition map. Each participation by an instance in the membership group is identified by a random number. The new membership group and partition ownership are generated and adjusted based on an average partition allocation to achieve consensus among the instances.
摘要翻译：基于实例之间的一致性，用于在数据库系统中的并发数据库应用服务器实例之间从外部应用程序分发任务以实现最佳负载平衡的方法和系统。每个应用程序实例基于时间窗口标识成员组中的任务分区所有权，并根据当前分区所有权生成新的成员组和分区所有权。该实例通过在成员资格表和分区映射中对它们进行重新编码，使其他成员获得了新的成员组和分区所有权。会员组中的实例的每个参与由随机数来标识。根据平均分区分配生成和调整新成员组和分区所有权，以实现实例之间的一致。

8. 发明授权

US08738673B2 Index partition maintenance over monotonically addressed document sequences 有权
标题翻译：索引分区维护通过单调寻址的文档序列
公开(公告)号：US08738673B2
公开(公告)日：2014-05-27
申请号：US12875615
申请日：2010-09-03
申请人： Ronald Jason Barber , Harish Deshmukh , Ning Li , Bruce Gilbert Lindsay , Sridhar Rajagopalan , Roger C. Raphael , Eugene J. Shekita , Paul Sherwood Taylor
发明人： Ronald Jason Barber , Harish Deshmukh , Ning Li , Bruce Gilbert Lindsay , Sridhar Rajagopalan , Roger C. Raphael , Eugene J. Shekita , Paul Sherwood Taylor
IPC分类号： G06F17/30
CPC分类号： G06F17/30233 , G06F17/30584 , G06F17/30631
摘要： Provided are techniques for partitioning a physical index into one or more physical partitions; assigning each of the one or more physical partitions to a node in a cluster of nodes; for each received document, assigning an assigned-doc-ID comprising an integer document identifier; and, in response to assigning the assigned-doc-ID to a document, determining a cut-off of assignment of new documents to a current virtual-index-epoch comprising a first set of physical partitions and placing the new documents into a new virtual-index-epoch comprising a second set of physical partitions by inserting each new document to a specific one of the physical partitions in the second set using one or more functions that direct the placement based on one of the assigned-doc-id, a field value derived from a set of fields obtained from the document, and a combination of the assigned-doc-id and the field value.
摘要翻译：提供了用于将物理索引分割成一个或多个物理分区的技术; 将一个或多个物理分区中的每一个分配给节点簇中的节点; 对于每个接收到的文档，分配包括整数文档标识符的分配文档ID; 并且响应于将分配的文档ID分配给文档，确定新文档的分配到当前虚拟索引时期的截断，该当前虚拟索引时期包括第一组物理分区，并将新文档放入新的虚拟 - 指数 - 历元包括第二组物理分区，通过使用一个或多个基于所分配的文档ID中的一个来指导所述布局的功能，将每个新文档插入第二组中的特定一个物理分区从文档获得的一组字段中导出的值以及分配的doc-id和字段值的组合。

9. 发明授权

US06343288B1 Single pass space efficient system and method for generating an approximate quantile in a data set having an unknown size 失效
标题翻译：用于在具有未知尺寸的数据集中生成近似分位数的单遍空间有效系统和方法
公开(公告)号：US06343288B1
公开(公告)日：2002-01-29
申请号：US09268089
申请日：1999-03-12
申请人： Bruce Gilbert Lindsay , Gurmeet Singh Manku , Sridhar Rajagopalan
发明人： Bruce Gilbert Lindsay , Gurmeet Singh Manku , Sridhar Rajagopalan
IPC分类号： G06F1730
CPC分类号： G06F17/30539 , G06F2216/03 , Y10S707/99932 , Y10S707/99936 , Y10S707/99937 , Y10S707/99942
摘要： A space-efficient system and method for generating an approximate &phgr;-quantile data element of a data set in a single pass over the data set, without a priori knowledge of the size of the data set. The approximate &phgr;-quantile is guaranteed to lie within a user-specified approximation error &egr; of the true quantile being sought with a probability of at least 1−&dgr;, with &dgr; being a user-defined probability of failure. B buffers, each having a capacity of k elements, initially are filled with elements from the data set, with the values of b and k depending on approximation error e and the probability &dgr;. The buffers are then collapsed into an output buffer, with the remaining buffers then being refilled with elements, collapsed (along with the previous output buffer), and so on until the entire data set has been processed and a single output remains. The element of the output corresponding to the approximate quantile is then output as the approximate quantile. In later iterations (when the height of the tree is at least equal to a predetermined height that depends on &dgr; and &egr;), the data is sampled non-uniformly to populate the buffers to render the desired performance. Parallel processors can be used, with the final output buffers of the processors being sent to a collecting processor P0 as input buffers to the collecting processor P0.
摘要翻译：一种空间有效的系统和方法，用于在数据集中的单次传递中生成数据集的近似分位数据元素，而无需对数据集的大小的先验知识。大致的分位数被保证位于用至少1-delta的概率寻求的真实分位数的用户指定的近似误差εi中，其中Δ是用户定义的故障概率。每个具有k个元素的容量的B缓冲器最初由数据集中的元素填充，其中b和k的值取决于近似误差e和概率delta。缓冲区然后被折叠成输出缓冲区，剩余的缓冲区然后被元素重新填充（与先前的输出缓冲区一起），等等，直到整个数据集被处理并且保持单个输出。然后输出对应于近似分位数的输出元素作为近似分位数。在后面的迭代中（当树的高度至少等于取决于delta和epsi的预定高度时），数据被不均匀地采样以填充缓冲器以呈现期望的性能。可以使用并行处理器，处理器的最终输出缓冲器被发送到收集处理器P0作为到采集处理器P0的输入缓冲器。

10. 发明授权

US5960428A Star/join query optimization 失效
标题翻译：星号/加入查询优化
公开(公告)号：US5960428A
公开(公告)日：1999-09-28
申请号：US919739
申请日：1997-08-28
申请人： Bruce Gilbert Lindsay , Guy Maring Lohman , Mir Hamid Pirahesh , Eugene Jon Shekita , David Everett Simmen , Monica Sachiye Urata
发明人： Bruce Gilbert Lindsay , Guy Maring Lohman , Mir Hamid Pirahesh , Eugene Jon Shekita , David Everett Simmen , Monica Sachiye Urata
IPC分类号： G06F17/30
CPC分类号： G06F17/30466 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934
摘要： Unwieldy star/join queries are performed more efficiently using a filtered fact table. Suitable queries include star/join queries with a large fact table joined with multiple subsidiary dimension tables, where indices exist over fact table join columns. The query is analyzed to prepare a query plan for the dimension table accesses. This plan is supplemented by adding nested loop join operations, where the inner table is a dimension table plan and the outer table is an index scan performed over a fact table index of the join column with the dimension table. The plan is also supplemented by filtering records resulting from the nested loop joins using a sequence of dynamic bit vectors, ultimately yielding a list of probable fact table records. The plan is further supplemented by fetching these records to construct a distilled fact which is used, instead of the large original table, to execute the query in considerably less time. If desired, the supplemented query plan and other competing approaches may studied to provide cost estimates, with the least costly approach being actually implemented.
摘要翻译：使用已过滤的事实表，更有效地执行无故障的星号/连接查询。合适的查询包括带有多个附属维度表的大型事实表的星号/连接查询，其中索引存在于事实表连接列上。分析查询以准备维度表访问的查询计划。此计划通过添加嵌套循环连接操作来补充，其中内部表是维度表计划，外部表是在具有维度表的连接列的事实表索引上执行的索引扫描。该计划还补充了使用一系列动态位向量的嵌套循环连接过滤记录，最终产生可能的事实表记录的列表。该计划进一步补充了通过获取这些记录来构建一个使用的蒸馏事实，而不是大的原始表，在相当短的时间内执行查询。如果需要，可以研究补充的查询计划和其他竞争方法，以提供成本估算，最低成本的方法正在实际实施。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式