Abstract
Scientific impact of publications is often measured using citation networks. However, traditional measures typically rely on direct citations only. To fully leverage citation networks for assessing scientific impact, it is necessary to investigate also indirect scientific influence, which is captured by citation paths. Further, the analysis and exploration of citation networks requires the ability to efficiently evaluate expressive queries on them. In this paper, we propose to use hybrid query patterns to query citation networks. These allow for both edge-to-edge and edge-to-path mappings between the query pattern and the graph, thus being able to extract both direct and indirect relationships. To efficiently evaluate hybrid pattern queries on citation graphs, we employ a pattern matching algorithm which exploits graph simulation to prune nodes that do not appear in the final answer. Our experimental results on citation networks show that our method not only allows for more expressive queries but is also efficient and scalable.
X. Wu—The research was supported by the National Natural Science Foundation of China under Grant No. 61872276.
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
Similar content being viewed by others
Notes
References
Aberger, C.R., Tu, S., Olukotun, K., Ré, C.: Emptyheaded: a relational engine for graph processing. In: SIGMOD, pp. 431–446 (2016)
Chen, L., Gupta, A., Kurul, M.E.: Stack-based algorithms for pattern matching on DAGs. In: VLDB, pp. 493–504 (2005)
Cheng, J., Yu, J.X., Yu, P.S.: Graph pattern matching: a join/semijoin approach. IEEE Trans. Knowl. Data Eng. 23(7), 1006–1021 (2011)
Fan, W., Li, J., Ma, S., Tang, N., Wu, Y., Wu, Y.: Graph pattern matching: From intractable to polynomial time. PVLDB 3(1), 264–275 (2010)
Fragkiadaki, E., Evangelidis, G.: Review of the indirect citations paradigm: theory and practice of the assessment of papers, authors and journals. Scientometrics 99(2), 261–288 (2013). https://doi.org/10.1007/s11192-013-1175-5
Fragkiadaki, E., Evangelidis, G.: Three novel indirect indicators for the assessment of papers and authors based on generations of citations. Scientometrics 106(2), 657–694 (2016)
Hu, X., Rousseau, R.: Scientific influence is not always visible: the phenomenon of under-cited influential publications. J. Informetr. 10(4), 1079–1091 (2016)
Jiang, X., Zhuge, H.: Forward search path count as an alternative indirect citation impact indicator. J. Informetr. 13(4), 100977 (2019)
Kaushik, R., Bohannon, P., Naughton, J.F., Korth, H.F.: Covering indexes for branching path queries. In: SIGMOD, pp. 133–144 (2002)
Kosmulski, M.: Hirsch-type approach to the 2nd generation citations. J. Informetr. 4(3), 257–264 (2010)
Liang, R., Zhuge, H., Jiang, X., Zeng, Q., He, X.: Scaling hop-based reachability indexing for fast graph pattern query processing. IEEE Trans. Knowl. Data Eng. 26(11), 2803–2817 (2014)
Ma, S., Cao, Y., Fan, W., Huai, J., Wo, T.: Strong simulation: capturing topology in graph pattern matching. ACM Trans. Database Syst. 39(1), 4:1–4:46 (2014)
Mennicke, S., Kalo, J., Nagel, D., Kroll, H., Balke, W.: Fast dual simulation processing of graph database queries. In: ICDE, pp. 244–255 (2019)
Renoust, B., Claver, V., Baffier, J.: Multiplex flows in citation networks. Appl. Netw. Sci. 2, 23 (2017)
Schubert, A.: Using the h-index for assessing single publications. Scientometrics 78(3), 559–565 (2009)
Su, J., Zhu, Q., Wei, H., Yu, J.X.: Reachability querying: can it be even faster? IEEE Trans. Knowl. Data Eng. 29(3), 683–697 (2017)
Wu, X., Theodoratos, D., Skoutas, D., Lan, M.: Efficiently computing homomorphic matches of hybrid pattern queries on large graphs. In: Ordonez, C., Song, I.-Y., Anderst-Kotsis, G., Tjoa, A.M., Khalil, I. (eds.) DaWaK 2019. LNCS, vol. 11708, pp. 279–295. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-27520-4_20
Wu, X., Theodoratos, D., Skoutas, D., Lan, M.: Evaluating mixed patterns on large data graphs using bitmap views. In: Li, G., Yang, J., Gama, J., Natwichai, J., Tong, Y. (eds.) DASFAA 2019. LNCS, vol. 11446, pp. 553–570. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-18576-3_33
Zeng, Q., Jiang, X., Zhuge, H.: Adding logical operators to tree pattern queries on graph-structured data. PVLDB 5(8), 728–739 (2012)
Zeng, Q., Zhuge, H.: Comments on “stack-based algorithms for pattern matching on dags”. PVLDB 5(7), 668–679 (2012)
Zervakis, L., Setty, V., Tryfonopoulos, C., Hose, K.: Efficient continuous multi-query processing over graph streams. In: EDBT, pp. 13–24 (2020)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Wu, X., Theodoratos, D., Skoutas, D., Lan, M. (2020). Exploring Citation Networks with Hybrid Tree Pattern Queries. In: Bellatreche, L., et al. ADBIS, TPDL and EDA 2020 Common Workshops and Doctoral Consortium. TPDL ADBIS 2020 2020. Communications in Computer and Information Science, vol 1260. Springer, Cham. https://doi.org/10.1007/978-3-030-55814-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-030-55814-7_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-55813-0
Online ISBN: 978-3-030-55814-7
eBook Packages: Computer ScienceComputer Science (R0)