{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:51:49Z","timestamp":1725558709010},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540242888"},{"type":"electronic","value":"9783540305705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30570-5_9","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T14:38:07Z","timestamp":1278254287000},"page":"129-143","source":"Crossref","is-referenced-by-count":6,"title":["An Abstract Framework for Generating Maximal Answers to Queries"],"prefix":"10.1007","author":[{"given":"Sara","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Yehoshua","family":"Sagiv","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","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. 2004 ACM SIGMOD International Conference on Management of Data (2004)","DOI":"10.1145\/1007568.1007581"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/3-540-47922-8","volume-title":"Database Theory - ICDT 2003","author":"S. Cohen","year":"2002","unstructured":"Cohen, S., Kanza, Y., Sagiv, Y.: Generating relations from XML documents. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 282\u2013296. Springer, Heidelberg (2002)"},{"key":"9_CR3","unstructured":"Cohen, S., Sagiv, Y.: Generating all maximal solutions for hereditary, connected-hereditary and rooted-hereditary graph properties, Corr ID: cs.DS\/0410039 (2004)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Galindo-Legaria, C.: Outerjoins as disjunctions. In: Proc. 1994 ACM SIGMOD International Conference on Management of Data (1994)","DOI":"10.1145\/191839.191908"},{"key":"9_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Guha, S., Jagadish, H.V., Koudas, N., Srivastava, D., Yu, T.: Approximate xml joins. In: Proc. 2002 ACM SIGMOD International Conference on Management of Data (2002)","DOI":"10.1145\/564691.564725"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: On generating all maximal independent sets. Information Processing Letters\u00a027(3), 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Kanza, Y., Nutt, W., Sagiv, Y.: Queries with incomplete answers over semistructured data. In: Proc. 18th Symposium on Principles of Database Systems (1999)","DOI":"10.1145\/303976.303999"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Kanza, Y., Sagiv, Y.: Flexible queries over semistructured data. In: Proc. 20th Symposium on Principles of Database Systems (2001)","DOI":"10.1145\/375551.375558"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Kanza, Y., Sagiv, Y.: Computing full disjunctions. In: Proc. 22nd Symposium on Principles of Database Systems (2003)","DOI":"10.1145\/773153.773162"},{"key":"9_CR11","unstructured":"Libkin, L.: A semantics-based approach to design of query languages for partial information. Semantics in Databases (1995)"},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1145\/322276.322280","volume":"28","author":"D. Maier","year":"1981","unstructured":"Maier, D., Sagiv, Y., Yannakakis, M.: On the complexity of testing implications of functional and join dependencies. J. ACM\u00a028(4), 680\u2013695 (1981)","journal-title":"J. ACM"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Mendelzon, A.O., Mihaila, G.A.: Querying partially sound and complete data sources. In: Proc. 20th Symposium on Principles of Database Systems (2001)","DOI":"10.1145\/375551.375575"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Rajaraman, A., Ullman, J.D.: Integrating information by outerjoins and full disjunctions. In: Proc. 15th Symposium on Principles of Database Systems (1996)","DOI":"10.1145\/237661.237717"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Srivastava, D., Amer-Yahia, S., Cho, S.: Tree pattern relaxation. In: Proc. 8th International Conference on Extending Database Technology (2002)","DOI":"10.1007\/3-540-45876-X_32"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: On the complexity of bounded-variable queries. In: Proc. 14th Symposium on Principles of Database Systems (1995)","DOI":"10.1145\/212433.212474"},{"key":"9_CR17","unstructured":"Yannakakis, M.: Algorithms for acyclic database schemas. In: Proc. 7th International Conference on Very Large Data Bases (1981)"}],"container-title":["Lecture Notes in Computer Science","Database Theory - ICDT 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30570-5_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:23:20Z","timestamp":1605741800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30570-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540242888","9783540305705"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30570-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}