Abstract
With the unprecedented proliferation of knowledge graphs, how to process query evaluation over them becomes increasingly important. On knowledge graphs, queries are typically evaluated with graph pattern matching, i.e., given a pattern query Q and a knowledge graph G, it is to find the set M(Q, G) of matches of Q in G, where matching is defined with subgraph isomorphism. However querying big knowledge graphs brings us challenges: (1) queries are often issued with natural languages, hence can not be evaluated directly; (2) query evaluation is very costly and match results are often difficult to inspect. In light of these, this paper studies the problem of querying knowledge graphs with natural languages. (1) We extend pattern queries by designating a node \(u_o\) as “query focus”, and revise the matching semantic based on the extension. (2) We develop techniques to understand natural language queries, and generate pattern queries with “query focus”. (3) We develop efficient techniques to identify top-k matches of “query focus”. (4) We experimentally verify that our techniques for query understanding perform well, and our query algorithm is able to find diversified top-k matches efficiently.
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
References
Alonso, O., Gamon, M., Haas, K., Pantel, P.: Diversity and relevance in social search. In: DDR (2012)
Bendersky, M., Metzler, D., Croft, W.B.: Learning concept importance using a weighted dependence model. In: WSDM 2010, pp. 31–40 (2010)
Borodin, A., Lee, H.C., Ye, Y.: Max-sum diversification, monotone submodular functions and dynamic updates. In: PODS, pp. 155–166. ACM (2012)
Cheng, J., Zeng, X., Yu, J.X.: Top-k graph pattern matching over large graphs. In: ICDE (2013)
Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub) graph isomorphism algorithm for matching large graphs. TPAMI 26(10), 1367–1372 (2004)
Ding, X., Jia, J., Li, J., Liu, J., Jin, H.: Top-k similarity matching in large graphs with attributes. In: DASFAA, pp. 156–170 (2014)
Fan, W., Wang, X., Wu, Y.: Diversified top-k graph pattern matching. PVLDB 6, 1510–1521 (2013)
Gollapudi, S., Sharma, A.: An axiomatic approach for result diversification. In: WWW (2009)
Gou, G., Chirkova, R.: Efficient algorithms for exact ranked twig-pattern matching over graphs. In: SIGMOD (2008)
Henzinger, M.R., Henzinger, T., Kopke, P.: Computing simulations on finite and infinite graphs. In: FOCS (1995)
Kasneci, G., Elbassuoni, S., Weikum, G.: MING: mining informative entity relationship subgraphs. In: CIKM, pp. 1653–1656 (2009)
Lafferty, J.D., McCallum, A., Pereira, F.C.N.: Conditional random fields: probabilistic models for segmenting and labeling sequence data. In: ICML, USA, pp. 282–289 (2001)
Ma, S., Cao, Y., Fan, W., Huai, J., Wo, T.: Capturing topology in graph pattern matching. PVLDB 5(4), 310–321 (2011)
Mottin, D., Lissandrini, M., Velegrakis, Y., Palpanas, T.: Exemplar queries: a new way of searching. VLDB J. 25(6), 741–765 (2016)
Pound, J., Hudek, A.K., Ilyas, I.F., Weddell, G.E.: Interpreting keyword queries over web knowledge bases. In: CIKM, pp. 305–314 (2012)
Wikipedia: F-measure. http://en.wikipedia.org/wiki/F1_score
Yahya, M., Berberich, K., Elbassuoni, S., Weikum, G.: Robust question answering over the web of linked data. In: CIKM, pp. 1107–1116 (2013)
Yang, Z., Fu, A.W., Liu, R.: Diversified top-k subgraph querying in a large graph. In: SIGMOD, pp. 1167–1182 (2016)
Zheng, W., Cheng, H., Zou, L., Yu, J.X., Zhao, K.: Natural language question/answering: let users talk with the knowledge graph. In: CIKM, pp. 217–226 (2017)
Zou, L., Chen, L., Lu, Y.: Top-k subgraph matching query in a large graph. In: Ph.D. workshop in CIKM (2007)
Acknowledgement
Xin Wang is supported in part by the NSFC 71490722, and Fundamental Research Funds for the Central Universities, China.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, X., Yang, L., Zhu, Y., Zhan, H., Jin, Y. (2019). Querying Knowledge Graphs with Natural Languages. In: Hartmann, S., Küng, J., Chakravarthy, S., Anderst-Kotsis, G., Tjoa, A., Khalil, I. (eds) Database and Expert Systems Applications. DEXA 2019. Lecture Notes in Computer Science(), vol 11707. Springer, Cham. https://doi.org/10.1007/978-3-030-27618-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-27618-8_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-27617-1
Online ISBN: 978-3-030-27618-8
eBook Packages: Computer ScienceComputer Science (R0)