{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T05:14:43Z","timestamp":1736486083942,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540346388"},{"type":"electronic","value":"9783540346395"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11766254_20","type":"book-chapter","created":{"date-parts":[[2006,6,14]],"date-time":"2006-06-14T08:03:44Z","timestamp":1150272224000},"page":"232-244","source":"Crossref","is-referenced-by-count":2,"title":["Highly Heterogeneous XML Collections: How to Retrieve Precise Results?"],"prefix":"10.1007","author":[{"given":"Ismael","family":"Sanz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Mesiti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanna","family":"Guerrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael Berlanga","family":"Llavori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/3-540-45876-X_32","volume-title":"Advances in Database Technology - EDBT 2002","author":"S. Amer-Yahia","year":"2002","unstructured":"Amer-Yahia, S., et al.: Tree Pattern Relaxation. In: Jensen, C.S., Jeffery, K., Pokorn\u00fd, J., \u0160altenis, S., Bertino, E., B\u00f6hm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol.\u00a02287, pp. 496\u2013513. Springer, Heidelberg (2002)"},{"key":"20_CR2","unstructured":"Amer-Yahia, S., et al.: Structure and Content Scoring for XML. In: VLDB (2005)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Buneman, P., et al.: Adding Structure to Unstructured Data. In: ICDT (1997)","DOI":"10.1007\/3-540-62222-5_55"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-44469-6_32","volume-title":"Database and Expert Systems Applications","author":"E. Damiani","year":"2000","unstructured":"Damiani, E., Tanca, L.: Blind Queries to XML Data. In: Ibrahim, M., K\u00fcng, J., Revell, N. (eds.) DEXA 2000. LNCS, vol.\u00a01873, pp. 345\u2013356. Springer, Heidelberg (2000)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Grust, T.: Accelerating XPath Location Steps. In: SIGMOD, pp. 109\u2013120 (2002)","DOI":"10.1145\/564691.564705"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Kanza, Y., Sagiv, Y.: Flexible Queries Over Semistructured Data. In: PODS (2001)","DOI":"10.1145\/375551.375558"},{"key":"20_CR7","unstructured":"Kilpel\u00e4inen, P.: Tree Matching Problems with Applications to Structured Text Databases. Ph.D thesis, University of Helsinki (1992)"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1002\/asi.10056","volume":"53","author":"R.W. Luk","year":"2002","unstructured":"Luk, R.W., et al.: A Survey in Indexing and Searching XML Documents. JASIS\u00a053, 415\u2013438 (2002)","journal-title":"JASIS"},{"key":"20_CR9","unstructured":"Marian, A., et al.: Adaptive Processing of Top-k Queries in XML. In: ICDE (2005)"},{"key":"20_CR10","unstructured":"Nierman, A., Jagadish, H.V.: Evaluating Structural Similarity in XML Documents. In: WebDB, pp. 61\u201366 (2002)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/11547273_14","volume-title":"Database and XML Technologies","author":"I. Sanz","year":"2005","unstructured":"Sanz, I., et al.: Approximate Subtree Identification in Heterogeneous XML Documents Collections. In: Bressan, S., Ceri, S., Hunt, E., Ives, Z.G., Bellahs\u00e8ne, Z., Rys, M., Unland, R. (eds.) XSym 2005. LNCS, vol.\u00a03671, pp. 192\u2013206. Springer, Heidelberg (2005)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Sanz, I., et al.: Highly Heterogeneous XML Collections: How to find good results? TR University of Genova (2006)","DOI":"10.1007\/11766254_20"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-540-45194-5_8","volume-title":"Intelligent Search on XML Data","year":"2003","unstructured":"Blanken, H.M., Grabs, T., Schek, H.-J., Schenkel, R., Weikum, G. (eds.): Intelligent Search on XML Data. LNCS, vol.\u00a02818, pp. 119\u2013131. Springer, Heidelberg (2003)"},{"key":"20_CR14","unstructured":"Schlieder, T., Naumann, F.: Approximate Tree Embedding for Querying XML Data. In: ACM SIGIR Workshop on XML and IR (2000)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45876-X_33","volume-title":"Advances in Database Technology - EDBT 2002","author":"T. Schlieder","year":"2002","unstructured":"Schlieder, T.: Schema-Driven Evaluation of Approximate Tree-Pattern Queries. In: Jensen, C.S., Jeffery, K., Pokorn\u00fd, J., \u0160altenis, S., Bertino, E., B\u00f6hm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol.\u00a02287, pp. 514\u2013532. Springer, Heidelberg (2002)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Shasha, D., et al.: ATreeGrep: Approximate Searching in Unordered Trees. In: 14th Conf. on Scientific and Statistical Database Management, pp. 89\u201398 (2002)","DOI":"10.1109\/SSDM.2002.1029709"},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/3-540-45876-X_31","volume-title":"Advances in Database Technology - EDBT 2002","author":"A. Theobald","year":"2002","unstructured":"Theobald, A., Weikum, G.: The Index-Based XXL Search Engine for Querying XML Data with Relevance Ranking. In: Jensen, C.S., Jeffery, K., Pokorn\u00fd, J., \u0160altenis, S., Bertino, E., B\u00f6hm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol.\u00a02287, pp. 477\u2013495. Springer, Heidelberg (2002)"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The String-to-string Correction Problem. J. of the ACM\u00a021, 168\u2013173 (1974)","journal-title":"J. of the ACM"}],"container-title":["Lecture Notes in Computer Science","Flexible Query Answering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11766254_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T10:36:23Z","timestamp":1736418983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11766254_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540346388","9783540346395"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11766254_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}