{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T06:48:58Z","timestamp":1792824538502,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540589075","type":"print"},{"value":"9783540491361","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-58907-4_6","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:54:06Z","timestamp":1330257246000},"page":"54-67","source":"Crossref","is-referenced-by-count":30,"title":["On the complexity of generating optimal left-deep processing trees with cross products"],"prefix":"10.1007","author":[{"given":"Sophie","family":"Cluet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guido","family":"Moerkotte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"6_CR1","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"J. Garey","year":"1979","unstructured":"Garey, J., Johnson, D.: Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"issue":"3","key":"6_CR2","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1145\/1270.1498","volume":"9","author":"T. Ibaraki","year":"1984","unstructured":"Ibaraki, T., Kameda, T.: Optimal Nesting for computing n-Relational Joins. ACM. Trans. on Database Systems, 9(3) (1984) 482\u2013502","journal-title":"ACM. Trans. on Database Systems"},{"key":"6_CR3","unstructured":"Krishnamurthy, R., Boral, H., Zaniolo, C.: Optimization of Nonrecursive Queries. Proc. Int. Conf. Very Large Databases (VLDB), (1986), 128\u2013137"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1287\/moor.4.3.215","volume":"4","author":"C. Monma","year":"1979","unstructured":"Monma, C., Sidney, J.: Sequencing with Series-Parallel Precedence Constraints. Math. Oper. Res,. 4 (1979), 215\u2013224","journal-title":"Math. Oper. Res"},{"key":"6_CR5","unstructured":"Ono, K., Lohman, G.: Measuring the Complexity of Join Enumeration in Query Optimization. Proc. Int. Conf. Very Large Databases (VLDB), (1990), 314\u2013325"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Selinger, P., Astrahan, M., Chamberlin, D., Lorie, R., Price, T.: Access Path Selection in a Relational Database Management System. Proc. Int. Conf. Management of Data (ACM SIGMOD), (1979), 23\u201334","DOI":"10.1145\/582095.582099"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58907-4_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:21:20Z","timestamp":1619558480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58907-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589075","9783540491361"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-58907-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}