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

1. 发明申请

US20050138052A1 Method, computer program product, and system converting relational data into hierarchical data structure based upon tagging trees 失效
标题翻译：方法，计算机程序产品和系统将关系数据转换为基于标记树的分层数据结构
公开(公告)号：US20050138052A1
公开(公告)日：2005-06-23
申请号：US10788141
申请日：2004-02-26
申请人： Nianjun Zhou , George Mihaila , Dikran Meliksetian , Sriram Padmanabhan
发明人： Nianjun Zhou , George Mihaila , Dikran Meliksetian , Sriram Padmanabhan
IPC分类号： G06F17/00 , G06F17/30
CPC分类号： G06F17/30595 , Y10S707/956 , Y10S707/99933 , Y10S707/99942
摘要： Tagging trees are generated and used to facilitate transforming data from relational databases into hierarchical formats, such as in XML documents. Tagging trees contain both XML hierarchical structure information as well a query information that is needed to access different data sources, e.g., databases, to retrieve the information to be placed in the hierarchical structure. A designer optionally creates a mapping script that specifies the transformation from relational databases to the hierarchical format. A tagging tree is created by either parsing that mapping script or by other means. A runtime environment then processes the tagging tree by a depth first traversal. The runtime environment is able to be configured to output a hierarchical data object, such as an XML document, or pipelined to control, for example, SAX processing.
摘要翻译：生成标记树以便于将数据从关系数据库转换为分层格式，如XML文档。标记树包含XML层次结构信息以及访问不同数据源（例如数据库）以检索要放置在分层结构中的信息所需的查询信息。设计人员可以选择创建一个映射脚本，该脚本指定从关系数据库到分层格式的转换。标记树通过解析该映射脚本或其他方式来创建。然后，运行时环境通过深度优先遍历处理标记树。运行时环境能够被配置为输出分层数据对象，例如XML文档，或流水线控制，例如SAX处理。

2. 发明申请

US20070118553A1 METHOD, COMPUTER PROGRAM PRODUCT, AND SYSTEM OF OPTIMIZED DATA TRANSLATION FROM RELATIONAL DATA STORAGE TO HIERARCHICAL STRUCTURE 有权
标题翻译：方法，计算机程序产品和从关系数据存储到分层结构的优化数据转换系统
公开(公告)号：US20070118553A1
公开(公告)日：2007-05-24
申请号：US11623840
申请日：2007-01-17
申请人： Nianjun Zhou , George Mihaila , Dikran Meliksetian , Sriram Padmanabhan
发明人： Nianjun Zhou , George Mihaila , Dikran Meliksetian , Sriram Padmanabhan
IPC分类号： G06F7/00
CPC分类号： G06F17/30595 , Y10S707/99934 , Y10S707/99945 , Y10S707/99948
摘要： A tagging tree that defines a hierarchical output data structure and relational database query operations that retrieve the data to be included in each hierarchical section is accepted and processed. A query optimizer analyzes the tagging tree to determine database query operations that can be combined into a single query command. An outer-union query command is generated to allow efficient combination of multiple query commands, some of which are predicates to others. The tagging tree is modified to replace the database queries that were combined into the outer-union query to extract data from the results set produced by the outer-union query as opposed to submitting queries to the database manager. The optimized queries can be reused an arbitrary number of times to leverage the optimizing resources that were used in their creation.
摘要翻译：定义分层输出数据结构的标记树和检索要包含在每个分层部分中的数据的关系数据库查询操作被接受和处理。查询优化器分析标记树以确定可以组合成单个查询命令的数据库查询操作。生成一个外联合查询命令，以允许多个查询命令的有效组合，其中一些查询命令是其他命令的谓词。标记树被修改为将组合到外联合查询中的数据库查询替换为从外联合查询生成的结果集中提取数据，而不是向数据库管理器提交查询。优化的查询可以重复使用任意次数，以利用其创建中使用的优化资源。

3. 发明申请

US20070143321A1 Converting recursive hierarchical data to relational data 审中-公开
标题翻译：将递归分层数据转换为关系数据
公开(公告)号：US20070143321A1
公开(公告)日：2007-06-21
申请号：US11303432
申请日：2005-12-16
申请人： Dikran Meliksetian , George Mihaila , Sriram Padmanabhan , Nianjun Zhou
发明人： Dikran Meliksetian , George Mihaila , Sriram Padmanabhan , Nianjun Zhou
IPC分类号： G06F7/00
CPC分类号： G06F16/86
摘要： A system and method of converting a recursive XML document into a relational schema comprises providing a recursive XML document; parsing an external mapping script specifying a mapping from the recursive XML document to a relational table format; building a recursive shredding tree based on the external mapping script and the relational table format; and shredding the mapped recursive XML document into a relational table. The system and method further comprise detecting whether any of a XML schema and a DTD document is recursive, wherein the detecting comprises building a directed graph comprising element names; corresponding elements names as nodes in the directed graph; forming arcs from every element parent node to every element child node of the element parent node; and checking for cycles in the directed graph. The system and method further comprise identifying all recursive cursor nodes and a recursive degree corresponding to the recursive shredding tree.
摘要翻译：将递归XML文档转换为关系模式的系统和方法包括提供递归XML文档; 解析指定从递归XML文档到关系表格式的映射的外部映射脚本; 基于外部映射脚本和关系表格式构建递归切割树; 并将映射的递归XML文档切割成关系表。所述系统和方法还包括检测XML模式和DTD文档中的任何一个是递归的，其中所述检测包括构建包括元素名称的有向图; 相应的元素名称作为有向图中的节点; 从每个元素父节点到元素父节点的每个元素子节点形成弧; 并检查有向图中的周期。该系统和方法还包括识别所有递归光标节点和对应于递归粉碎树的递归度。

4. 发明申请

US20050138073A1 Method, computer program product, and system of optimized data translation from relational data storage to hierarchical structure 失效
标题翻译：方法，计算机程序产品和从关系数据存储到分层结构的优化数据转换系统
公开(公告)号：US20050138073A1
公开(公告)日：2005-06-23
申请号：US10744424
申请日：2003-12-22
申请人： Nianjun Zhou , George Mihaila , Dikran Meliksetian , Sriram Padmanabhan
发明人： Nianjun Zhou , George Mihaila , Dikran Meliksetian , Sriram Padmanabhan
IPC分类号： G06F17/00 , G06F17/30
CPC分类号： G06F17/30595 , Y10S707/99934 , Y10S707/99945 , Y10S707/99948
摘要： A tagging tree that defines a hierarchical output data structure and relational database query operations that retrieve the data to be included in each hierarchical section is accepted and processed. A query optimizer analyzes the tagging tree to determine database query operations that can be combined into a single query command. An outer-union query command is generated to allow efficient combination of multiple query commands, some of which are predicates to others. The tagging tree is modified to replace the database queries that were combined into the outer-union query to extract data from the results set produced by the outer-union query as opposed to submitting queries to the database manager. The optimized queries can be reused an arbitrary number of times to leverage the optimizing resources that were used in their creation.
摘要翻译：定义分层输出数据结构的标记树和检索要包含在每个分层部分中的数据的关系数据库查询操作被接受和处理。查询优化器分析标记树以确定可以组合成单个查询命令的数据库查询操作。生成一个外联合查询命令，以允许多个查询命令的有效组合，其中一些查询命令是其他命令的谓词。标记树被修改为将组合到外联合查询中的数据库查询替换为从外联合查询生成的结果集中提取数据，而不是向数据库管理器提交查询。优化的查询可以重复使用任意次数，以利用其创建中使用的优化资源。

5. 发明申请

US20060184552A1 Memory efficient XML shredding with partial commit 有权
标题翻译：具有部分提交功能的内存高效的XML切割
公开(公告)号：US20060184552A1
公开(公告)日：2006-08-17
申请号：US11058020
申请日：2005-02-15
申请人： Dikran Meliksetian , George Mihaila , Nianjun Zhou
发明人： Dikran Meliksetian , George Mihaila , Nianjun Zhou
IPC分类号： G06F17/00
CPC分类号： G06F17/30914 , Y10S707/99944
摘要： A method and system that allows efficient shredding of large instances of hierarchical data structures into relational data structures. Large instances of hierarchical data structures, which are able to be larger than the random access storage of a computer used to shred them into relational data structures, are incrementally shredded into a temporary storage. When the amount of data shredded into the temporary storage reaches or exceeds a predetermined commit count, the data in the temporary storage is transferred to a relational data structure maintained by a relational database manager. A Document Type Description annotation is provided to allow the end user to specify execution order for SQL commands and to specify commit count values.
摘要翻译：一种方法和系统，允许将大型实例的分层数据结构高效地分解成关系数据结构。能够比用于将它们分割成关系数据结构的计算机的随机存取存储器更大的分级数据结构的大型实例被递增地切割成临时存储器。当切入临时存储器的数据量达到或超过预定提交计数时，临时存储器中的数据被传送到由关系数据库管理器维护的关系数据结构。文档类型说明注释用于允许最终用户指定SQL命令的执行顺序并指定提交计数值。

6. 发明申请

US20050028091A1 Method, system and recording medium for maintaining the order of nodes in a heirarchical document 有权
标题翻译：方法，系统和记录介质，用于维护阴性文件中节点的顺序
公开(公告)号：US20050028091A1
公开(公告)日：2005-02-03
申请号：US10629744
申请日：2003-07-30
申请人： Rajesh Bordawekar , Yi Chen , George Mihaila , Sriram Padmanabhan
发明人： Rajesh Bordawekar , Yi Chen , George Mihaila , Sriram Padmanabhan
IPC分类号： G06F15/00 , G06Q10/00
CPC分类号： G06Q10/10 , Y10S707/99942
摘要： A method, a system and recording medium for maintaining the order of nodes in a hierarchical document. The method may select the maximum and the minimum number of children for each node, build an auxiliary ordered tree having at least as many leaves as atoms within the hierarchical document based upon the selected maximum and minimum number of children for each node, attach the atoms to the leaves of the auxiliary ordered tree, and label each of the nodes in the auxiliary ordered tree.
摘要翻译：一种用于维护分级文档中节点顺序的方法，系统和记录介质。该方法可以基于每个节点的所选择的最大和最小子数，来选择每个节点的最大和最小子数，构建具有至少与分层文档中的原子一样多的叶的辅助有序树，附加原子到辅助有序树的叶子，并标记辅助有序树中的每个节点。

7. 发明申请

US20050198055A1 Query-driven partial materialization of relational-to-hierarchical mappings 有权
标题翻译：查询驱动的关系到层次映射的部分实现
公开(公告)号：US20050198055A1
公开(公告)日：2005-09-08
申请号：US10795534
申请日：2004-03-08
申请人： George Mihaila , Sriram Padmanabhan , Oded Shmueli
发明人： George Mihaila , Sriram Padmanabhan , Oded Shmueli
IPC分类号： G06F17/00
CPC分类号： G06F17/30932 , Y10S707/99931 , Y10S707/99943 , Y10S707/99945 , Y10S707/99953
摘要： Techniques are provided for automatically rewriting a relational-to-hierarchical mapping into one or more modified mappings. In this way, clients that prefer or require different portions of the mapping-defined data are supported. For example, in one aspect of the invention, a technique for modifying a relational-to-hierarchical mapping in accordance with at least one user query includes the following steps/operations. At least one query associated with a query language that supports a hierarchical data structure is obtained. Further, at least one relational-to-hierarchical mapping for use in translating data associated with a relational data structure into data associated with the hierarchical data structure is obtained. Then, the at least one relational-to-hierarchical mapping is modified based on the at least one query such that data specifically relevant to the at least one query may be generated in accordance with the modified relational-to-hierarchical mapping.
摘要翻译：提供了用于将关系到分层映射自动重写成一个或多个修改的映射的技术。以这种方式，支持偏好或需要映射定义数据的不同部分的客户端。例如，在本发明的一个方面，根据至少一个用户查询修改关系到分层映射的技术包括以下步骤/操作。获得与支持分层数据结构的查询语言相关联的至少一个查询。此外，获得用于将与关系数据结构相关联的数据转换成与分层数据结构相关联的数据的至少一个关系到分层映射。然后，基于至少一个查询来修改至少一个关系到分层映射，使得可以根据修改的关系到分层映射生成与至少一个查询特别相关的数据。

8. 发明申请

US20060074963A1 Techniques for estimating item frequencies in large data sets 有权
公开(公告)号：US20060074963A1
公开(公告)日：2006-04-06
申请号：US10950800
申请日：2004-09-27
申请人： George Mihaila , Min Wang
发明人： George Mihaila , Min Wang
IPC分类号： G06F17/00
CPC分类号： G06F17/30539 , G06Q10/10 , G06Q30/02
摘要： Techniques for estimating items (e.g., data item or objects) frequencies in large data sets are disclosed. For example, a technique for determining items and their frequencies at multiple levels of interest in a collection of nested bags includes the following steps. A hierarchy of a plurality of levels of nested bags and the levels of interest are inputted. Among the plurality of levels, a subset of bags is sampled from at least one level. At each level of interest, the frequency is counted of each distinct item in the bags obtained in the sampling step. At each level of interest, the item frequencies obtained in the counting step are extrapolated based on sampling ratios associated with the sampling step. At each level of interest, the items are sorted according to their frequencies obtained from the extrapolating step and those items with highest frequencies are retained. A bag may refer to one or more subsets or groups of data items or objects. Also, a bag may, itself, contain one or more other bags.

9. 发明申请

US20070005612A1 Methods and systems for optimizing searches within relational databases having hierarchical data 审中-公开
标题翻译：用于优化具有分层数据的关系数据库内的搜索的方法和系统
公开(公告)号：US20070005612A1
公开(公告)日：2007-01-04
申请号：US11168868
申请日：2005-06-29
申请人： Sweefen Goh , George Mihaila , Maroun Touma
发明人： Sweefen Goh , George Mihaila , Maroun Touma
IPC分类号： G06F7/00
CPC分类号： G06F16/2246
摘要： A method and system for preparing a relational database for searching includes determining a hierarchy of data within the relational database, and storing a hierarchical label for at least one record of data within the relational database that corresponds to the hierarchy of the data.
摘要翻译：用于准备用于搜索的关系数据库的方法和系统包括确定关系数据库内的数据层级，以及存储与数据层级对应的关系数据库内的至少一个数据记录的分层标签。

10. 发明申请

US20070067343A1 Determining the structure of relations and content of tuples from XML schema components 审中-公开
标题翻译：从XML模式组件确定元组的关系和内容的结构
公开(公告)号：US20070067343A1
公开(公告)日：2007-03-22
申请号：US11232585
申请日：2005-09-21
申请人： George Mihaila , Dung Nguyen , Mayank Pradhan
发明人： George Mihaila , Dung Nguyen , Mayank Pradhan
IPC分类号： G06F17/00
CPC分类号： G06F16/86
摘要： A method for determining relationships between hierarchically structured schema components and their effects on and content of tuples, includes: analyzing the hierarchically structured schema with user-supplied mappings and finding elements or attributes mapped to a same relational table; determining relationships between the elements or attributes to be either a one-to-one relationship or a one-to-many relationship based on an information set in the hierarchically structured schema; recording the relationships; and processing a hierarchically structured document against the recorded relationships and generating tuples accordingly. The constructs of a hierarchically structured schema that may affect the cardinality between the attributes of a relation, and thus the contents of the tuples, are considered. A relationship between the hierarchically structured schema model and a relational model is established.
摘要翻译：确定分层结构化模式组件之间的关系及其对元组的影响和内容的方法，包括：使用用户提供的映射和查找映射到同一关系表的元素或属性来分析分层结构化模式; 基于在所述分层结构化模式中设置的信息，确定所述元素或属性之间的关系为一对一关系或一对多关系; 记录关系; 并根据记录的关系处理分层结构化文档，并相应地生成元组。考虑可能影响关系的属性之间的基数的分层结构化模式的构造，并因此影响元组的内容。建立层次结构化模式模型与关系模型之间的关系。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式