{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:45:52Z","timestamp":1725540352108},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642049569"},{"type":"electronic","value":"9783642049576"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04957-6_40","type":"book-chapter","created":{"date-parts":[[2009,11,2]],"date-time":"2009-11-02T06:46:36Z","timestamp":1257144396000},"page":"465-476","source":"Crossref","is-referenced-by-count":1,"title":["Finding Top-k Approximate Answers to Path Queries"],"prefix":"10.1007","author":[{"given":"Carlos A.","family":"Hurtado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandra","family":"Poulovassilis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter T.","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"40_CR1","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/s007990050001","volume":"1","author":"S. Abiteboul","year":"1997","unstructured":"Abiteboul, S., Quass, D., McHugh, J., Widom, J., Wiener, J.L.: The LOREL query language for semistructured data. Int. J. Digit. Libr.\u00a01(1), 68\u201388 (1997)","journal-title":"Int. J. Digit. Libr."},{"doi-asserted-by":"crossref","unstructured":"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\u2013416 (2006)","key":"40_CR2","DOI":"10.1145\/1135777.1135838"},{"doi-asserted-by":"crossref","unstructured":"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\u201337 (2008)","key":"40_CR3","DOI":"10.1007\/978-3-540-68880-8_5"},{"unstructured":"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)","key":"40_CR4"},{"key":"40_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-3-540-25957-2_16","volume-title":"Flexible Query Answering Systems","author":"H. Bulskov","year":"2004","unstructured":"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.\u00a03055, pp. 191\u2013202. Springer, Heidelberg (2004)"},{"unstructured":"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\u2013185 (2000)","key":"40_CR6"},{"doi-asserted-by":"crossref","unstructured":"Cruz, I.F., Mendelzon, A.O., Wood, P.T.: A graphical query language supporting recursion. In: Proc. ACM SIGMOD Conf., pp. 323\u2013330 (1987)","key":"40_CR7","DOI":"10.1145\/38713.38749"},{"issue":"6","key":"40_CR8","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1111\/j.1467-8535.2006.00666.x","volume":"37","author":"S. Freitas de","year":"2006","unstructured":"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\u00a037(6), 867\u2013880 (2006)","journal-title":"British Journal of Educational Technology"},{"doi-asserted-by":"crossref","unstructured":"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\u2013355 (2006)","key":"40_CR9","DOI":"10.1007\/11766254_29"},{"issue":"2","key":"40_CR10","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539795290477","volume":"28","author":"D. Eppstein","year":"1998","unstructured":"Eppstein, D.: Finding the k shortest paths. SIAM J. Comput.\u00a028(2), 652\u2013673 (1998)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"40_CR11","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/382780.382783","volume":"43","author":"G. Gottlob","year":"2001","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: The complexity of acyclic conjunctive queries. J. ACM\u00a043(3), 431\u2013498 (2001)","journal-title":"J. ACM"},{"unstructured":"Grahne, G., Thomo, A.: Approximate reasoning in semi-structured databases. In: Proc. 8th Int. Workshop on Knowledge Representation meets Databases (2001)","key":"40_CR12"},{"doi-asserted-by":"crossref","unstructured":"Grahne, G., Thomo, A., Wadge, W.W.: Preferentially annotated regular path queries. In: Proc. 11th Int. Conf. on Database Theory, pp. 314\u2013328 (2007)","key":"40_CR13","DOI":"10.1007\/11965893_22"},{"unstructured":"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)","key":"40_CR14"},{"key":"40_CR15","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-77688-8_2","volume":"X","author":"C.A. Hurtado","year":"2008","unstructured":"Hurtado, C.A., Poulovassilis, A., Wood, P.T.: relaxation in RDF. Journal on Data Semantics\u00a0X, 31\u201361 (2008)","journal-title":"Journal on Data Semantics"},{"doi-asserted-by":"crossref","unstructured":"Hurtado, C.A., Poulovassilis, A., Wood, P.T.: Ranking approximate answers to semantic web queries. In: Proc. 6th European Semantic Web Conference, pp. 263\u2013277 (2009)","key":"40_CR16","DOI":"10.1007\/978-3-642-02121-3_22"},{"key":"40_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00778-004-0128-2","volume":"13","author":"I.F. Ilyas","year":"2004","unstructured":"Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting top-k join queries in relational databases. The VLDB Journal\u00a013, 207\u2013221 (2004)","journal-title":"The VLDB Journal"},{"doi-asserted-by":"crossref","unstructured":"Kanza, Y., Sagiv, Y.: Flexible queries over semistructured data. In: Proc. Twentieth ACM Symp. on Principles of Databases Systems, pp. 40\u201351 (2001)","key":"40_CR18","DOI":"10.1145\/375551.375558"},{"doi-asserted-by":"crossref","unstructured":"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\u2013211 (2004)","key":"40_CR19","DOI":"10.1007\/978-3-540-24745-6_14"},{"doi-asserted-by":"crossref","unstructured":"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\u2013263 (2007)","key":"40_CR20","DOI":"10.1007\/978-3-540-73255-6_20"},{"unstructured":"Lehmann, J., Sch\u00fcppel, J., Auer, S.: Discovering unknown connections\u2014the DBpedia relationship finder. In: Proc. 1st SABRE Conference on Social Semantic Web, pp. 99\u2013110 (2007)","key":"40_CR21"},{"doi-asserted-by":"crossref","unstructured":"Stuckenschmidt, H., van Harmelen, F.: Approximating terminological queries. In: Proc. 5th Int. Conf. on Flexible Query Answering Systems, pp. 329\u2013343 (2002)","key":"40_CR22","DOI":"10.1007\/3-540-36109-X_26"},{"key":"40_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-540-69132-7_19","volume-title":"Intelligent Tutoring Systems","author":"N. Labeke van","year":"2008","unstructured":"van Labeke, N., Poulovassilis, A., Magoulas, G.D.: Using similarity metrics for matching lifelong learners. In: Woolf, B.P., A\u00efmeur, E., Nkambou, R., Lajoie, S. (eds.) ITS 2008. LNCS, vol.\u00a05091, pp. 142\u2013151. Springer, Heidelberg (2008)"},{"issue":"10","key":"40_CR24","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"Wu, S., Manber, U.: Fast text searching allowing errors. Commun. ACM\u00a035(10), 83\u201391 (1992)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Flexible Query Answering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04957-6_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:46:21Z","timestamp":1606185981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04957-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642049569","9783642049576"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04957-6_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}