公开(公告)号：US08630997B1

公开(公告)日：2014-01-14

申请号：US12398810

申请日：2009-03-05

申请人： Maxim Kulkin ,  Roman Alekseenkov ,  Andrew Lazarev ,  Maxim Zhilyaev

发明人： Maxim Kulkin ,  Roman Alekseenkov ,  Andrew Lazarev ,  Maxim Zhilyaev

IPC分类号： G06F17/30

CPC分类号： G06F17/30938

摘要： A query (e.g., an extensible markup language (XML) Path or XPath query) for one or more components of a document (e.g., XML document) may be received. A forward axis graph including a plurality of nodes with edges connecting the nodes may be generated based on the query and corresponding to a traversal of the document as associated with events (e.g., XML SAX events) corresponding to the document. A plurality of matching states of the forward axis graph including at least one final state may be identified, each matching state including a subset of the nodes wherein each incoming edge to the subset originates from one of the nodes of the subset. Whether the one or more components of the query exist within the document may be based on which events correspond to transitions between the matching states and whether the final state is achieved.

摘要翻译： 可以接收对于文档的一个或多个组件（例如，XML文档）的查询（例如，可扩展标记语言（XML）Path或XPath查询）。 可以基于查询生成包括具有连接节点的边缘的多个节点的前向轴图，并且对应于与文档相对应的事件（例如，XML SAX事件）关联的文档遍历。 可以识别包括至少一个最终状态的正向轴图的多个匹配状态，每个匹配状态包括节点的子集，其中子集的每个进入边源自该子集的一个节点。 存在于文档中的查询的一个或多个组件可以基于哪些事件对应于匹配状态之间的转换以及是否实现最终状态。