{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:32:08Z","timestamp":1725564728847},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540213710"},{"type":"electronic","value":"9783540246558"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24655-8_47","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T20:25:37Z","timestamp":1283977537000},"page":"442-446","source":"Crossref","is-referenced-by-count":0,"title":["Inter-relevant Successive Trees Model and Its Implementation"],"prefix":"10.1007","author":[{"given":"Yongdan","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhan","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianhui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunfa","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"47_CR1","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1145\/237496.237497","volume":"14","author":"A. Moffat","year":"1996","unstructured":"Moffat, A., Zobel, J.: Self-Indexing Inverted Files for Fast Text Retrieval. ACM Transactions on Information System\u00a014(4), 349\u2013379 (1996)","journal-title":"ACM Transactions on Information System"},{"key":"47_CR2","unstructured":"Zobel, J., Moffat, A.: Sacks \u2013 Davis. An Efficient Indexing Technique for Full- Text Database Systems. In: Proceedings of the 18th Inter. Conf. on VLDB, pp. 352\u2013362 (1992)"},{"issue":"3","key":"47_CR3","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/TIT.1966.1053907","volume":"IT- 12","author":"Golomb","year":"1996","unstructured":"Golomb: Run-Length Encodings. IEEE Transactions on Information Theory\u00a0IT- 12(3), 399\u2013401 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"12","key":"47_CR4","doi-asserted-by":"publisher","first-page":"1624","DOI":"10.1109\/PROC.1979.11543","volume":"67","author":"C. Roberts","year":"1979","unstructured":"Roberts, C.: Partial-match retrieval via the method of superimposed code. Proceeding of the IEEE\u00a067(12), 1624\u20131642 (1979)","journal-title":"Proceeding of the IEEE"},{"issue":"1","key":"47_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/4078.4080","volume":"17","author":"C. Faloutsos","year":"1985","unstructured":"Faloutsos, C.: Access methods for text. Computing Survey\u00a017(1), 49\u201374 (1985)","journal-title":"Computing Survey"},{"issue":"2","key":"47_CR6","first-page":"201","volume":"10","author":"S. Christodoulakis","year":"1984","unstructured":"Christodoulakis, S., Faloutsos, C.: Design Considerations for a Message File Server. TSE\u00a010(2), 201\u2013210 (1984)","journal-title":"TSE"},{"issue":"4","key":"47_CR7","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/296854.277632","volume":"23","author":"J. Zobel","year":"1998","unstructured":"Zobel, J., Moffat, A., Ramamohanarao, K.: Inverted files versus signature files for text indexing. Transactions on Database Systems\u00a023(4), 453\u2013490 (1998)","journal-title":"Transactions on Database Systems"},{"key":"47_CR8","unstructured":"Muthukrishnan, S.: Efficient Algorithms for Document Retrieval Problems. In: Proc. ACM-SIAM SODA, pp. 657\u2013666 (2002)"},{"key":"47_CR9","volume-title":"Modern Information Retrieval","author":"R. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley, Reading (1999)"},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"R. Grossi, J.S. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract). STOC 2000: 397- 406, 1999.","DOI":"10.1145\/335305.335351"},{"key":"47_CR11","unstructured":"Yunfa, H., Shuigeng, Z.: A New Model of Chinese Full-text databases. In: Proceeding World Multiconference on Systemics, Cybernetics and Informatics, Florida, USA, pp. 528\u2013533 (2001)"},{"key":"47_CR12","unstructured":"Xiaopeng, T., Yunfa, H., Shuigeng, Z.: Subsequent Array: A New Full Text Index. In: Proceeding World Multiconference on Systemics, Cybernetics and Informatics, Florida, USA, pp. 551\u2013556 (2001)"},{"key":"47_CR13","doi-asserted-by":"crossref","unstructured":"Farach, M., Ferragina, P., Muthukrishnan, S.: Overcoming the Memory Bottleneck in Suffix Tree Construction. In: Proc. of IEEE FOCS, pp. 174\u2013183 (1998)","DOI":"10.1109\/SFCS.1998.743441"}],"container-title":["Lecture Notes in Computer Science","Advanced Web Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24655-8_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:50:40Z","timestamp":1605761440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24655-8_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213710","9783540246558"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24655-8_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}