{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:22:45Z","timestamp":1725805365879},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319115863"},{"type":"electronic","value":"9783319115870"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11587-0_28","type":"book-chapter","created":{"date-parts":[[2014,9,19]],"date-time":"2014-09-19T06:27:47Z","timestamp":1411108067000},"page":"301-312","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Algorithm to Approximate Values with Non-uniform Spreads Inside a Histogram Bucket"],"prefix":"10.1007","author":[{"given":"Wissem","family":"Labbadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jalel","family":"Akaichi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Kooi, R.P.: The optimization of queries in relational databases. PhD thesis, Case Western Reserver University (September 1980)"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Shapiro, G.P., Connell, C.: Accurate estimation of the number of tuples satisfying a condition. In: Proc. of ACM SIGMOD, pp. 256\u2013276 (1984)","DOI":"10.1145\/971697.602294"},{"key":"28_CR3","unstructured":"Ioannidis, Y.: Universality of serial histograms. In: Proc. of 19th VLDB, pp. 256\u2013267 (1993)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Ioannidis, Y., Christodoulakis, S.: Optimal histograms for limiting worst-case error propagation in the size of join results. In: Proc. of ACM TODS (1993)","DOI":"10.1145\/169725.169708"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Selinger, P.G., Astrahan, M.M., Chamberlin, D.D., Lorie, R.A., Price, T.T.: Access path selection in a relational database management system. In: Proc. of ACM SIGMOD, pp. 23\u201334 (1979)","DOI":"10.1145\/582096.582099"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Poosala, V., Ioannidis, Y., Haas, P., Shekita, E.: Improved histograms for selectivity estimation of range predicates. In: Proc. of ACM SIGMOD, pp. 294\u2013305 (1996)","DOI":"10.1145\/235968.233342"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Ioannidis, Y., Poosala, V.: Balancing histogram optimality and practicality for query result size estimation. In: Proc. of ACM SIGMOD, pp. 233\u2013244 (1995)","DOI":"10.1145\/568271.223841"},{"key":"28_CR8","unstructured":"Poosala, V., Ioannidis, Y.: Estimation of query-result distribution and its application in parallel-join load balancing. In: Proc. of 22nd VLDB, pp. 448\u2013459 (1996)"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-40769-7_4","volume-title":"Flexible Query Answering Systems","author":"W. Labbadi","year":"2013","unstructured":"Labbadi, W., Akaichi, J.: Improving range query result size estimation based on a new optimal histogram. In: Larsen, H.L., Martin-Bautista, M.J., Vila, M.A., Andreasen, T., Christiansen, H. (eds.) FQAS 2013. LNCS, vol.\u00a08132, pp. 40\u201356. Springer, Heidelberg (2013)"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Jain, R., Chlamtac, I.: The p2 algorithm for dynamic calculation of quantiles and histograms without storing observations. Communications oh the ACM, 1076\u20131085 (1985)","DOI":"10.1145\/4372.4378"},{"key":"28_CR11","unstructured":"Jagadish, H.V., Koudas, N., Muthukrishnan, S., Poosala, V., Sevcik, K., Suel, T.: Optimal histograms with quality guarantees. In: Proc. of 24th VLDB, pp. 275\u2013286 (1998)"}],"container-title":["Lecture Notes in Computer Science","Model and Data Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11587-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T22:47:50Z","timestamp":1558997270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11587-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115863","9783319115870"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11587-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}