TF-label: A topological-folding labeling scheme for reachability querying in a large graph
Refereed conference paper presented and published in conference proceedings

替代計量分析
.

其它資訊
摘要Reachability querying is a basic graph operation with numerous important applications in databases, network analysis, computational biology, software engineering, etc. Although many indexes have been proposed to answer reachability queries, most of them are only efficient for handling relatively small graphs. We propose TF-label, an efficient and scalable labeling scheme for processing reachability queries. TF-label is constructed based on a novel topo-logical folding (TF) that recursively folds an input graph into half so as to reduce the label size, thus improving query efficiency. We show that TF-label is efficient to construct and propose efficient algorithms and optimization schemes. Our experiments verify that TF-label is significantly more scalable and efficient than the state-of-the-art methods in both index construction and query processing. Copyright © 2013 ACM.
著者Cheng J., Huang S., Wu H., Fu A.W.-C.
會議名稱2013 ACM SIGMOD Conference on Management of Data, SIGMOD 2013
會議開始日22.06.2013
會議完結日27.06.2013
會議地點New York, NY
會議國家/地區美國
出版年份2013
月份7
日期29
頁次193 - 204
國際標準書號9781450320375
國際標準期刊號0730-8078
語言英式英語
關鍵詞Graph indexing, Graph querying, Graph reachability

上次更新時間 2020-25-10 於 00:41