公开(公告)号：US20130218898A1

公开(公告)日：2013-08-22

申请号：US13398792

申请日：2012-02-16

申请人： Nikhil Raghavan ,  Ravi Murthy ,  Aman Naimat

发明人： Nikhil Raghavan ,  Ravi Murthy ,  Aman Naimat

IPC分类号： G06F17/30

CPC分类号： G06F17/30404

摘要： Metadata search is enhanced by utilizing relationship data indicating relationships between metadata items. A server generates an index mapping metadata items to terms associated with the metadata items and a graph describing relationships between each of the metadata items. When the server receives a search request, the server locates a candidate set of the metadata items based on the search term(s) and the index. The server performs a link analysis of the graph to determine a relationship score for each metadata item. For each particular metadata item in the candidate set of the metadata items, the server calculates a ranking score based at least on the relationship score for the particular metadata item. The server generates a ranked result set based on comparing the ranking scores for the candidate set of metadata items. The server then provides information indicating the ranked result set in response to the search request.

摘要翻译： 通过利用表示元数据项之间关系的关系数据来增强元数据搜索。 服务器生成将元数据项映射到与元数据项相关联的术语的索引，以及描述每个元数据项之间的关系的图。 当服务器接收到搜索请求时，服务器根据搜索项和索引来定位元数据项的候选集。 服务器执行图形的链接分析，以确定每个元数据项目的关系得分。 对于元数据项的候选集合中的每个特定元数据项，服务器至少基于特定元数据项的关系得分来计算排名得分。 服务器基于比较候选元数据集合的排名分数来生成排名结果集。 然后，服务器响应于搜索请求提供指示排名结果集的信息。

公开(公告)号：US08484208B1

公开(公告)日：2013-07-09

申请号：US13398799

申请日：2012-02-16

申请人： Nikhil Raghavan ,  Ravi Murthy ,  Aman Naimat

发明人： Nikhil Raghavan ,  Ravi Murthy ,  Aman Naimat

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

CPC分类号： G06F17/30554 ,  G06F17/30941

摘要： Techniques are disclosed for presenting semi-structured sets of search results comprising two or more differently-structured subsets of search results. The search results are divided into two or more groups of similarly-structured results. The search results are displayed in their respective groups rather than as a single set. Each group is displayed using a different display structure, in an order determined by a group ranking mechanism. The search results within a group ordered by a result ranking mechanism. Techniques are also disclosed for enhancing a display of similarly structured data by emphasizing highly relevant result fields. The highly relevant result fields may be identified based on metadata ranking mechanisms, uniqueness of their constituent values, historical feedback, keyword location, and/or other mechanisms. The fields are emphasized using, without limitation, highlighting, reordering, and filtering of unemphasized fields from the display.

公开(公告)号：US08078611B2

公开(公告)日：2011-12-13

申请号：US11648950

申请日：2007-01-03

申请人： Nipun Agarwal ,  Sanket Malde ,  Bhushan Khaladkar ,  Ravi Murthy ,  Sivasankaran Chandrasekar

发明人： Nipun Agarwal ,  Sanket Malde ,  Bhushan Khaladkar ,  Ravi Murthy ,  Sivasankaran Chandrasekar

IPC分类号： G06F17/30

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

摘要： Systems, methods, and other embodiments associated with providing query modes for translation-enabled XML documents are described. One method embodiment includes receiving an XPath query to an XML document that may store a translation for a data element. The method embodiment may also include automatically selecting a query mode for the XPath query. The method embodiment may also include querying the XML document using the XPath query and the selected query mode. The query mode may control, at least in part, the operation of an XML database logic.

摘要翻译： 描述了与为支持翻译的XML文档提供查询模式相关联的系统，方法和其他实施例。 一种方法实施例包括：向可能存储数据元素的翻译的XML文档接收XPath查询。 方法实施例还可以包括自动选择XPath查询的查询模式。 方法实施例还可以包括使用XPath查询和所选择的查询模式查询XML文档。 至少部分地，查询模式可以控制XML数据库逻辑的操作。

公开(公告)号：US08001127B2

公开(公告)日：2011-08-16

申请号：US12103880

申请日：2008-04-16

申请人： Sivasankaran Chandrasekar ,  Ashish Thusoo ,  Ravi Murthy ,  Nipun Agarwal ,  Eric Sedlar ,  Sreedhar Mukkamalla

发明人： Sivasankaran Chandrasekar ,  Ashish Thusoo ,  Ravi Murthy ,  Nipun Agarwal ,  Eric Sedlar ,  Sreedhar Mukkamalla

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

CPC分类号： G06F17/30914 ,  G06F17/30911 ,  G06F17/30929 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99945 ,  Y10S707/99948

摘要： A method and system are provided for extracting a valid, self-contained fragment for a node in a XML document stored in a database management system. An XML index is used to identify a location in which XML fragment data corresponding to the node is located. Ancestors of the node are identified and examined for any information needed for the proper interpretation of the fragment. If an ancestor node contains such needed information, this information is patched into the XML fragment to ensure that the fragment is a valid, self-contained XML fragment.

摘要翻译： 提供了一种用于提取存储在数据库管理系统中的XML文档中的节点的有效的，独立的片段的方法和系统。 XML索引用于标识与节点对应的XML片段数据所在的位置。 识别和检查节点的祖先，以便适当解释片段所需的任何信息。 如果祖先节点包含这些所需的信息，则将该信息修补到XML片段中，以确保该片段是有效的，独立的XML片段。

公开(公告)号：US07992081B2

公开(公告)日：2011-08-02

申请号：US11407508

申请日：2006-04-19

申请人： Vijay Medi ,  Nipun Agarwal ,  Ravi Murthy ,  Eric Sedlar ,  Arkady Rabinov

发明人： Vijay Medi ,  Nipun Agarwal ,  Ravi Murthy ,  Eric Sedlar ,  Arkady Rabinov

IPC分类号： G06F17/21

CPC分类号： G06F17/272 ,  G06F17/2247 ,  G06F17/2258 ,  G06F17/2725

摘要： A method and apparatus for streaming validation of XML documents is provided. A particular event of a series of events is received. The series of events is generated as an XML document is parsed by a parser, and the received particular event indicates that the parser has encountered a particular part of the XML document. The particular part of the XML document indicated by the particular event is then received. A current validation state for the XML document is determined. The current validation state, which is one of a plurality of validation states for the XML document, indicates a validation type associated with the particular part of the XML document. Based on at least the current validation state, the particular part of the XML document is validated against an XML schema that defines the structure of the XML document.

摘要翻译： 提供了一种用于XML文档的流验证的方法和装置。 收到一系列事件的特定事件。 一系列事件是由解析器解析为XML文档而生成的，并且接收的特定事件指示解析器遇到了XML文档的特定部分。 然后接收由特定事件指示的XML文档的特定部分。 确定XML文档的当前验证状态。 作为XML文档的多个验证状态之一的当前验证状态指示与XML文档的特定部分相关联的验证类型。 至少基于当前的验证状态，XML文档的特定部分将针对定义XML文档结构的XML模式进行验证。

公开(公告)号：US07937398B2

公开(公告)日：2011-05-03

申请号：US12903437

申请日：2010-10-13

申请人： Ravi Murthy

发明人： Ravi Murthy

IPC分类号： G06F7/00 ,  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文档的语句来查询复合文档，或者可以单独查询和处理子文档的父文档。 访问控制和版本控制可以在子文档的更细粒度上应用。

公开(公告)号：US07933928B2

公开(公告)日：2011-04-26

申请号：US11317101

申请日：2005-12-22

申请人： Sivasankaran Chandrasekar ,  Nipun Agarwal ,  Namit Jain ,  Ravi Murthy

发明人： Sivasankaran Chandrasekar ,  Nipun Agarwal ,  Namit Jain ,  Ravi Murthy

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

CPC分类号： G06F17/2247 ,  G06F17/30908

摘要： A method and apparatus for loading an XML document into memory is provided. A client loads one or more array elements into a first partition of an array that is maintained in memory. Each array element represents an XML element of an XML document. Upon determining that an amount of data maintained in the first partition exceeds a first threshold, the client subsequently loads array elements into a new partition of the array. Upon determining that an amount of data maintained in the memory of the client exceeds a second threshold, the array elements of the least recently used partition are persistently stored in a database without persistently storing the entire XML document. When the last XML element of the XML document is loaded into a partition of the array, that partition is persistently stored in the database, thereby causing the entire XML document to be stored in the database.

摘要翻译： 提供了一种将XML文档加载到存储器中的方法和装置。 客户端将一个或多个数组元素加载到内存中维护的数组的第一个分区中。 每个数组元素表示XML文档的XML元素。 在确定在第一分区中维护的数据量超过第一阈值时，客户端随后将数组元素加载到阵列的新分区中。 在确定在客户端的存储器中维护的数据量超过第二阈值时，最近最少使用的分区的数组元素被持久地存储在数据库中，而不会持续存储整个XML文档。 当XML文档的最后一个XML元素加载到数组的分区中时，该分区将永久存储在数据库中，从而使整个XML文档存储在数据库中。

公开(公告)号：US07840609B2

公开(公告)日：2010-11-23

申请号：US11888415

申请日：2007-07-31

申请人： Sivasankaran Chandrasekar ,  Ravi Murthy ,  Thomas Baby ,  Nipun Agarwal

发明人： Sivasankaran Chandrasekar ,  Ravi Murthy ,  Thomas Baby ,  Nipun Agarwal

IPC分类号： G06F7/00

CPC分类号： G06F17/30935 ,  G06F17/30442

摘要： A method and apparatus are provided for using sibling-counts in XML indices to optimize single-path queries. Using a b-tree XML index with a SQL query logarithmically reduces the number of disk accesses by passing over index entries where it is determined that a match will not be found. However, because certain index entries are passed over, it is impossible to ascertain if a path expression occurs more than once in the XML index, as certain queries sometimes require. This hurdle can be overcome by maintaining a sibling count with each node entry in the XML index. Because the sibling count is stored with the index entry, the index will reveal whether the matching node is single or has other siblings. In additional to re-writing the original query for optimization by use of an XML index, it will be re-written to check for a single-path condition in the index.

摘要翻译： 提供了一种方法和装置，用于在XML索引中使用同级计数来优化单路径查询。 在SQL查询中使用b-tree XML索引对数地减少了通过传递索引条目的磁盘访问次数，确定不会找到匹配项。 但是，由于某些索引条目被传递，因此某些查询有时需要，无法确定路径表达式是否在XML索引中多次出现。 通过维护XML索引中每个节点条目的兄弟数量，可以克服这个障碍。 由于兄弟计数与索引条目一起存储，索引将显示匹配节点是单个节点还是具有其他兄弟节点。 除了通过使用XML索引重新编写原始查询进行优化外，还将重新编写索引中的单路径条件。

公开(公告)号：US20090157715A1

公开(公告)日：2009-06-18

申请号：US11959288

申请日：2007-12-18

申请人： Ravi Murthy

发明人： Ravi Murthy

IPC分类号： G06F7/06

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.

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

公开(公告)号：US07493305B2

公开(公告)日：2009-02-17

申请号：US11059665

申请日：2005-02-15

申请人： Ashish Thusoo ,  Sivasankaran Chandrasekar ,  Ravi Murthy ,  Nipun Agarwal ,  Eric Sedlar ,  Sreedhar Mukkamalla ,  Reema Koo

发明人： Ashish Thusoo ,  Sivasankaran Chandrasekar ,  Ravi Murthy ,  Nipun Agarwal ,  Eric Sedlar ,  Sreedhar Mukkamalla ,  Reema Koo

IPC分类号： G06F17/30

CPC分类号： G06F17/30911 ,  G06F17/30935 ,  G06F17/30938 ,  Y10S707/99932 ,  Y10S707/99942

摘要： A method and system are provided for determining whether a given path is an indexed path of XML documents stored in a database management system. A finite state machine is built using the path subsetting rules specified by a user. The finite state machine is traversed using the given path. If any accepting states are reached during the traversal of the finite state machine, the given path is determined to matching the path subsetting rules.

摘要翻译： 提供了一种用于确定给定路径是否存储在数据库管理系统中的XML文档的索引路径的方法和系统。 使用用户指定的路径子集规则构建有限状态机。 使用给定的路径遍历有限状态机。 如果在遍历有限状态机期间达到任何接受状态，则确定给定路径以匹配路径子集规则。