{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:05:42Z","timestamp":1725483942140},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678397"},{"type":"electronic","value":"9783540449140"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44914-0_28","type":"book-chapter","created":{"date-parts":[[2007,5,22]],"date-time":"2007-05-22T17:26:14Z","timestamp":1179854774000},"page":"328-329","source":"Crossref","is-referenced-by-count":0,"title":["Answering Queries with Database Restrictions"],"prefix":"10.1007","author":[{"given":"Chen","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"S. S. Cosmadakis, H. Gaifman, P. C. Kanellakis, and M. Y. Vardi. Decidable optimization problems for database logic programs. ACM Symposium on Theory of Computing (STOC), pages 477\u2013490, 1988.","DOI":"10.1145\/62212.62259"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"M. R. Genesereth, A. M. Keller, and O. M. Duschka. Infomaster: An information integration system. In Proc. of ACM SIGMOD, pages 539\u2013542, 1997.","DOI":"10.1145\/253260.253400"},{"key":"28_CR3","unstructured":"C. Li. Computing complete answers to queries in the presence of limited access patterns (extended version). Technical report, Computer Science Dept., Stanford Univ., 1999."},{"key":"28_CR4","unstructured":"C. Li. Testing query containment in the presence of binding restrictions. Technical report, Computer Science Dept., Stanford Univ. 1999."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"C. Li and E. Chang. Query planning with limited source capabilities. International Conference on Data Engineering (ICDE), 2000.","DOI":"10.1109\/ICDE.2000.839440"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"C. Li, R. Yerneni, V. Vassalos, H. Garcia-Molina, Y. Papakonstantinou, J. D. Ullman, and M. Valiveti. Capability based mediation in TSIMMIS. In Proc. of ACM SIGMOD, pages 564\u2013566, 1998.","DOI":"10.1145\/276304.276382"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. In Proc. of ACM Symposium on Principles of Database Systems (PODS), pages 105\u2013112, 1995.","DOI":"10.1145\/212433.220199"},{"issue":"3","key":"28_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0743-1066(93)90040-N","volume":"15","author":"O. Shmueli","year":"1993","unstructured":"O. Shmueli. Equivalence of datalog queries is undecidable. Journal of Logic Programming. 15(3):231\u2013241, 1993.","journal-title":"Journal of Logic Programming"},{"key":"28_CR9","volume-title":"Principles of Database and Knowledge-base Systems, Volumes II: The New Technologies","author":"J. D. Ullman","year":"1989","unstructured":"J. D. Ullman. Principles of Database and Knowledge-base Systems, Volumes II: The New Technologies. Computer Science Press, New York, 1989."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"J. D. Ullman. Information integration using logical views. International Conference on Database Theory (ICDT), pages 19\u201340, 1997.","DOI":"10.1007\/3-540-62222-5_34"},{"issue":"3","key":"28_CR11","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/2.121508","volume":"25","author":"G. Wiederhold","year":"1992","unstructured":"G. Wiederhold. Mediators in the architecture of future information systems. IEEE Computer, 25(3):38\u201349, 1992.","journal-title":"IEEE Computer"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"R. Yerneni, C. Li, H. Garcia-Molina, and J. D. Ullman. Computing capabilities of mediators. In Proc. of ACM SIGMOD, pages 443\u2013454, 1999.","DOI":"10.1145\/304182.304221"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"R. Yerneni, C. Li, J. D. Ullman, and H. Garcia-Molina. Optimizing large join queries in mediation systems. International Conference on Database Theory (ICDT), pages 348\u2013364, 1999.","DOI":"10.1007\/3-540-49257-7_22"}],"container-title":["Lecture Notes in Computer Science","Abstraction, Reformulation, and Approximation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44914-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T03:01:23Z","timestamp":1556420483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44914-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678397","9783540449140"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44914-0_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}