{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:26:34Z","timestamp":1738387594000,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540856535"},{"type":"electronic","value":"9783540856542"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85654-2_44","type":"book-chapter","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T07:30:03Z","timestamp":1219822203000},"page":"508-522","source":"Crossref","is-referenced-by-count":1,"title":["Superimposed Code-Based Indexing Method for Extracting MCTs from XML Documents"],"prefix":"10.1007","author":[{"given":"Wenxin","family":"Liang","sequence":"first","affiliation":[]},{"given":"Takeshi","family":"Miki","sequence":"additional","affiliation":[]},{"given":"Haruo","family":"Yokota","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Chaudhuri, S., Das, G.: DBXplorer: A System for Keyword-Based Search over Relational Databases. In: ICDE, pp. 5\u201316 (2002)","DOI":"10.1109\/ICDE.2002.994693"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Chaudhuri, S., Das, G.: DBXplorer: Enabling Keyword Search over Relational Databases. In: SIGMOD, p. 627 (2002)","DOI":"10.1145\/564691.564782"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: On Finding Lowest Common Ancestors in Trees. In: STOC, pp. 253\u2013265 (1973)","DOI":"10.1145\/800125.804056"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., Sudarshan, S.: Keyword Searching and Browsing in Databases using BANKS. In: ICDE, pp. 431\u2013440 (2002)","DOI":"10.1109\/ICDE.2002.994756"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Selective Families, Superimposed Codes, and Broadcasting on Unknown Radio Networks. In: SODA, pp. 709\u2013718 (2001)","DOI":"10.1145\/383962.384040"},{"key":"44_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, S., Mamou, J., Kanza, Y., Sagiv, Y.: XSEarch: A Semantic Search Engine for XML. In: VLDB, pp. 45\u201356 (2003)","DOI":"10.1016\/B978-012722442-8\/50013-6"},{"issue":"4","key":"44_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF00191355","volume":"8","author":"M. Dyer","year":"1995","unstructured":"Dyer, M., Fenner, T., Frieze, A., Thomason, A.: On Key Storage in Secure Networks. J. of Cryptology\u00a08(4), 189\u2013200 (1995)","journal-title":"J. of Cryptology"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Guo, L., Shao, F., Botev, C., Shanmugasundaram, J.: XRANK: Ranked Keyword Search over XML Documents. In: SIGMOD, pp. 16\u201327 (2003)","DOI":"10.1145\/872757.872762"},{"issue":"2","key":"44_CR9","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast Algorithms for Finding Nearest Common Ancestors. SIAM J. Comput.\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"44_CR10","first-page":"525","volume":"18","author":"V. Hristidis","year":"2006","unstructured":"Hristidis, V., Koudas, N.: Keyword Proximity Search in XML Trees. IEEE TKDE\u00a018(4), 525\u2013539 (2006)","journal-title":"IEEE TKDE"},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Papakonstantinou, Y.: DISCOVER: Keyword Search in Relational Databases. In: VLDB, pp. 670\u2013681 (2002)","DOI":"10.1016\/B978-155860869-6\/50065-2"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Kaae, R., Nguyen, T.-D., N\u00f8rgaard, D., Schmidt, A.: Kalchas: A Dynamic XML Search Engine. In: CIKM, pp. 541\u2013548 (2005)","DOI":"10.1145\/1099554.1099699"},{"issue":"4","key":"44_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"W.H. Kautz","year":"1964","unstructured":"Kautz, W.H., Singleton, R.C.: Nonrandom Binary Superimposed Codes. IEICE Trans. Inform. Theory\u00a010(4), 363\u2013377 (1964)","journal-title":"IEICE Trans. Inform. Theory"},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"Li, Y., Yu, C., Jagadish, H.V.: Schema-Free XQuery. In: VLDB, pp. 72\u201383 (2004)","DOI":"10.1016\/B978-012088469-8.50010-3"},{"issue":"6","key":"44_CR15","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0020-0190(94)00050-6","volume":"50","author":"M. Nyk\u00e4nen","year":"1994","unstructured":"Nyk\u00e4nen, M., Ukkonen, E.: Finding Lowest Common Ancestors in Arbitrarily Directed Trees. Inf. Process. Lett.\u00a050(6), 307\u2013310 (1994)","journal-title":"Inf. Process. Lett."},{"key":"44_CR16","unstructured":"XML\u00a0Benchmark Project, http:\/\/www.xml-benchmark.org"},{"issue":"6","key":"44_CR17","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On Finding Lowest Common Ancestors: Simplification and Parallelization. SIAM J. Comput.\u00a017(6), 1253\u20131262 (1988)","journal-title":"SIAM J. Comput."},{"key":"44_CR18","doi-asserted-by":"crossref","unstructured":"Schmidt, A., Kersten, M.L., Windhouwer, M.: Querying XML Documents Made Easy: Nearest Concept Queries. In: ICDE, pp. 321\u2013329 (2001)","DOI":"10.1109\/ICDE.2001.914844"},{"key":"44_CR19","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/S0378-3758(99)00131-7","volume":"86","author":"W.D.R. Stinson","year":"2000","unstructured":"Stinson, W.D.R., van Trung, T., Wei, R.: Secure Frameproof Codes, Key Distribution Patterns, Group Testing Algorithms and Related Structures. J. of Statistical Planning and Inference\u00a086, 595\u2013617 (2000)","journal-title":"J. of Statistical Planning and Inference"},{"key":"44_CR20","unstructured":"Swiss-Prot, http:\/\/www.ebi.ac.uk\/swissprot\/"},{"issue":"4","key":"44_CR21","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/322154.322161","volume":"26","author":"R.E. Tarjan","year":"1979","unstructured":"Tarjan, R.E.: Applications of Path Compression on Balanced Trees. J. ACM\u00a026(4), 690\u2013715 (1979)","journal-title":"J. ACM"},{"key":"44_CR22","unstructured":"TrEMBL, http:\/\/www.ebi.ac.uk\/trembl\/"},{"key":"44_CR23","unstructured":"The Free\u00a0Encyclopedia: Wikipedia, http:\/\/www.wikipedia.org\/"},{"key":"44_CR24","unstructured":"XML Version of DBLP, http:\/\/dblp.uni-trier.de\/xml\/"},{"key":"44_CR25","doi-asserted-by":"crossref","unstructured":"Xu, Y., Papakonstantinou, Y.: Efficient Keyword Search for Smallest LCAs in XML Databases. In: SIGMOD, pp. 537\u2013538 (2005)","DOI":"10.1145\/1066157.1066217"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85654-2_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T17:51:06Z","timestamp":1738345866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85654-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540856535","9783540856542"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85654-2_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}