公开(公告)号：US10089361B2

公开(公告)日：2018-10-02

申请号：US11932423

申请日：2007-10-31

申请人： Ravi Murthy ,  Muralidhar Krishnaprasad ,  Sivasankaran Chandrasekar ,  Nipun Agarwal

发明人： Ravi Murthy ,  Muralidhar Krishnaprasad ,  Sivasankaran Chandrasekar ,  Nipun Agarwal

IPC分类号： G06F7/00 ,  G06F17/30

摘要： A method and apparatus for managing hierarchical relationships in a relational database system is provided. An “orderkey” data type, which is native within a relational database system, is disclosed. The orderkey type is designed to contain values that represent the position of an entity relative to the positions of other entities within a hierarchy. Such values represent hierarchical relationships between those entities. Values that are of the orderkey type have properties that allow hierarchy-oriented functions to be performed in an especially efficient manner. Database functions, which operate on and/or produce values that are of the orderkey type, are also disclosed. Such functions can be placed within SQL statements that a database server executes, for example. In response to executing SQL statements that contain such functions, the database server performs hierarchy-oriented operations in a highly efficient manner.

公开(公告)号：US08949455B2

公开(公告)日：2015-02-03

申请号：US11284521

申请日：2005-11-21

申请人： Sam Idicula ,  Nipun Agarwal ,  Ravi Murthy ,  Eric Sedlar

发明人： Sam Idicula ,  Nipun Agarwal ,  Ravi Murthy ,  Eric Sedlar

IPC分类号： G06F15/173 ,  G06F17/30

CPC分类号： G06F17/30893 ,  G06F12/0246 ,  G06F12/0817 ,  G06F12/0833 ,  G06F17/30091 ,  G06F17/30595 ,  G06F2212/62 ,  G06F2212/622 ,  G06F2212/7204

摘要： A method and apparatus for processing path-based database operations is provided. According to one aspect, a path cache is maintained. For each hierarchical node that is traversed during a path-determining operation, it is determined whether a cache entry corresponding to that node is already contained in the path cache. If such a cache entry is already contained in the path cache, then the path indicated in that cache entry is used to complete the pathname for the node for which the operation is being performed. As a result, hierarchically higher nodes do not need to be traversed to complete the operation. Alternatively, if such a cache entry is not already contained in the path cache, then a cache entry for the node currently being traversed is generated and inserted into the path cache for use in subsequent path-determining operations.

摘要翻译： 提供了一种用于处理基于路径的数据库操作的方法和装置。 根据一个方面，维护路径高速缓存。 对于在路径确定操作期间遍历的每个分级节点，确定与该节点相对应的高速缓存条目是否已经包含在路径高速缓存中。 如果这样的缓存条目已经包含在路径缓存中，则使用该缓存条目中指示的路径来完成正在执行该操作的节点的路径名。 因此，不需要遍历层次更高的节点来完成操作。 或者，如果这样的高速缓存条目尚未包含在路径高速缓存中，则生成用于当前正在遍历的节点的高速缓存条目并将其插入到路径高速缓存中以用于随后的路径确定操作。

公开(公告)号：US08943045B2

公开(公告)日：2015-01-27

申请号：US12360919

申请日：2009-01-28

申请人： Ravi Murthy

发明人： Ravi Murthy

IPC分类号： G06F17/30 ,  G06F7/00 ,  G06F17/27

CPC分类号： G06F17/30938 ,  G06F17/276

摘要： Mechanisms are described for providing auto-completion capability in a user interface that allows users to search for XML tags and data in a collection of XML documents. A user searching for data in XML documents might not be aware of the entire structure of the data. A path context may be specified for narrowing the search to a particular set of nodes within the documents in the collection. When the user is in the process of typing in an XML tag name, but prior to submitting the tag name to the search engine, the user interface presents an ordered list of completed XML tags that match the prefix typed by the user. The order of the tags in the list reflects the frequency of the completed tags found within the specified path context of the collection of documents. Likewise, when the user is in the process of typing a string of text to be searched for within the value of XML nodes in the set of documents, but prior to submitting the test string to the search engine, the user interface presents an ordered list of completed text strings that match the partially specified text, where the order of the completed text strings reflects their frequency within the specified path context in the collection of documents.

摘要翻译： 描述了在用户界面中提供自动完成功能的机制，允许用户在XML文档集合中搜索XML标签和数据。 在XML文档中搜索数据的用户可能不知道数据的整个结构。 可以指定路径上下文以将搜索缩小到集合中的文档内的特定节点集合。 当用户正在键入XML标签名称的过程中，但是在将标签名称提交给搜索引擎之前，用户界面将显示与用户键入的前缀匹配的完整XML标签的有序列表。 列表中的标签的顺序反映了在文档集合的指定路径上下文中找到的已完成标签的频率。 类似地，当用户正在文档集合中的XML节点的值内键入要搜索的文本串的过程中，但是在将测试字符串提交给搜索引擎之前，用户界面呈现有序列表 的完整文本字符串与部分指定的文本匹配，其中完成的文本字符串的顺序反映其在文档集合中指定的路径上下文中的频率。

公开(公告)号：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.

摘要翻译： 为文档中的每个结构化元素收集规则。 适用于元素的任何特定实例的规则取决于实例在文档中的分层位置。 这些规则是以考虑到这种依赖性的方式进行收集和有效组织的。 收集规则后，可以进一步处理规则。 例如，计算之间可能存在依赖关系。 以计算这些依赖关系的方式计划计算。 一旦规则被收集并进一步处理，规则将用于验证给定的文档。

公开(公告)号：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.

摘要翻译： 从规范化数据有效地识别非结构化查询的高度相关的搜索结果。 服务器显示每个数据对象之间的关系。 对于每个搜索项，服务器识别映射到该术语的候选数据对象集合。 服务器至少部分地基于图形的链接分析中的一个或多个来计算候选数据对象的优先级分数; 或描述对候选数据对象的结构约束的元数据的分析。 基于该图，服务器识别一个或多个搜索结果子图，每个包括来自每个候选集的至少一个数据对象。 服务器按照候选数据对象的优先级得分的顺序查找子图。 服务器可以提前终止其搜索，部分原因是优先级候选数据对象增加了首先接收相关搜索结果的可能性。

公开(公告)号：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.

摘要翻译： 提供了一种用于在计算机存储系统中找到最近匹配的技术。 查询语句包括一个新的运算符，指示用户希望访问包含最接近目标值的值的一组行。 访问的索引至少部分地基于包含在该语句中的列参考。 索引包括多个叶节点，其中每个叶节点包括一个或多个条目，其中每个条目包含对应于列引用的键值以及对表中的行的引用。 由于索引中的叶节点是相互排序和链接的，所以索引的一部分只需要扫描一次。 返回表中的一组行，这些行由列值最接近目标值的一个或多个条目引用。

公开(公告)号：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.

摘要翻译： 提供了一种用于管理存储在存储库中的资源之间的关系的方法和装置。 客户端向服务器发送存储资源库中的第一个资源的请求。 响应于接收到请求，服务器解析第一资源以检索关系数据，该关系数据标识要在存储库内存储或当前存储的两个或多个资源之间的关系。 服务器在服务器可访问的数据库内存储一个或多个关系记录，用于标识两个或更多资源之间的关系。 一个或多个关系记录与两个或更多个资源分开存储。 随后，客户端可以向服务器发出关于存储在数据库中的一个或多个关系记录的查询。 以这种方式，用户可以访问一个或多个关系记录以分析存储在存储库中的资源之间的关系。

公开(公告)号：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.

摘要翻译： 提供了一种方法来将相互关联的文档分割成数据库系统的分区。 在一些实施例中，可以将多个文档分配给数据库系统中的两个或更多个分区，从而在第一分区和第二分区之间形成多个分区间链接。 这里，第一分区和第二分区都在两个或更多个分区中。 可以将第一文档分配给第一分区，而将第二文档分配给第二分区。 第一个文件和第二个文件都在多个文件中。 然后确定将第一分区中的一个或多个第一文档移动到第二分区是否减少了第一分区和第二分区之间的分区间链接的数量。 如果是这种情况，则将一个或多个第一个文档移动到第二个分区。

公开(公告)号：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文档的语句来查询复合文档，或者可以单独查询和处理子文档的父文档。 访问控制和版本控制可以在子文档的更细粒度上应用。

公开(公告)号：US07873649B2

公开(公告)日：2011-01-18

申请号：US09949020

申请日：2001-09-06

申请人： Muralidhar Krishnaprasad ,  Viswanathan Krishnamurthy ,  Ravi Murthy

发明人： Muralidhar Krishnaprasad ,  Viswanathan Krishnamurthy ,  Ravi Murthy

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30595

摘要： Techniques are provided for using XML syntax in exchanging data in relational databases. According to certain embodiments of the invention, one or more portions of the relational database is visualized as an XML document. A standard Uniform Resource Locator (URL) mechanism is provided to access data stored in the relational database by defining the URL as an XPath expression over the visualized XML document.

摘要翻译： 提供了使用XML语法在关系数据库中交换数据的技术。 根据本发明的某些实施例，关系数据库的一个或多个部分可视化为XML文档。 提供了一种标准的统一资源定位器（URL）机制，通过将可视化XML文档中的URL定义为XPath表达式来访问存储在关系数据库中的数据。