{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:56:01Z","timestamp":1725512161484},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540720348"},{"type":"electronic","value":"9783540720355"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72035-5_25","type":"book-chapter","created":{"date-parts":[[2007,6,5]],"date-time":"2007-06-05T12:02:15Z","timestamp":1181044935000},"page":"328-338","source":"Crossref","is-referenced-by-count":0,"title":["Xistree: Bottom-Up Method of XML Indexing"],"prefix":"10.1007","author":[{"given":"Xinyin","family":"Wang","sequence":"first","affiliation":[]},{"given":"Chenghong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jingyuan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yunfa","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/s00778-002-0081-x","volume":"11","author":"H.V. Jagadish","year":"2002","unstructured":"Jagadish, H.V., Al-Khalifa, S., Chapman, A., et al.: Timber: A native XML database. The VLDB Journal\u00a011, 274\u2013291 (2002)","journal-title":"The VLDB Journal"},{"key":"25_CR2","unstructured":"Goldman, R., Widom, J.: Dataguides: enabling query formulation and optimization in semistructured databases. In: Proc. of VLDB\u201997, pp. 436\u2013445 (1997)"},{"key":"25_CR3","unstructured":"Cooper, B., et al.: A fast index for semistructured data. In: Proc. of VLDB\u201901, pp. 341\u2013350 (2001)"},{"key":"25_CR4","unstructured":"Li, Q., Moon, B.: Indexing and querying xml data for regular path expressions. In: Proc. of VLDB\u201901, pp. 361\u2013370 (2001)"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Wang, H., et al.: Vist: A dynamic index method for querying xml data by tree structures. In: Proc. of ACM SIGMOD\u201903, pp. 110\u2013121 (2003)","DOI":"10.1145\/872757.872774"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Q.H., Lim, A., Ong, K.: D(k)-index: An adaptive structural summary for graph-structured data. In: Proc. of ACM SIGMOD\u201903, pp. 134\u2013144 (2003)","DOI":"10.1145\/872757.872776"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing xpath queries. In: Proc. of VLDB\u201902, pp. 95\u2013106 (2002)","DOI":"10.1016\/B978-155860869-6\/50017-2"},{"key":"25_CR8","unstructured":"Ishikawa, Y., Nagai, T., Kitagawa, H.: Transforming XPath Queries for Bottom-Up Query Processing. In: Proc. of ISDB\u201902, pp. 210\u2013215 (2002)"},{"issue":"5","key":"25_CR9","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/MIC.2005.115","volume":"9","author":"B. Catania","year":"2005","unstructured":"Catania, B., Maddalena, A., Vakali, A.: XML document indexes: A classification. IEEE Internet Computing\u00a09(5), 64\u201371 (2005)","journal-title":"IEEE Internet Computing"},{"key":"25_CR10","unstructured":"XIndice (2006), available at http:\/\/xml.apache.org\/xindice\/index.html"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Zou, Q., Liu, S., Chu, W.: Ctree: a compact tree for indexing XML data. In: Proc. of WIDM\u201904, pp. 39\u201346 (2004)","DOI":"10.1145\/1031453.1031462"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Kazai, G., Lalmas, M., Vries, A.: The Overlapping problem in Content-Oriented XML Retrieval Evaluation. In: Proc. of SIGIR\u201904, pp. 72\u201379 (2004)","DOI":"10.1145\/1008992.1009008"},{"issue":"10","key":"25_CR13","first-page":"1933","volume":"13","author":"S. Zhou","year":"2000","unstructured":"Zhou, S., Hu, Y., Guan, J.: Adjacency matrix based full-text indexing models. Journal of Software\u00a013(10), 1933\u20131942 (2000)","journal-title":"Journal of Software"},{"key":"25_CR14","unstructured":"Hu, Y.: Inter-relevant successive trees \u2013 a new mathematical model for full-text database. Technical Report no.\u00a0TR022031, Department of Computer and Information Technology, Fudan University (2002)"},{"issue":"4","key":"25_CR15","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1360\/crad20050409","volume":"42","author":"H.-B. Ma","year":"2005","unstructured":"Ma, H.-B., et al.: Mining frequent patterns based on is+-tree model. Journal of Computer Research and Development\u00a042(4), 588\u2013593 (2005)","journal-title":"Journal of Computer Research and Development"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Chung, C., Min, J., Shim, K.: Apex: An adaptive path index for xml data. In: Proc. of ACM SIGMOD\u201902, pp. 121\u2013132 (2002)","DOI":"10.1145\/564691.564706"},{"key":"25_CR17","unstructured":"Timber (2004), available at http:\/\/www.eecs.umich.edu\/db\/timber"},{"key":"25_CR18","unstructured":"DBLP (2006), available at http:\/\/dblp.uni-trier.de\/xml\/"}],"container-title":["Lecture Notes in Computer Science","Business Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72035-5_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:28:23Z","timestamp":1605745703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72035-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540720348","9783540720355"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72035-5_25","relation":{},"subject":[]}}