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

1. 发明授权

US07246115B2 Materialized view signature and efficient identification of materialized view candidates for queries 失效
标题翻译：物化视图签名和有效识别用于查询的物化视图候选
公开(公告)号：US07246115B2
公开(公告)日：2007-07-17
申请号：US10324800
申请日：2002-12-19
申请人： Guogen Zhang , Irene Ching-Hua Liu , Ding-Wei Chieh , Lee-Chin Hsu Liu , Yao-Ching Stephen Chen , Hsuiying Yen Cheng , Brian Thinh-Vinh Tran , Yun Wang , Ruiping Li
发明人： Guogen Zhang , Irene Ching-Hua Liu , Ding-Wei Chieh , Lee-Chin Hsu Liu , Yao-Ching Stephen Chen , Hsuiying Yen Cheng , Brian Thinh-Vinh Tran , Yun Wang , Ruiping Li
IPC分类号： G06F17/30
CPC分类号： G06F17/30457 , Y10S707/99933 , Y10S707/99934 , Y10S707/99942 , Y10S707/99943
摘要： A method and system for efficiently identifying materialized view candidates for queries filters materialized views using certain criteria, using the materialized view signatures. This filtering rejects some of the unqualified materialized views prior to the performance of the query rewrite matching algorithm, resulting in a group of materialized view candidates. The query rewrite matching algorithm is then performed on the materialized view candidates. By first filtering the materialized views based on their signatures, the number of materialized views on which the query rewrite matching algorithm is performed is significantly reduced, improving performance.
摘要翻译：用于有效地识别用于查询的物化视图候选的方法和系统使用特定的视图签名使用特定标准过滤物化视图。该过滤在执行查询重写匹配算法之前拒绝一些不合格的物化视图，导致一组物化视图候选。然后对物化视图候选进行查询重写匹配算法。通过首先根据其签名过滤物化视图，大大减少了执行查询重写匹配算法的物化视图数量，从而提高了性能。

2. 发明授权

US08543614B2 Packing nodes into records to store XML XQuery data model and other hierarchically structured data 失效
标题翻译：将节点包装到记录中以存储XML XQuery数据模型和其他分层结构化数据
公开(公告)号：US08543614B2
公开(公告)日：2013-09-24
申请号：US11209997
申请日：2005-08-22
申请人： Yao-Ching Stephen Chen , Yue Huang , Fen-Ling Lin , Brian Thinh-Vinh Tran , Guogen Zhang
发明人： Yao-Ching Stephen Chen , Yue Huang , Fen-Ling Lin , Brian Thinh-Vinh Tran , Guogen Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/30917 , G06F17/30911
摘要： A storage of nodes of hierarchically structured data uses logical node identifiers to reference the nodes stored within and across record data structures. A node identifier index is used to map each logical node identifier to a record identifier for the record that contains the node. When a sub-tree is stored in a separate record, a proxy node is used to represent the sub-tree in the parent record. The mapping in the node identifier index reflects the storage of the sub-tree nodes in the separate record. Since the references between the records are through logical node identifiers, there is no limitation to the moving of records across pages, as long as the indices are updated or rebuilt to maintain synchronization with the resulting data pages. This approach is highly scalable and has a much smaller storage consumption than approaches that use explicit references between nodes.
摘要翻译：分级结构化数据节点的存储使用逻辑节点标识符来引用存储在记录数据结构内和跨记录数据结构的节点。节点标识符索引用于将每个逻辑节点标识符映射到包含节点的记录的记录标识符。当子树存储在单独的记录中时，代理节点用于表示父记录中的子树。节点标识符索引中的映射反映了子树节点在单独记录中的存储。由于记录之间的引用是通过逻辑节点标识符，只要索引被更新或重建以维持与所得到的数据页的同步，就不限于跨页面的记录移动。这种方法具有高度可扩展性，并且比使用节点之间的明确引用的方法具有更小的存储消耗。

3. 发明授权

US07937413B2 Self-adaptive prefix encoding for stable node identifiers 失效
标题翻译：用于稳定节点标识符的自适应前缀编码
公开(公告)号：US07937413B2
公开(公告)日：2011-05-03
申请号：US10709415
申请日：2004-05-04
申请人： Brian Thinh-Vinh Tran , Guogen Zhang
发明人： Brian Thinh-Vinh Tran , Guogen Zhang
IPC分类号： G06F17/30
CPC分类号： G06F17/30908
摘要： A variable-length binary string is utilized to encode node identifiers in a tree for an XML document object model. A general prefix encoding scheme is followed; a node identifier is generated by the concatenation of encodings at each level of a tree along a path from a root node to another particular node. Arbitrary insertions are supported without change to existing node identifier encodings. In addition, the method provides for document order when unsigned binary string comparison is used to compare encoded node identifiers. In support of sub-document concurrency control, prefix encoding provides a way to derive ancestor-descendant relationships among nodes in a tree. Lastly, the encoding method provides a natural pre-order clustering sequence, also known as depth-first clustering. If a prefix is applied to an encoding with a level number, starting with zero at the root, width-first clustering will result. A mixed clustering can also be supported.
摘要翻译：使用可变长度的二进制字符串来编码用于XML文档对象模型的树中的节点标识符。遵循一般的前缀编码方案; 通过沿着从根节点到另一个特定节点的路径的树的每个级别的编码的级联来生成节点标识符。支持任意插入，而不改变现有的节点标识符编码。此外，当使用无符号二进制字符串比较来比较编码节点标识符时，该方法提供了文档顺序。为了支持子文档并发控制，前缀编码提供了一种在树中节点之间派生祖先 - 后代关系的方法。最后，编码方法提供了一种自然的预购聚类序列，也称为深度优先聚类。如果将前缀应用于具有级号的编码，则从根开始为零，将导致宽度优先聚类。也可以支持混合群集。

4. 发明授权

US06253196B1 Generalized model for the exploitation of database indexes 失效
标题翻译：数据库索引利用的广义模型
公开(公告)号：US06253196B1
公开(公告)日：2001-06-26
申请号：US09112307
申请日：1998-07-09
申请人： Gene Y. C. Fuh , Michelle Mei-Chiou Jou , Kamilla Kazimierowicz , Brian Thinh-Vinh Tran , Yun Wang
发明人： Gene Y. C. Fuh , Michelle Mei-Chiou Jou , Kamilla Kazimierowicz , Brian Thinh-Vinh Tran , Yun Wang
IPC分类号： G06F1730
CPC分类号： G06F17/30312 , G06F17/30483 , G06F17/30492 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936 , Y10S707/99943 , Y10S707/99953
摘要： A method, apparatus, and article of manufacture for computer-implemented exploitation of database indexes. A statement is executed in a database stored on a data storage device connected to a computer. The database contains data. A model based on pattern matching for a user-defined predicate and selection of an index exploitation rule based on a matched user-defined predicate is provided to be used for exploiting an index to retrieve data from the database.
摘要翻译：计算机实现数据库索引利用的方法，装置和制造。在存储在连接到计算机的数据存储设备上的数据库中执行语句。数据库包含数据。提供了基于用户定义谓词的模式匹配和基于匹配的用户定义谓词的索引利用规则的选择的模型，用于利用索引从数据库检索数据。

5. 发明授权

US06266663B1 User-defined search using index exploitation 失效
标题翻译：使用索引开发的用户定义搜索
公开(公告)号：US06266663B1
公开(公告)日：2001-07-24
申请号：US09113976
申请日：1998-07-09
申请人： Gene Y. C. Fuh , Michelle Mei-chiou Jou , Daniel T. Lee , Ping Li , Hsin Pan , Shahrokh Talmoud , Brian Thinh-Vinh Tran , Yun Wang
发明人： Gene Y. C. Fuh , Michelle Mei-chiou Jou , Daniel T. Lee , Ping Li , Hsin Pan , Shahrokh Talmoud , Brian Thinh-Vinh Tran , Yun Wang
IPC分类号： G06F1730
CPC分类号： G06F17/30471 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935
摘要： A method, apparatus, and article of manufacture for a computer-implemented model for user-defined search in Relational Database Management Systems. A statement is executed in a database stored on a data storage device connected to a computer. Data that is qualified by user-defined functions is located based on a model that supports user-defined search.
摘要翻译：用于关系数据库管理系统中用户定义搜索的计算机实现模型的方法，装置和制造。在存储在连接到计算机的数据存储设备上的数据库中执行语句。由用户定义的功能限定的数据基于支持用户定义搜索的模型。

6. 发明授权

US5857182A Database management system, method and program for supporting the mutation of a composite object without read/write and write/write conflicts 失效
标题翻译：数据库管理系统，支持复制对象突变的方法和程序，无需读/写和写/写冲突
公开(公告)号：US5857182A
公开(公告)日：1999-01-05
申请号：US786605
申请日：1997-01-21
申请人： Linda Gail DeMichiel , Gene Y. C. Fuh , Michelle Mei-Chiou Jou , Bruce Gilbert Lindsay , Nelson Mendonca Mattos , Serge Philippe Rielau , Brian Thinh-Vinh Tran
发明人： Linda Gail DeMichiel , Gene Y. C. Fuh , Michelle Mei-Chiou Jou , Bruce Gilbert Lindsay , Nelson Mendonca Mattos , Serge Philippe Rielau , Brian Thinh-Vinh Tran
IPC分类号： G06F17/30
CPC分类号： G06F17/30607 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99936 , Y10S707/99937 , Y10S707/99938
摘要： The system, method, and program of this invention avoids potential write/write conflicts and read/write conflicts when a subcomponent of a composite object (e.g., an ADT) is mutated. The embodiments of this invention define a copy semantic for the mutation function. In one embodiment, a copy function is inserted prior to any mutation function. In a another embodiment, a global compile-time analysis is performed to determine if a write/write or read/write conflict exists; and to eliminate redundant copy constructors if a conflict does exist. In a preferred embodiment, only a local analysis is performed during the parsing phase, thereby avoiding a global compile-time analysis. A mutation safe flag is associated with each parse tree node. A read target leaf parse tree node is set to false while non-leaf parse tree nodes (functions) derive their value from an incoming node, except that constructors and copy constructor functions are always true. Whether or not a copy is made of the composite object (i.e., whether or not a copy constructor is inserted) prior to a mutation is determined according to the setting of the mutation safe flags and according to the following. If a mutation safe flag for a mutation function is false, a copy constructor is inserted for the mutated composite object and the mutation safe flag is set to true. In addition, for update and trigger statements, the mutation safe flag for a mutated target is defaulted to true. Furthermore, related update entries are grouped together and a copy is generated for the common target. The generated copy is used as the common target for all of the mutations caused by the update entries grouped together in order to accumulate all of the desired mutations in a same copy of the composite object.
摘要翻译：本发明的系统，方法和程序在复合对象（例如，ADT）的子组件被突变时避免潜在的写入/写入冲突和读/写冲突。本发明的实施例定义了突变功能的复制语义。在一个实施例中，在任何突变功能之前插入复制功能。在另一实施例中，执行全局编译时分析以确定是否存在写/写或读/写冲突; 并且如果存在冲突，则消除冗余的拷贝构造函数。在优选实施例中，在解析阶段仅执行局部分析，从而避免了全局编译时分析。突变安全标志与每个解析树节点相关联。读取目标叶解析树节点设置为false，而非叶解析树节点（函数）从传入节点导出其值，除了构造函数和复制构造函数始终为真。根据突变安全标志的设置，根据以下来确定复制对象（即，是否插入复制构造函数）之前的副本是否被复制。如果突变功能的突变安全标志为假，则为突变复合对象插入复制构造函数，并将突变安全标志设置为true。另外，对于更新和触发语句，突变目标的突变安全标志默认为true。此外，将相关的更新条目分组在一起，并为共同目标生成副本。生成的拷贝被用作由更新条目组合在一起引起的所有突变的共同目标，以便累积复合对象的相同副本中的所有期望的突变。

7. 发明授权

US06285996B1 Run-time support for user-defined index ranges and index filters 失效
标题翻译：运行时支持用户定义的索引范围和索引过滤器
公开(公告)号：US06285996B1
公开(公告)日：2001-09-04
申请号：US09113802
申请日：1998-07-09
申请人： Michelle Mei-Chiou Jou , Daniel Tsunfang Lee , Ping Li , Hsin Pan , Brian Thinh-Vinh Tran , Yun Wang
发明人： Michelle Mei-Chiou Jou , Daniel Tsunfang Lee , Ping Li , Hsin Pan , Brian Thinh-Vinh Tran , Yun Wang
IPC分类号： G06F1730
CPC分类号： G06F17/30312 , G06F17/30483 , G06F17/30492 , Y10S707/99931 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934
摘要： A method, apparatus, and article of manufacture for run-time support for user-defined index ranges and index filters. A statement is executed in a database stored on a data storage device, which is connected to a computer. The database contains data. A search range is generated based on a user-defined range function associated with a user-defined index.
摘要翻译：用于用户定义的索引范围和索引过滤器的运行时支持的方法，设备和制造。在存储在连接到计算机的数据存储设备上的数据库中执行语句。数据库包含数据。基于与用户定义的索引相关联的用户定义的范围函数生成搜索范围。

8. 发明授权

US5930795A Supporting dynamic tables in SQL query compilers 失效
标题翻译：在SQL查询编译器中支持动态表
公开(公告)号：US5930795A
公开(公告)日：1999-07-27
申请号：US786603
申请日：1997-01-21
申请人： Yao-Ching Stephen Chen , Jyh-Herng Chow , Roberta Jo Cochrane , Gene Y.C. Fuh , Nelson Mendonca Mattos , Mir Hamid Pirahesh , Jeffrey D. Richey , Brian Thinh-Vinh Tran , Tuong Chanh Truong
发明人： Yao-Ching Stephen Chen , Jyh-Herng Chow , Roberta Jo Cochrane , Gene Y.C. Fuh , Nelson Mendonca Mattos , Mir Hamid Pirahesh , Jeffrey D. Richey , Brian Thinh-Vinh Tran , Tuong Chanh Truong
IPC分类号： G06F17/30
CPC分类号： G06F17/30421 , G06F17/30474
摘要： A framework for a query compiler and run-time environment for resolving a table reference to a dynamic table that is first identified at run-time but is initially unknown at compile-time. A parser parses the table reference and creates a parsed representation for the table that identifies the type of dynamic table. A code generator creates executable plans containing run-time table object representations (TAOB), from the parsed representations, that contain the type of dynamic table. The TAOB is also extended to provide for parameters that are definable at run-time, including a table ID of the actual table entity being referenced. A routine is embedded in a run-time routine that checks the type of dynamic table in the TAOB and dispatches control to one of a plurality of corresponding routines, depending upon the type of dynamic table. The corresponding routines use the extended TAOB to dynamically link the table reference to the dynamic table, depending upon the type of dynamic table. Once the dynamic table has been linked to the table reference, query processing continues as if that table were a base or derived table.
摘要翻译：用于查询编译器和运行时环境的框架，用于解析对运行时首先标识但最初在编译时未知的动态表的表引用。解析器解析表引用，并创建用于标识动态表类型的表的解析表示。代码生成器从解析的表示形式创建包含运行时表对象表示（TAOB）的可执行计划，其中包含动态表的类型。 TAOB还被扩展以提供在运行时可定义的参数，包括被引用的实际表实体的表ID。例程被嵌入到运行时程序中，该运行时程序检查TAOB中的动态表的类型，并根据动态表的类型将控制调度到多个相应的例程之一。相应的例程使用扩展TAOB来动态地将表引用动态链接到动态表，这取决于动态表的类型。一旦将动态表链接到表引用，查询处理将继续进行，就像该表是基类或派生表一样。

9. 发明申请

US20100042631A1 METHOD FOR PARTITIONING A QUERY 有权
标题翻译：用于分类查询的方法
公开(公告)号：US20100042631A1
公开(公告)日：2010-02-18
申请号：US12190187
申请日：2008-08-12
申请人： Yefim Shuf , Hong Min , Terence Patrick Purcell , Ou Jin , Fen-Ling Lin , Brian Thinh-Vinh Tran , Patrick Dooling Bossman
发明人： Yefim Shuf , Hong Min , Terence Patrick Purcell , Ou Jin , Fen-Ling Lin , Brian Thinh-Vinh Tran , Patrick Dooling Bossman
IPC分类号： G06F17/30
CPC分类号： G06F17/30445
摘要： Techniques for partitioning a query are provided. The techniques include establishing one or more criterion for partitioning a query, wherein the query comprises one or more tables, materializing a first of the one or more tables, partitioning the first of the one or more tables until the one or more criterion have been satisfied, and partitioning and joining a remainder of the one or more tables of the query.
摘要翻译：提供了分割查询的技术。这些技术包括建立用于划分查询的一个或多个标准，其中该查询包括一个或多个表，实现该一个或多个表中的第一个表，划分一个或多个表中的第一个，直到满足一个或多个标准，以及分割和加入查询的一个或多个表的其余部分。

10. 发明授权

US6065013A Optimal storage mechanism for persistent objects in DBMS 失效
标题翻译： DBMS中持久对象的最佳存储机制
公开(公告)号：US6065013A
公开(公告)日：2000-05-16
申请号：US914394
申请日：1997-08-19
申请人： Gene Y. C. Fuh , Bruce Gilbert Lindsay , Nelson Mendonca Mattos , Brian Thinh-Vinh Tran , Yun Wang
发明人： Gene Y. C. Fuh , Bruce Gilbert Lindsay , Nelson Mendonca Mattos , Brian Thinh-Vinh Tran , Yun Wang
IPC分类号： G06F17/30
CPC分类号： G06F17/30607 , Y10S707/99944
摘要： A method, apparatus, and article of manufacture for a computer implemented storage mechanism for persistent objects in a database management system. A statement is executed in a computer. The statement is performed by the computer to manipulate data in a database stored on a data storage device connected to the computer. It is determined that an object is to be stored in an inline buffer. When the object can be entirely stored in the inline buffer, the object is stored in the inline buffer. When the object cannot be entirely stored in the inline buffer, a selected portion of the object is stored in the inline buffer and the remaining portion of the object is stored as a large object.
摘要翻译：一种用于数据库管理系统中用于持久对象的计算机实现的存储机制的方法，装置和制品。在计算机中执行语句。该语句由计算机执行以操作存储在连接到计算机的数据存储设备上的数据库中的数据。确定一个对象要存储在一个内联缓冲区中。当对象可以完全存储在内联缓冲区中时，对象被存储在内联缓冲区中。当对象不能完全存储在内联缓冲区中时，对象的选定部分被存储在内联缓冲区中，并且对象的剩余部分被存储为大对象。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式