{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:14:36Z","timestamp":1781104476667,"version":"3.54.1"},"reference-count":29,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10,1]]},"abstract":"<p>The rapid increase of data volumes makes sampling a crucial component of modern data management systems. Although there is a large body of work on database sampling, the problem of automatically determine the optimal sample for a given query remained (almost) unaddressed. To tackle this problem the authors propose a sample advisor based on a novel cost model. Primarily designed for advising samples of a few queries specified by an expert, the authors additionally propose two extensions of the sample advisor. The first extension enhances the applicability by utilizing recorded workload information and taking memory bounds into account. The second extension increases the effectiveness by merging samples in case of overlapping pieces of sample advice. For both extensions, the authors present exact and heuristic solutions. Within their evaluation, the authors analyze the properties of the cost model and demonstrate the effectiveness and the efficiency of the heuristic solutions with a variety of experiments.<\/p>","DOI":"10.4018\/ijkbo.2013100101","type":"journal-article","created":{"date-parts":[[2014,2,12]],"date-time":"2014-02-12T09:33:26Z","timestamp":1392197606000},"page":"1-21","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing Sample Design for Approximate Query Processing"],"prefix":"10.4018","volume":"3","author":[{"given":"Philipp","family":"R\u00f6sch","sequence":"first","affiliation":[{"name":"Business Intelligence Practice, SAP Research, Dresden, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wolfgang","family":"Lehner","sequence":"additional","affiliation":[{"name":"Database Technology Research Group, Dresden University of Technology, Dresden, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"ijkbo.2013100101-0","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335450"},{"key":"ijkbo.2013100101-1","first-page":"275","author":"S.Acharya","year":"1999","journal-title":"Join Synopses for Approximate Query Answering"},{"key":"ijkbo.2013100101-2","first-page":"496","author":"S.Agrawal","year":"2000","journal-title":"Automated Selection of Materialized Views and Indexes in SQL Databases"},{"key":"ijkbo.2013100101-3","doi-asserted-by":"publisher","DOI":"10.1145\/872819.872822"},{"key":"ijkbo.2013100101-4","first-page":"111","author":"K.Chakrabarti","year":"2000","journal-title":"Approximate Query Processing Using Wavelets"},{"key":"ijkbo.2013100101-5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2001.914867"},{"key":"ijkbo.2013100101-6","first-page":"263","author":"S.Chaudhuri","year":"1999","journal-title":"On Random Sampling over Joins"},{"key":"ijkbo.2013100101-7","first-page":"146","author":"S.Chaudhuri","year":"1997","journal-title":"An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server"},{"key":"ijkbo.2013100101-8","first-page":"367","author":"S.Chaudhuri","year":"1998","journal-title":"AutoAdmin \u201cwhat-if\u201d Index Analysis Utility"},{"key":"ijkbo.2013100101-9","doi-asserted-by":"publisher","DOI":"10.1109\/69.908978"},{"key":"ijkbo.2013100101-10","doi-asserted-by":"publisher","DOI":"10.1145\/42201.42205"},{"key":"ijkbo.2013100101-11","first-page":"145","author":"K. E.Gebaly","year":"2008","journal-title":"Robustness in Automatic Physical Database Design"},{"key":"ijkbo.2013100101-12","first-page":"6","author":"R.Gemulla","year":"2008","journal-title":"Linked Bernoulli Synopses: Sampling Along Foreign-Keys"},{"issue":"2","key":"ijkbo.2013100101-13","first-page":"105","article-title":"HYRISE - A Main Memory Hybrid Storage Engine}.","volume":"4","author":"M.Grund","year":"2010","journal-title":"PVLDB"},{"key":"ijkbo.2013100101-14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.16"},{"key":"ijkbo.2013100101-15","first-page":"287","author":"P. J.Haas","year":"1999","journal-title":"Ripple Joins for Online Aggregation"},{"key":"ijkbo.2013100101-16","first-page":"171","author":"J. M.Hellerstein","year":"1997","journal-title":"Online Aggregation"},{"key":"ijkbo.2013100101-17","first-page":"174","author":"Y. E.Ioannidis","year":"1999","journal-title":"Histogram-Based Approximation of Set-Valued Query-Answers"},{"key":"ijkbo.2013100101-18","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247560"},{"key":"ijkbo.2013100101-19","first-page":"563","author":"C.Jermaine","year":"2005","journal-title":"A Disk-Based Join with Probabilistic Guarantees"},{"key":"ijkbo.2013100101-20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45876-X_39"},{"key":"ijkbo.2013100101-21","first-page":"448","author":"Y.Matias","year":"1998","journal-title":"Wavelet-Based Histograms for Selectivity Estimation"},{"key":"ijkbo.2013100101-22","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233342"},{"key":"ijkbo.2013100101-23","first-page":"1400","author":"P.R\u00f6sch","year":"2008","journal-title":"Designing Random Sample Synopses with Outliers"},{"key":"ijkbo.2013100101-24","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516408"},{"key":"ijkbo.2013100101-25","doi-asserted-by":"crossref","unstructured":"R\u00f6sch, P., & Lehner, W. (2010). A Sample Advisor for Approximate Query Processing. East European Conf. on Advances in Databases and Information Systems, (pp. 490-504).","DOI":"10.1007\/978-3-642-15576-5_37"},{"key":"ijkbo.2013100101-26","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"},{"key":"ijkbo.2013100101-27","article-title":"Scaling the Data Warehouse.","author":"R.Winter","year":"2008","journal-title":"Intelligent Enterprise"},{"key":"ijkbo.2013100101-28","first-page":"180","author":"D. C.Zilio","year":"2004","journal-title":"Recommending Materialized Views and Indexes with IBM DB2 Design Advisor"}],"container-title":["International Journal of Knowledge-Based Organizations"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=101191","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T10:51:54Z","timestamp":1654080714000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijkbo.2013100101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2013,10,1]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,10]]}},"URL":"https:\/\/doi.org\/10.4018\/ijkbo.2013100101","relation":{},"ISSN":["2155-6393","2155-6407"],"issn-type":[{"value":"2155-6393","type":"print"},{"value":"2155-6407","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,1]]}}}