首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Estimating searching cost of regular path queries on large graphs by exploiting unit-subqueries
Authors:Nguyen  Van-Quyet  Huynh  Quyet-Thang  Kim  Kyungbaek
Institution:1.Chonnam National University, 77, Yongbong-ro, Buk-gu, Gwangju, South Korea
;2.Hanoi University of Science and Technology, 01, Dai Co Viet Road, Hanoi, Vietnam
;
Abstract:Journal of Heuristics - Regular path queries (RPQs) are widely used on a graph whose answer is a set of tuples of nodes connected by paths corresponding to a given regular expression. Traditional...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号