Abstract
Focusing on the problem of graph reachability query with keyword and distance constraint, a method of graph reachability query based on reference node embedding was proposed. Firstly, a very small part of representative reference nodes were selected from all nodes, shortest path distance between all nodes and these reference nodes were previously calculated. Next distance range was obtained based on the triangle inequality relation. Lastly according to the distance constraint and keyword in query condition, a conclusion of reachability could be drawn quickly. Comparative tests were done on data of social network and road network. Compared with Dijkstra algorithm, the proportion of drawing a reachability conclusion directly of the proposed algorithm is 84.6 % in the New York Road network, while 66.6 % in the Digital Bibliography & Library Project (DBLP) network, moreover, the running time are both shortened greatly, which is reduced by 87.4 % and 77.3 % respectively. The testing experimental data demonstrates that the computational complexity of online queries is reduced by using a small index cost through the method proposed in this paper, which is a good solution to graph reachability query with keyword and distance constraint suitable for weighted graph as well as unweighted graph, with wider value in application.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Van Schaik, S.J., De Moor, O.: A memory efficient reachability data structure through bit vector compression. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, pp. 913–924. ACM press, New York (2011)
Qiao, M., Qin, L., Cheng, H., Xu Yu, J., Tian, W.T.: Top-K nearest keyword search on large graphs. Proc. VLDB Endowment 6(10), 901–912 (2013)
Jin, R., Liu, L., Ding, B., Wang, H.: Distance-constraint reachability computation in uncertain graphs. PVLDB 4(9), 551–562 (2011)
Jin, R., Hong, H., Wang, H., Ruan, N., Xiang, Y.: Computing label-constraint reachability in graph databases. In: 2010 SIGMOD Conference, pp. 123–134. ACM press, New York (2010)
Xu, K., Zou, L., Xu Yu. J.: Answering Label-Constraint Reachability in large graphs. In: CIKM 2011, pp. 1595–1600. ACM press, New York (2011)
Qiao, M., Cheng, H., Qin, L., Xu Yu, J.: Computing weight constraint reachability in large networks. VLDB 22(3), 275–294 (2013)
Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, pp. 867–876. ACM press, New York (2009)
Acknowledgements
This work is supported by Foundation for Distinguished Young Talents in Higher Education of Guangdong, China (2014KQNCX184).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Juping, W. (2016). Discussion of Graph Reachability Query with Keyword and Distance Constraint. In: Yin, H., et al. Intelligent Data Engineering and Automated Learning – IDEAL 2016. IDEAL 2016. Lecture Notes in Computer Science(), vol 9937. Springer, Cham. https://doi.org/10.1007/978-3-319-46257-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-46257-8_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46256-1
Online ISBN: 978-3-319-46257-8
eBook Packages: Computer ScienceComputer Science (R0)