TEDI Efficient Shortest Path Query Answering on Graphs出有效的最短路径查询图.pptVIP

下载本文档

4
0
约 13页
2017-03-08 发布于上海
举报
版权申诉

TEDI Efficient Shortest Path Query Answering on Graphs出有效的最短路径查询图.ppt

1、本文档共13页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
5、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
6、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
7、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
8、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

TEDI Efficient Shortest Path Query Answering on Graphs出有效的最短路径查询图

TEDI: Efficient Shortest Path Query Answering on Graphs Author: Fang Wei SIGMOD 2010 Presentation: Dr. Greg Speegle Shortest Path Problem Graph G=(V,E) V = set of vertices E = set of edges (u,v) in E, u, v in V Path from u to v Sequence of edges Shortest Path Fewest edges in path Unweighted Issues of Shortest Path Solutions Algorithms require O(|V|2) time Transitive closure requires |V|2 space Challenge: Do better! TEDI TreE Decomposition based Indexing Construct representation (tree decomposition) Algorithms on representation Equivalent results More efficient Index creation flexible Tree Decomposition Convert graph G into tree T Nodes in T Labeled (integers in paper) Subset of V Properties: All vertices in some node All edges in some node Connectedness condition Connectedness Condition Consider a vertex v Consider nodes with v Such nodes must form a subtree (i.e., be connected) Tree Paths Tree vertex If v is in Tree node i, {v,i}. Inner Edges (u,v) in E Both u and v in i (some such i must exist) ({u,i},{v,i}) is inner edge ({v,i},{u,i}) also inner edge Multiple i possible Tree Paths (contd) Inter Edges For v in V, exists set of nodes with v If edge between nodes i and j ({v,i},{v,j}) is inter edge Tree Paths Inner and Inter Edges “Up and down” tree Represent as sequence of tree edges Path Equivalence There exists a path in G from u to v, iff there exists a tree path from {u,i} to {v,j} Note: No restriction on {u,i} and {v,j} Tree path to path easy Inner Edges are path Exists tree node with every edge Path to tree path is inductive proof (see paper) Shortest Path Assume sdist(u,w) computed for all w seen so far Assume sdist(t,z) computed for all t,z in parent Compute sdist(u,z) as min(sdist(u,t)+sdist(t,z)) for all t in both parent and child, for all z only in parent Union results with previous computations Algorithm Shortest Path Lookup Let u.r (v.r) be root of tree for u (v) Find lca(u.r,v.r) Compute sdist for all points between u.r and lca an