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

1. 发明申请

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.
摘要翻译：提供了用于将关系到分层映射自动重写成一个或多个修改的映射的技术。以这种方式，支持偏好或需要映射定义数据的不同部分的客户端。例如，在本发明的一个方面，根据至少一个用户查询修改关系到分层映射的技术包括以下步骤/操作。获得与支持分层数据结构的查询语言相关联的至少一个查询。此外，获得用于将与关系数据结构相关联的数据转换成与分层数据结构相关联的数据的至少一个关系到分层映射。然后，基于至少一个查询来修改至少一个关系到分层映射，使得可以根据修改的关系到分层映射生成与至少一个查询特别相关的数据。

2. 发明授权

US07469249B2 Query-driven partial materialization of relational-to-hierarchical mappings 有权
标题翻译：查询驱动的关系到层次映射的部分实现
公开(公告)号：US07469249B2
公开(公告)日：2008-12-23
申请号：US10795534
申请日：2004-03-08
申请人： George Andrei Mihaila , Sriram Padmanabhan , Oded Shmueli
发明人： George Andrei 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.
摘要翻译：提供了用于将关系到分层映射自动重写成一个或多个修改的映射的技术。以这种方式，支持偏好或需要映射定义数据的不同部分的客户端。例如，在本发明的一个方面，根据至少一个用户查询修改关系到分层映射的技术包括以下步骤/操作。获得与支持分层数据结构的查询语言相关联的至少一个查询。此外，获得用于将与关系数据结构相关联的数据转换成与分层数据结构相关联的数据的至少一个关系到分层映射。然后，基于至少一个查询来修改至少一个关系到分层映射，使得可以根据修改的关系到分层映射生成与至少一个查询特别相关的数据。

3. 发明申请

US20050102256A1 Single pass workload directed clustering of XML documents 失效
标题翻译：单通道工作负载定向聚类XML文档
公开(公告)号：US20050102256A1
公开(公告)日：2005-05-12
申请号：US10703250
申请日：2003-11-07
申请人： Rajesh Bordawekar , Sriram Padmanabhan , Oded Shmueli
发明人： Rajesh Bordawekar , Sriram Padmanabhan , Oded Shmueli
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30923 , Y10S707/99942
摘要： A method and system for clustering of XML documents is disclosed. The method operates under specified memory-use constraints. The system implements the method and scans an XML document, assigns edge-weights according to the application workload, and maps clusters of XML nodes to disk pages, all in a single parser-controlled pass over the XML data. Application workload information is used to generate XML clustering solutions that lead to substantial reduction in page faults for the workload under consideration. Several approaches for representing workload information are disclosed. For example, the workload may list the XPath operators invoked during the application along with their invocation frequencies. The application workload can be further refined by incorporating additional features such as query importance or query compilation costs. XML access patterns could be also modeled using stochastic approaches.
摘要翻译：公开了一种用于XML文档聚类的方法和系统。该方法在指定的内存使用限制下运行。系统实现该方法并扫描XML文档，根据应用程序工作负载分配边缘权重，并将XML节点的集群映射到磁盘页面，所有这些都在XML数据的单个解析器控制的传递中。应用程序工作负载信息用于生成XML集群解决方案，从而大大减少了所考虑的工作负载的页面错误。公开了用于表示工作负载信息的几种方法。例如，工作负载可能会列出应用程序中调用的XPath运算符及其调用频率。可以通过结合附加功能（如查询重要性或查询编译成本）来进一步改进应用程序工作负载。 XML访问模式也可以使用随机方法建模。

4. 发明申请

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处理。

5. 发明申请

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文档中的任何一个是递归的，其中所述检测包括构建包括元素名称的有向图; 相应的元素名称作为有向图中的节点; 从每个元素父节点到元素父节点的每个元素子节点形成弧; 并检查有向图中的周期。该系统和方法还包括识别所有递归光标节点和对应于递归粉碎树的递归度。

6. 发明申请

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.
摘要翻译：定义分层输出数据结构的标记树和检索要包含在每个分层部分中的数据的关系数据库查询操作被接受和处理。查询优化器分析标记树以确定可以组合成单个查询命令的数据库查询操作。生成一个外联合查询命令，以允许多个查询命令的有效组合，其中一些查询命令是其他命令的谓词。标记树被修改为将组合到外联合查询中的数据库查询替换为从外联合查询生成的结果集中提取数据，而不是向数据库管理器提交查询。优化的查询可以重复使用任意次数，以利用其创建中使用的优化资源。

7. 发明申请

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.
摘要翻译：一种用于维护分级文档中节点顺序的方法，系统和记录介质。该方法可以基于每个节点的所选择的最大和最小子数，来选择每个节点的最大和最小子数，构建具有至少与分层文档中的原子一样多的叶的辅助有序树，附加原子到辅助有序树的叶子，并标记辅助有序树中的每个节点。

8. 发明申请

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.
摘要翻译：定义分层输出数据结构的标记树和检索要包含在每个分层部分中的数据的关系数据库查询操作被接受和处理。查询优化器分析标记树以确定可以组合成单个查询命令的数据库查询操作。生成一个外联合查询命令，以允许多个查询命令的有效组合，其中一些查询命令是其他命令的谓词。标记树被修改为将组合到外联合查询中的数据库查询替换为从外联合查询生成的结果集中提取数据，而不是向数据库管理器提交查询。优化的查询可以重复使用任意次数，以利用其创建中使用的优化资源。

9. 发明授权

US09605250B2 Chimeric antibacterial polypeptides 有权
公开(公告)号：US09605250B2
公开(公告)日：2017-03-28
申请号：US14111531
申请日：2012-04-12
申请人： Chemira B. Appaiah , Sriram Padmanabhan , R. Sanjeev Saravanan , Bharathi Sriram
发明人： Chemira B. Appaiah , Sriram Padmanabhan , R. Sanjeev Saravanan , Bharathi Sriram
IPC分类号： A61K38/43 , C12N9/24 , C12N9/36 , C12N1/06 , C12N15/62 , C07K14/47 , C12N9/48 , C07K14/005 , A61K38/00
CPC分类号： C12N9/2462 , A61K38/00 , C07K14/005 , C07K14/47 , C07K14/4742 , C07K2319/03 , C12N1/06 , C12N9/24 , C12N9/48 , C12N15/62 , C12N2795/00022 , C12N2795/00033 , C12N2795/10122 , C12N2795/10133 , C12N2795/10322 , C12N2795/10333 , C12Y302/01017 , Y02A50/475 , Y02A50/483
摘要： Provided herein are antibacterial compositions and methods of making and using the compositions.

10. 发明授权

US09298787B2 Star and snowflake schemas in extract, transform, load processes 有权
公开(公告)号：US09298787B2
公开(公告)日：2016-03-29
申请号：US13292234
申请日：2011-11-09
申请人： Manish Anand Bhide , Srinivas Kiran Mittapalli , Sriram Padmanabhan
发明人： Manish Anand Bhide , Srinivas Kiran Mittapalli , Sriram Padmanabhan
IPC分类号： G06F17/30
CPC分类号： G06F17/30563 , G06F17/30589 , G06F17/30592
摘要： A computer-implemented method, computer program product and a system for supporting star and snowflake data schemas for use with an Extract, Transform, Load (ETL) process, comprising selecting a data source comprising dimensional data, where the dimensional data comprises at least one source table comprising at least one source column, importing a data model for the dimensional data into a data integration system, analyzing the imported data model to select a star or snowflake target data schema comprising target dimensions and target facts, generating a meta-model representation by mapping at least one source table or source column to each target fact and target dimension, automatically converting the meta-model representation into one or more ETL jobs, and executing the ETL jobs to extract the dimensional data from the data source and loading the dimensional data into the selected target data schema in a target data system.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式