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

1. 发明授权

US07007006B2 Method for recommending indexes and materialized views for a database workload 失效
公开(公告)号：US07007006B2
公开(公告)日：2006-02-28
申请号：US10177007
申请日：2002-06-21
申请人： Daniel C. Zilio , Gary G. Valentin , Guy M. Lohman , Calisto P. Zuzarte , Roberta J. Cochrane , Hamid Pirahesh , Markos Zaharioudakis , Kit Man Cheung , Kevin S. Beyer , David E. Simmen , Ting Y. Leung , Samuel S. Lightstone
发明人： Daniel C. Zilio , Gary G. Valentin , Guy M. Lohman , Calisto P. Zuzarte , Roberta J. Cochrane , Hamid Pirahesh , Markos Zaharioudakis , Kit Man Cheung , Kevin S. Beyer , David E. Simmen , Ting Y. Leung , Samuel S. Lightstone
IPC分类号： G06F17/30
CPC分类号： G06F17/30312 , Y10S707/99932 , Y10S707/99934 , Y10S707/99935
摘要： The invention herein provides method and apparatus, including software for determining a set of materialized views or indices of the contents or a subset of the contents of a database in a data processing system to be created for one or more users of the database. The method and apparatus provide method and means for evaluating a workload presented by a user to the database; evaluating the data processing system characteristics; evaluating the database characteristics; and, using the above evaluations for recommending a set of suitable materialized views or indices to the user. Another aspect of the invention, which may be used for a workload presented by a user of a database in a data processing system, provides method and apparatus, including software for determining a set of materialized views or indices of the contents or a subset of the contents of the database, by: generating a plurality of materialized view candidates from evaluation of the workload, data processing system characteristics and database characteristics; estimating statistics for the materialized view candidates such as the number of rows, row size, and column statistics; generating a plurality of potential index candidates by evaluating the workload, data processing system characteristics, database characteristics and the materialized view candidates; and, from the materialized view candidates and index candidates selecting a set of suitable materialized views and/or indices for submission to the user.

2. 发明授权

US5548758A Optimization of SQL queries using early-out join transformations of column-bound relational tables 失效
标题翻译：使用列关联表的早期连接变换优化SQL查询
公开(公告)号：US5548758A
公开(公告)日：1996-08-20
申请号：US463968
申请日：1995-06-05
申请人： Mir H. Pirahesh , Ting Y. Leung , Guy M. Lohman , Eugene J. Shekita , David E. Simmen
发明人： Mir H. Pirahesh , Ting Y. Leung , Guy M. Lohman , Eugene J. Shekita , David E. Simmen
IPC分类号： G06F17/30
CPC分类号： G06F17/30454 , Y10S707/99932 , Y10S707/99935
摘要： A method and apparatus for optimizing SQL queries in a relational database management system uses early-out join transformations. An early-out join comprises a many-to-one existential join, wherein the join scans an inner table for a match for each row of the outer table and terminates the scan for each row of the outer table when a single match is found in the inner table. To transform a many-to-many join to an early-out join, the query must include a requirement for distinctiveness, either explicitly or implicitly, in one or more result columns for the join operation. Distinctiveness can be specified using the DISTINCT keyword in the SELECT clause or can be implied from the predicates present in the query. The early-out join transformation also requires that no columns of the inner table be referenced after the join, or if an inner table column is referenced after the join, that each referenced column be "bound". A referenced column can be bound in one of three ways: (1) an inner table column can be bound to a constant through an equality predicate, (2) an inner table column can be bound to an outer table column, or (3) an inner table column can be bound to a correlated value, wherein the correlated value originates outside the query block. In all three cases, an inner table column can be bound through the transitivity of equality predicates.
摘要翻译：用于优化关系数据库管理系统中的SQL查询的方法和装置使用早期连接变换。早期连接包括多对一存在连接，其中，连接扫描内部表以获取外部表的每一行的匹配，并且当找到单个匹配时终止外部表的每一行的扫描内表。要将多对多连接转换为早期连接，查询必须在连接操作的一个或多个结果列中明确或隐式地包含独特性的要求。可以使用SELECT子句中的DISTINCT关键字指定不同之处，也可以从查询中存在的谓词中暗示。早期连接转换还要求在连接之后不引用内部列的列，或者如果在连接之后引用了内部列列，则每个引用的列都将被“绑定”。引用的列可以通过三种方式之一来绑定：（1）内表列可以通过相等谓词绑定到常量，（2）内表列可绑定到外表列，或（3）可以将内表列绑定到相关值，其中相关值起始于查询块之外。在所有三种情况下，内表列可以通过相等谓词的传递性来约束。

3. 发明授权

US5548754A Optimization of SQL queries using early-out join transformations 失效
标题翻译：使用Early-out连接变换优化SQL查询
公开(公告)号：US5548754A
公开(公告)日：1996-08-20
申请号：US385177
申请日：1995-02-07
申请人： Mir H. Pirahesh , Ting Y. Leung , Guy M. Lohman , Eugene J. Shekita , David E. Simmen
发明人： Mir H. Pirahesh , Ting Y. Leung , Guy M. Lohman , Eugene J. Shekita , David E. Simmen
IPC分类号： G06F17/30
CPC分类号： G06F17/30454 , Y10S707/99932 , Y10S707/99935
摘要： A method and apparatus for optimizing SQL queries in a relational database management system uses early-out join transformations. An early-out join comprises a many-to-one existential join, wherein the join scans an inner table for a match for each row of the outer table and terminates the scan for each row of the outer table when a single match is found in the inner table. To transform a many-to-many join to an early-out join, the query must include a requirement for distinctiveness, either explicitly or implicitly, in one or more result columns for the join operation. Distinctiveness can be specified using the DISTINCT keyword in the SELECT clause or can be implied from the predicates present in the query. The early-out join transformation also requires that no columns of the inner table be referenced after the join, or if an inner table column is referenced after the join, that each referenced column be "bound". A referenced column can be bound in one of three ways: (1) an inner table column can be bound to a constant through an equality predicate, (2) an inner table column can be bound to an outer table column, or (3) an inner table column can be bound to a correlated value, wherein the correlated value originates outside the query block. In all three cases, an inner table column can be bound through the transitivity of equality predicates.
摘要翻译：用于优化关系数据库管理系统中的SQL查询的方法和装置使用早期连接变换。早期连接包括多对一存在连接，其中，连接扫描内部表以获取外部表的每一行的匹配，并且当找到单个匹配时终止外部表的每一行的扫描内表。要将多对多连接转换为早期连接，查询必须在连接操作的一个或多个结果列中明确或隐式地包含独特性的要求。可以使用SELECT子句中的DISTINCT关键字指定不同之处，也可以从查询中存在的谓词中暗示。早期连接转换还要求在连接之后不引用内部列的列，或者如果在连接之后引用了内部列列，则每个引用的列都将被“绑定”。引用的列可以通过三种方式之一来绑定：（1）内表列可以通过相等谓词绑定到常量，（2）内表列可绑定到外表列，或（3）可以将内表列绑定到相关值，其中相关值起始于查询块之外。在所有三种情况下，内表列可以通过相等谓词的传递性来约束。

4. 发明授权

US07085751B2 Query execution in query processing systems 失效
标题翻译：在查询处理系统中查询执行
公开(公告)号：US07085751B2
公开(公告)日：2006-08-01
申请号：US09757427
申请日：2001-01-10
申请人： Ian R. Finlay , Bruce G. Lindsay , Guy M. Lohman , David C. Sharpe , Daniel C. Zilio
发明人： Ian R. Finlay , Bruce G. Lindsay , Guy M. Lohman , David C. Sharpe , Daniel C. Zilio
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30477 , Y10S707/954 , Y10S707/99931 , Y10S707/99933 , Y10S707/99943
摘要： A query processing system having a data manager, and a query manager also includes a buffer. The query manager calls the data manager to access data based on a query. Where there is no predicate check or consumption operation on the record accessed, the data manager will notionally return the record to the query manager. However, the data manager accomplishes the return by writing the relevant portions of the record to a buffer. The data manager maintains stabilization of the page containing the record while the buffer is being written to. The data manager continues to access records on the stabilized page and to write such records to the buffer where appropriate. The query manager retrieves the records from the buffer after the data manager has completed its operation resulting from the query manager call.
摘要翻译：具有数据管理器和查询管理器的查询处理系统还包括缓冲器。查询管理器根据查询调用数据管理器访问数据。在访问记录上没有谓词检查或消费操作的情况下，数据管理器将会将记录返回给查询管理器。然而，数据管理器通过将记录的相关部分写入缓冲器来完成返回。在缓冲区被写入时，数据管理器维护包含记录的页面的稳定性。数据管理器继续访问稳定页面上的记录，并在适当时将此类记录写入缓冲区。在数据管理器完成由查询管理器调用产生的操作之后，查询管理器从缓冲区中检索记录。

5. 发明申请

US20080222087A1 System and Method for Optimizing Query Access to a Database Comprising Hierarchically-Organized Data 审中-公开
标题翻译：用于优化对包含分层有组织数据的数据库的查询访问的系统和方法
公开(公告)号：US20080222087A1
公开(公告)日：2008-09-11
申请号：US11383481
申请日：2006-05-15
申请人： Andrey Balmin , Tom Eliaz , Guy M. Lohman , David E. Simmen , Chun Zhang
发明人： Andrey Balmin , Tom Eliaz , Guy M. Lohman , David E. Simmen , Chun Zhang
IPC分类号： G06F17/30
CPC分类号： G06F16/8365
摘要： An cost based optimizer optimizes access to at least a portion of hierarchically-organized documents, such as those formatted using eXtensible Markup Language (XML), by estimating a number of results produced by the access of the hierarchically-organized documents. Estimating the number of results comprises computing the cardinality of each operator executing query language expressions and further computing a sequence size of sequences of hierarchically-organized nodes produced by the query language expressions. Access to the hierarchically-organized documents is optimized using the structure of the query expression and/or path statistics involving the hierarchically-organized data. The cardinality and the sequence size are used to calculate a cost estimation for execution of alternate query execution plans. Based on the cost estimation, an optimal query execution plan is selected from among the alternate query execution plans.
摘要翻译：基于成本的优化器通过估计由分级组织的文档的访问产生的结果的数量来优化对至少部分分层组织的文档的访问，例如使用可扩展标记语言（XML）格式化的文档。估计结果的数量包括计算执行查询语言表达的每个运算符的基数，并进一步计算由查询语言表达式产生的分层组织节点的序列的序列大小。使用涉及层次组织的数据的查询表达式和/或路径统计量的结构来优化对层级组织的文档的访问。基数和序列大小用于计算执行备用查询执行计划的成本估算。基于成本估算，从备用查询执行计划中选择最优查询执行计划。

6. 发明授权

US08838551B2 Multi-level database compression 有权
标题翻译：多级数据库压缩
公开(公告)号：US08838551B2
公开(公告)日：2014-09-16
申请号：US13278330
申请日：2011-10-21
申请人： Thomas Fanghaenel , Uttam Jain , Quanzhong Li , Guy M. Lohman , Richard S. Sidle , Ioana R. Stanoi , Robbert Van der Linden
发明人： Thomas Fanghaenel , Uttam Jain , Quanzhong Li , Guy M. Lohman , Richard S. Sidle , Ioana R. Stanoi , Robbert Van der Linden
IPC分类号： G06F17/30
CPC分类号： G06F17/30336
摘要： Embodiments of the invention relate to a multi-level database compression technique to compress table data objects stored in pages. A compact dictionary structure is encoded that represents frequent values of data at any level of granularity. More than one level of compression is provided, wherein input to a finer level of granularity is an output of a coarser level of granularity. Based upon the encoded dictionary structure, a compression technique is applied to a stored page to compress each row on the page. Similarly, a de-compression technique may be applied to decompress the compressed data, utilizing the same dictionary structures at each level of granularity.
摘要翻译：本发明的实施例涉及用于压缩存储在页面中的表数据对象的多级数据库压缩技术。编码紧凑型字典结构，代表任何粒度级别的频繁值数据。提供了多于一个级别的压缩，其中更精细的粒度级别的输入是较粗的粒度级别的输出。基于编码字典结构，将压缩技术应用于存储的页面以压缩页面上的每一行。类似地，可以应用解压缩技术来解压缩压缩数据，在每个粒度级利用相同的字典结构。

7. 发明申请

US20090132594A1 DATA CLASSIFICATION BY KERNEL DENSITY SHAPE INTERPOLATION OF CLUSTERS 有权
标题翻译： KERNEL密度形状数据分类插值
公开(公告)号：US20090132594A1
公开(公告)日：2009-05-21
申请号：US12142949
申请日：2008-06-20
申请人： Tanveer Syeda-Mahmood , Peter J. Haas , John M. Lake , Guy M. Lohman
发明人： Tanveer Syeda-Mahmood , Peter J. Haas , John M. Lake , Guy M. Lohman
IPC分类号： G06F17/30
CPC分类号： G06K9/6273 , G06K9/6226 , G06N99/005
摘要： A data processing system is provided that comprises a processor, a random access memory for storing data and programs for execution by the processor, and computer readable instructions stored in the random access memory for execution by the processor to perform a method for obtaining a shape interpolated representation of shapes of clusters in an image of a clustered dataset. The method comprises generating a density estimate value of each grid point of a set of grid points sampled from the image at a specified resolution for each cluster using a kernel density function; evaluating the density estimate value of each grid point for each cluster to identify a maximum density estimate value of each grid point and a cluster associated with the maximum density estimate value; and adding each grid point for which the maximum density estimate value exceeds a specified threshold to the associated cluster to form a shape interpolated representation.
摘要翻译：提供了一种数据处理系统，其包括处理器，用于存储用于由处理器执行的数据和程序的随机存取存储器以及存储在随机存取存储器中的计算机可读指令，以供处理器执行以执行用于获得内插形状的方法聚类数据集的图像中的聚类形状的表示。该方法包括使用核密度函数，以每个簇的特定分辨率从图像采样的一组网格点的每个网格点的密度估计值; 评估每个簇的每个网格点的密度估计值，以识别每个网格点的最大密度估计值和与最大密度估计值相关联的簇; 并将最大密度估计值超过规定阈值的每个网格点添加到相关联的簇以形成形状插值表示。

8. 发明申请

US20090132568A1 DATA CLASSIFICATION BY KERNEL DENSITY SHAPE INTERPOLATION OF CLUSTERS 有权
标题翻译： KERNEL密度形状数据分类插值
公开(公告)号：US20090132568A1
公开(公告)日：2009-05-21
申请号：US12164532
申请日：2008-06-30
申请人： Tanveer Syeda-Mahmood , Peter J. Haas , John M. Lake , Guy M. Lohman
发明人： Tanveer Syeda-Mahmood , Peter J. Haas , John M. Lake , Guy M. Lohman
IPC分类号： G06F17/30
CPC分类号： G06K9/6273 , G06K9/6226 , G06N99/005
摘要： A method for representing a dataset comprises clustering the dataset using an unsupervised, non-parametric clustering method to generate a set of clusters each comprising a set of data points in an image; clustering the data points of each cluster using a supervised, partitional clustering method to partition each cluster into a specified number of sub-clusters; generating a density estimate value of each grid point of a set of grid points sampled from the image at a specified resolution for each sub-cluster using a kernel density function; identifying a maximum density estimate value and a sub-cluster associated with the maximum density estimate value for the grid point; adding each grid point for which the maximum density estimate value exceeds a specified threshold to the sub-cluster associated with the maximum density estimate value; and, for each cluster, merging the sub-clusters of the cluster into a corresponding cluster region in the image.
摘要翻译：一种用于表示数据集的方法包括使用无监督的非参数聚类方法对所述数据集进行聚类，以生成每组包括图像中的一组数据点的一组聚类; 使用受监督的分段聚类方法对每个集群的数据点进行聚类，以将每个集群分成指定数量的子集群; 使用核密度函数生成以每个子群体以指定分辨率从图像采样的一组网格点的每个网格点的密度估计值; 识别最大密度估计值和与所述网格点的最大密度估计值相关联的子簇; 将最大密度估计值超过特定阈值的每个网格点添加到与最大密度估计值相关联的子簇; 并且对于每个集群，将集群的子集合合并到图像中的相应集群区域中。

9. 发明授权

US07519227B1 Finding structures in multi-dimensional spaces using image-guided clustering 失效
标题翻译：使用图像引导聚类在多维空间中寻找结构
公开(公告)号：US07519227B1
公开(公告)日：2009-04-14
申请号：US12168547
申请日：2008-07-07
申请人： Tanveer Syeda-Mahmood , Peter J. Haas , John M. Lake , Guy M. Lohman
发明人： Tanveer Syeda-Mahmood , Peter J. Haas , John M. Lake , Guy M. Lohman
IPC分类号： G06K9/62 , G06F7/00 , G06F17/00 , G06F17/30
CPC分类号： G06K9/6219 , Y10S707/99933 , Y10S707/99945
摘要： A method executed on a computer for determining a hierarchical clustering of a multidimensional dataset in a multidimensional image space comprises receiving a pyramid of multidimensional images of the multidimensional dataset in which the images of the pyramid representing a first multidimensional image of the multidimensional dataset at successively lower resolution levels; identifying data clusters at each resolution level of the pyramid by applying a set of perceptual grouping constraints; plotting a variation curve of a magnitude of data clusters identified at each resolution level of the pyramid as a function of resolution level; and generating a clustering hierarchy for the multidimensional dataset by identifying the resolution level at each salient bend in the variation curve as a level of the clustering hierarchy.
摘要翻译：在计算机上执行的用于确定多维图像空间中的多维数据集的分层聚类的方法包括：接收所述多维数据集的多维图像的金字塔，其中所述金字塔的图像表示所述多维数据集的第一多维图像，并且连续地较低分辨率水平; 通过应用一组感知分组约束来识别金字塔的每个分辨率级别的数据集群; 绘制在金字塔的每个分辨率级别识别的数据簇的大小的变化曲线作为分辨率水平的函数; 以及通过将变化曲线中的每个突出弯曲处的分辨率水平识别为聚类层级的级别来为多维数据集生成聚类层级。

10. 发明授权

US09355146B2 Efficient partitioned joins in a database with column-major layout 有权
标题翻译：数据库中的高级分区连接与列主要布局
公开(公告)号：US09355146B2
公开(公告)日：2016-05-31
申请号：US13537745
申请日：2012-06-29
申请人： Stefan Arndt , Gopi K. Attaluri , Ronald J. Barber , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
发明人： Stefan Arndt , Gopi K. Attaluri , Ronald J. Barber , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
IPC分类号： G06F17/30
CPC分类号： G06F17/30486 , G06F17/30315 , G06F17/3033 , G06F17/30466 , G06F17/30498
摘要： Embodiments of the present invention provide a database processing system for efficient partitioning of a database table with column-major layout for executing one or more join operations. One embodiment comprises a method for partitioning a database table with column-major layout, partitioning only the join-columns by limiting the partitions by size and number, executing one or more join operations for joining the partitioned columns, and optionally de-partitioning the join result to the original order by sequentially writing and randomly reading table values using P cursors.
摘要翻译：本发明的实施例提供了一种数据库处理系统，用于对具有用于执行一个或多个连接操作的列主要布局的数据库表进行高效分区。一个实施例包括用于对具有列主要布局的数据库表进行分区的方法，仅通过限制分区的大小和数量来分隔连接列，执行用于加入分区列的一个或多个连接操作，以及可选地去分割连接通过顺序写入并使用P光标随机读取表值，从而达到原始顺序。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式