公开(公告)号：US20070005657A1

公开(公告)日：2007-01-04

申请号：US11171129

申请日：2005-06-30

Applicant: Philip Bohannon ,  Wenfei Fan

Inventor： Philip Bohannon ,  Wenfei Fan

IPC: G06F17/30

CPC classification number: G06F16/8373

Abstract: Methods and apparatus are provided for processing updates to an XML document. Updates are converted into one or more complement queries that can be performed on the XML document. The complement queries provided by the present invention allow (i) virtual views of XML data to be updated; (ii) updates and queries to be composed; and (iii) the XML document to be updated using an XML query engine. The XML document can be recursively processed to determine for each node whether the node is affected by the update and implementing the update at the affected nodes.

Abstract translation: 提供了用于处理对XML文档的更新的方法和装置。 更新被转换成可以在XML文档上执行的一个或多个补码查询。 由本发明提供的补码查询允许（i）更新XML数据的虚拟视图; （ii）要组成的更新和查询; 和（iii）使用XML查询引擎更新的XML文档。 可以递归处理XML文档，以确定每个节点是否受更新影响，并在受影响的节点上实施更新。

公开(公告)号：US20060155743A1

公开(公告)日：2006-07-13

申请号：US11025846

申请日：2004-12-29

Applicant: Philip Bohannon ,  Wenfei Fan ,  Michael Flaster ,  Rajeev Rastogi

Inventor： Philip Bohannon ,  Wenfei Fan ,  Michael Flaster ,  Rajeev Rastogi

IPC: G06F17/30

CPC classification number: G06F17/30371 ,  G06F17/3051

Abstract: Methods and apparatus are provided for identifying constraint violation repairs in data that is comprised of a plurality of records, where each record has a plurality of cells. A database is processed, based on a plurality of constraints that data in the database must satisfy. At least one constraint violation to be resolved is identified based on a cost of repair and the corresponding records to be resolved and equivalent cells are identified in the data that violate the identified at least one constraint violation. A value for each of the equivalent cells can optionally be determined, and the determined value can be assigned to each of the equivalent cells. The at least one constraint violation selected for resolution may be, for example, the constraint violation with a lowest cost. The cost of repairing a constraint is based on a distance metric between the attributes values.

Abstract translation: 提供了用于识别由多个记录组成的数据中的约束违规修复的方法和装置，其中每个记录具有多个单元。 基于数据库中的数据必须满足的多个约束来处理数据库。 基于修复成本和要解析的相应记录以及违反所识别的至少一个约束违规的数据中识别等价小区来识别要解决的至少一个约束违规。 可以可选地确定每个等效单元的值，并且可以将确定的值分配给每个等效单元。 选择用于解决的至少一个约束违反可以是例如具有最低成本的约束违反。 修复约束的成本基于属性值之间的距离度量。

公开(公告)号：US20060143557A1

公开(公告)日：2006-06-29

申请号：US11022894

申请日：2004-12-27

Applicant: Chee-Yong Chan ,  Wenfei Fan ,  Minos Garofalakis

Inventor： Chee-Yong Chan ,  Wenfei Fan ,  Minos Garofalakis

IPC: G06F17/21

CPC classification number: G06F17/30938 ,  G06F21/6245 ,  Y10S707/99939 ,  Y10S707/99945

Abstract: Method for providing controlled access to an XML document includes defining at least one access control policy for a user of the XML document, deriving a security view of the XML document for the user based upon said access control policy and schema level processing of the XML document and translating a user query based on the security view of the XML document to an equivalent query based on the XML document. An apparatus for same includes means for defining an access control policy for a user of the XML document and means for deriving a security view of the XML document for the user based on said access control policy and schema level processing of the XML document. Also included are means for translating a user query based on the security view of the XML document to an equivalent query based on the XML document.

Abstract translation: 提供对XML文档的受控访问的方法包括为XML文档的用户定义至少一个访问控制策略，基于XML文档的所述访问控制策略和模式级处理，为用户导出XML文档的安全视图 并将基于XML文档的安全视图的用户查询转换为基于XML文档的等效查询。 用于其的装置包括用于为XML文档的用户定义访问控制策略的装置以及用于基于XML文档的所述访问控制策略和模式级别处理来导出用户的XML文档的安全视图的装置。 还包括用于将基于XML文档的安全视图的用户查询翻译为基于XML文档的等效查询的装置。

公开(公告)号：US20050278368A1

公开(公告)日：2005-12-15

申请号：US11095344

申请日：2005-03-31

Applicant: Michael Benedikt ,  Wenfei Fan ,  Rajeev Rastogi

Inventor： Michael Benedikt ,  Wenfei Fan ,  Rajeev Rastogi

IPC: G06F17/22 ,  G06F17/30

CPC classification number: G06F17/227 ,  G06F16/84

Abstract: A framework is provided for integrating data from multiple relational sources into an XML document that both conforms to a given DTD and satisfies predefined XML constraints. The framework is based on a specification language, designated Attribute Integration Grammar (AIG), that extends a DTD by (1) associating element types with semantic attributes, (2) computing these attributes via parameterized SQL queries over multiple data sources, and (3) incorporating XML keys and inclusion constraints. The AIG uniquely operates on semantic attributes and their dependency relations for controlling context-dependent, DTD-directed construction of XML documents, and, as well as checks XML constraints in parallel with document-generation.

Abstract translation: 提供了一个框架，用于将来自多个关系源的数据集成到符合给定DTD并满足预定义XML约束的XML文档中。 该框架基于指定语言，指定的属性集成语法（AIG），其通过（1）将元素类型与语义属性相关联来扩展DTD，（2）通过多个数据源通过参数化SQL查询计算这些属性，以及（3 ）结合XML密钥和包含约束。 AIG独特地操作语义属性及其依赖关系，用于控制与文档相关的依赖于DTD的XML文档的构建，以及与文档生成并行检查XML约束。

公开(公告)号：US08429202B2

公开(公告)日：2013-04-23

申请号：US12474686

申请日：2009-05-29

Applicant: Wenfei Fan ,  Ming Xiong

Inventor： Wenfei Fan ,  Ming Xiong

IPC: G06F17/30

CPC classification number: G06F17/30306

Abstract: Methods and apparatus are provided for propagating functional dependencies with conditions. Propagation covers are computed using an SPC view of a dataset, wherein the SPC view comprises selection, projection and Cartesian product operations. Selection operations are processed to extract equivalence classes. Cartesian product operations are processed to obtain a renamed set of the plurality of conditional functional dependencies, that have attributes appearing in the SPC view. Domain constraints from the equivalence classes are applied to the renamed set to remove attributes not in the SPC view. Projection operations are processed using a reduction by resolution procedure to identify inferences that can be propagated to the SPC view from the conditional functional dependencies having attributes that do not appear in the SPC view. Domain constraints of the equivalence classes are converted to conditional functional dependencies; and a minimal cover of the SPC view is determined.

Abstract translation: 提供了用于在条件下传播功能依赖性的方法和装置。 使用数据集的SPC视图来计算传播封面，其中SPC视图包括选择，投影和笛卡尔乘积运算。 处理选择操作以提取等价类。 处理笛卡尔产品操作以获得具有出现在SPC视图中的属性的多个条件功能依赖性的重命名集合。 来自等价类的域约束应用于重命名的集合，以删除不在SPC视图中的属性。 投影操作使用解决度过程进行缩减处理，以识别可从具有不出现在SPC视图中的属性的条件功能依赖性传播到SPC视图的推论。 等价类的域约束转换为条件函数依赖; 并确定SPC视图的最小封面。

公开(公告)号：US20100250596A1

公开(公告)日：2010-09-30

申请号：US12411935

申请日：2009-03-26

Applicant: Wenfei Fan ,  Ming Xiong

Inventor： Wenfei Fan ,  Ming Xiong

IPC: G06F17/30

CPC classification number: G06F16/215

Abstract: Methods and apparatus are provided for discovering minimal conditional functional dependencies (CFDs). CFDs extend functional dependencies by supporting patterns of semantically related constants, and can be used as rules for cleaning relational data. A disclosed CFDMiner algorithm, based on techniques for mining closed itemsets, discovers constant minimal CFDs. A disclosed CTANE algorithm discovers general minimal CFDs based on the levelwise approach. A disclosed FastCFD algorithm discovers general minimal CFDs based on a depth-first search strategy, and an optimization technique via closed-itemset mining to reduce search space.

Abstract translation: 提供了用于发现最小条件函数依赖性（CFDs）的方法和装置。 CFDs通过支持语义相关常数的模式来扩展功能依赖性，并可用作清除关系数据的规则。 基于挖掘封闭项集的技术，公开的CFDMiner算法可以发现不变的最小CFD。 公开的CTANE算法基于水平方法发现一般的最小差分分析。 所公开的FastCFD算法基于深度优先搜索策略发现一般最小CFD，并通过封闭项目集挖掘来优化技术以减少搜索空间。

公开(公告)号：US20090006302A1

公开(公告)日：2009-01-01

申请号：US11771103

申请日：2007-06-29

Applicant: Wenfei Fan ,  Floris Geerts ,  Xibei Jia ,  Anastasios Kementsietsidis

Inventor： Wenfei Fan ,  Floris Geerts ,  Xibei Jia ,  Anastasios Kementsietsidis

IPC: G06N7/00 ,  G06F17/30

CPC classification number: G06F17/30303

Abstract: Methods and apparatus are provided for detecting data inconsistencies. Methods are disclosed for determining whether a set of conditional functional dependencies are consistent; determining a minimal cover of a set of conditional functional dependencies and detecting a violation of one or more conditional functional dependencies in a set of conditional functional dependencies. The conditional functional dependencies comprise one or more constraints that data in a database must satisfy including at least one pattern with data values.

Abstract translation: 提供了检测数据不一致的方法和装置。 公开了用于确定一组条件功能依赖性是否一致的方法; 确定一组条件功能依赖性的最小覆盖并且检测在一组条件功能依赖性中的一个或多个条件功能依赖性的违反。 条件功能依赖性包括数据库中的数据必须满足的一个或多个约束，包括至少一个具有数据值的模式。

公开(公告)号：US20080059439A1

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

申请号：US11468533

申请日：2006-08-30

Applicant: Wenfei Fan ,  Rajeev Rastogi

Inventor： Wenfei Fan ,  Rajeev Rastogi

IPC: G06F17/30

CPC classification number: G06F17/2205 ,  G06F16/8358 ,  G06F16/86 ,  G06F17/2229 ,  G06F17/2247

Abstract: The invention provides a system and method for translating XPATH queries into SQL queries with a simple least fixpoint (LFP) operator, which is already supported by most commercial RDBMS. The method comprises the steps of (a) rewriting an input query into a regular query, which is capable of capturing both DTD recursion and XPATH queries in a uniform framework; and (b) translating the regular query to an SQL query with LFP. The invention further provides optimization techniques for reducing the use of the LFP operator. As a result, the invention is capable of answering a large class of XPATH queries by means of only low-end RDBMS features already available in most RDBMS.

Abstract translation: 本发明提供了一种用于将 XPATH 查询转换为 SQL 查询的系统和方法，该查询具有简单的最低修正点（ LFP ）运算符，它已被 最商业的 RDBMS 。 该方法包括以下步骤：（a）将输入查询重写为常规查询，其能够在统一框架中捕获 DTD 递归和 XPATH 查询; 和（b）使用 LFP 将常规查询转换为 SQL 查询。 本发明还提供了用于减少 LFP 运算符的使用的优化技术。 因此，本发明能够通过仅在大多数 RDBMS中已经提供的低端 RDBMS 功能来回答大量 XPATH 查询。

公开(公告)号：US08745082B2

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

申请号：US11771286

申请日：2007-06-29

Applicant: Gao Cong ,  Wenfei Fan ,  Anastasios Kementsietsidis

Inventor： Gao Cong ,  Wenfei Fan ,  Anastasios Kementsietsidis

IPC: G06F17/30

CPC classification number: G06F17/2247 ,  G06F17/2229 ,  G06F17/30938

Abstract: Methods and apparatus are provided for evaluating XPath filters on fragmented and distributed XML documents. According to one aspect of the invention, a method is disclosed for evaluating a query over a tree having a plurality of fragments distributed over a plurality of sites. The method comprises the steps of identifying the plurality of sites storing at least one of the plurality of fragments of the tree; providing the query to the plurality of identified sites, wherein each of the identified sites partially evaluates the query against one of more fragments of the tree stored by the respective site; obtaining partial results from the plurality of identified sites; and composing the partial results to compute a result to the query. The query may be, for example, a boolean XPath query. The method can be performed, for example, by a coordinating site that stores a root fragment of the tree.

Abstract translation: 提供了方法和设备，用于评估分段和分布式XML文档上的XPath过滤器。 根据本发明的一个方面，公开了一种用于评估具有分布在多个站点上的多个片段的树上的查询的方法。 该方法包括以下步骤：识别存储该树的多个片段中的至少一个的多个站点; 将所述查询提供给所述多个识别的站点，其中所述所识别的站点中的每一个部分地根据相应站点存储的所述树的多个片段中的一个部分地评估所述查询; 从多个识别的站点获得部分结果; 并组合部分结果以计算查询的结果。 该查询可以是例如布尔的XPath查询。 该方法可以例如由存储树的根片段的协调站点来执行。

公开(公告)号：US08224863B2

公开(公告)日：2012-07-17

申请号：US11025846

申请日：2004-12-29

Applicant: Philip L. Bohannon ,  Wenfei Fan ,  Michael E. Flaster ,  Rajeev Rastogi

Inventor： Philip L. Bohannon ,  Wenfei Fan ,  Michael E. Flaster ,  Rajeev Rastogi

IPC: G06F17/30

CPC classification number: G06F17/30371 ,  G06F17/3051

Abstract: Methods and apparatus are provided for identifying constraint violation repairs in data that is comprised of a plurality of records, where each record has a plurality of cells. A database is processed, based on a plurality of constraints that data in the database must satisfy. At least one constraint violation to be resolved is identified based on a cost of repair and the corresponding records to be resolved and equivalent cells are identified in the data that violate the identified at least one constraint violation. A value for each of the equivalent cells can optionally be determined, and the determined value can be assigned to each of the equivalent cells. The at least one constraint violation selected for resolution may be, for example, the constraint violation with a lowest cost. The cost of repairing a constraint is based on a distance metric between the attributes values.

Abstract translation: 提供了用于识别由多个记录组成的数据中的约束违规修复的方法和装置，其中每个记录具有多个单元。 基于数据库中的数据必须满足的多个约束来处理数据库。 基于修复成本和要解析的相应记录以及违反所识别的至少一个约束违规的数据中标识等价单元来识别要解决的至少一个约束违规。 可以可选地确定每个等效单元的值，并且可以将确定的值分配给每个等效单元。 选择用于解决的至少一个约束违反可以是例如具有最低成本的约束违反。 修复约束的成本基于属性值之间的距离度量。