Abstract
Linked Data is one of the emerging ways to publish and link structured and machine-processable data on the Web, however, the existing techniques to perform live query Linked Data are based on recursive URI look-up process. These techniques contain a limitation for the query patterns having subject unbound and object containing a foreign URI. In such cases, the live query does not produce any answers to the query as the querying process could not be initiated due to unavailability of subject field in the triple pattern. In this paper, we make use of backlinking to extract and store foreign URIs and using this information for executing the queries live where the subject is unbound.
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
- 1.
‘#’ indicates that the specific entity is given and the ‘?’ denotes that the respective entity is variable or unbound.
- 2.
- 3.
References
Augmenting the Web of Data using Referers, April 2011
Fernandez, J., MartÃnez-Prieto, M.A., Gutierrez, C., Polleres, A., Arias, M.: Binary RDF representation for publication and exchange (HDT). Web Semant. Sci. Serv. Agents World Wide Web 19, 22–41 (2013)
Langridge, S., Hickson, I.: Pingback 1.0 (2016)
Papadakis, I., Stefanidakis, M.: An autosuggest service based on lod backlinks, p. 8, June 2018
Saleem, M., Ali, M.I., Hogan, A., Mehmood, Q., Ngomo, A.-C.N.: LSQ: the linked SPARQL queries dataset. In: Arenas, M., et al. (eds.) ISWC 2015. LNCS, vol. 9367, pp. 261–269. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25010-6_15
Salvadores, M., et al.: Domain-specific backlinking services in the web of data. In: Main Conference Proceedings of 2010 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2010, Toronto, Canada, 31 August–3 September 2010, pp. 318–323 (2010)
Scheglmann, S., Scherp, A.: Will linked data benefit from inverse link traversal? In: Proceedings of the Workshop on Linked Data on the Web Co-located with the 23rd International World Wide Web Conference (WWW 2014), Seoul, Korea, 8 April 2014 (2014)
Schmidt, M., Görlitz, O., Haase, P., Ladwig, G., Schwarte, A., Tran, T.: FedBench: a benchmark suite for federated semantic data query processing. In: Aroyo, L., et al. (eds.) ISWC 2011. LNCS, vol. 7031, pp. 585–600. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25073-6_37
Stefanidakis, M., Papadakis, I.: Linking the (un)linked data through backlinks. In: Proceedings of the International Conference on Web Intelligence, Mining and Semantics, WIMS 2011, Sogndal, Norway, 25–27 May 2011, p. 61 (2011)
Tramp, S., Frischmuth, P., Ermilov, T., Auer, S.: Weaving a social data web with semantic pingback. In: Cimiano, P., Pinto, H.S. (eds.) EKAW 2010. LNCS (LNAI), vol. 6317, pp. 135–149. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-16438-5_10
Umbrich, J.: A hybrid framework for querying linked data dynamically. Ph.D. thesis, National University of Ireland, Galway Ollscoil na hEireann, Gaillimh (2012)
Verborgh, R., et al.: Triple pattern fragments: a low-cost knowledge graph interface for the web. J. Web Semant. 37–38, 184–206 (2016)
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
Bai, S., Hussain, S., Khoja, S. (2019). Linked Data Live Exploration with Complete Results. In: Garoufallou, E., Sartori, F., Siatri, R., Zervas, M. (eds) Metadata and Semantic Research. MTSR 2018. Communications in Computer and Information Science, vol 846. Springer, Cham. https://doi.org/10.1007/978-3-030-14401-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-14401-2_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-14400-5
Online ISBN: 978-3-030-14401-2
eBook Packages: Computer ScienceComputer Science (R0)