{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T18:04:58Z","timestamp":1648836298574},"reference-count":36,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6621,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1016\/0304-3975(94)00305-3","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"125-159","source":"Crossref","is-referenced-by-count":3,"title":["Dynamic analysis of some relational databases parameters"],"prefix":"10.1016","volume":"144","author":[{"given":"Dani\u00e8le","family":"Gardy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Louchard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00305-3_BIB1","series-title":"Convergence of Probability Measures","author":"Billingsley","year":"1968"},{"key":"10.1016\/0304-3975(94)00305-3_BIB2","series-title":"Proc. ACM SIGMOD","first-page":"40","article-title":"Estimating block transfers and join sizes","author":"Christodoulakis","year":"1983"},{"issue":"2","key":"10.1016\/0304-3975(94)00305-3_BIB3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/329.318578","article-title":"Implications of certains assumptions in database performance evaluation","volume":"9","author":"Christodoulakis","year":"1984","journal-title":"ACM Trans. Database System"},{"key":"10.1016\/0304-3975(94)00305-3_BIB4","article-title":"On the estimation and use of selectivities in database performance evaluation","author":"Christodoulakis","year":"1989"},{"issue":"2","key":"10.1016\/0304-3975(94)00305-3_BIB5","first-page":"179","article-title":"On the joint distribution of the maximum and its location for a linear diffusion","volume":"23","author":"Csaki","year":"1987","journal-title":"Ann. Inst. H. Poincar\u00e8"},{"key":"10.1016\/0304-3975(94)00305-3_BIB6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.2307\/1427162","article-title":"The maximum of a gaussian process whose mean path has a maximum, with an application to the strength of bundles of fibres","volume":"21","author":"Daniels","year":"1989","journal-title":"Adv. in Appl. Probab"},{"key":"10.1016\/0304-3975(94)00305-3_BIB7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.2307\/1427054","article-title":"The maximum of a random walk whose mean path has a maximum","volume":"17","author":"Daniels","year":"1985","journal-title":"Adv. in Appl Probab."},{"key":"10.1016\/0304-3975(94)00305-3_BIB8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.2307\/3213751","article-title":"The first-passage density of a continuous gaussian process to a general boundary","volume":"22","author":"Durbin","year":"1985","journal-title":"J. Appl. Probab."},{"key":"10.1016\/0304-3975(94)00305-3_BIB9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0196-6774(80)90020-6","article-title":"Sequence of operations analysis for dynamic data structures","author":"Flajolet","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(94)00305-3_BIB10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0255(86)90016-2","article-title":"The analysis of simple list structures","volume":"38","author":"Flajolet","year":"1986","journal-title":"Inform. Sci."},{"key":"10.1016\/0304-3975(94)00305-3_BIB11","series-title":"CAAP'84, 9th Colloq. on Trees in Algebra and Programming, Cambridge University Press","article-title":"Histoires de files de priorit\u00e9 avec fusions","author":"Francon","year":"1984"},{"issue":"2","key":"10.1016\/0304-3975(94)00305-3_BIB12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1137\/0405018","article-title":"Normal limiting distributions for projection and semijoin sizes","volume":"5","author":"Gardy","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0304-3975(94)00305-3_BIB13","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0304-3975(94)90180-5","article-title":"Join sizes, urn models and normal limiting distributions","volume":"131","author":"Gardy","year":"1994","journal-title":"Theret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00305-3_BIB14","article-title":"Dynamic analysis of some relational data base parameters I: projections","author":"Gardy","year":"1994"},{"key":"10.1016\/0304-3975(94)00305-3_BIB15","article-title":"Dynamic analysis of some relational data base parameters II: equijoins and semijoins","author":"Gardy","year":"1994"},{"issue":"3\/4","key":"10.1016\/0304-3975(94)00305-3_BIB16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0306-4379(84)90005-X","article-title":"On the sizes of projections: a generating function approach","volume":"9","author":"Gardy","year":"1984","journal-title":"Inform Systems"},{"issue":"4","key":"10.1016\/0304-3975(94)00305-3_BIB17","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1145\/76902.76907","article-title":"On the effect of join operation on relation sizes","volume":"14","author":"Gardy","year":"1989","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0304-3975(94)00305-3_BIB18","series-title":"Principles of Database Systems","first-page":"190","article-title":"Fixed-precision estimation of join selectivity","author":"Haas","year":"1993"},{"issue":"4","key":"10.1016\/0304-3975(94)00305-3_BIB19","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1145\/115302.115300","article-title":"Statistical estimators for aggregate relational algebra queries","volume":"16","author":"Hou","year":"1991","journal-title":"ACM Trans. Database System"},{"key":"10.1016\/0304-3975(94)00305-3_BIB20","series-title":"Urn Models and Their Application","author":"Johnson","year":"1977"},{"key":"10.1016\/0304-3975(94)00305-3_BIB21","series-title":"A Second Course in Stochastic Processes","author":"Karlin","year":"1981"},{"key":"10.1016\/0304-3975(94)00305-3_BIB22","series-title":"Proc. 16th Internat. Colloqu. on Automata, Languages and Programming","first-page":"473","article-title":"General methods for the analysis of the maximum size of dynamic data structures","volume":"Vol. 372","author":"Kenyon-Mathieu","year":"1989"},{"issue":"4","key":"10.1016\/0304-3975(94)00305-3_BIB23","doi-asserted-by":"crossref","DOI":"10.1145\/141818.141820","article-title":"A supplement to sampling-based methods or query size estimation in a database system","volume":"21","author":"Ling","year":"1992","journal-title":"SIGMOD Record"},{"issue":"1","key":"10.1016\/0304-3975(94)00305-3_BIB24","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0304-3975(93)90224-H","article-title":"Efficient sampling strategies for relational database operations","volume":"116","author":"Lipton","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00305-3_BIB25","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF01939359","article-title":"Brownian motion and algorithms complexity","volume":"26","author":"Louchard","year":"1986","journal-title":"BIT"},{"key":"10.1016\/0304-3975(94)00305-3_BIB26","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(87)90028-4","article-title":"Random walks, gaussian processes and list structures","volume":"53","author":"Louchard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00305-3_BIB27","doi-asserted-by":"crossref","unstructured":"G. Louchard, Trie size in a dynamic list structure, in: M.-C. Gaudel and J.-P. Jouannaud, eds., Proc. TAPSOFT'93.","DOI":"10.1007\/3-540-56610-4_100"},{"key":"10.1016\/0304-3975(94)00305-3_BIB28","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-3975(92)90330-I","article-title":"Dynamic algorithms in D.E. Knuth's model: a probabilistic analysis","volume":"93","author":"Louchard","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00305-3_BIB29","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/0885-064X(91)90035-V","article-title":"A path integral approach to data structure evolution","author":"Maier","year":"1991","journal-title":"J. Complexity"},{"issue":"3","key":"10.1016\/0304-3975(94)00305-3_BIB30","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1145\/62061.62063","article-title":"Statistical profile estimation in database systems","volume":"20","author":"Mannino","year":"1988","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0304-3975(94)00305-3_BIB31","series-title":"Proc. 5th Conf. on Very Large Data Bases","first-page":"418","article-title":"Distribution models of relations","author":"Merrett","year":"1979"},{"issue":"3","key":"10.1016\/0304-3975(94)00305-3_BIB32","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0306-4379(93)90037-2","article-title":"Estimating the size of a relational join","volume":"18","author":"Mullin","year":"1993","journal-title":"Inform. Systems"},{"key":"10.1016\/0304-3975(94)00305-3_BIB33","series-title":"Proc. Ann. Conf. of the ACM","first-page":"439","article-title":"A detailed statistical model for relational query optimization","author":"Muthuswamy","year":"1985"},{"key":"10.1016\/0304-3975(94)00305-3_BIB34","series-title":"Internat. Conf. ACM SIGMOD","first-page":"256","article-title":"Accurate estimation of the number of tuples satisfying a condition","author":"Piatetsky-Shapiro","year":"1984"},{"key":"10.1016\/0304-3975(94)00305-3_BIB35","series-title":"Proc. ACM SIGMOD Internat. Conf.","first-page":"79","article-title":"An instant and accurate size estimation method for joins and selection in a retrieval-intensive environment","author":"Sun","year":"1993"},{"key":"10.1016\/0304-3975(94)00305-3_BIB36","series-title":"Principles of Database Systems","first-page":"180","article-title":"Multiple join size estimation by virtual domains","author":"van Gelder","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594003053?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594003053?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:28:04Z","timestamp":1555403284000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594003053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":36,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["0304397594003053"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00305-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}