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

1. 发明申请

US20050097084A1 XPath containment for index and materialized view matching 有权
标题翻译： XPath包含索引和物化视图匹配
公开(公告)号：US20050097084A1
公开(公告)日：2005-05-05
申请号：US10698622
申请日：2003-10-31
申请人： Andrey Balmin , Kevin Beyer , Roberta Cochrane , Fatma Ozcan , Mir Pirahesh
发明人： Andrey Balmin , Kevin Beyer , Roberta Cochrane , Fatma Ozcan , Mir Pirahesh
IPC分类号： G06F17/30
CPC分类号： G06F17/30935 , G06F17/30457 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936
摘要： A method for using pre-computed information stored in auxiliary structures to speed up processing of expensive queries on hierarchical documents such as XML documents being queried using XPath. The invention defines a taxonomy of such structures such as indexes and materialized views for storing pre-computed XPath results (PXRs), determines what portion of the query can be evaluated by the structures, and computes the compensation for the results generated by the structures. The invention detects all structures applicable to the query and rewrites the query to use such structures, speeding up the performance of the queries. The invention identifies the matching structures by detecting containment mappings between XPath expressions in the query and the structure. The invention also includes a new representation for XPath expressions that is rich enough to express all features of XPath.
摘要翻译：使用存储在辅助结构中的预先计算的信息的方法，用于加速使用XPath查询的诸如XML文档之类的分层文档上的昂贵查询的处理。本发明定义了这种结构的分类法，例如用于存储预先计算的XPath结果（PXR）的索引和物化视图，确定该结构可以评估查询的哪些部分，并且计算由结构生成的结果的补偿。本发明检测适用于查询的所有结构，并重写查询以使用这种结构，加速查询的执行。本发明通过检测查询中的XPath表达式和结构之间的容纳映射来识别匹配结构。本发明还包括XPath表达式的新表示，其足以表达XPath的所有特征。

2. 发明申请

US20050044493A1 Incremental AST maintenance using work areas 有权
标题翻译：使用工作区域增量AST维护
公开(公告)号：US20050044493A1
公开(公告)日：2005-02-24
申请号：US10643644
申请日：2003-08-19
申请人： Songting Chen , Roberta Cochrane , Mir Pirahesh , Richard Sidle
发明人： Songting Chen , Roberta Cochrane , Mir Pirahesh , Richard Sidle
IPC分类号： G06F17/00 , G06F17/30
CPC分类号： G06F17/30457 , G06F17/30489 , Y10S707/99932 , Y10S707/99933
摘要： Disclosed is a method and system for incrementally maintaining algebraic functions in automatic summary tables (ASTs) of at least one relational database. The method associates a work area with each algebraic function in each AST. Each work area is comprised of one or more variables. The method populates the variables within each work area for each algebraic function when each AST is created and when each AST is updated. The method maintains each work area by adding and subtracting to and from its associated variables when the associated data changes in the relational database. The functions that compute the variables of the work areas are distributive and thus incrementally maintainable. The method computes and recomputes the algebraic function within an AST after the updates have changed one or more of the variables of its workarea.
摘要翻译：公开了一种用于在至少一个关系数据库的自动汇总表（AST）中逐渐维持代数函数的方法和系统。该方法将工作区域与每个AST中的每个代数函数相关联。每个工作区域都包含一个或多个变量。当创建每个AST和更新每个AST时，该方法为每个代数函数填充每个工作区域内的变量。该方法通过在关系数据库中相关联的数据更改时向其关联变量添加和减少来维护每个工作区域。计算工作区变量的函数是分布式的，因此可以逐步维护。该方法在更新改变其工作区的一个或多个变量之后，计算并重新计算AST内的代数函数。

3. 发明申请

US20050192989A1 Techniques to preserve data constraints and referential integrity in asynchronous transactional replication of relational tables 失效
标题翻译：在关系表的异步事务复制中保留数据约束和引用完整性的技术
公开(公告)号：US20050192989A1
公开(公告)日：2005-09-01
申请号：US10788651
申请日：2004-02-27
申请人： Nicolas Adiba , Roberta Cochrane , Elizabeth Hamel , Somil Kulkarni , Bruce Lindsay
发明人： Nicolas Adiba , Roberta Cochrane , Elizabeth Hamel , Somil Kulkarni , Bruce Lindsay
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30371 , G06F17/30578 , Y10S707/99934
摘要： An improved method and system for preserving data constraints during parallel apply in asynchronous transaction replication in a database system have been disclosed. The method and system preserves secondary unique constraints and referential integrity constraints, while also allowing a high degree of parallelism in the application of asynchronous replication transactions. The method and system also detects and resolves ordering problems introduced by referential integrity cascade deletes, and allows the parallel initial loading of parent and child tables of a referential integrity constraint.
摘要翻译：已经公开了一种用于在数据库系统中的异步事务复制中并行地保留数据约束的改进的方法和系统。该方法和系统保留次要唯一约束和引用完整性约束，同时还允许应用异步复制事务的高度并行性。该方法和系统还检测和解决引用完整性级联删除引入的排序问题，并允许并行初始加载父表和子表的引用完整性约束。

4. 发明申请

US20050108209A1 Context quantifier transformation in XML query rewrite 失效
标题翻译： XML查询重写中的上下文量词变换
公开(公告)号：US20050108209A1
公开(公告)日：2005-05-19
申请号：US10717870
申请日：2003-11-19
申请人： Kevin Beyer , Roberta Cochrane , Fatma Ozcan , Normen Seemann
发明人： Kevin Beyer , Roberta Cochrane , Fatma Ozcan , Normen Seemann
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30935 , G06F17/30932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： An XML query compilation processor (20) includes an execution compiler (42) that transforms an XML query into an executable XML query plan (22). A query rewrite processor (34) performs query transformations on the XML query. Said query transformations include transforming an expression input (60) received by an expression (62) conditional upon a set of items defined by an output (64) of the expression (62) being independent of grouping of items in the expression input (60).
摘要翻译： XML查询编译处理器（20）包括将XML查询转换成可执行XML查询计划（22）的执行编译器（42）。查询重写处理器（34）对XML查询执行查询转换。所述查询变换包括变换由表达式（62）接收的表达式输入（60），该表达式输入（60）是由表达式（62）的输出（64）定义的一组项独立于表达式输入（60）中的项目的分组而条件的。。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式