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

21. 发明授权

US07412429B1 Method for data classification by kernel density shape interpolation of clusters 有权
标题翻译：通过核心密度形状插值进行数据分类的方法
公开(公告)号：US07412429B1
公开(公告)日：2008-08-12
申请号：US11940739
申请日：2007-11-15
申请人： 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/00 , G06N5/00
CPC分类号： G06K9/6273 , G06K9/6226 , G06N99/005
摘要： A method for obtaining a shape interpolated representation of shapes of one or more clusters in an image of a dataset that has been clustered 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 in the image 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 of each grid point; and adding each grid point for which the maximum density estimate value exceeds a specified threshold to the cluster associated with the maximum density estimate value for the grid point to form a shape interpolated representation of the one or more clusters.
摘要翻译：一种用于获得已经聚类的数据集的图像中的一个或多个聚类的形状的形状插值表示的方法包括：以指定的分辨率生成从图像采样的一组网格点的每个网格点的密度估计值，图像中的每个簇使用核密度函数; 评估每个簇的每个网格点的密度估计值，以识别每个网格点的最大密度估计值和与每个网格点的最大密度估计值相关联的聚类; 以及将最大密度估计值超过特定阈值的每个网格点添加到与所述网格点的最大密度估计值相关联的聚类，以形成所述一个或多个聚类的形状插值表示。

22. 发明授权

US5930785A Method for detecting and optimizing queries with encoding/decoding tables 失效
标题翻译：用于使用编码/解码表检测和优化查询的方法
公开(公告)号：US5930785A
公开(公告)日：1999-07-27
申请号：US950674
申请日：1997-10-16
申请人： Guy M. Lohman , Bernhard Schiefer , Monica S. Urata
发明人： Guy M. Lohman , Bernhard Schiefer , Monica S. Urata
IPC分类号： G06F17/30
CPC分类号： G06F17/30466 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934
摘要： A join optimizer and method for a relational database management system including a data processor, a stored database, and a plurality of database relations, wherein one or more of the relations are retrieved by the processor by means of query commands by performing a plurality of join operations on the relations, the system employing a general purpose heuristic algorithm which excludes or defers Cartesian products as late in the join sequence as possible, the method includes the steps of determining, in association with the execution of, or preferably prior to executing the general purpose algorithm, whether tables referenced in a query command includes a hub table and at least two encoding tables related to the hub table and, when the query command references a hub table and at least two encoding tables, determining the best access plan for the hub table, determining whether the best access plan utilizes an index used to access the hub table and, if so, constructing a plan to join the encoding tables as Cartesian products, constructing a plan to join the hub table and the encoding tables and storing the plans in the data structures of the optimizer for enumeration with other access plans constructed by the optimizer.
摘要翻译：一种用于关系数据库管理系统的连接优化器和方法，包括数据处理器，存储的数据库和多个数据库关系，其中通过执行多个连接的处理器通过查询命令检索一个或多个关系所述系统对所述关系的操作，所述系统采用在尽可能晚地排除或延迟笛卡尔乘积的通用启发式算法，所述方法包括以下步骤：与所述一般的执行，或优选地在执行所述一般目的算法，查询命令中引用的表是否包括集线器表和至少两个与集线器表相关的编码表，当查询命令引用集线器表和至少两个编码表时，确定集线器的最佳访问计划表，确定最佳访问计划是否使用用于访问中心表的索引，如果是，则构建计划加入 e编码表作为笛卡尔乘积，构建加入集线器表和编码表的计划，并将计划存储在优化器的数据结构中，以便与优化器构建的其他访问计划进行枚举。

23. 发明申请

US20090271664A1 METHOD FOR MONITORING DEPENDENT METRIC STREAMS FOR ANOMALIES 有权
标题翻译：用于监测异常的相关公差流的方法
公开(公告)号：US20090271664A1
公开(公告)日：2009-10-29
申请号：US12110851
申请日：2008-04-28
申请人： Peter J. Haas , John M. Lake , Guy M. Lohman , Ashutosh Singh , Tanveer F. Syeda-Mahmood
发明人： Peter J. Haas , John M. Lake , Guy M. Lohman , Ashutosh Singh , Tanveer F. Syeda-Mahmood
IPC分类号： G06F11/00 , G06F17/30
CPC分类号： G06F11/008
摘要： A method for monitoring dependent metric streams for anomalies including identifying a plurality of sets of dependent metric streams from a plurality of metric streams of a computer system by measuring an association of the plurality of metric streams using a statistical dependency measure analysis, wherein each set includes a plurality of the dependent metric streams and each metric stream includes a plurality of data, determining a subset of the plurality of sets of dependent metric streams to monitor by selecting a quantity of the sets of dependent metric streams that have a highest statistical dependency, cleaning the data of each set of dependent metric streams of the subset by identifying and removing outlier data, fitting a probability density function to the cleaned data of each set of dependent metric streams of the subset, wherein the probability density function is a likelihood function that provides a likelihood of an occurrence of the cleaned data, determining a detection threshold that is a lower threshold on the likelihood of the occurrence of the cleaned data of each set of dependent metric streams of the subset based on the likelihood function, detecting an anomaly if a likelihood of an occurrence of a new data of one of the sets of dependent metric streams of the subset is less than the detection threshold, and transmitting an alert signal in response to detecting the anomaly.
摘要翻译：一种用于监视异常的相关度量流的方法，包括通过使用统计依赖度量度分析来测量多个度量流的关联来从计算机系统的多个度量流中识别多个独立度量流集合，其中每个集合包括多个依赖度量流和每个度量流包括多个数据，通过选择具有最高统计依赖性的依赖度量流集合的数量来确定多个依赖度量流集合的子集以进行监视通过识别和去除异常值数据，将概率密度函数拟合到子集的每组非依赖度量流中的清除数据，其中概率密度函数是提供清除数据的发生的可能性，确定检测阈值，其是基于似然函数发生子集的每组非依赖度量流的清除数据的可能性的较低阈值，如果发生了一组中的一个的新数据的可能性，则检测异常所述子集的依赖度量流小于所述检测阈值，并且响应于检测到所述异常而发送警报信号。

24. 发明申请

US20080162946A1 METHOD AND SYSTEM FOR CONTENT-BASED ENCRYPTED ACCESS TO A DATABASE 有权
标题翻译：用于基于内容的加密访问数据库的方法和系统
公开(公告)号：US20080162946A1
公开(公告)日：2008-07-03
申请号：US11617597
申请日：2006-12-28
申请人： Guy M. Lohman , Mark F. Wilding
发明人： Guy M. Lohman , Mark F. Wilding
IPC分类号： H04L9/32
CPC分类号： G06F21/6227
摘要： Some aspects of the invention provide methods, systems, and computer program products for inserting an encrypted problem signature into a symptom database. A problem signature is first provided, which is then used to derive a hash value. The problem signature is then encrypted using the hash value. The hash value is further used to indicate the location in the database to insert the problem signature. The problem signature is then inserted at the location in the database indicated by the location.
摘要翻译：本发明的一些方面提供了用于将加密的问题签名插入症状数据库的方法，系统和计算机程序产品。首先提供问题签名，然后将其用于导出哈希值。然后使用哈希值对问题签名进行加密。散列值进一步用于指示数据库中插入问题签名的位置。然后将问题签名插入位置指示的数据库中的位置。

25. 发明授权

US07392250B1 Discovering interestingness in faceted search 有权
标题翻译：发现有趣的搜索
公开(公告)号：US07392250B1
公开(公告)日：2008-06-24
申请号：US11876042
申请日：2007-10-22
申请人： Debabrata Dash , Guy M. Lohman , Nimrod Megiddo , Jun Rao
发明人： Debabrata Dash , Guy M. Lohman , Nimrod Megiddo , Jun Rao
IPC分类号： G06F17/30
CPC分类号： G06F17/30539 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99937 , Y10S707/99938 , Y10S707/99942 , Y10S707/99943 , Y10S707/99944
摘要： Exemplary embodiments of the present invention relate to enhanced faceted search support for OLAP queries over unstructured text as well as structured dimensions by the dynamic and automatic discovery of dimensions that are determined to be most “interesting” to a user based upon the data. Within the exemplary embodiments “interestingness” is defined as how surprising a summary along some dimensions is from a user's expectation. Further, multi-attribute facets are determined and a user is optionally permitted to specify the distribution of values that she expects, and/or the distance metric by which actual and expected distributions are to be compared.
摘要翻译：本发明的示例性实施例涉及通过基于数据被确定为对用户最“有趣”的维度的动态和自动发现的针对非结构化文本的OLAP查询的增强的分面搜索支持以及结构化维度。在示例性实施例中，“兴趣”被定义为从用户的期望来看，某些维度上的摘要令人惊讶。此外，确定多属性小平面，并且可选地允许用户指定她期望的值的分布，和/或要比较实际和预期分布的距离度量。

26. 发明授权

US07281004B2 Method, system and program for optimizing compression of a workload processed by a database management system 有权
标题翻译：用于优化由数据库管理系统处理的工作负载的压缩的方法，系统和程序
公开(公告)号：US07281004B2
公开(公告)日：2007-10-09
申请号：US10788583
申请日：2004-02-27
申请人： Sam S. Lightstone , Guy M. Lohman , Ivan Popivanov , Jun Rao , Adam J. Storm , Daniele C. Zilio
发明人： Sam S. Lightstone , Guy M. Lohman , Ivan Popivanov , Jun Rao , Adam J. Storm , Daniele C. Zilio
IPC分类号： G06F17/30
CPC分类号： G06F17/3046 , Y10S707/99934
摘要： The present invention provides a method, system and program for optimizing compression of a workload processed by a database management system. In an embodiment of the present invention a method of optimizing the compression of database workloads is provided. Initially, an estimate of a cost of execution for each query according to a defined metric such as execution time or memory consumption is determined. A sub-set of queries is then selected from the workload in order of the most costly to least costly relative to the defined metric for compression according to either a predetermined compression threshold percentage or a threshold percentage derived from an allotted workload execution time. Compression is then performed on the selected sub-set of queries (i.e. those that will benefit the most from the compression) to achieve a net beneficial trade-off between the cost of workload compression and the cost of workload execution.
摘要翻译：本发明提供一种用于优化由数据库管理系统处理的工作负载的压缩的方法，系统和程序。在本发明的实施例中，提供了优化数据库工作负载的压缩的方法。首先，确定根据诸如执行时间或存储器消耗的定义的度量的每个查询的执行成本的估计。然后根据预定的压缩阈值百分比或从分配的工作负载执行时间导出的阈值百分比，从工作负荷中选择相对于定义的压缩度量最贵的成本最低的成本的子集。然后对所选择的查询子集（即将从压缩中获益最多的那些）执行压缩，以实现工作负载压缩成本与工作负载执行成本之间的净有益权衡。

27. 发明授权

US09875280B2 Efficient partitioned joins in a database with column-major layout 有权
公开(公告)号：US09875280B2
公开(公告)日：2018-01-23
申请号：US13594200
申请日：2012-08-24
申请人： 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.

28. 发明授权

US09535940B2 Intra-block partitioning for database management 有权
标题翻译：用于数据库管理的块内分区
公开(公告)号：US09535940B2
公开(公告)日：2017-01-03
申请号：US13599007
申请日：2012-08-30
申请人： Ronald J. Barber , Min-Soo Kim , Sam S. Lightstone , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
发明人： Ronald J. Barber , Min-Soo Kim , Sam S. Lightstone , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
IPC分类号： G06F17/30
CPC分类号： G06F17/30315 , G06F17/30584
摘要： A method for storing database information includes storing a table having data values in a column major order. The data values are stored in a list of blocks. The method also includes assigning a tuple sequence number (TSN) to each data value in each column of the table according to a sequence order in the table. The data values that correspond to each other across a plurality of columns of the table have equivalent TSNs. The method also includes assigning each data value to a partition based on a representation of the data value. The method also includes assigning a tuple map value to each data value. The tuple map value identifies the partition in which each data value is located.
摘要翻译：用于存储数据库信息的方法包括以列主要顺序存储具有数据值的表。数据值存储在块列表中。该方法还包括根据表中的序列顺序向表的每列中的每个数据值分配元组序列号（TSN）。在表的多个列上彼此对应的数据值具有等效的TSN。该方法还包括基于数据值的表示将每个数据值分配给分区。该方法还包括为每个数据值分配元组映射值。元组映射值标识每个数据值所在的分区。

29. 发明申请

US20140006380A1 EFFICIENT PARTITIONED JOINS IN A DATABASE WITH COLUMN-MAJOR LAYOUT 审中-公开
标题翻译：数据库中高效的分层连接与主要布局
公开(公告)号：US20140006380A1
公开(公告)日：2014-01-02
申请号：US13594200
申请日：2012-08-24
申请人： 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光标随机读取表值，从而达到原始顺序。

30. 发明申请

US20130325901A1 INTRA-BLOCK PARTITIONING FOR DATABASE MANAGEMENT 审中-公开
标题翻译：数据库管理的内部分区
公开(公告)号：US20130325901A1
公开(公告)日：2013-12-05
申请号：US13599007
申请日：2012-08-30
申请人： Ronald J. Barber , Min-Soo Kim , Sam S. Lightstone , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
发明人： Ronald J. Barber , Min-Soo Kim , Sam S. Lightstone , Guy M. Lohman , Lin Qiao , Vijayshankar Raman , Eugene J. Shekita , Richard S. Sidle
IPC分类号： G06F17/30
CPC分类号： G06F17/30315 , G06F17/30584
摘要： A method for storing database information, including: storing a table having data values in a column major order, wherein the data values are stored in a list of blocks, assigning a tuple sequence number (TSN) to each data value in each column of the table according to a sequence order in the table, wherein data values that correspond to each other across a plurality of columns of the table have equivalent TSNs; assigning each data value to a partition based on a representation of the data value; and assigning a tuple map value to each data value, wherein the tuple map value identifies the partition in which each data value is located.
摘要翻译：一种用于存储数据库信息的方法，包括：存储具有列主要顺序的数据值的表，其中数据值被存储在块列表中，将元组序列号（TSN）分配给每个列的每个列中的每个数据值根据表中的序列顺序表，其中在表的多个列上彼此对应的数据值具有等效的TSN; 基于数据值的表示将每个数据值分配给分区; 以及向每个数据值分配元组映射值，其中所述元组映射值标识每个数据值所在的分区。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式