Abstract
Large-scale knowledge graphs are increasingly being used in applications, and there is a growing need for tools that can effectively support users in analysis and exploration tasks. One such important task is entity comparison—to describe in an informative way the similarities between two given entities as described in a knowledge graph. In our previous work the result of entity comparison is modelled as a similarity query—that is, a SPARQL query having the input entities as part of the answer over the input graph; for instance, one can describe the similarity between two companies such as Telenor and Vodafone in the YAGO graph as a query asking for all telecom companies based in Europe. In this paper, we extend the results of our prior work in different ways. First, we expand the language of similarity queries to consider a richer fragment of SPARQL allowing for numeric filter expressions; this enables us to express that Telenor and Vodafone are also similar in that they both have at least 30,000 employees. We then propose algorithms for computing similarity queries satisfying certain additional desirable properties, such as being as specific as possible. Such algorithms are, however, impractical; hence, we also propose and implement a scalable algorithm that is guaranteed to compute a similarity query, but not necessarily a most specific one.
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
Aebeloe, C., Montoya, G., Setty, V., Hose, K.: Discovering diversified paths in knowledge bases. Proc. VLDB Endow. 11(12), 2002–2005 (2018)
Arenas, M., Diaz, G.I., Kostylev, E.V.: Reverse engineering SPARQL queries. In: Proceedings of WWW, pp. 239–249 (2016)
Baader, F., Turhan, A.-Y.: On the problem of computing small representations of least common subsumers. In: Jarke, M., Lakemeyer, G., Koehler, J. (eds.) KI 2002. LNCS (LNAI), vol. 2479, pp. 99–113. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45751-8_7
Barceló, P., Romero, M.: The complexity of reverse engineering problems for conjunctive queries. In: Proceedings of ICDT, pp. 7:1–7:17 (2017)
Bonifati, A., Ciucanu, R., Lemay, A.: Learning path queries on graph databases. In: Proceedings of EDBT, pp. 109–120 (2015)
Cheng, G., Zhang, Y., Qu, Y.: Explass: exploring associations between entities via top-K ontological patterns and facets. In: Mika, P., et al. (eds.) ISWC 2014. LNCS, vol. 8797, pp. 422–437. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11915-1_27
Colucci, S., Donini, F.M., Giannini, S., Di Sciascio, E.: Defining and computing least common subsumers in RDF. Web Semant. 39, 62–80 (2016)
Cowan, N.: The magical number 4 in short-term memory: A reconsideration of mental storage capacity. Behav. Brain Sci. 24(1), 87–114 (2001)
El Hassad, S., Goasdoué, F., Jaudoin, H.: Learning commonalities in RDF. In: Blomqvist, E., Maynard, D., Gangemi, A., Hoekstra, R., Hitzler, P., Hartig, O. (eds.) ESWC 2017. LNCS, vol. 10249, pp. 502–517. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-58068-5_31
El Hassad, S., Goasdoué, F., Jaudoin, H.: Learning commonalities in SPARQL. In: d’Amato, C., et al. (eds.) ISWC 2017. LNCS, vol. 10587, pp. 278–295. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68288-4_17
Fionda, V., Pirrò, G.: Explaining and querying knowledge graphs by relatedness. Proc. VLDB Endow. 10(12), 1913–1916 (2017)
Guo, Y., Pan, Z., Heflin, J.: LUBM: a benchmark for OWL knowledge base systems. Web Semant. 3(2–3), 158–182 (2005)
Gutiérrez-Basulto, V., Jung, J.C., Sabellek, L.: Reverse engineering queries in ontology-enriched systems: The case of expressive horn description logic ontologies. In: Proceedings of IJCAI, pp. 1847–1853 (2018)
Heim, P., Hellmann, S., Lehmann, J., Lohmann, S., Stegemann, T.: RelFinder: Revealing relationships in RDF knowledge bases. In: Chua, T.-S., Kompatsiaris, Y., Mérialdo, B., Haas, W., Thallinger, G., Bailer, W. (eds.) SAMT 2009. LNCS, vol. 5887, pp. 182–187. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-10543-2_21
Klug, A.: On conjunctive queries containing inequalities. J. ACM 35(1), 146–160 (1988)
Lehmann, J., Schüppel, J., Auer, S.: Discovering unknown connections - the DBpedia relationship finder. Proc. CSSW 113, 99–110 (2007)
Petrova, A., Sherkhonov, E., Cuenca Grau, B., Horrocks, I.: Entity comparison in RDF graphs. In: d’Amato, C., et al. (eds.) ISWC 2017. LNCS, vol. 10587, pp. 526–541. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68288-4_31
Rossi, R.A., Gleich, D.F.: A dynamical system for PageRank with time-dependent teleportation. Internet Math. 10(1), 188–217 (2014)
Suchanek, F.M., Kasneci, G., Weikum, G.: YAGO: A large ontology from Wikipedia and Wordnet. Web Semant. 6(3), 203–217 (2008)
Tan, W.C., Zhang, M., Elmeleegy, H., Srivastava, D.: Reverse engineering aggregation queries. PVLDB 10(11), 1394–1405 (2017)
ten Cate, B., Dalmau, V.: The product homomorphism problem and applications. In: Proceedings of ICDT, pp. 161–176 (2015)
Weiss, Y.Y., Cohen, S.: Reverse engineering SPJ-queries from examples. In: Proceedings of PODS, pp. 151–166 (2017)
Zhang, M., Elmeleegy, H., Procopiuc, C.M., Srivastava, D.: Reverse engineering complex join queries. In: Proceedings of SIGMOD, pp. 809–820 (2013)
Acknowledgements
This research was supported by the SIRIUS Centre for Scalable Data Access and the EPSRC projects DBOnto, MaSI\(^3\), and ED\(^3\).
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
Petrova, A., Kostylev, E.V., Cuenca Grau, B., Horrocks, I. (2019). Query-Based Entity Comparison in Knowledge Graphs Revisited. In: Ghidini, C., et al. The Semantic Web – ISWC 2019. ISWC 2019. Lecture Notes in Computer Science(), vol 11778. Springer, Cham. https://doi.org/10.1007/978-3-030-30793-6_32
Download citation
DOI: https://doi.org/10.1007/978-3-030-30793-6_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-30792-9
Online ISBN: 978-3-030-30793-6
eBook Packages: Computer ScienceComputer Science (R0)
