{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:25:02Z","timestamp":1726406702016},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_16","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:01:56Z","timestamp":1330192916000},"page":"174-186","source":"Crossref","is-referenced-by-count":0,"title":["Relational algebra operations and sizes of relations"],"prefix":"10.1007","author":[{"given":"Dani\u00e8le","family":"Gardy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"Puech","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"16_CR1","unstructured":"F. Bancilhon, Ph. Richard, and M. Scholl, On line processing of compacted relations, Proc. VLDB 82, Mexico 1982."},{"key":"16_CR2","unstructured":"M.W. Blasgen and K.P. Eswaran, \"On the Evaluation of Queries in Relational Data Base Systems,\" RJ1745 (April 1976). IBM Research Report, IBM Research Center, San Jose"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"S. Christodoulakis, Estimating Block Transfers and Join Sizes, Proc. SIGMOD 83, San Jose, Cal. 1983.","DOI":"10.1145\/582192.582204"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"W.W. Chu and P. Hurley, \"Optimal query processing for distributed database systems,\" IEEE Transactions on Computers C-31(9)(1982).","DOI":"10.1109\/TC.1982.1676099"},{"key":"16_CR5","unstructured":"R. Demolombe, Estimation of the number of tuples satisfying a query expressed in Predicate Calculus language, Proc. VLDB 80 1980."},{"key":"16_CR6","unstructured":"R. Demolombe, \"How to improve performance of relational DBMS,\" pp. 229\u2013233 in Proc. IFIP 83, ed. Mason R.E.A.,Elsevier Science Publishers (1983)."},{"key":"16_CR7","unstructured":"D. Gardy, Evaluation de r\u00e9sultats d'op\u00e9rations de l'alg\u00e8bre relationnelle, Th\u00e8se de Troisi\u00e8me Cycle, Universit\u00e9 de Paris-Sud, Orsay 1983."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"E. Gelenbe and D. Gardy, \"On the sizes of projections, I,\" Information Processing Letters 14(1)(1982).","DOI":"10.1016\/0020-0190(82)90134-X"},{"key":"16_CR9","unstructured":"E. Gelenbe and D. Gardy, The size of Projections of Relations Satisfying a Functional Dependency, Proc. VLDB 82, Mexico 1982."},{"key":"16_CR10","unstructured":"L.R. Gotlieb, Computing joins of relations, Proc. SIGMOD 78 1978."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"A.R. Hevner and S.B. Yao, \"Query processing in distributed data base systems,\" IEEE Transactions On Software Engineering, (1979).","DOI":"10.1109\/TSE.1979.234179"},{"key":"16_CR12","unstructured":"D. Maier, The Theory of Relational Databases, Computer Science Press (1983)."},{"key":"16_CR13","unstructured":"T.H. Merrett and Ekow Otoo, Distributions models of relations, Proc. VLDB 79, Rio de Janeiro 1979."},{"key":"16_CR14","unstructured":"A.Y. Montgomery, Y.J. D'Souza, and S.B. Lee, \"The cost of relational algebraic operations on skewed data: estimates and experiments,\" pp. 235\u2013241 in Proc. IFIP 83, ed. Mason R.E.A.,Elsevier Science Publishers (1983)."},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Ph. Richard, Evaluation of the size of a query expressed in relational algebra, Proc. SIGMOD 81 1981.","DOI":"10.1145\/582318.582343"},{"issue":"4","key":"16_CR16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/984488.984491","volume":"11","author":"A. S. Rosenthal","year":"1981","unstructured":"A.S. Rosenthal, \"Note on the expected size of a join,\" SIGMOD Record 11(4) pp. 19\u201325 (1981).","journal-title":"SIGMOD Record"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"P. Griffiths Selinger, M.M. Astrahan, M.M. Chamberlin, R.A. Lorie, and T.G. Price, Access path selection in a relational Database System, Proc. ACM SIGMOD 1979.","DOI":"10.1145\/582096.582099"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"J.M. Smith and P.Y.T. Chang, \"Optimizing the performance of a relational algebra Database interface,\" CACM 18(10)(1975).","DOI":"10.1145\/361020.361025"},{"key":"16_CR19","unstructured":"J.D. Ullmann, Principles of data base systems, Computer Science Press (1980)."},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"S.B. Yao, \"An attribute based model for data base access cost analysis,\" ACM TODS, (1977).","DOI":"10.1145\/320521.320535"},{"issue":"2","key":"16_CR21","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/320071.320072","volume":"4","author":"S. B. Yao","year":"1979","unstructured":"S.B. Yao, \"Optimization of Query Evaluation Algorithms,\" ACM TODS 4(2) pp. 133\u2013155 (1979).","journal-title":"ACM TODS"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:07:12Z","timestamp":1605643632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}