{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T07:09:57Z","timestamp":1791097797421,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540309512","type":"print"},{"value":"9783540314455","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11601524_8","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T13:28:15Z","timestamp":1133443695000},"page":"122-137","source":"Crossref","is-referenced-by-count":41,"title":["Satisfiability of XPath Queries with Sibling Axes"],"prefix":"10.1007","author":[{"given":"Floris","family":"Geerts","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenfei","family":"Fan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Cho, S., Lakshmanan, L., Srivistava, D.: Minimization of tree pattern queries. In: SIGMOD (2001)","DOI":"10.1145\/375663.375730"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Benedikt, M., Fan, W., Geerts, F.: XPath satisfiability in the presence of DTDs. In: PODS (2005)","DOI":"10.1145\/1065167.1065172"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/3-540-36285-1_6","volume-title":"Database Theory - ICDT 2003","author":"M. Benedikt","year":"2002","unstructured":"Benedikt, M., Fan, W., Kuper, G.M.: Structural properties of XPath fragments. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 79\u201395. Springer, Heidelberg (2002)"},{"key":"8_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59207-2","volume-title":"The Classical Decision Problem","author":"E. B\u00f6rger","year":"1997","unstructured":"B\u00f6rger, E., Gr\u00e4del, E., Gurevich, Y.: The Classical Decision Problem. Springer, Heidelberg (1997)"},{"key":"8_CR5","unstructured":"Bray, T., Paoli, J., Sperberg-McQueen, C.M.: Extensible Markup Language (XML) 1.0. W3C Recommendation (February 1998), \n                  \n                    http:\/\/www.w3.org\/TR\/REC-xml"},{"issue":"5","key":"8_CR6","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S1389-1286(02)00223-2","volume":"39","author":"P. Buneman","year":"2002","unstructured":"Buneman, P., Davidson, S., Fan, W., Hara, C., Tan, W.: Keys for XML. Computer Networks\u00a039(5), 473\u2013487 (2002)","journal-title":"Computer Networks"},{"key":"8_CR7","unstructured":"Clark, J., DeRose, S.: XML Path Language (XPath). W3C Recommendation (November 1999)"},{"key":"8_CR8","unstructured":"Deutsch, A., Tannen, V.: Containment for classes of XPath expressions under integrity constraints. In: KRDB (2001)"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-36285-1_15","volume-title":"Database Theory - ICDT 2003","author":"A. Deutsch","year":"2002","unstructured":"Deutsch, A., Tannen, V.: Reformulation of XML queries and constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 225\u2013238. Springer, Heidelberg (2002)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Fan, W., Chan, C., Garofalakis, M.: Secure XML querying with security views. In: SIGMOD (2004)","DOI":"10.1145\/1007568.1007634"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. In: VLDB (2002)","DOI":"10.1016\/B978-155860869-6\/50017-2"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C., Schulz, K.: Conjunctive queries over trees. In: PODS (2004)","DOI":"10.1145\/1055558.1055585"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24607-7_3","volume-title":"Database Programming Languages","author":"J. Hidders","year":"2004","unstructured":"Hidders, J.: Satisfiability of XPath expressions. In: Lausen, G., Suciu, D. (eds.) DBPL 2003. LNCS, vol.\u00a02921, pp. 21\u201336. Springer, Heidelberg (2004)"},{"key":"8_CR14","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"2000","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation, 2nd edn. Addison Wesley, Reading (2000)","edition":"2"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Lakshmanan, L., Ramesh, G., Wang, H., Zhao, Z.: On testing satisfiability of tree pattern queries. In: VLDB (2004)","DOI":"10.1016\/B978-012088469-8.50014-0"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/11523468_4","volume-title":"Automata, Languages and Programming","author":"L. Libkin","year":"2005","unstructured":"Libkin, L.: Logics over unranked trees: an overview. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 35\u201350. Springer, Heidelberg (2005)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-540-24741-8_28","volume-title":"Advances in Database Technology - EDBT 2004","author":"M. Marx","year":"2004","unstructured":"Marx, M.: XPath with conditional axis relations. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., B\u00f6hm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol.\u00a02992, pp. 477\u2013494. Springer, Heidelberg (2004)"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-30570-5_8","volume-title":"Database Theory - ICDT 2005","author":"M. Marx","year":"2004","unstructured":"Marx, M.: First order paths in ordered trees. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol.\u00a03363, pp. 114\u2013128. Springer, Heidelberg (2004)"},{"issue":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/962446.962448","volume":"51","author":"G. Miklau","year":"2004","unstructured":"Miklau, G., Suciu, D.: Containment and equivalence for a fragment of XPath. JACM\u00a051(1), 2\u201345 (2004)","journal-title":"JACM"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Murata, M.: Extended path expressions for XML. In: PODS (2001)","DOI":"10.1145\/375551.375569"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Neven, F., Schwentick, T.: Expressive and efficient languages for tree-structured data. In: PODS (2000)","DOI":"10.1145\/335168.335217"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Neven, F., Schwentick, T.: XPath containment in the presence of disjunction, DTDs, and variables. In: ICDT (2003)","DOI":"10.1007\/3-540-36285-1_21"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Olteanu, D., Meuss, H., Furche, T., Bry, F.: XPath: Looking forward. In: XMLDM (2002)","DOI":"10.1007\/3-540-36128-6_7"},{"key":"8_CR24","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"issue":"1","key":"8_CR25","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/974121.974140","volume":"33","author":"T. Schwentick","year":"2004","unstructured":"Schwentick, T.: Xpath query containment. SIGMOD Rec.\u00a033(1), 101\u2013109 (2004)","journal-title":"SIGMOD Rec."},{"key":"8_CR26","unstructured":"Sur, G., Hammer, J., Sim\u00e9on, J.: An XQuery-based language for processing updates in XML. In: PLAN-X (2004)"},{"key":"8_CR27","unstructured":"Thompson, H., et al.: XML Schema. W3C Recommendation (October 2004), \n                  \n                    http:\/\/www.w3.org\/TR\/xmlschema1"},{"key":"8_CR28","unstructured":"Wood, P.T.: Minimising simple XPath expressions. In: WebDB (2001)"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/3-540-36285-1_20","volume-title":"Database Theory - ICDT 2003","author":"P.T. Wood","year":"2002","unstructured":"Wood, P.T.: Containment for XPath fragments under DTD constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 297\u2013311. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Database Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11601524_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:52:53Z","timestamp":1558288373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11601524_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309512","9783540314455"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11601524_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}