{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T11:40:13Z","timestamp":1736595613306,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540481058"},{"type":"electronic","value":"9783540481072"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11912873_49","type":"book-chapter","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:40:04Z","timestamp":1160581204000},"page":"474-486","source":"Crossref","is-referenced-by-count":1,"title":["Clustered Chain Path Index for XML Document: Efficiently Processing Branch Queries"],"prefix":"10.1007","author":[{"given":"Hongqiang","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hongzhi","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","unstructured":"XML Path Language (XPath) 2.0, http:\/\/www.w3.org\/TR\/xpath20\/"},{"key":"49_CR2","unstructured":"XQuery 1.0: An XML query language, http:\/\/www.w3.org\/TR\/xquery\/"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Bruno, N., Srivastava, D., Koudas, N.: Holistic twig joins: optimal XML pattern matching. In: SIGMOD Conference, pp. 310\u2013321 (2002)","DOI":"10.1145\/564691.564727"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Jiang, H., et al.: Holistic twig joins on indexed XML documents. In: Proc. of VLDB, pp. 273\u2013284 (2003)","DOI":"10.1016\/B978-012722442-8\/50032-X"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Lu, J.H., Chen, T., Ling, T.W.: Efficient processing of XML twig patterns with parent child edges: a look-ahead approach. In: Proceedings of CIKM Conference 2004, pp. 533\u2013542 (2004)","DOI":"10.1145\/1031171.1031272"},{"key":"49_CR6","unstructured":"Li, Q., Moon, B.: Indexing and querying XML data for regular path expressions. In: Proc. of VLDB, pp. 361\u2013370 (2001)"},{"key":"49_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-49257-7_18","volume-title":"Database Theory - ICDT\u201999","author":"T. Milo","year":"1998","unstructured":"Milo, T., Dan Suciu, D.: Index structures for path expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 277\u2013295. Springer, Heidelberg (1998)"},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"Miklau, G., Suciu, D.: Containment and equivalence for an XPath fragment. In: PODS, pp. 65\u201376 (2002)","DOI":"10.1145\/543613.543623"},{"key":"49_CR9","unstructured":"Lu, J., Ling, T.W., Chan, C.Y., Chen, T.: From Region Encoding To Extended Dewey: On Efficient Processing of XML Twig Pattern Matching. In: Proc. of VLDB, pp. 193\u2013204 (2003)"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Chen, Y., Davidson, S.B., Zheng, Y.: BLAS: An efficient XPath processing system. In: Proc. of SIGMOD, pp. 47\u201358 (2004)","DOI":"10.1145\/1007568.1007577"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Jiang, H., Wang, W., Lu, H., Yu, J.X.: Holistic twig joins on indexed XML documents. In: Proceeding of VLDB 2003, pp. 273\u2013284 (2003)","DOI":"10.1016\/B978-012722442-8\/50032-X"},{"key":"49_CR12","unstructured":"Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting local similarity for efficient indexing of paths in graph structured data. In: ICDE 2002 (2002)"},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Qun, C., Lim, A., Ong, K.W.: D(k)-index: An adaptive structural summary for graph-structured data. In: ACM SIGMOD, pp. 134\u2013144 (2003)","DOI":"10.1145\/872757.872776"},{"key":"49_CR14","unstructured":"He, H., Yang, J.: Multi resolution indexing of XML for frequent queries. In: ICDE 2004 (2004)"},{"key":"49_CR15","doi-asserted-by":"crossref","unstructured":"Kaushik, R., Bohannon, P., Naughton, J.F., Korth, H.F.: Covering indexes for branching path queries. In: SIGMOD 2002 (2002)","DOI":"10.1145\/564691.564707"},{"key":"49_CR16","unstructured":"XMark: The XML-benchmark project, http:\/\/monetdb.cwi.nl\/xml"},{"key":"49_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, N., Kacholia, V., \u00d6zsu, M.T.: A succinct physical storage scheme for efficient evaluation of path queries in XML. In: ICDE 2004, pp. 54\u201365 (2004)","DOI":"10.1109\/ICDE.2004.1319984"},{"key":"49_CR18","unstructured":"U. of Washington XML Repository, http:\/\/www.cs.washington.edu\/research\/xmldatasets\/"},{"key":"49_CR19","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems \u2013 WISE 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11912873_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T11:22:56Z","timestamp":1736594576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11912873_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540481058","9783540481072"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11912873_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}