公开(公告)号：US20160026731A1

公开(公告)日：2016-01-28

申请号：US14873748

申请日：2015-10-02

Applicant: Oracle International Corporation

Inventor： Ravi Murthy

IPC: G06F17/30

CPC classification number: G06F16/986 ,  G06F16/835 ,  G06F16/94 ,  G06F16/9558 ,  G06F17/2229 ,  G06F17/2247

Abstract: 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.

Abstract translation: 声明机制用于管理存储库中的大型文档。 大文档被分段到由父文档链接在一起的子文档中。 父文档和子文档的组合被称为复合文档。 有多种选项用于配置将源文档分解为复合文档并命名子文档的规则。 可以使用将复合文档视为单个XML文档的语句来查询复合文档，或者可以单独查询和处理子文档的父文档。 访问控制和版本控制可以在子文档的更细粒度上应用。

公开(公告)号：US20140207802A1

公开(公告)日：2014-07-24

申请号：US14222521

申请日：2014-03-21

Applicant: Oracle International Corporation

Inventor： Nikhil Raghavan ,  Ravi Murthy ,  Aman Naimat

IPC: G06F17/30

CPC classification number: G06F17/30651 ,  G06F17/30112 ,  G06F17/30958

Abstract: 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.

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

公开(公告)号：US20130318109A1

公开(公告)日：2013-11-28

申请号：US13953582

申请日：2013-07-29

Applicant: Oracle International Corporation

Inventor： Asha Tarachandani ,  Sivasankaran Chandrasekar ,  Man-Hay Tam ,  Anh-Tuan Tran ,  Ravi Murthy ,  Nipun Agarwal ,  Eric Sedlar

IPC: G06F17/30

CPC classification number: G06F17/30011 ,  G06F17/2229 ,  G06F17/2247 ,  G06F17/30908

Abstract: A mechanism is provided for detecting and disregarding application specific nodes contained in shared XML documents. The techniques described involve determining one or more application specific nodes within XML documents and performing path expression evaluations of the XML documents as if the nodes are not present. In one embodiment, a mechanism is provided by which a user may specify the criterion that determine which subset of node in XML documents are to be ignored from path expression evaluations and evaluating a query that specifies a path operation based on a path and ignoring said identified nodes when evaluating said path operation.

Abstract translation: 提供了一种用于检测和忽略包含在共享XML文档中的应用程序特定节点的机制。 所描述的技术涉及确定XML文档内的一个或多个应用特定节点，并且如同节点不存在一样执行XML文档的路径表达式评估。 在一个实施例中，提供了一种机制，用户可以通过该机制指定确定XML文档中的节点的哪个子集将被从路径表达式评估中忽略的标准，并且基于路径评估指定路径操作的查询，并忽略所述标识的 节点在评估所述路径操作时。

公开(公告)号：US20130282710A1

公开(公告)日：2013-10-24

申请号：US13923072

申请日：2013-06-20

Applicant: Oracle International Corporation

Inventor： Nikhil Raghavan ,  Ravi Murthy ,  Aman Naimat

IPC: G06F17/30

CPC classification number: G06F17/30554 ,  G06F17/30941

Abstract: 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.

Abstract translation: 公开了用于呈现包括搜索结果的两个或多个不同结构的子集的搜索结果的半结构化集合的技术。 搜索结果分为两组或多组相似结构的结果。 搜索结果显示在它们各自的组中而不是单个集合中。 使用不同的显示结构显示每个组，按照组排名机制确定的顺序。 由结果排序机制排序的组内的搜索结果。 还公开了通过强调高度相关的结果字段来增强类似结构化数据的显示的技术。 高度相关的结果字段可以基于元数据排名机制，其组成值的唯一性，历史反馈，关键词位置和/或其他机制来识别。 使用而不是限制从显示中突出显示，重新排序和过滤未强调的字段来强调这些字段。