Estimating searching cost of regular path queries on large graphs by exploiting unit-subqueries-Reference-Cited by-同舟云学术

Estimating searching cost of regular path queries on large graphs by exploiting unit-subqueries

Published:2018-11-30 Issue: Volume: Page:
ISSN:1381-1231
Container-title:Journal of Heuristics
language:en
Short-container-title:J Heuristics

Author:

Nguyen Van-Quyet,Huynh Quyet-Thang,Kim Kyungbaek

Funder

National Research Foundation of Korea

Ministry of Science, ICT and Future Planning

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Management Science and Operations Research,Control and Optimization,Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/s10732-018-9402-0.pdf

Reference39 articles.

1. Abul-Basher, Z.: Multiple-query optimization of regular path queries. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp. 1426–1430. IEEE (2017)

2. Almeida, J., Zeitoun, M.: Description and analysis of a bottom-up DFA minimization algorithm. Inf. Process. Lett. 107(2), 52–59 (2008)

3. Barceló, P., Libkin, L., Lin, A.W., Wood, P.T.: Expressive languages for path queries over graph-structured data. ACM Trans. Database Syst. 37(4), 31 (2012)

4. Barceló Baeza, P.: Querying graph databases. In: Proceedings of the 32nd ACM SIGMOD–SIGACT–SIGAI Symposium on Principles of Database Systems, pp 175–188. ACM (2013)

5. Bast, H., Bäurle, F., Buchhold, B., Haußmann, E.: Easy access to the freebase dataset. In: Proceedings of the 23rd International Conference on World Wide Web. ACM, pp. 95–98 (2014)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficiently Estimating Joining Cost of Subqueries in Regular Path Queries;Electronics;2021-04-21

2. A Genetic Algorithm for Large Graph Partitioning Problem;Proceedings of the Tenth International Symposium on Information and Communication Technology - SoICT 2019;2019