{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T04:27:24Z","timestamp":1744259244959,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642334689"},{"type":"electronic","value":"9783642334696"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33469-6_87","type":"book-chapter","created":{"date-parts":[[2012,10,6]],"date-time":"2012-10-06T11:35:50Z","timestamp":1349523350000},"page":"706-713","source":"Crossref","is-referenced-by-count":0,"title":["An XML Data Query Method Based on Structure-Encoded"],"prefix":"10.1007","author":[{"given":"Zhaohui","family":"Xu","sequence":"first","affiliation":[]},{"given":"Jie","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Fuliang","family":"Yan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"87_CR1","unstructured":"Brian, F.C., Neal, S., Michael, F., Moshe, S.: A fast index for semistructured data. In: VLDB, pp. 341\u2013350 (2001)"},{"key":"87_CR2","doi-asserted-by":"crossref","unstructured":"Wang, H.X., Park, S., Fan, W., Yu, P.S.: ViST: A Dynamic Index Method for Querying XML Data by Tree Structures. In: ACM SIGMOD (2003)","DOI":"10.1145\/872773.872774"},{"key":"87_CR3","doi-asserted-by":"crossref","unstructured":"Jie, Q., Shu, M.Z.: Querying XML Documents on Multi-processor. In: Sixth International Conference on Fuzzy Systems and Knowledge Discovery, pp. 327\u2013331 (2009)","DOI":"10.1109\/FSKD.2009.373"},{"key":"87_CR4","doi-asserted-by":"crossref","unstructured":"Bruno, N., Koudas, N., Srivastava, D.: Holistic Twig Joins: Optimal XML Pattern Matching. In: ACM SIGMOD (2002)","DOI":"10.1145\/564691.564727"},{"issue":"2","key":"87_CR5","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. Journal of the ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"key":"87_CR6","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.L., Rosalba, G.: Algorithmics and Applications of Tree and Graph Searching. In: ACM Symposium on Principles of Database Systems (PODS), pp. 39\u201352 (2002)","DOI":"10.1145\/543613.543620"},{"key":"87_CR7","doi-asserted-by":"crossref","unstructured":"Leeuwen, J.V.: Algorithms for finding patterns in strings. In: Handbook of Theoretical Computer Science. Algorithms and Complexity, vol.\u00a0A, pp. 255\u2013300. Elsevier (1990)","DOI":"10.1016\/B978-0-444-88071-0.50010-2"},{"key":"87_CR8","unstructured":"Sleepycat Software, The Berkeley Database (Berkeley DB), http:\/\/www.sleepycat.com"},{"key":"87_CR9","unstructured":"The DBLP Computer Science Bibliography (2009), http:\/\/www.informatik.uni-trier.de\/~ley\/db"},{"key":"87_CR10","unstructured":"XMark-An XML Benchmark Project (2009), http:\/\/www.xml-benchmark.org\/"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems and Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33469-6_87.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T02:18:19Z","timestamp":1744251499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33469-6_87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334689","9783642334696"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33469-6_87","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}