Author:
Bouros Panagiotis,Skiadopoulos Spiros,Dalamagas Theodore,Sacharidis Dimitris,Sellis Timos
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Critchlow, T., Lacroix, Z.: Bioinformatics: Managing Scientific Data. Morgan Kaufmann, San Francisco (2003)
2. Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: SODA, pp. 937–946 (2002)
3. Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: SIGMOD Conference, pp. 253–262 (1989)
4. Jin, R., Xiang, Y., Ruan, N., Wang, H.: Efficiently answering reachability queries on very large directed graphs. In: SIGMOD Conference, pp. 595–608 (2008)
5. Wang, H., He, H., Yang, J., Yu, P.S., Yu, J.X.: Dual labeling: Answering graph reachability queries in constant time. In: ICDE, p. 75 (2006)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Indexing the extended Dyck-CFL reachability for context-sensitive program analysis;Proceedings of the ACM on Programming Languages;2022-10-31
2. Efficient Maintenance of Shortest Distances in Dynamic Graphs;IEEE Transactions on Knowledge and Data Engineering;2018-03-01
3. Incremental maintenance of all-pairs shortest paths in relational DBMSs;Social Network Analysis and Mining;2017-08-01
4. Efficient Maintenance of All-Pairs Shortest Distances;Proceedings of the 28th International Conference on Scientific and Statistical Database Management;2016-07-18
5. Evaluating Path Queries over Frequently Updated Route Collections;IEEE Transactions on Knowledge and Data Engineering;2012-07