会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Method, system and computer program for inserting records into a database
    • 用于将记录插入数据库的方法,系统和计算机程序
    • US07860845B2
    • 2010-12-28
    • US11781841
    • 2007-07-23
    • Zhimin ChenLinqi LiuXiaoyan QianSerge Philippe Rielau
    • Zhimin ChenLinqi LiuXiaoyan QianSerge Philippe Rielau
    • G06F7/00
    • G06F17/30377Y10S707/99953
    • For a data processing system having memory for storing a database, a method, a system and a computer program product for directing the data processing system to process a record to be inserted into the database is disclosed. The database includes a plurality of base tables. The method includes the steps of making a record copy matching the record, for each base table to be selected from the plurality of base tables: providing a base table candidate indication for a selected base table, the base table candidate indication indicating whether the selected base table is a candidate base table that may receive the record, the base table candidate indication being determined on an outcome of executing before triggers and an outcome of testing constraints in association with the record copy, the before triggers and the constraints being associated with the selected base table; and restoring the record copy so that the record copy matches the record before providing a next subsequent base table candidate indication for another base table to be selected.
    • 对于具有用于存储数据库的存储器的数据处理系统,公开了一种用于指导数据处理系统处理要插入数据库的记录的方法,系统和计算机程序产品。 数据库包括多个基表。 该方法包括以下步骤:对于从多个基表中选择的每个基表,制作与记录相匹配的记录拷贝:为所选择的基表提供基表候选指示,所述基表候选指示指示所选基数 表是可以接收记录的候选基表,基于表的候选指示是根据在触发之前执行的结果确定的,以及与记录副本相关联的测试约束的结果,前触发和约束与所选择的相关联 基地台 以及恢复所述记录副本,使得所述记录副本与为所选择的另一基表提供下一个后续基表候选指示之前匹配所述记录。
    • 5. 发明申请
    • 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%的关键优势是一个确切的关​​键,其中一个关键的任何其他百分比。 基于具有重复的属性值的表行的数量来估计关键强度。 只返回超过阈值的列集。 模式分析标识一组最佳描述一组给定属性值中的模式的正则表达式模式。 模式分析包括三个阶段:用于确定令牌正则表达式的第一阶段,用于确定候选正则表达式的第二阶段,以及用于识别与属性值匹配的候选的最佳正则表达式的第三阶段。
    • 6. 发明申请
    • SYSTEM AND COMPUTER PROGRAM FOR INSERTING RECORDS INTO A DATABASE
    • 将记录插入数据库的系统和计算机程序
    • US20080140689A1
    • 2008-06-12
    • US12020462
    • 2008-01-25
    • Zhimin ChenLinqi LiuXiaoyan QianSerge Philippe Rielau
    • Zhimin ChenLinqi LiuXiaoyan QianSerge Philippe Rielau
    • G06F7/00
    • G06F17/30377Y10S707/99953
    • For a data processing system having memory for storing a database, a method, a system and a computer program product for directing the data processing system to process a record to be inserted into the database is disclosed. The database includes a plurality of base tables. The method includes the steps of making a record copy matching the record, for each base table to be selected from the plurality of base tables: providing a base table candidate indication for a selected base table, the base table candidate indication indicating whether the selected base table is a candidate base table that may receive the record, the base table candidate indication being determined on an outcome of executing before triggers and an outcome of testing constraints in association with the record copy, the before triggers and the constraints being associated with the selected base table; and restoring the record copy so that the record copy matches the record before providing a next subsequent base table candidate indication for another base table to be selected.
    • 对于具有用于存储数据库的存储器的数据处理系统,公开了一种用于指导数据处理系统处理要插入数据库的记录的方法,系统和计算机程序产品。 数据库包括多个基表。 该方法包括以下步骤:对于从多个基表中选择的每个基表,制作与记录相匹配的记录拷贝:为所选择的基表提供基表候选指示,所述基表候选指示指示所选基数 表是可以接收记录的候选基表,基于表的候选指示是根据在触发之前执行的结果确定的,以及与记录副本相关联的测试约束的结果,前触发和约束与所选择的相关联 基地台 以及恢复所述记录副本,使得所述记录副本与为所选择的另一基表提供下一个后续基表候选指示之前匹配所述记录。
    • 7. 发明申请
    • Efficient computation of multiple group by queries
    • 通过查询高效计算多组
    • US20060253422A1
    • 2006-11-09
    • US11124516
    • 2005-05-06
    • Vivek NarasayyaZhimin Chen
    • Vivek NarasayyaZhimin Chen
    • G06F17/30
    • G06F16/24535
    • Systems and methodologies for computation of multiple group by queries via an optimizer that examines the space of plans in a systematic and cost based manner. The optimizer includes a merging component to merge pairs of sub plans to facilitate a plan choice with a lowest cost. The merging component can take as input two sub plans (e.g., sub plan P1 with root node V1 and sub plan P2 with root node V2, wherein each sub plan is a sub-tree of a logical plan whose root node is directly pointed to a Relation “R”), to return a set of sub-plans as out put with a root node V1∪V2 that is the smallest relation from which both V1 and V2 can be computed.
    • 用于通过查询计算多组的系统和方法,该优化器以系统和成本为基础的方式检查计划的空间。 优化器包括合并组件以合并子计划对,以便以最低成本进行计划选择。 合并组件可以将根节点V <1>和子计划P <2> 的子计划(例如,子计划P&lt; 1&lt; 1&gt; 节点V 2,其中每个子计划是逻辑计划的子树,其根节点直接指向关系“R”),以返回一组子计划,如与 作为V SUB 1和V 2 2两者之间的最小关系的根节点V 1 2 V 2 2&lt; 1&lt; 1&lt; 计算。
    • 10. 发明授权
    • 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%的关键优势是一个确切的关​​键,其中一个关键的任何其他百分比。 基于具有重复的属性值的表行的数量来估计关键强度。 只返回超过阈值的列集。 模式分析标识一组最佳描述一组给定属性值中的模式的正则表达式模式。 模式分析包括三个阶段:用于确定令牌正则表达式的第一阶段,用于确定候选正则表达式的第二阶段,以及用于识别与属性值匹配的候选的最佳正则表达式的第三阶段。