{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T05:38:08Z","timestamp":1738215488786,"version":"3.34.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,3,26]],"date-time":"2008-03-26T00:00:00Z","timestamp":1206489600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1007\/s00778-008-0097-y","type":"journal-article","created":{"date-parts":[[2008,3,25]],"date-time":"2008-03-25T17:01:53Z","timestamp":1206464513000},"page":"233-254","source":"Crossref","is-referenced-by-count":4,"title":["Containment of partially specified tree-pattern queries in the presence of dimension graphs"],"prefix":"10.1007","volume":"18","author":[{"given":"Dimitri","family":"Theodoratos","sequence":"first","affiliation":[]},{"given":"Pawel","family":"Placek","sequence":"additional","affiliation":[]},{"given":"Theodore","family":"Dalamagas","sequence":"additional","affiliation":[]},{"given":"Stefanos","family":"Souldatos","sequence":"additional","affiliation":[]},{"given":"Timos","family":"Sellis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,3,26]]},"reference":[{"key":"97_CR1","unstructured":"XML Path Language (XPath). World Wide Web Consortium site, W3C XPath: http:\/\/www.w3.org\/TR\/xpath20"},{"key":"97_CR2","unstructured":"XML Query (XQuery). World Wide Web Consortium site, W3C XQuery: http:\/\/www.w3.org\/XML\/Query"},{"key":"97_CR3","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Cho, S., Lakshmanan, L.V.S., Srivastava, D.: Minimization of tree pattern queries. In: Proceedings of the ACM SIGMOD Intl. Conf. on Management of Data, pp. 497\u2013508, Santa Barbara (2001)","DOI":"10.1145\/375663.375730"},{"key":"97_CR4","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Cho, S., Srivastava, D.: Tree pattern relaxation. In: Proc. of the 8th Intl. Conf. on Extending Database Technology, Prague (2002)","DOI":"10.1007\/3-540-45876-X_32"},{"key":"97_CR5","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Lakshmanan, L.V.S., Pandit, S.: Flexpath: flexible structure and full-text querying for xml. In: Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, pp. 83\u201394 (2004)","DOI":"10.1145\/1007568.1007581"},{"key":"97_CR6","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":"97_CR7","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Fundulaki, I.: Xml subtree queries: specification and composition. In: Proc. of the Intl. Workshop on Database Programming Languages (DBPL\u201905), pp. 138\u2013153, Trondheim (2005)","DOI":"10.1007\/11601524_9"},{"key":"97_CR8","doi-asserted-by":"crossref","unstructured":"Chen, L., Rundensteiner, E.A.: Xquery containment in presence of variable binding dependencies. In: Proc. of the 14th Intl. Conf. on World Wide Web, pp. 288\u2013297 (2005)","DOI":"10.1145\/1060745.1060789"},{"key":"97_CR9","unstructured":"Cluet, S., Veltri, P., Vodislav, D.: Views in a large scale xml repository. In: Proc. of the 27th Intl. Conf. on Very Large Data Bases (2001)"},{"key":"97_CR10","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"},{"key":"97_CR11","unstructured":"Deutsch, A., Tannen, V.: Containment and integrity constraints for xpath. In: Proc. of the 8th Intl. Workshop on Knowledge Representation meets Databases (2001)"},{"key":"97_CR12","doi-asserted-by":"crossref","unstructured":"Dong, X., Halevy, A.Y., Tatarinov, I.: Containment of nested XML queries. In: Proc. of the 30th Intl. Conf. on Very Large Data Bases, pp. 132\u2013143 (2004)","DOI":"10.1016\/B978-012088469-8\/50015-2"},{"issue":"1\u20136","key":"97_CR13","doi-asserted-by":"crossref","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. Comput. Netw. 33(1\u20136), 119\u2013135 (2000)","journal-title":"Comput. Netw."},{"key":"97_CR14","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":"97_CR15","doi-asserted-by":"crossref","unstructured":"Guha, S., Jagadish, H.V., Koudas, N., Srivastava, D., Yu, T.: Approximate XML joins. In: Proceedings of the ACM SIGMOD Intl. Conf. on Management of Data, Madison, pp. 287\u2013298 (2002)","DOI":"10.1145\/564691.564725"},{"key":"97_CR16","doi-asserted-by":"crossref","unstructured":"Hidders, J.: Satisfiability of XPath expressions. In: Proc. of the 9th Intl. Workshop on Database Programming Languages, pp. 21\u201336 (2003)","DOI":"10.1007\/978-3-540-24607-7_3"},{"key":"97_CR17","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"},{"key":"97_CR18","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":"97_CR19","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, Madison, pp. 133\u2013144 (2002)","DOI":"10.1145\/564691.564707"},{"key":"97_CR20","doi-asserted-by":"crossref","unstructured":"Kaushik, R., Shenoy, P., Bohannon, P., Gudes, E.: Exploiting local similarity for indexing paths in graph-structured data. In: Proc. of the 18th Intl. Conf. on Data Engineering, pp. 129\u2013140 (2002)","DOI":"10.1109\/ICDE.2002.994703"},{"key":"97_CR21","unstructured":"Lakshmanan, L.V., Wang, H.W., Zhao, Z.J.: Answering tree pattern queries using views. In: Proc. of the 32nd Intl. Conf. on Very Large Data Bases (2006)"},{"key":"97_CR22","doi-asserted-by":"crossref","unstructured":"Lakshmanan, L.V.S., Ramesh, G., Wang, H.W., Zhao, Z.J.: On testing satisfiability of tree pattern queries. In: Proc. of the 30th Intl. Conf. on Very Large Data Bases, pp. 120\u2013130 (2004)","DOI":"10.1016\/B978-012088469-8.50014-0"},{"key":"97_CR23","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":"97_CR24","doi-asserted-by":"crossref","unstructured":"Liu, Z., Chen, Y.: Identifying meaningful return information for xml keyword search. In: Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, pp. 329\u2013340 (2007)","DOI":"10.1145\/1247480.1247518"},{"key":"97_CR25","doi-asserted-by":"crossref","unstructured":"Miklau, G., Suciu, D.: Containment and equivalence for an XPath fragment. In: Proc. of the 21st ACM Symp. on Principles of Database Systems, pp. 65\u201376 (2002)","DOI":"10.1145\/543613.543623"},{"key":"97_CR26","doi-asserted-by":"crossref","unstructured":"Milo, T., Suciu, D.: Index structures for path expressions. In: Proc. of the 9th Intl. Conf. on Database Theory, pp. 277\u2013295 (1999)","DOI":"10.1007\/3-540-49257-7_18"},{"key":"97_CR27","doi-asserted-by":"crossref","unstructured":"Neven, F., Schwentick, T.: XPath containment in the presence of disjunction, DTDs, and variables. In: Proc. of the 13th Intl. Conf. on Database Theory, Sienna, pp. 315\u2013329 (2003)","DOI":"10.1007\/3-540-36285-1_21"},{"key":"97_CR28","doi-asserted-by":"crossref","unstructured":"Papakonstantinou, Y., Vassalos, V.: Query rewriting for semistructured data. In: SIGMOD Conference, pp. 455\u2013466 (1999)","DOI":"10.1145\/304182.304222"},{"key":"97_CR29","doi-asserted-by":"crossref","unstructured":"Polyzotis, N., Garofalakis, M.: Statistical synopsis for graph-structured XML databases. In: Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, Madison (2002)","DOI":"10.1145\/564732.564733"},{"key":"97_CR30","doi-asserted-by":"crossref","unstructured":"Polyzotis, N., Garofalakis, M., Ioannidis, Y.: Approximate XML query answers. In: Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, Paris, pp. 263\u2013274 (2004)","DOI":"10.1145\/1007568.1007599"},{"key":"97_CR31","doi-asserted-by":"crossref","unstructured":"Ramanan, P.: Efficient algorithms for minimizing tree pattern queries. In: Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, Madison, pages 299\u2013309 (2002)","DOI":"10.1145\/564691.564726"},{"key":"97_CR32","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, pp. 321\u2013329 (2001)","DOI":"10.1109\/ICDE.2001.914844"},{"key":"97_CR33","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":"97_CR34","doi-asserted-by":"crossref","unstructured":"Theodoratos, D., Dalamagas, T., Placek, P., Souldatos, S., Sellis, T.: Containment of partially specified tree-pattern queries. In: Proc. of the Intl. Conference on Scientific and Statistical Databases, pp. 3\u201312 (2006)","DOI":"10.1109\/SSDBM.2006.16"},{"key":"97_CR35","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, pp. 445\u2013454 (2006)","DOI":"10.1145\/1183614.1183679"},{"key":"97_CR36","unstructured":"Wood, P.T.: Minimising simple XPath expressions. In: Informal Proc. of the 4th Intl. Workshop on the Web and Databases, pp. 13\u201318 (2001)"},{"key":"97_CR37","doi-asserted-by":"crossref","unstructured":"Wood, P.T.: Containment for XPath fragments under DTD constraints. In: Proc. of the 13th Intl. Conf. on Database Theory, Sienna, pp. 300\u2013314 (2003)","DOI":"10.1007\/3-540-36285-1_20"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-008-0097-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-008-0097-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-008-0097-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T07:29:37Z","timestamp":1738135777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-008-0097-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,26]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["97"],"URL":"https:\/\/doi.org\/10.1007\/s00778-008-0097-y","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"type":"print","value":"1066-8888"},{"type":"electronic","value":"0949-877X"}],"subject":[],"published":{"date-parts":[[2008,3,26]]}}}