{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:28:37Z","timestamp":1648859317777},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bf00881860","type":"journal-article","created":{"date-parts":[[2005,1,7]],"date-time":"2005-01-07T05:02:27Z","timestamp":1105074147000},"page":"317-323","source":"Crossref","is-referenced-by-count":0,"title":["On the complexity of nested-object matching"],"prefix":"10.1007","volume":"14","author":[{"given":"Kumar V.","family":"Vadaparty","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Beeri, C., Naqvi, S., Shmueli, O., and Tsur, S.: Set constructors in a logic database language,J. Logic Programming (1991).","DOI":"10.1016\/0743-1066(91)90036-O"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Benanav, D., Kapur, D., and Narendran, P.: Complexity of matching problems, inProc. 1st Internat. Conf. Rewrite Technique and Applications, 1985, pp. 416?429.","DOI":"10.1007\/3-540-15976-2_22"},{"issue":"1","key":"CR3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","volume":"25","author":"A. K. Chandra","year":"1982","unstructured":"Chandra, A. K. and Harel, D.: Structure and complexity of relational queries,J. Computer Systems and Sciences 25(1) (1982), 99?128.","journal-title":"J. Computer Systems and Sciences"},{"key":"CR4","unstructured":"Chen, W., Kifer, M., and Warren, D.: HiLog as a platform for database languages, inWorkshop on DBPL, 1989."},{"key":"CR5","unstructured":"Garey, M. and Johnson, D.:Computers and Intractability, A Guide to Theory of NP-Completeness, W. H. Freeman, 1979."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0022-0000(91)90036-5","volume":"43","author":"R. Hull","year":"1991","unstructured":"Hull, R. and Su, J.: On the expressive power of database queries with intermediate types,J. Computer and System Sciences 43 (1991), 219?267.","journal-title":"J. Computer and System Sciences"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Kapur, D. and Narendran, P.: NP-completeness of the set unification and matching problem, inProc. 8th Internat. Conf. Automated Deduction (CADE-8), 1986.","DOI":"10.1007\/3-540-16780-3_113"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF00245463","volume":"9","author":"D. Kapur","year":"1992","unstructured":"Kapur, D. and Narendran, P.: Complexity of unification problems with associative-commutative operators,J. of Automated Reasoning 9 (1992), 261?288.","journal-title":"J. of Automated Reasoning"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Kuper, G. M.: Logic programming with sets,JCSS 41(1) (1990).","DOI":"10.1016\/0022-0000(90)90033-H"},{"issue":"2","key":"CR10","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","volume":"16","author":"M. S. Paterson","year":"1978","unstructured":"Paterson, M. S. and Wegman, M. N.: Linear unification,J. Computer and System Sciences 16(2) (1978), 158?167.","journal-title":"J. Computer and System Sciences"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0747-7171(89)80012-4","volume":"7","author":"J. Siekmann","year":"1989","unstructured":"Siekmann, J.: Unification theory,J. Symbolic Computation 7 (1989) 207?274.","journal-title":"J. Symbolic Computation"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0743-1066(14)80009-5","volume":"21","author":"K. Vadaparty","year":"1994","unstructured":"Vadaparty, K.: On the power of rule-based query languages for nested data models,J. Logic Programming 21 (1994) 155?175.","journal-title":"J. Logic Programming"},{"key":"CR13","volume-title":"Querying database with non-deterministic information","author":"K. Vadaparty","year":"1992","unstructured":"Vadaparty, K.: Querying database with non-deterministic information, PhD thesis, Rutgers University, Department of Computer Science, Rutgers University, New Brunswick, 1992."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"Vardi, M.: The complexity of relational query languages, inProc. 14th STOC, 1982.","DOI":"10.1145\/800070.802186"},{"issue":"1","key":"CR15","first-page":"33","volume":"101","author":"R. M. Verma","year":"1992","unstructured":"Verma, R. M. and Ramakrishnan, I. V.: Tight complexity bounds,Information and Control 101(1) (1992), 33?69.","journal-title":"Information and Control"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881860.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00881860\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881860","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T07:05:25Z","timestamp":1586070325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00881860"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995]]}},"alternative-id":["BF00881860"],"URL":"https:\/\/doi.org\/10.1007\/bf00881860","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}