首页>
外国专利>
REGULAR PATH QUERIES (RPQS) FOR DISTRIBUTED GRAPHS
REGULAR PATH QUERIES (RPQS) FOR DISTRIBUTED GRAPHS
展开▼
机译:分布式图形的常规路径查询(RPQ)
展开▼
页面导航
摘要
著录项
相似文献
摘要
A pattern matching engine interprets a query into a data structure resembling a finite state machine. Vertices in the query pattern are treated as states or stages, while edges connecting them are treated as state transitions or hops. To match the full pattern, the first stage is first matched by applying vertex filters, if any. If the vertex is eligible, its edges that satisfy the edge filters, if any, are followed to move to the neighbors that can potentially produce results, thus progressing to the next stage. This process is repeated; if all stages are matched, then the whole pattern has been matched successfully.
展开▼