会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 41. 发明授权
    • Workload analysis tool for relational databases
    • 关系数据库的工作负载分析工具
    • US07281013B2
    • 2007-10-09
    • US10161397
    • 2002-06-03
    • Surajit ChaudhuriVivek NarasayyaOmer Zaki
    • Surajit ChaudhuriVivek NarasayyaOmer Zaki
    • G06F17/30
    • G06F17/30595Y10S707/958Y10S707/99932Y10S707/99942
    • A method for providing workload information in a structured workload information data structure format that is organized according to a workload schema to be conducive to a given end usage of the information. The structured workload information can be made accessible using standard database analytical server applications to facilitate ad-hoc querying of the structured workload information to summarize and analyze the database workload or to facilitate exchange of workload information. A structured workload information (SWI) is constructed according to a SWI schema to facilitate a desired end usage of the workload information. The query information is extracted from the workload and stored in a structured workload information (SWI) data structure according to the schema based on the desired end usage of the information such as ad hoc querying or information exchange. The query information may be stored in a relational database having query information organized as a central fact table and a collection of hierarchical dimension tables or as an OLAP cube featuring hierarchical dimensions that arrange the query information in dimensions having objects ordered as a function of granularity or the information may be stored according to an XML schema wherein units of query information are separated by XML tags that identify a type of workload information.
    • 一种用于以结构化工作负载信息数据结构格式提供工作负载信息的方法,所述结构化工作负载信息数据结构格式根据工作负载模式被组织以有利于信息的给定最终使用。 结构化工作负载信息可以使用标准数据库分析服务器应用程序进行访问,以便于对结构化工作负载信息进行即席查询,以总结和分析数据库工作负载或促进工作负载信息的交换。 根据SWI模式构建结构化工作负载信息(SWI),以便于工作负载信息的期望的最终使用。 从工作负载中提取查询信息,并根据信息的期望最终使用情况,根据模式,将其存储在结构化工作负载信息(SWI)数据结构中,例如即席查询或信息交换。 查询信息可以存储在具有被组织为中心事实表和分层维度表的集合的查询信息的关系数据库中,或者作为具有分层维度的OLAP多维数据集,OLAP多维数据集将维度中的查询信息排列成具有作为粒度的函数排列的对象,或者 可以根据XML模式存储信息,其中查询信息的单位由标识工作负载信息类型的XML标签分隔。
    • 42. 发明授权
    • Linear programming approach to assigning benefit to database physical design structures
    • 线性规划方法为数据库物理设计结构分配利益
    • US07139778B2
    • 2006-11-21
    • US10186821
    • 2002-06-28
    • Surajit ChaudhuriVivek NarasayyaMayur Datar
    • Surajit ChaudhuriVivek NarasayyaMayur Datar
    • G06F17/30
    • G06F17/30595Y10S707/954Y10S707/99931Y10S707/99932
    • In a relational database system, a set of physical design structures is enumerated that optimizes database performance over a given workload consisting of workload entries that include queries and updates that have been executed against the database. An individual benefit is calculated for each candidate structure relevant to a given workload entry and these individual benefits are summed over the entries in the workload examined thus far. A workload entry is selected from the workload and a set of candidate structures relevant to the workload entry is identified. A benefit is assigned to each of the candidate structures by 1) evaluating the workload entry in the presence of subsets of candidate structures to obtain an actual benefit for each subset of candidate structures; 2) forming a set of constraints on the structure benefits of candidate structures based on the actual benefits determined for each subset of candidate structures; and 3) determining the individual benefit of each candidate structure by resolving the constraints. The set of physical design structures is enumerated based on the determined benefit for each candidate structure.
    • 在关系数据库系统中,枚举了一组物理设计结构,其优化了数据库性能,该特定工作负载包括工作负载条目,其中包括针对数据库执行的查询和更新。 对于与给定工作量条目相关的每个候选结构计算个人福利,并且将这些个人福利归结于迄今为止审查的工作量中的条目。 从工作负载中选择工作负载条目,并识别与工作负载条目相关的一组候选结构。 通过以下方式分配每个候选结构的好处:1)在存在候选结构子集的情况下评估工作量项,以获得候选结构的每个子集的实际利益; 2)根据为候选结构的每个子集确定的实际收益,形成一组对候选结构的结构利益的约束; 和3)通过解决约束来确定每个候选结构的个人利益。 基于每个候选结构的确定好处列举了一套物理设计结构。
    • 46. 发明授权
    • Index merging for database systems
    • 索引合并数据库系统
    • US06169983A
    • 2001-01-02
    • US09087617
    • 1998-05-30
    • Surajit ChaudhuriVivek Narasayya
    • Surajit ChaudhuriVivek Narasayya
    • G06F1730
    • G06F17/30336Y10S707/99932Y10S707/99933Y10S707/99935
    • An index merge tool helps form, for use by a database server in accessing a database in accordance with a workload of queries, an index configuration or set of indexes that consumes relatively less storage space. The index merge tool identifies from an initial set of indexes one or more combinations of two or more indexes on the same table of the database and merges each identified combination of indexes to form a merged set of indexes. The index merge tool identifies and merges each combination of indexes by identifying and merging one pair of indexes at a time. The index merge tool uses the merged set of indexes as the index configuration for use in executing queries against the database so long as the storage saved by the merged set of indexes exceeds a threshold amount and so long as any increase in the cost to execute queries against the database using the merged set of indexes is limited. Otherwise, the index merge tool uses the initial set of indexes as the index configuration.
    • 索引合并工具有助于形成数据库服务器根据查询的工作负载访问数据库,使用索引配置或索引集合来消耗相对较少的存储空间。 索引合并工具从初始索引集中识别数据库同一表上的两个或多个索引的一个或多个组合,并合并每个已标识的索引组合以形成一组合并的索引。 索引合并工具通过一次识别和合并一对索引来识别和合并索引的每个组合。 索引合并工具使用合并的索引集作为用于对数据库执行查询的索引配置,只要合并的索引集合保存的存储超过阈值量,并且只要执行查询的成本增加 使用合并的索引集对数据库进行限制。 否则,索引合并工具将使用初始索引集作为索引配置。
    • 49. 发明授权
    • Key profile computation and data pattern profile computation
    • 关键轮廓计算和数据模式轮廓计算
    • US07720883B2
    • 2010-05-18
    • US11769050
    • 2007-06-27
    • Zhimin ChenVenkatesh GantiGunjan JhaShriraghav KaushikVivek Narasayya
    • Zhimin ChenVenkatesh GantiGunjan JhaShriraghav KaushikVivek Narasayya
    • G06F7/00G06F17/30
    • G06F17/30536
    • Architecture that provides a data profile computation technique which employs key profile computation and data pattern profile computation. Key profile computation in a data table includes both exact keys as well as approximate keys, and is based on key strengths. A key strength of 100% is an exact key, and any other percentage in an approximate key. The key strength is estimated based on the number of table rows that have duplicated attribute values. Only column sets that exceed a threshold value are returned. Pattern profiling identifies a small set of regular expression patterns which best describe the patterns within a given set of attribute values. Pattern profiling includes three phases: a first phases for determining token regular expressions, a second phase for determining candidate regular expressions, and a third phase for identifying the best regular expressions of the candidates that match the attribute values.
    • 提供采用关键轮廓计算和数据模式轮廓计算的数据轮廓计算技术的架构。 数据表中的关键轮廓计算包括精密键和近似键,并且基于关键优点。 100%的关键优势是一个确切的关​​键,其中一个关键的任何其他百分比。 基于具有重复的属性值的表行的数量来估计关键强度。 只返回超过阈值的列集。 模式分析标识一组最佳描述一组给定属性值中的模式的正则表达式模式。 模式分析包括三个阶段:用于确定令牌正则表达式的第一阶段,用于确定候选正则表达式的第二阶段,以及用于识别与属性值匹配的候选的最佳正则表达式的第三阶段。
    • 50. 发明申请
    • DATA PROFILE COMPUTATION
    • 数据配置文件计算
    • US20090006392A1
    • 2009-01-01
    • US11769050
    • 2007-06-27
    • Zhimin ChenVenkatesh GantiGunjan JhaShriraghav KaushikVivek Narasayya
    • Zhimin ChenVenkatesh GantiGunjan JhaShriraghav KaushikVivek Narasayya
    • G06F7/06G06F17/30
    • G06F17/30536
    • Architecture that provides a data profile computation technique which employs key profile computation and data pattern profile computation. Key profile computation in a data table includes both exact keys as well as approximate keys, and is based on key strengths. A key strength of 100% is an exact key, and any other percentage in an approximate key. The key strength is estimated based on the number of table rows that have duplicated attribute values. Only column sets that exceed a threshold value are returned. Pattern profiling identifies a small set of regular expression patterns which best describe the patterns within a given set of attribute values. Pattern profiling includes three phases: a first phases for determining token regular expressions, a second phase for determining candidate regular expressions, and a third phase for identifying the best regular expressions of the candidates that match the attribute values.
    • 提供采用关键轮廓计算和数据模式轮廓计算的数据轮廓计算技术的架构。 数据表中的关键轮廓计算包括精密键和近似键,并且基于关键优点。 100%的关键优势是一个确切的关​​键,其中一个关键的任何其他百分比。 基于具有重复的属性值的表行的数量来估计关键强度。 只返回超过阈值的列集。 模式分析标识一组最佳描述一组给定属性值中的模式的正则表达式模式。 模式分析包括三个阶段:用于确定令牌正则表达式的第一阶段,用于确定候选正则表达式的第二阶段,以及用于识别与属性值匹配的候选的最佳正则表达式的第三阶段。