{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:28:33Z","timestamp":1725564513298},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207795"},{"type":"electronic","value":"9783540246183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24618-3_10","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T07:31:03Z","timestamp":1283671863000},"page":"122-139","source":"Crossref","is-referenced-by-count":7,"title":["Tree Signatures and Unordered XML Pattern Matching"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Zezula","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federica","family":"Mandreoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Martoglia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Dietz, P.F.: Maintaining Order in a Linked List. In: Proceedings of STOC, 14th Annual ACM Symposium on Theory of Computing, San Francisco, CA, May 1982, pp. 122\u2013127 (1982)","DOI":"10.1145\/800070.802184"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Grust, T.: Accelerating XPath Location Steps. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison, Wisconsin, pp. 109-120 (2002)","DOI":"10.1145\/564691.564705"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.L., Shan, H., Zhang, K.: ATreeGrep: Approximate Searching in Unordered Trees. In: Proceedings of the 14th International Conference on Scientific and Statistical Database Management, Edinburgh, Scotland, UK, July 24-26, pp. 89\u201398 (2002)","DOI":"10.1109\/SSDM.2002.1029709"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-540-39429-7_10","volume-title":"Database and XML Technologies","author":"P. Zezula","year":"2003","unstructured":"Zezula, P., Amato, G., Debole, F., Rabitti, F.: Tree Signatures for XML Querying and Navigation. In: Bellahs\u00e8ne, Z., Chaudhri, A.B., Rahm, E., Rys, M., Unland, R. (eds.) XSym 2003. LNCS, vol.\u00a02824, pp. 149\u2013163. Springer, Heidelberg (2003)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"42","author":"K. Zhang","year":"1992","unstructured":"Zhang, K., Statman, R., Shasha, D.: On the Edit Distance between Unordered Labeled Trees. Information Processing Letters\u00a042, 133\u2013139 (1992)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2004: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24618-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T13:36:35Z","timestamp":1559568995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24618-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540207795","9783540246183"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24618-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}