Abstract
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of regular path queries, allowing path variables to appear in the bodies and the heads of rules, so that paths can be returned to the user. We propose an approximate query matching semantics which adapts standard notions of approximation from string matching to graph matching. Query results are returned to the user ranked in order of increasing “distance” to the user’s original query. We show that the top-k approximate answers can be returned in polynomial time in the size of the database graph and the query.
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
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Quass, D., McHugh, J., Widom, J., Wiener, J.L.: The LOREL query language for semistructured data. Int. J. Digit. Libr. 1(1), 68–88 (1997)
Aleman-Meza, B., Nagarajan, M., Ramakrishnan, C., Ding, L., Kolari, P., Sheth, A.P., Arpinar, I.B., Joshi, A., Finin, T.: Semantic analytics on social networks: experiences in addressing the problem of conflict of interest detection. In: Proc. 15th Int. Conf. on the World Wide Web, pp. 407–416 (2006)
Barrett, C.L., Bisset, K.R., Holzer, M., Konjevod, G., Marathe, M.V., Wagner, D.: Engineering label-constrained shortest-path algorithms. In: Proc. 4th Int. Conf. on Algorithmic Aspects in Information and Management, pp. 27–37 (2008)
Berners-Lee, T., Chen, Y., Chilton, L., Connolly, D., Dhanaraj, R., Hollenbach, J., Lerer, A., Sheets, D.: Tabulator: Exploring and analyzing linked data on the semantic web. In: Proc. 3rd Int. Semantic Web User Interaction Workshop (2006)
Bulskov, H., Knappe, R., Andreasen, T.: On querying ontologies and databases. In: Christiansen, H., Hacid, M.-S., Andreasen, T., Larsen, H.L. (eds.) FQAS 2004. LNCS, vol. 3055, pp. 191–202. Springer, Heidelberg (2004)
Calvanese, D., Giacomo, G.D., Lenzerini, M., Vardi, M.Y.: Containment of conjunctive regular path queries with inverse. In: Proc. Seventh Int. Conf. on Principles of Knowledge Representation and Reasoning, pp. 176–185 (2000)
Cruz, I.F., Mendelzon, A.O., Wood, P.T.: A graphical query language supporting recursion. In: Proc. ACM SIGMOD Conf., pp. 323–330 (1987)
de Freitas, S., Harrison, I., Magoulas, G., Mee, A., Mohamad, F., Oliver, M., Papamarkos, G., Poulovassilis, A.: The development of a system for supporting the lifelong learner. British Journal of Educational Technology 37(6), 867–880 (2006)
Dolog, P., Stuckenschmidt, H., Wache, H.: Robust query processing for personalized information access on the semantic web. In: Proc. 7th Int. Conf. on Flexible Query Answering Systems, pp. 343–355 (2006)
Eppstein, D.: Finding the k shortest paths. SIAM J. Comput. 28(2), 652–673 (1998)
Gottlob, G., Leone, N., Scarcello, F.: The complexity of acyclic conjunctive queries. J. ACM 43(3), 431–498 (2001)
Grahne, G., Thomo, A.: Approximate reasoning in semi-structured databases. In: Proc. 8th Int. Workshop on Knowledge Representation meets Databases (2001)
Grahne, G., Thomo, A., Wadge, W.W.: Preferentially annotated regular path queries. In: Proc. 11th Int. Conf. on Database Theory, pp. 314–328 (2007)
Heath, T., Hausenblas, M., Bizer, C., Cyganiak, R.: How to publish linked data on the web (tutorial). In: Proc. 7th Int. Semantic Web Conf. (2008)
Hurtado, C.A., Poulovassilis, A., Wood, P.T.: relaxation in RDF. Journal on Data Semantics X, 31–61 (2008)
Hurtado, C.A., Poulovassilis, A., Wood, P.T.: Ranking approximate answers to semantic web queries. In: Proc. 6th European Semantic Web Conference, pp. 263–277 (2009)
Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting top-k join queries in relational databases. The VLDB Journal 13, 207–221 (2004)
Kanza, Y., Sagiv, Y.: Flexible queries over semistructured data. In: Proc. Twentieth ACM Symp. on Principles of Databases Systems, pp. 40–51 (2001)
Lacroix, Z., Murthy, H., Naumann, F., Raschid, L.: Links and paths through life sciences data sources. In: Proc. 1st Int. Workshop on Data Integration in the Life Sciences, pp. 203–211 (2004)
Lee, W.-J., Raschid, L., Srinivasan, P., Shah, N., Rubin, D.L., Noy, N.F.: Using annotations from controlled vocabularies to find meaningful associations. In: Proc. 4th Int. Workshop on Data Integration in the Life Sciences, pp. 247–263 (2007)
Lehmann, J., Schüppel, J., Auer, S.: Discovering unknown connections—the DBpedia relationship finder. In: Proc. 1st SABRE Conference on Social Semantic Web, pp. 99–110 (2007)
Stuckenschmidt, H., van Harmelen, F.: Approximating terminological queries. In: Proc. 5th Int. Conf. on Flexible Query Answering Systems, pp. 329–343 (2002)
van Labeke, N., Poulovassilis, A., Magoulas, G.D.: Using similarity metrics for matching lifelong learners. In: Woolf, B.P., Aïmeur, E., Nkambou, R., Lajoie, S. (eds.) ITS 2008. LNCS, vol. 5091, pp. 142–151. Springer, Heidelberg (2008)
Wu, S., Manber, U.: Fast text searching allowing errors. Commun. ACM 35(10), 83–91 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hurtado, C.A., Poulovassilis, A., Wood, P.T. (2009). Finding Top-k Approximate Answers to Path Queries. In: Andreasen, T., Yager, R.R., Bulskov, H., Christiansen, H., Larsen, H.L. (eds) Flexible Query Answering Systems. FQAS 2009. Lecture Notes in Computer Science(), vol 5822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04957-6_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-04957-6_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04956-9
Online ISBN: 978-3-642-04957-6
eBook Packages: Computer ScienceComputer Science (R0)