支持近似图查询的Why-Not问题解释方法-OpenRepositoryof.PDFVIP

网络出版时间：2016-10-31 16:50:46 网络出版地址：/kcms/detail/11.5602.TP1650.014.html ISSN 1673-9418 CODEN JKYTA8 E-mail:fcst@ Journal ofFrontiers of Computer Science and Technology 1673-9418/2000/00(00)-0000-00 Tel:+86-10 doi: 10.3778/j.issn.1673-9418.1608050 支持近似图查询的Why-Not 问题解释方法* 贺丹, 宗传玉, 王斌, 李金旭, 杨晓春+ 东北大学 计算机科学与工程学院,沈阳110819 ExplainingWhy-Not Questions onApproximate Graph Queries* HE Dan,ZONG Chuanyu,WANG Bin,LI Jinxu,YANGXiaochun+ SchoolofComputer ScienceandEngineering,NortheasternUniversity,Shenyang 110819,China + Corresponding author:E-mail:yangxc@ HE Dan, ZONG Chuanyu, WANG Bin, LI Jinxu, YANG Xiaochun. Explaining why-not questions on approximategraph queries.Journal ofFrontiersof ComputerScience andTechnology,2000, 0(0):1-000. Abstract:Why-not questions aim to seek clarifications on the missing tuples for query results.Answering why-not questionson database queriesnot only helpsuser better understandthe query,but also improves data quality andthe availability of database.To enhancethe availability of graph database, an efficient explaining technique for why-not questions on approximate graph queries is proposed in this paper. This technique gives explanations for missing graphs, aswell as some suggestions on how to modify the initial query graph to let the missing graphs appear in the query result set.Algorithm for answering approximate graph queries includes two parts, the first part is a candidate generation phase, which proposed the basic algorithm according to frequency information of edges, and proposed theimproved algorithm by graph decomposition operation to acquire candidate operation set.And in the secondpart, in order to minimize the cost of modifying initial query graph, we propose gre