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

91. 发明授权

US08938668B2 Validation based on decentralized schemas 有权
标题翻译：基于分散式模式的验证
公开(公告)号：US08938668B2
公开(公告)日：2015-01-20
申请号：US13221832
申请日：2011-08-30
申请人： Andrea Di Blas , Ravi Murthy , Mayssam Sayyadian
发明人： Andrea Di Blas , Ravi Murthy , Mayssam Sayyadian
IPC分类号： G06F17/00 , G06F17/27 , G06F17/22
CPC分类号： G06F17/2725 , G06F17/2247
摘要： Rules are collected for each structured element in a document. The rules that apply to any particular instance of an element depend on the hierarchical position of the instance within the document. The rules are collected and efficiently organized in a manner that accounts for this dependency. Once the rules are collected, the rules may be further processed. For example, there may be dependencies between calculations. The computation of the calculations is scheduled in a manner that accounts for these dependencies. Once the rules are collected and further processed, the rules are used to validate the given document.
摘要翻译：为文档中的每个结构化元素收集规则。适用于元素的任何特定实例的规则取决于实例在文档中的分层位置。这些规则是以考虑到这种依赖性的方式进行收集和有效组织的。收集规则后，可以进一步处理规则。例如，计算之间可能存在依赖关系。以计算这些依赖关系的方式计划计算。一旦规则被收集并进一步处理，规则将用于验证给定的文档。

92. 发明授权

US08682932B2 Mechanisms for searching enterprise data graphs 有权
标题翻译：搜索企业数据图的机制
公开(公告)号：US08682932B2
公开(公告)日：2014-03-25
申请号：US13398794
申请日：2012-02-16
申请人： Nikhil Raghavan , Ravi Murthy , Aman Naimat
发明人： Nikhil Raghavan , Ravi Murthy , Aman Naimat
IPC分类号： G06F7/00
CPC分类号： G06F17/30651 , G06F17/30112 , G06F17/30958
摘要： Highly relevant search results for unstructured queries are efficiently identified from normalized data. A server graphs relationships between each of the data objects. For each search term, the server identifies a candidate set of data objects mapped to the term. The server calculates priority scores for the candidate data objects based at least in part on one or more of: a link analysis of the graph; or an analysis of metadata describing structural constraints upon the candidate data objects. Based on the graph, the server identifies one or more search result subgraphs, each comprising at least one data object from each of the candidate sets. The server looks for subgraphs in an order that is based on the priority scores for the candidate data objects. The server may terminate its search early, in part because prioritizing the candidate data objects increases the likelihood of receiving relevant search results first.
摘要翻译：从规范化数据有效地识别非结构化查询的高度相关的搜索结果。服务器显示每个数据对象之间的关系。对于每个搜索项，服务器识别映射到该术语的候选数据对象集合。服务器至少部分地基于图形的链接分析中的一个或多个来计算候选数据对象的优先级分数; 或描述对候选数据对象的结构约束的元数据的分析。基于该图，服务器识别一个或多个搜索结果子图，每个包括来自每个候选集的至少一个数据对象。服务器按照候选数据对象的优先级得分的顺序查找子图。服务器可以提前终止其搜索，部分原因是优先级候选数据对象增加了首先接收相关搜索结果的可能性。

93. 发明授权

US08452757B2 Index mechanism for finding nearest matches in a computer system 有权
标题翻译：在计算机系统中找到最匹配的索引机制
公开(公告)号：US08452757B2
公开(公告)日：2013-05-28
申请号：US11388300
申请日：2006-03-24
申请人： Ravi Murthy
发明人： Ravi Murthy
IPC分类号： G06F7/00
CPC分类号： G06F17/30327 , G06F17/30492
摘要： A technique for finding the nearest match in a computer storage system is provided. A query statement includes a new operator that indicates that a user desires to access a set of rows that contain a value nearest to a target value. An index is accessed that is based at least in part on a column reference included in the statement. The index comprises a plurality of leaf nodes, where each leaf node comprises one or more entries, where each entry contains a key value, corresponding to the column reference, and a reference to a row in a table. Because leaf nodes in an index are ordered and linked to one another, a portion of the index need only be scanned once. The set of rows from the table are returned that are referenced by one or more entries whose column values are nearest to the target value.
摘要翻译：提供了一种用于在计算机存储系统中找到最近匹配的技术。查询语句包括一个新的运算符，指示用户希望访问包含最接近目标值的值的一组行。访问的索引至少部分地基于包含在该语句中的列参考。索引包括多个叶节点，其中每个叶节点包括一个或多个条目，其中每个条目包含对应于列引用的键值以及对表中的行的引用。由于索引中的叶节点是相互排序和链接的，所以索引的一部分只需要扫描一次。返回表中的一组行，这些行由列值最接近目标值的一个或多个条目引用。

94. 发明授权

US08356053B2 Managing relationships between resources stored within a repository 有权
标题翻译：管理存储在存储库中的资源之间的关系
公开(公告)号：US08356053B2
公开(公告)日：2013-01-15
申请号：US11256527
申请日：2005-10-20
申请人： Ravi Murthy , Eric Sedlar
发明人： Ravi Murthy , Eric Sedlar
IPC分类号： G06F17/30
CPC分类号： G06F17/30917
摘要： A method and apparatus for managing relationships between resources stored in a repository is provided. A client sends, to a server, a request to store a first resource within a repository. In response to receiving the request, the server parses the first resource to retrieve relationship data that identifies a relationship between two or more resources to be stored, or currently stored, within the repository. The server stores, within a database accessible to the server, one or more relationship records that identify the relationship between the two or more resources. The one or more relationship records are stored separate from the two or more resources. Subsequently, the client may issue queries, to the server, about the one or more relationships records stored in the database. In this way, a user may access the one or more relationship records to analyze the relationship between resources stored in repository.
摘要翻译：提供了一种用于管理存储在存储库中的资源之间的关系的方法和装置。客户端向服务器发送存储资源库中的第一个资源的请求。响应于接收到请求，服务器解析第一资源以检索关系数据，该关系数据标识要在存储库内存储或当前存储的两个或多个资源之间的关系。服务器在服务器可访问的数据库内存储一个或多个关系记录，用于标识两个或更多资源之间的关系。一个或多个关系记录与两个或更多个资源分开存储。随后，客户端可以向服务器发出关于存储在数据库中的一个或多个关系记录的查询。以这种方式，用户可以访问一个或多个关系记录以分析存储在存储库中的资源之间的关系。

95. 发明授权

US08260832B2 Managing large collection of interlinked XML documents 有权
标题翻译：管理大量的互连XML文档集合
公开(公告)号：US08260832B2
公开(公告)日：2012-09-04
申请号：US11959288
申请日：2007-12-18
申请人： Ravi Murthy
发明人： Ravi Murthy
IPC分类号： G06F17/30
CPC分类号： G06F17/2247 , G06F17/2235
摘要： An approach is provided to partition inter-linked documents into partitions of a database system. In some embodiments, a plurality of documents may be assigned to two or more partitions in the database system, thereby forming a number of inter-partition links between a first partition and a second partition. Here both the first partition and the second partition are in the two or more partitions. First documents may be assigned to the first partition while second documents are assigned to the second partition. Both the first documents and the second documents are in the plurality of documents. It is then determined whether moving one or more of the first documents in the first partition to the second partition reduces the number of inter-partition links between the first partition and the second partition. If that is the case, the one or more of the first documents are moved to the second partition.
摘要翻译：提供了一种方法来将相互关联的文档分割成数据库系统的分区。在一些实施例中，可以将多个文档分配给数据库系统中的两个或更多个分区，从而在第一分区和第二分区之间形成多个分区间链接。这里，第一分区和第二分区都在两个或更多个分区中。可以将第一文档分配给第一分区，而将第二文档分配给第二分区。第一个文件和第二个文件都在多个文件中。然后确定将第一分区中的一个或多个第一文档移动到第二分区是否减少了第一分区和第二分区之间的分区间链接的数量。如果是这种情况，则将一个或多个第一个文档移动到第二个分区。

96. 发明申请

US20110047193A1 MANAGING COMPOUND XML DOCUMENTS IN A REPOSITORY 有权
标题翻译：在报告中管理复合XML文档
公开(公告)号：US20110047193A1
公开(公告)日：2011-02-24
申请号：US12903437
申请日：2010-10-13
申请人： Ravi Murthy
发明人： Ravi Murthy
IPC分类号： G06F17/30
CPC分类号： G06F17/30923
摘要： A declarative mechanism is used to manage large documents within a repository. The large documents are sectioned into subdocuments that are linked together by a parent document. The combination of the parent document and subdocument is referred to as a compound document. There are multiple options for configuring rules to break up a source document into a compound document and naming the subdocuments. The compound documents may be queried using statements that treat the compound document as a single XML document, or the parent document of a subdocument may be queried and treated independently. Access control and versioning can be applied at the finer granularity of the subdocument.
摘要翻译：声明机制用于管理存储库中的大型文档。大文档被分段到由父文档链接在一起的子文档中。父文档和子文档的组合被称为复合文档。有多种选项用于配置将源文档分解为复合文档并命名子文档的规则。可以使用将复合文档视为单个XML文档的语句来查询复合文档，或者可以单独查询和处理子文档的父文档。访问控制和版本控制可以在子文档的更细粒度上应用。

97. 发明授权

US07761479B2 Management of complex XML schemas in a database system 有权
标题翻译：在数据库系统中管理复杂的XML模式
公开(公告)号：US07761479B2
公开(公告)日：2010-07-20
申请号：US11519720
申请日：2006-09-11
申请人： Abhyudaya Agrawal , Thomas Baby , Ravi Murthy , Nipun Agarwal
发明人： Abhyudaya Agrawal , Thomas Baby , Ravi Murthy , Nipun Agarwal
IPC分类号： G06F7/00 , G06F17/00
CPC分类号： G06F17/30917 , Y10S707/954
摘要： Techniques manage the presence of repeated constructs within a complex type at the time of schema registration. At registration, techniques detect repeated elements in the XML schema and analyze whether the repeated elements are from the same complex type. If so, techniques perform additional analysis to determine a minimal common ancestor. Within the context of a minimal common ancestor, techniques determine the maximum number of times an element may occur in the schema. In a choice content model, the largest maximum occurrence value is selected. In other content models, the maximum occurrence value is determined by adding together the occurrence values for the repeated elements. Then, when an object relational table is generated for the XML schema, the maximum number of times that an element appears in the schema is this value. Techniques retain the advantages of object relational storage, even after a schema evolution.
摘要翻译：技术在模式注册时管理复杂类型中重复构造的存在。在注册时，技术会检测XML模式中的重复元素，并分析重复的元素是否来自相同的复杂类型。如果是这样，技术将进行额外的分析，以确定一个最小的共同祖先。在最小共同祖先的上下文中，技术确定元素在模式中可能发生的最大次数。在选择内容模型中，选择最大的最大出现值。在其他内容模型中，通过将重复元素的出现值相加来确定最大出现值。然后，当为XML模式生成对象关系表时，元素在模式中出现的最大次数是此值。技术保留对象关系存储的优点，即使在模式演进之后。

98. 发明授权

US07689542B2 Dynamic return type generation in a database system 有权
标题翻译：数据库系统中的动态返回类型生成
公开(公告)号：US07689542B2
公开(公告)日：2010-03-30
申请号：US10767512
申请日：2004-01-29
申请人： Adiel M. Yoaz , Qin Yu , Ravi Murthy , Susan Kotsovolos
发明人： Adiel M. Yoaz , Qin Yu , Ravi Murthy , Susan Kotsovolos
IPC分类号： G06F17/30
CPC分类号： G06F7/00 , G06F17/30 , Y10S707/99933
摘要： Dynamic return type generation in a database system. A request is received to execute a first function. A second function is executed if the first function is defined to return data in a first type of data structure. When executed, the second function returns formatting information that indicates an arrangement of fields of data within the first type of data structure. The first function is executed to obtain a collection of data formatted according to the first type of data structure, and the collection of data is organized according to the formatting information returned by the second function.
摘要翻译：数据库系统中的动态返回类型生成。接收到执行第一功能的请求。如果第一个函数定义为返回第一类数据结构中的数据，则执行第二个函数。当执行时，第二功能返回指示第一类型的数据结构内的数据的排列的格式化信息。执行第一功能以获得根据第一类型的数据结构格式化的数据的集合，并且根据由第二功能返回的格式化信息来组织数据的收集。

99. 发明授权

US07680764B2 Parallel population of an XML index 有权
标题翻译： XML索引的并行总体
公开(公告)号：US07680764B2
公开(公告)日：2010-03-16
申请号：US11472837
申请日：2006-06-21
申请人： Sivansankaran Chandrasekar , Anh-Tuan Tran , Ravi Murthy , Nipun Agarwal
发明人： Sivansankaran Chandrasekar , Anh-Tuan Tran , Ravi Murthy , Nipun Agarwal
IPC分类号： G06F17/30
CPC分类号： G06F17/30911 , Y10S707/99932
摘要： Populating an XML index is parallelized, providing both inter-document and intra-document parallelism, by using multiple pull-type parser processes to parse respective XML documents in parallel and to call respective ‘instances’ of the function that generates the index entries based on parsed XML node information. The function is configured to operate according to a cursor-type interface model, whereby each function instance can operate on one node at a time in a controlled pull manner rather than in an uncontrolled streaming manner. Hence, the index load procedure flow can be in the control of an application or routine, via the pull parsers, rather than in the control of a serial stream-based parser.
摘要翻译：通过使用多个拉类型解析器进程并行解析相应的XML文档并调用基于生成索引条目的函数的相应“实例”，来填充XML索引并行化，提供文档间和文档内并行性解析XML节点信息。该功能被配置为根据光标类型接口模型进行操作，由此每个功能实例可以以受控的拉动方式而不是以不受控制的流式方式一次在一个节点上操作。因此，索引加载过程流程可以通过拉式解析器控制应用程序或例程，而不是控制基于串行流的解析器。

100. 发明授权

US07440954B2 Index maintenance for operations involving indexed XML data 有权
标题翻译：涉及索引XML数据的操作的索引维护
公开(公告)号：US07440954B2
公开(公告)日：2008-10-21
申请号：US10944177
申请日：2004-09-16
申请人： Ravi Murthy , Sivasankaran Chandrasekaran , Ashish Thusoo , Nipun Agarwal , Eric Sedlar
发明人： Ravi Murthy , Sivasankaran Chandrasekaran , Ashish Thusoo , Nipun Agarwal , Eric Sedlar
IPC分类号： G06F17/30
CPC分类号： G06F17/30917 , G06F17/2241 , G06F17/2247 , G06F17/30911 , Y10S707/99942 , Y10S707/99952
摘要： A method and system are provided for maintaining an XML index in response to piece-wise modifications on indexed XML documents. The database server that manages the XML index determines which nodes are involved in the piece-wise modifications, and updates the XML index based on only those nodes. Index entries for nodes not involved in the piece-wise modifications remain unchanged.
摘要翻译：提供了一种方法和系统，用于响应于对索引的XML文档的分段修改来维护XML索引。管理XML索引的数据库服务器确定哪些节点涉及分段修改，并仅基于这些节点更新XML索引。不参与分段修改的节点的索引条目保持不变。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式