公开(公告)号：US20070067274A1

公开(公告)日：2007-03-22

申请号：US11228888

申请日：2005-09-16

申请人： Wei Han ,  Inderpal Narang ,  Vijayshankar Raman

发明人： Wei Han ,  Inderpal Narang ,  Vijayshankar Raman

IPC分类号： G06F17/30

CPC分类号： G06F16/2456

摘要： Disclosed are a method and a system for executing a query that requires an expensive process, such as a join, between two or more datasets. If each dataset has multiple partitions that are located at multiple sources, then each of the multiple partitions for each dataset must be unioned prior to completing execution of the query. The method and system develop both a query execution plan and at least one alternative query execution plan to indicate when the process should be pushed down below the unions and when the process should be pulled up above the unions based on collocation of partitions. The query execution plan and the alternative query execution plan(s) are embedded in a composite query execution plan which is evaluated and re-evaluated at run time to determine which of the query execution plan and the alternative query execution plan is currently the most efficient plan and the query is executed, accordingly.

摘要翻译： 公开了一种执行查询的方法和系统，该查询需要在两个或更多个数据集之间的昂贵的处理，诸如连接。 如果每个数据集具有位于多个源的多个分区，则在完成执行查询之前，必须对每个数据集的每个分区进行联合。 该方法和系统开发查询执行计划和至少一个替代查询执行计划，以指示何时将流程推送到工会下方，以及何时应该根据分区的搭配将工作提升到工会以上。 查询执行计划和替代查询执行计划嵌入在复合查询执行计划中，该计划在运行时进行评估和重新评估，以确定查询执行计划和备用查询执行计划中的哪一个当前是最有效的 相应地执行计划并执行查询。

公开(公告)号：US20070294323A1

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

申请号：US11848304

申请日：2007-08-31

申请人： Inderpal Narang ,  Vijayshankar Raman ,  Peter Schwarz

发明人： Inderpal Narang ,  Vijayshankar Raman ,  Peter Schwarz

IPC分类号： G06F17/30

CPC分类号： G06F17/30575 ,  Y10S707/99933 ,  Y10S707/99955

摘要： A system, method, and program storage device implementing the method, for integrating data in a database management system, wherein the method comprises grouping data sources and replicas of the data sources that provide analogous data into a common logical domain; writing application queries against the common logical domain; selecting a correct set of replicas of the data sources and a query-execution strategy for combining a content of the correct set of replicas of the data sources in order to answer the application queries according to query-cost-based optimization; selecting a correct set of data sources according to run-time constraints; shielding the application queries from changes to the data sources by dynamically binding the application queries against the correct sets of data sources and replicas of the data sources; and processing the application queries by generating an optimum query result based on the steps of grouping and shielding.

摘要翻译： 实现该方法的系统，方法和程序存储设备，用于将数据集成在数据库管理系统中，其中该方法包括将提供类似数据的数据源的数据源和副本分组到公共逻辑域中; 针对公共逻辑域编写应用程序查询; 选择正确的数据源副本和用于组合数据源的正确的副本集合的内容的查询执行策略，以便根据基于查询成本的优化来应答应用查询; 根据运行时限制选择正确的数据源集合; 通过将应用程序查询与数据源的正确数据源和副本集合动态绑定来屏蔽应用程序查询对数据源的更改; 并通过基于分组和屏蔽的步骤产生最佳查询结果来处理应用查询。

公开(公告)号：US20070067664A1

公开(公告)日：2007-03-22

申请号：US11231204

申请日：2005-09-20

申请人： Bruce Lindsay ,  Inderpal Narang ,  Vijayshankar Raman

发明人： Bruce Lindsay ,  Inderpal Narang ,  Vijayshankar Raman

IPC分类号： G06F11/00

CPC分类号： G06F11/1482

摘要： Embodiments herein present a method, computer program product, etc. for masking data failures. The method comprises storing a single master copy of data and a replica copy of the data. Next, the method performs writes to the master using a middleware component. Reads are then performed from either the master or the replica using the middleware component. When the master is unavailable, the writes are stored in a table located in the middleware component as stored write requests, wherein the stored write requests comprise UDI's to be made to the master. The reads are also performed from the table and the replica when the master is unavailable. When the master becomes available, the stored write requests are propagated to the master. Thus, by storing the write requests in the table, the middleware allows the writes to run during times when the master is unavailable.

摘要翻译： 本文的实施例提供了用于掩蔽数据故障的方法，计算机程序产品等。 该方法包括存储数据的单个主副本和数据的副本副本。 接下来，该方法使用中间件组件执行向主机的写入。 然后使用中间件组件从主机或副本执行读取。 当主机不可用时，写入被存储在位于中间件组件中的表中作为存储的写入请求，其中所存储的写入请求包括要对主机进行的UDI。 当主机不可用时，也从表和副本执行读取。 当主机可用时，存储的写入请求被传播到主机。 因此，通过将写入请求存储在表中，中间件允许写入在主机不可用的时间内运行。

公开(公告)号：US20050044088A1

公开(公告)日：2005-02-24

申请号：US10645221

申请日：2003-08-21

申请人： Bruce Lindsay ,  Inderpal Narang ,  Vijayshankar Raman

发明人： Bruce Lindsay ,  Inderpal Narang ,  Vijayshankar Raman

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

CPC分类号： G06F17/30578

摘要： A system and method of lightweight asynchronous data replication that avoids the need for any persistent store at the replication source or communication channel, and is independent of the underlying data formats, wherein the method of data replication comprises replicating deltas from a source, embedding replication tracking information in the replicated deltas, wherein the tracking information comprises a timestamp and a sequence number, and applying deltas at a target. The tracking information is used to ensure that each delta is applied exactly once. In the event of a crash in the system, the target analyzes the tracking information to determine which deltas have been applied, and requests retransmission of replicated data from the source starting from the earliest unapplied delta. The source and target are treated as only delta producers and consumers, and as such the invention is applicable to replication between arbitrary data source formats.

摘要翻译： 轻量级异步数据复制的系统和方法，避免了复制源或通信通道上任何持久存储的需要，并且独立于底层数据格式，其中数据复制的方法包括从源复制三角形，嵌入复制跟踪 复制三角形中的信息，其中所述跟踪信息包括时间戳和序列号，以及在目标上应用三角形。 跟踪信息用于确保每个增量都应用一次。 在系统崩溃的情况下，目标分析跟踪信息以确定已应用哪些增量，并且从最早未应用的增量开始从源发送重传数据。 源和目标仅被视为增量生成器和消费者，因此本发明适用于任意数据源格式之间的复制。

公开(公告)号：US20060047721A1

公开(公告)日：2006-03-02

申请号：US10931002

申请日：2004-08-31

申请人： Inderpal Narang ,  Vijayshankar Raman ,  Peter Schwarz

发明人： Inderpal Narang ,  Vijayshankar Raman ,  Peter Schwarz

IPC分类号： G06F17/30

CPC分类号： G06F17/30575 ,  Y10S707/99933 ,  Y10S707/99955

摘要： A system, method, and program storage device implementing the method, for integrating data in a database management system, wherein the method comprises grouping data sources and replicas of the data sources that provide analogous data into a common logical domain; writing application queries against the common logical domain; selecting a correct set of replicas of the data sources and a query-execution strategy for combining a content of the correct set of replicas of the data sources in order to answer the application queries according to query-cost-based optimization; selecting a correct set of data sources according to run-time constraints; shielding the application queries from changes to the data sources by dynamically binding the application queries against the correct sets of data sources and replicas of the data sources; and processing the application queries by generating an optimum query result based on the steps of grouping and shielding.

摘要翻译： 实现该方法的系统，方法和程序存储设备，用于将数据集成在数据库管理系统中，其中该方法包括将提供类似数据的数据源的数据源和副本分组到公共逻辑域中; 针对公共逻辑域编写应用程序查询; 选择正确的数据源副本和用于组合数据源的正确的副本集合的内容的查询执行策略，以便根据基于查询成本的优化来应答应用查询; 根据运行时限制选择正确的数据源集合; 通过将应用程序查询与数据源的正确数据源和副本集合动态绑定来屏蔽应用程序查询对数据源的更改; 并通过基于分组和屏蔽的步骤产生最佳查询结果来处理应用查询。

公开(公告)号：US08676865B2

公开(公告)日：2014-03-18

申请号：US12123598

申请日：2008-05-20

申请人： Wei Han ,  Lin Qiao ,  Vijayshankar Raman

发明人： Wei Han ,  Lin Qiao ,  Vijayshankar Raman

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

CPC分类号： G06F17/30958

摘要： A query processing method intersects two or more unsorted lists based on a conjunction of predicates. Each list comprises a union of multiple sorted segments. The method performs lazy segment merging and an adaptive n-ary intersecting process. The lazy segment merging comprises starting with each list being a union of completely unmerged segments, such that lookups into a given list involve separate lookups into each segment of the given list. The method intersects the lists according to the predicates while performing the lazy segment merging, such that the lazy segment merging reads in only those portions of each segment that are needed for the intersecting. As the intersecting proceeds and the lookups are performed, the intersecting selectively merges the segments together, based on a cost-benefit analysis of the cost of merging compared to the benefit produced by reducing a number of lookups.

摘要翻译： 查询处理方法基于谓词的连接与两个或多个未排序的列表相交。 每个列表包括多个排序段的并集。 该方法执行延迟段合并和自适应n元相交处理。 懒惰段合并包括从每个列表开始，这些列是完全未合并的段的并集，使得到给定列表中的查找涉及到给定列表的每个段的单独查找。 该方法在执行延迟段合并时根据谓词与列表相交，使得懒惰段合并仅读取相交所需的每个段的那些部分。 当相交进行和查找被执行时，相交的选择性地将段合在一起，基于与合并成本的成本效益分析相比，通过减少多个查找产生的收益。

公开(公告)号：US07885953B2

公开(公告)日：2011-02-08

申请号：US11866907

申请日：2007-10-03

申请人： Ying-lin Chen ,  You-Chin Fuh ,  Wei Han ,  Fen-Ling Lin ,  Inderpal Singh Narang ,  Lin Qiao ,  Vijayshankar Raman ,  Kouhorng Allen Yang

发明人： Ying-lin Chen ,  You-Chin Fuh ,  Wei Han ,  Fen-Ling Lin ,  Inderpal Singh Narang ,  Lin Qiao ,  Vijayshankar Raman ,  Kouhorng Allen Yang

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

CPC分类号： G06F17/30498

摘要： A method, storage server, and computer readable medium for off-loading star-join operations from a host information processing system to a storage server. At least a first and second set of keys from a first and second dimension table, respectively are received from a host system. Each of the first and second set of keys is associated with at least one fact table. A set of locations associated with a set of foreign key indexes are received from the host system. A set of fact table indexes are traversed. At least a first set of Row Identifiers (“RIDs”) associated with the first set of keys and at least a second set of RIDs associated with the second set of keys are identified. An operation is performed on the first and second sets of RIDs to identify an intersecting set of RIDs. The intersecting set of RIDs are then stored.

摘要翻译： 一种用于从主机信息处理系统到存储服务器的卸载星形连接操作的方法，存储服务器和计算机可读介质。 分别从主机系统接收来自第一和第二维度表的至少第一和第二组密钥。 第一组和第二组中的每一个与至少一个事实表相关联。 从主机系统接收与一组外键索引相关联的一组位置。 遍历一组事实表索引。 识别与第一组密钥相关联的至少第一组行标识符（“RID”）和与第二组密钥相关联的至少第二组RID。 对第一和​​第二组RID执行操作以识别RID的交叉集合。 然后存储相交的RID集合。

公开(公告)号：US20080059489A1

公开(公告)日：2008-03-06

申请号：US11512769

申请日：2006-08-30

申请人： Wei Han ,  Inderpal Singh Narang ,  Vijayshankar Raman

发明人： Wei Han ,  Inderpal Singh Narang ,  Vijayshankar Raman

IPC分类号： G06F7/00

CPC分类号： G06F9/5066 ,  G06F16/245 ,  G06F16/2455

摘要： A method is provided for query processing in a grid computing infrastructure. The method entails storing data in a data storage system accessible to a plurality of computing nodes. Computationally-expensive query operations are identified and query fragments are allocated to individual nodes according to computing capability. The query fragments are independently executed on individual nodes. The query fragment results are combined into a final query result.

摘要翻译： 提供了一种用于网格计算基础设施中的查询处理的方法。 该方法需要将数据存储在多个计算节点可访问的数据存储系统中。 识别计算昂贵的查询操作，并根据计算能力将查询片段分配给各个节点。 查询片段在各个节点上独立执行。 查询片段结果组合成最终查询结果。

公开(公告)号：US20090292714A1

公开(公告)日：2009-11-26

申请号：US12123598

申请日：2008-05-20

申请人： Wei Han ,  Lin Qiao ,  Vijayshankar Raman

发明人： Wei Han ,  Lin Qiao ,  Vijayshankar Raman

IPC分类号： G06F17/30

CPC分类号： G06F17/30958

摘要： A query processing method intersects two or more unsorted lists based on a conjunction of predicates. Each list comprises a union of multiple sorted segments. The method performs lazy segment merging and an adaptive n-ary intersecting process. The lazy segment merging comprises starting with each list being a union of completely unmerged segments, such that lookups into a given list involve separate lookups into each segment of the given list. The method intersects the lists according to the predicates while performing the lazy segment merging, such that the lazy segment merging reads in only those portions of each segment that are needed for the intersecting. As the intersecting proceeds and the lookups are performed, the intersecting selectively merges the segments together, based on a cost-benefit analysis of the cost of merging compared to the benefit produced by reducing a number of lookups.

摘要翻译： 查询处理方法基于谓词的连接与两个或多个未排序的列表相交。 每个列表包括多个排序段的并集。 该方法执行延迟段合并和自适应n元相交处理。 懒惰段合并包括从每个列表开始，这些列是完全未合并的段的并集，使得到给定列表中的查找涉及到给定列表的每个段的单独查找。 该方法在执行延迟段合并时根据谓词与列表相交，使得懒惰段合并仅读取相交所需的每个段的那些部分。 当相交进行和查找被执行时，相交的选择性地将段合在一起，基于与合并成本的成本效益分析相比，通过减少多个查找产生的收益。

公开(公告)号：US20090094258A1

公开(公告)日：2009-04-09

申请号：US11866907

申请日：2007-10-03

申请人： YING-LIN CHEN ,  You-Chin Fuh ,  Wei Han ,  Fen-Ling Lin ,  Inderpal Singh Narang ,  Lin Qiao ,  Vijayshankar Raman ,  Kouhorng Allen Yang

发明人： YING-LIN CHEN ,  You-Chin Fuh ,  Wei Han ,  Fen-Ling Lin ,  Inderpal Singh Narang ,  Lin Qiao ,  Vijayshankar Raman ,  Kouhorng Allen Yang

IPC分类号： G06F7/00

CPC分类号： G06F17/30498

摘要： A method, storage server, and computer readable medium for off-loading star-join operations from a host information processing system to a storage server. At least a first and second set of keys from a first and second dimension table, respectively are received from a host system. Each of the first and second set of keys is associated with at least one fact table. A set of locations associated with a set of foreign key indexes are received from the host system. A set of fact table indexes are traversed. At least a first set of Row Identifiers (“RIDs”) associated with the first set of keys and at least a second set of RIDs associated with the second set of keys are identified. An operation is performed on the first and second sets of RIDs to identify an intersecting set of RIDs. The intersecting set of RIDs are then stored.

摘要翻译： 一种用于从主机信息处理系统到存储服务器的卸载星形连接操作的方法，存储服务器和计算机可读介质。 分别从主机系统接收来自第一和第二维度表的至少第一和第二组密钥。 第一组和第二组中的每一个与至少一个事实表相关联。 从主机系统接收与一组外键索引相关联的一组位置。 遍历一组事实表索引。 识别与第一组密钥相关联的至少第一组行标识符（“RID”）和与第二组密钥相关联的至少第二组RID。 对第一和​​第二组RID执行操作以识别RID的交叉集合。 然后存储相交的RID集合。