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

51. 发明授权

US09064047B2 Parallel processing of ETL jobs involving extensible markup language documents 有权
标题翻译：并行处理涉及可扩展标记语言文档的ETL作业
公开(公告)号：US09064047B2
公开(公告)日：2015-06-23
申请号：US12566255
申请日：2009-09-24
申请人： Manoj K. Agarwal , Manish A. Bhide , Srilakshmi Kotwal , Srinivas Kiran Mittapalli , Sriram Padmanabhan
发明人： Manoj K. Agarwal , Manish A. Bhide , Srilakshmi Kotwal , Srinivas Kiran Mittapalli , Sriram Padmanabhan
IPC分类号： G06F17/00 , G06F11/36 , G06F17/30
CPC分类号： G06F11/3604 , G06F17/30917
摘要： Techniques for running an Extract Transform Load (ETL) job in parallel on one or more processors wherein the ETL job comprises use of an extensible markup language (XML) document are provided. The techniques include receiving an XML document input, identifying a node in the XML document at which partitioning of the XML document is to begin, sending partition information to each respective processor, performing a shallow parsing of the XML document in parallel on the one or more processors, wherein each processor performs shallow parsing using the identified partition node until it reaches its identified partition, using the shallow parsing to generate the partition of the input XML document, wherein each processor generates a different partition of the same XML document, and sending each partition in streaming format to an ETL job instance.
摘要翻译：提供了在一个或多个处理器上并行运行提取变换加载（ETL）作业的技术，其中ETL作业包括使用可扩展标记语言（XML）文档。这些技术包括接收XML文档输入，识别XML文档中开始分割XML文档的节点，向每个相应处理器发送分区信息，在一个或多个文件上并行执行XML文档的浅析解处理器，其中每个处理器使用所识别的分区节点执行浅解析，直到其到达其识别的分区，使用浅解析来生成输入XML文档的分区，其中每个处理器生成相同XML文档的不同分区，并且发送每个以流格式分区到ETL作业实例。

52. 发明授权

US09002131B2 Method and system for enhancing image quality 有权
标题翻译：提高图像质量的方法和系统
公开(公告)号：US09002131B2
公开(公告)日：2015-04-07
申请号：US14131979
申请日：2012-09-11
申请人： Shyam Vasudeva Rao , Chandrasekhar Kuppuswamy , Mahabaleswara Ram Bhatt , Sriram Padmanabhan
发明人： Shyam Vasudeva Rao , Chandrasekhar Kuppuswamy , Mahabaleswara Ram Bhatt , Sriram Padmanabhan
IPC分类号： G06K9/40 , G06T5/00 , G06T5/20
CPC分类号： G06T5/002 , G06T5/003 , G06T5/008 , G06T5/20 , G06T2207/20012 , G06T2207/20032 , G06T2207/20192
摘要： The present disclosure relates to image filtering techniques for enhancing image quality. In one embodiment, two filtering techniques are applied on an image. Firstly, an adaptive weighted median filtering operation is performed on an acquired low contrast image corrupted by impulsive noise. Subsequently, a guided image filtering on the image obtained from adaptive weighted median filtering operation to de-blur and enhance the contrast that ultimately assures to preserve the edges of the images. In addition, the image filtering for enhancing image quality is enhanced by several variations of data adaptive guided image filtering and adaptive window sizes for guided image filtering techniques.
摘要翻译：本公开涉及用于增强图像质量的图像滤波技术。在一个实施例中，在图像上应用两种滤波技术。首先，对由脉冲噪声损坏的获取的低对比度图像执行自适应加权中值滤波操作。随后，对从自适应加权中值滤波操作获得的图像上的引导图像滤波进行去模糊并增强最终确保保留图像边缘的对比度。此外，用于增强图像质量的图像滤波通过用于引导图像滤波技术的数据自适应引导图像滤波和自适应窗口尺寸的几种变化而增强。

53. 发明授权

US07483890B2 Method, computer program product, and system of optimized data translation from relational data storage to hierarchical structure 有权
标题翻译：方法，计算机程序产品和从关系数据存储到分层结构的优化数据转换系统
公开(公告)号：US07483890B2
公开(公告)日：2009-01-27
申请号：US11623840
申请日：2007-01-17
申请人： Nianjun Zhou , George Andrei Mihaila , Dikran S. Meliksetian , Sriram Padmanabhan
发明人： Nianjun Zhou , George Andrei Mihaila , Dikran S. Meliksetian , Sriram Padmanabhan
IPC分类号： 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.
摘要翻译：定义分层输出数据结构的标记树和检索要包含在每个分层部分中的数据的关系数据库查询操作被接受和处理。查询优化器分析标记树以确定可以组合成单个查询命令的数据库查询操作。生成一个外联合查询命令，以允许多个查询命令的有效组合，其中一些查询命令是其他命令的谓词。标记树被修改为将组合到外联合查询中的数据库查询替换为从外联合查询生成的结果集中提取数据，而不是向数据库管理器提交查询。优化的查询可以重复使用任意次数，以利用其创建中使用的优化资源。

54. 发明授权

US07313563B2 Method, system and recording medium for maintaining the order of nodes in a heirarchical document 有权
标题翻译：方法，系统和记录介质，用于维护阴性文件中节点的顺序
公开(公告)号：US07313563B2
公开(公告)日：2007-12-25
申请号：US10629744
申请日：2003-07-30
申请人： Rajesh Bordawekar , Yi Chen , George A. Mihaila , Sriram Padmanabhan
发明人： Rajesh Bordawekar , Yi Chen , George A. Mihaila , Sriram Padmanabhan
IPC分类号： G06F7/00 , G06F17/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.
摘要翻译：一种用于维护分级文档中节点顺序的方法，系统和记录介质。该方法可以基于每个节点的所选择的最大和最小子数，来选择每个节点的最大和最小子数，构建具有至少与分层文档中的原子一样多的叶的辅助有序树，附加原子到辅助有序树的叶子，并标记辅助有序树中的每个节点。

55. 发明授权

US07174328B2 Selective path signatures for query processing over a hierarchical tagged data structure 失效
标题翻译：用于通过分层标记数据结构进行查询处理的选择性路径签名
公开(公告)号：US07174328B2
公开(公告)日：2007-02-06
申请号：US10653550
申请日：2003-09-02
申请人： Ioana Stanoi , Christian Lang , Sriram Padmanabhan
发明人： Ioana Stanoi , Christian Lang , Sriram Padmanabhan
IPC分类号： G06F17/30 , G06F12/00
CPC分类号： G06F17/30961 , G06F17/30917 , Y10S707/99933
摘要： A method of utilizing one or more hints for query processing over a hierarchical tagged data structure having a plurality of nodes in a computing system having memory, the hint being positive if there is a tag accessible in top-down traversal from a child node, and otherwise negative. For each tag in the data structure, the method calculates a bitmap for a current node with all bits set to 1 and for each child node, followed by AND-ing all child bitmaps and setting a bit corresponding to a tag ID of a current tag to zero if such current tag exists. The method further sets a bit of a current tag to 0, calculates a plurality of possible non-redundant hints for each child node, and refreshes a hint list.
摘要翻译：一种在具有存储器的计算系统中具有多个节点的分层标记数据结构上利用一个或多个提示进行查询处理的方法，如果存在可从子节点自顶向下遍历的标签，则该提示为肯定的;以及否则为负。对于数据结构中的每个标签，该方法计算所有位设置为1的当前节点的位图，并为每个子节点计算所有子位图的AND位，并设置与当前标签的标签ID相对应的位如果存在这样的当前标签，则为零。该方法还将当前标签的位设置为0，为每个子节点计算多个可能的非冗余提示，并刷新提示列表。

56. 发明申请

US20060161517A1 Method, system and article of manufacture for improving execution efficiency of a database workload 失效
公开(公告)号：US20060161517A1
公开(公告)日：2006-07-20
申请号：US11038513
申请日：2005-01-18
申请人： Bishwaranjan Bhattacharjee , Sam Lightstone , Timothy Malkemus , Sriram Padmanabhan , Adam Storm , Daniele Zilio
发明人： Bishwaranjan Bhattacharjee , Sam Lightstone , Timothy Malkemus , Sriram Padmanabhan , Adam Storm , Daniele Zilio
IPC分类号： G06F17/30
CPC分类号： G06F17/30592 , G06F17/30306 , Y10S707/99932 , Y10S707/99942 , Y10S707/99943
摘要： Disclosed is a data processing system implemented method, a data processing system and an article of manufacture for improving execution efficiency of a database workload to be executed against a database. The database includes database tables, and the database workload identifies at least one of the database tables. The data processing system includes an identification module for identifying candidate database tables being identifiable in the database workload, the identified candidate database tables being eligible for organization under a clustering schema, a selection module for selecting the identified candidate tables according to whether execution of the database workload is improved if the selected identified candidate table is organized according to the clustering scheme, and an organization module for organizing the clustering schema of the selected organized identified candidate tables prior to the database workload being execution against the database.

57. 发明申请

US20050138050A1 System and method for estimating storage requirements for a multi-dimensional clustering data configuration 失效
标题翻译：用于估计多维群集数据配置的存储要求的系统和方法
公开(公告)号：US20050138050A1
公开(公告)日：2005-06-23
申请号：US10993567
申请日：2004-11-19
申请人： Sam Lightstone , Sriram Padmanabhan , Richard Swagerman
发明人： Sam Lightstone , Sriram Padmanabhan , Richard Swagerman
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30492 , G06F17/30312 , G06F17/30592 , Y10S707/99943 , Y10S707/99953 , Y10S707/99956
摘要： A storage requirements estimating system estimates the storage required for a proposed multidimensional clustering data by modeling wasted space. The amount of wasted space is modeled by calculating the cardinality of the unique value of the clustering key for the proposed configuration. Cardinality may be determined by estimation techniques. Specific values for wasted space and total space may be determined in response to the determined cardinality. Comparison of estimates for different proposed clustering configurations facilitate a selection among proposed multidimensional clustering data configurations.
摘要翻译：存储需求估计系统通过建模浪费的空间来估计所提出的多维聚类数据所需的存储。通过计算建议配置的聚类密钥的唯一值的基数来建模浪费的空间量。基数可以通过估计技术来确定。浪费空间和总空间的具体值可以根据确定的基数来确定。不同提议的聚类配置的估计的比较有助于提出的多维聚类数据配置之间的选择。

58. 发明申请

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访问模式也可以使用随机方法建模。

59. 发明申请

US20050050016A1 Selective path signatures for query processing over a hierarchical tagged data structure 失效
标题翻译：用于通过分层标记数据结构进行查询处理的选择性路径签名
公开(公告)号：US20050050016A1
公开(公告)日：2005-03-03
申请号：US10653550
申请日：2003-09-02
申请人： Ioana Stanoi , Christian Lang , Sriram Padmanabhan
发明人： Ioana Stanoi , Christian Lang , Sriram Padmanabhan
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30961 , G06F17/30917 , Y10S707/99933
摘要： A method of utilizing one or more hints for query processing over a hierarchical tagged data structure having a plurality of nodes in a computing system having memory, the hint being positive if there is a tag accessible in top-down traversal from a child node, and otherwise negative. For each tag in the data structure, the method calculates a bitmap for a current node with all bits set to 1 and for each child node, followed by AND-ing all child bitmaps and setting a bit corresponding to a tag ID of a current tag to zero if such current tag exists. The method further sets a bit of a current tag to 0, calculates a plurality of possible non-redundant hints for each child node, and refreshes a hint list.
摘要翻译：一种在具有存储器的计算系统中具有多个节点的分层标记数据结构上利用一个或多个提示进行查询处理的方法，如果存在可从子节点自顶向下遍历的标签，则该提示为肯定的;以及否则为负。对于数据结构中的每个标签，该方法计算所有位设置为1的当前节点的位图，并为每个子节点计算所有子位图的AND位，并设置与当前标签的标签ID相对应的位如果存在这样的当前标签，则为零。该方法还将当前标签的位设置为0，为每个子节点计算多个可能的非冗余提示，并刷新提示列表。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式