{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:52:52Z","timestamp":1725511972021},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540717027"},{"type":"electronic","value":"9783540717034"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71703-4_61","type":"book-chapter","created":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T20:31:22Z","timestamp":1186000282000},"page":"727-739","source":"Crossref","is-referenced-by-count":2,"title":["An Original Semantics to Keyword Queries for XML Using Structural Patterns"],"prefix":"10.1007","author":[{"given":"Dimitri","family":"Theodoratos","sequence":"first","affiliation":[]},{"given":"Xiaoying","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"61_CR1","doi-asserted-by":"crossref","unstructured":"Al-Khalifa, S., Jagadish, H.V., Patel, J.M., Wu, Y., Koudas, N., Srivastava, D.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. In: Proc. of the Intl. Conf. on Data Engineering, p. 141 (2002)","DOI":"10.1109\/ICDE.2002.994704"},{"key":"61_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/3-540-45876-X_32","volume-title":"Advances in Database Technology - EDBT 2002","author":"S. Amer-Yahia","year":"2002","unstructured":"Amer-Yahia, S., Cho, S., Srivastava, D.: Tree Pattern Relaxation. In: Jensen, C.S., Jeffery, K.G., Pokorn\u00fd, J., \u0160altenis, S., Bertino, E., B\u00f6hm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol.\u00a02287, p. 496. Springer, Heidelberg (2002)"},{"key":"61_CR3","unstructured":"Barta, A., Consens, M.P., Mendelzon, A.O.: Benefits of Path Summaries in an XML Query Optimizer Supporting Multiple Access Methods. In: Proc. of the 31st Intl. Conf. on Very Large Data Bases, pp. 133\u2013144 (2005)"},{"key":"61_CR4","doi-asserted-by":"crossref","unstructured":"Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, pp. 310\u2013321 (2002)","DOI":"10.1145\/564691.564727"},{"key":"61_CR5","doi-asserted-by":"crossref","unstructured":"Cohen, S., Mamou, J., Kanza, Y., Sagiv, Y.: XSearch: A Semantic Search Engine for XML. In: Proc. of the 29th Intl. Conf. on Very Large Data Bases (2003)","DOI":"10.1016\/B978-012722442-8\/50013-6"},{"issue":"1-6","key":"61_CR6","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S1389-1286(00)00069-4","volume":"33","author":"D. Florescu","year":"2000","unstructured":"Florescu, D., Kossmann, D., Manolescu, I.: Integrating keyword search into xml query processing. Computer Networks\u00a033(1-6), 119\u2013135 (2000)","journal-title":"Computer Networks"},{"key":"61_CR7","unstructured":"Goldman, R., Widom, J.: DataGuides: Enabling query formulation and optimization in semistructured databases. In: Proc. of the 23rd Intl. Conf. on Very large Databases, pp. 436\u2013445 (1997)"},{"key":"61_CR8","doi-asserted-by":"crossref","unstructured":"Guo, L., Shao, F., Botev, C., Shanmugasundaram, J.: XRANK: Ranked Keyword Search over XML Documents. In: Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, pp. 16\u201327 (2003)","DOI":"10.1145\/872757.872762"},{"issue":"4","key":"61_CR9","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TKDE.2006.1599390","volume":"18","author":"V. Hristidis","year":"2006","unstructured":"Hristidis, V., Koudas, N., Papakonstantinou, Y., Srivastava, D.: Keyword Proximity Search in XML Trees. IEEE Trans. Knowl. Data Eng.\u00a018(4), 525\u2013539 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"61_CR10","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Papakonstantinou, Y., Balmin, A.: Keyword Proximity Search on XML Graphs. In: Proc. of the 19th Intl. Conf. on Data Engineering, pp. 367\u2013378 (2003)","DOI":"10.1109\/ICDE.2003.1260806"},{"issue":"4","key":"61_CR11","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., Lakshmanan, L.V.S., Nierman, A., Paparizos, S., Patel, J.M., Srivastava, D., Wiwatwattana, N., Wu, Y., Yu, C.: Timber: A native XML database. VLDB Journal\u00a011(4), 274\u2013291 (2002)","journal-title":"VLDB Journal"},{"key":"61_CR12","doi-asserted-by":"crossref","unstructured":"Kanza, Y., Sagiv, Y.: Flexible Queries Over Semistructured Data. In: Proc. of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (2001)","DOI":"10.1145\/375551.375558"},{"key":"61_CR13","doi-asserted-by":"crossref","unstructured":"Kaushik, R., Bohannon, P., Naughton, J.F., Korth, H.F.: Covering Indexes for Branching Path Queries. In: Proc. of the ACM SIGMOD Intl. Conf. on Management of Data (2002)","DOI":"10.1145\/564691.564707"},{"key":"61_CR14","doi-asserted-by":"crossref","unstructured":"Li, Y., Yu, C., Jagadish, H.V.: Schema-Free Xquery. In: Proc. of the 30th Intl. Conf. on Very Large Data Bases, pp. 72\u201383 (2004)","DOI":"10.1016\/B978-012088469-8.50010-3"},{"key":"61_CR15","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.: Index Structures for Path Expressions. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 277\u2013295. Springer, Heidelberg (1998)"},{"key":"61_CR16","doi-asserted-by":"crossref","unstructured":"Schmidt, A., Kersten, M.L., Windhouwer, M.: Querying XML Documents Made Easy: Nearest Concept Queries. In: Proc. of the 17th Intl. Conf. on Data Engineering (2001)","DOI":"10.1109\/ICDE.2001.914844"},{"key":"61_CR17","doi-asserted-by":"crossref","unstructured":"Theodoratos, D., Dalamagas, T., Koufopoulos, A., Gehani, N.: Semantic Querying of Tree-Structured Data Sources Using Partially Specified Tree-Patterns. In: Proc. of the 14th ACM Intl. Conf. on Information and Knowledge Management, pp. 712\u2013719 (2005)","DOI":"10.1145\/1099554.1099729"},{"key":"61_CR18","doi-asserted-by":"crossref","unstructured":"Theodoratos, D., Souldatos, S., Dalamagas, T., Placek, P., Sellis, T.: Heuristic Containment Check of Partial Tree-Pattern Queries in the Presence of Index Graphs. In: Proc. of the 15th ACM Intl. Conf. on Information and Knowledge Management (2006)","DOI":"10.1145\/1183614.1183679"},{"key":"61_CR19","doi-asserted-by":"crossref","unstructured":"Xu, Y., Papakonstantinou, Y.: Efficient Keyword Search for Smallest LCAs in XML Databases. In: Proc. of the ACM SIGMOD Intl. Conf. on Management of Data (2005)","DOI":"10.1145\/1066157.1066217"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases: Concepts, Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71703-4_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:54:49Z","timestamp":1619502889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71703-4_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540717027","9783540717034"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71703-4_61","relation":{},"subject":[]}}