{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T02:17:21Z","timestamp":1649125041663},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1007\/bf01178261","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T19:38:41Z","timestamp":1108669121000},"page":"255-270","source":"Crossref","is-referenced-by-count":0,"title":["Lazy structure sharing for query optimization"],"prefix":"10.1007","volume":"32","author":[{"given":"Adam L.","family":"Buchsbaum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajamani","family":"Sundar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","series-title":"McGraw-Hill Computer Science Series","volume-title":"Anatomy of LISP","author":"J. Allen","year":"1978","unstructured":"Allen, J.: Anatomy of LISP. McGraw-Hill Computer Science Series. New York: McGraw-Hill 1978"},{"key":"CR2","first-page":"101","volume":"7","author":"R.S. Boyer","year":"1972","unstructured":"Boyer, R.S., Moore, J.S.: The sharing of structure in theorem-proving programs. Machine Intelligence7, 101?116 (1972)","journal-title":"Machine Intelligence"},{"key":"CR3","unstructured":"Cordin, J., Bidoit, M.: A rehabilitation of Robinson's unification algorithm. In Proc. 9th IFIP World Computer Cong., pp. 909?914 (1983)"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Flickinger, D., Pollard, C., Wasow, T.: Structure-sharing in lexical representation. In Proc. 23rd Ann. Mtg. of the Asso. for Computational Linguistics, pp. 262?267, 1985","DOI":"10.3115\/981210.981242"},{"key":"CR5","volume-title":"Mathematics for the analysis of algorithms","author":"D.H. Greene","year":"1982","unstructured":"Greene, D.H., Knuth, D.E.: Mathematics for the analysis of algorithms 2nd edn. Boston: Birkh\u00e4user, 1982","edition":"2nd edn."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Karttunen, L., Kay, M.: Structure sharing with binary trees. In Proc. 23rd Ann. Mtg. of the Asso. for Computational Linguistics, pp. 133?136a, 1985","DOI":"10.3115\/981210.981226"},{"key":"CR7","unstructured":"Martelli, A., Montanari, U.: Theorem proving with structure sharing and efficient unification. In Proc. 5th Int. Joint Conf. on Artificial Intelligence, pp. 543, 1977"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Pereira, F.C.N.: A structure-sharing representation for unification-based grammar functions. In Proc. 23rd Ann. Mtg. of the Asso. for Computational Linguistics, pp 137?144, 1985","DOI":"10.3115\/981210.981227"},{"key":"CR9","unstructured":"Pugh, W.W.: Incremental computation and the incremental evaluation of functional programs. Ph.D. Thesis, Department of Computer Science, Cornell University, 1988"},{"issue":"12","key":"CR10","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1145\/359657.359667","volume":"21","author":"J.M. Spitzer","year":"1978","unstructured":"Spitzer, J.M., Levitt, K.N., Robinson, L.: An example of hierarchical design and proof. Commun. ACM21 (12), 1064?1075 (1978)","journal-title":"Commun. ACM"},{"issue":"2","key":"CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM22 (2), 215?225 (1975)","journal-title":"J. ACM"},{"key":"CR12","unstructured":"Yellin, D.M.: Algorithms for subset testing and finding maximal sets. In Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, pp. 386?92, 1992"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01178261.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01178261\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01178261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:29:12Z","timestamp":1586118552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01178261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["BF01178261"],"URL":"https:\/\/doi.org\/10.1007\/bf01178261","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}