{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:50Z","timestamp":1725663470788},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540550150"},{"type":"electronic","value":"9783540466468"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-55015-1_28","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T23:23:20Z","timestamp":1330212200000},"page":"524-545","source":"Crossref","is-referenced-by-count":10,"title":["Querying design and planning databases"],"prefix":"10.1007","author":[{"given":"T.","family":"Imielinski","sequence":"first","affiliation":[]},{"given":"S.","family":"Naqvi","sequence":"additional","affiliation":[]},{"given":"K.","family":"Vadaparty","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"S. Abiteboul, C. Kanellakis, Object Identity as a Query language Primitive, Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data.","DOI":"10.1145\/67544.66941"},{"key":"28_CR2","unstructured":"C. Beeri, S. Naqvi, O. Shmueli, and S. Tsur, Set Constructors in a Logic Database Language, accepted for publication in Journal of Logic Programming. Extended abstract in ACM PODS, 1987."},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"A. K. Chandra, and D. Harel Structure and Complexity of relational queries J. of Comp. Syst. Sci., 25 pp99\u2013128.","DOI":"10.1016\/0022-0000(82)90012-5"},{"key":"28_CR4","unstructured":"M. Garey and D. Johnson, Computers and Intractability A guide to the theory of NP-Completeness, W.H. Freeman and Company, NY."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"R. Hull, J.Su, Untyped sets, invention, and computable queries, Proc. of 8th PODS, Philadelphia, 1989.","DOI":"10.1145\/73721.73755"},{"issue":"4","key":"28_CR6","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1145\/1634.1886","volume":"31","author":"T. Imielinski","year":"1984","unstructured":"T. Imielinski and W. Lipski, Incomplete information in relational databases, JACM 31(4):761\u2013791, October, 1984.","journal-title":"JACM"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"T. Imielinski, S. Naqvi and K. Vadaparty, Incomplete Objects \u2014 A Data Model for Design and Planning Applications, Accepted for publication in Proceedings of SIGMOD 1991.","DOI":"10.1145\/115790.115838"},{"key":"28_CR8","unstructured":"T. Imielinski, S. Naqvi and K. Vadaparty, A Query Language for Databases with Incomplete Objects, a manuscript."},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"T.Imielinski and K. Vadaparty, Complexity of Querying Databases with or-objects, Proceedings of the Eighth ACM Symposium on Principles of Database Systems (PODS), 1989.","DOI":"10.1145\/73721.73726"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"J. Lloyd, Foundations of Logic Programming, Springer Verlag, 1984.","DOI":"10.1007\/978-3-642-96826-6"},{"key":"28_CR11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0747-7171(89)80012-4","volume":"7","author":"J. Siekmann","year":"1989","unstructured":"J. Siekmann, Unification Theory, Journal of Symbolic Computation, 7, 207\u2013274, 1989. Journal of Symbolic Computation, 7, 207\u2013274, 1989.","journal-title":"Journal of Symbolic Computation"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"K. Vadaparty, On the power of rule based languages with sets, Proceedings of the Tenth ACM on Principles of Database Systems (PODS), 1991.","DOI":"10.1145\/113413.113416"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"M. Vardi, The Complexity of Relational Query Languages, Proc. of 14th STOC, 137\u2013146, 1982.","DOI":"10.1145\/800070.802186"}],"container-title":["Lecture Notes in Computer Science","Deductive and Object-Oriented Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55015-1_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:57:12Z","timestamp":1605646632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55015-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540550150","9783540466468"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-55015-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}