{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T05:25:22Z","timestamp":1736227522270,"version":"3.32.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T00:00:00Z","timestamp":1374451200000},"content-version":"vor","delay-in-days":2759,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of King Saud University - Computer and Information Sciences"],"published-print":{"date-parts":[[2006]]},"DOI":"10.1016\/s1319-1578(06)80003-0","type":"journal-article","created":{"date-parts":[[2013,3,27]],"date-time":"2013-03-27T02:27:55Z","timestamp":1364351275000},"page":"53-75","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Efficient Computing of Iceberg Queries Using Quantiling"],"prefix":"10.1007","volume":"18","author":[{"given":"Khaled","family":"AlSabti","sequence":"first","affiliation":[]}],"member":"297","reference":[{"article-title":"The Third International Knowledge Discovery and Data Mining Tools Competition","year":"1999","series-title":"Fifth ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","key":"10.1016\/S1319-1578(06)80003-0_bib1"},{"key":"10.1016\/S1319-1578(06)80003-0_bib2","series-title":"Proceedings of the ACM SIGMOD Int'l Conference on Management of Data","first-page":"207","article-title":"Mining Associations Between Sets of Items in Massive Databases","author":"Agrawal","year":"1993"},{"key":"10.1016\/S1319-1578(06)80003-0_bib3","series-title":"Proceedings of the 20th Int'l Conference on Very Large Databases (VLDB '94)","article-title":"Fast Algorithms for Mining Association Rules","author":"Agrawal","year":"1994"},{"key":"10.1016\/S1319-1578(06)80003-0_bib4","series-title":"Proceedings of the 7th Int'l Conference Management of Data (COMAD-95)","article-title":"A One-Pass Space-Efficient Algorithm for Finding Quantiles","author":"Agrawal","year":"1995"},{"key":"10.1016\/S1319-1578(06)80003-0_bib5","series-title":"Proceedings of the Int'l Conference on Very Large Databases (VLDB '97)","first-page":"346","article-title":"A One-Pass Algorithm for Accurately Estimating Quantiles for Disk-Resident Data","author":"AISabti","year":"1997"},{"year":"1999","series-title":"The UCI KDD Archive [http:\/\/kdd.ics.uci.edu]","author":"Bay","key":"10.1016\/S1319-1578(06)80003-0_bib6"},{"key":"10.1016\/S1319-1578(06)80003-0_bib7","series-title":"In the Proceedings of 1999 ACM SIGMOD Int'l. Conference on Management of Data","first-page":"359","article-title":"Bottom-Up Computation of Sparse and Iceberg CUBEs","author":"Beyer","year":"1999"},{"issue":"4","key":"10.1016\/S1319-1578(06)80003-0_bib8","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","article-title":"Time Bounds for Selection","volume":"7","author":"Blum","year":"1972","journal-title":"Journal of Computers and Systems"},{"key":"10.1016\/S1319-1578(06)80003-0_bib9","series-title":"In Proceedings of the 6th Int'l World Wide Web Conference","article-title":"Syntactic Clustering of the Web","author":"Broder","year":"1997"},{"key":"10.1016\/S1319-1578(06)80003-0_bib10","series-title":"Proceedings of the 25th Int'l Conference on Very Large Databases (VLDB '99)","first-page":"399","article-title":"Evaluating Top-A: Selection Queries","author":"Chaudhuri","year":"1999"},{"key":"10.1016\/S1319-1578(06)80003-0_bib11","series-title":"Proceedings of the 25th Int'l Conference on Very Large Databases (VLDB'99)","first-page":"411","article-title":"Probabilistic Optimization of Top n Queries","author":"Donjerkovic","year":"1999"},{"key":"10.1016\/S1319-1578(06)80003-0_bib12","series-title":"Proceedings of the 24th Int'l Conference on Very Large Databases (VLDB '98)","article-title":"Computing Ice- berg Queries Efficiently","author":"Fang","year":"1998"},{"year":"1996","series-title":"Advances in Knowledge Discovery and Data Mining","key":"10.1016\/S1319-1578(06)80003-0_bib13"},{"issue":"3","key":"10.1016\/S1319-1578(06)80003-0_bib14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/360680.360691","article-title":"Expected Time Bounds for Selection","volume":"18","author":"Floyd","year":"1975","journal-title":"Communications of the ACM"},{"key":"10.1016\/S1319-1578(06)80003-0_bib15","series-title":"Prentice Hill","article-title":"Lexical Analysis and Stoplist in Information Retrieval Data Structures and Algorithms","author":"Fox","year":"1992"},{"key":"10.1016\/S1319-1578(06)80003-0_bib16","series-title":"Technical Report TR-90-24","article-title":"Equidepth Partitioning of a Data Set Based on Finding its Medians","author":"Gurajada","year":"1990"},{"issue":"No. 10","key":"10.1016\/S1319-1578(06)80003-0_bib17","doi-asserted-by":"crossref","first-page":"1076","DOI":"10.1145\/4372.4378","article-title":"The P2 Algorithm for Dynamic Calculation for Quantiles and Histograms Without Storing Observations","volume":"Vol. 28","author":"Jain","year":"1985","journal-title":"CACM"},{"issue":"8","key":"10.1016\/S1319-1578(06)80003-0_bib18","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1093\/comjnl\/41.8.537","article-title":"Classification of Text Documents","volume":"41","author":"Li","year":"1998","journal-title":"The Computer Journal"},{"key":"10.1016\/S1319-1578(06)80003-0_bib19","series-title":"In the Proceedings of 1998 ACM SIGMOD Int'l. Conference on Management of Data","first-page":"426","article-title":"Approximate Medians and other Quantiles in One Pass and with Limited Memory","author":"Manku","year":"1998"},{"key":"10.1016\/S1319-1578(06)80003-0_bib20","series-title":"KDD-94: AAAI Workshop on Knowledge Discovery in Databases, Seattle, Washington","first-page":"181","article-title":"Efficient Algorithms for Discovering Association Rules","author":"Mannila","year":"1994"},{"key":"10.1016\/S1319-1578(06)80003-0_bib21","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","article-title":"Selection and Sorting with Limited Storage","volume":"12","author":"Munro","year":"1980","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1319-1578(06)80003-0_bib22","series-title":"Ph.D. Thesis","article-title":"Random Sampling from Databases","author":"Olken","year":"1993"},{"year":"2000","series-title":"Database Management Systems","author":"Ramakrishnan","key":"10.1016\/S1319-1578(06)80003-0_bib23"},{"year":"1971","series-title":"The SMART Retrieval System- Experiments in Automatic Documents Processing","author":"Salton","key":"10.1016\/S1319-1578(06)80003-0_bib24"},{"year":"1975","series-title":"A Theory of Indexing","author":"Salton","key":"10.1016\/S1319-1578(06)80003-0_bib25"},{"key":"10.1016\/S1319-1578(06)80003-0_bib26","series-title":"In Proceedings of the 2nd Int'l Conference on Knowledge Discovery and Data Mining","article-title":"An Efficient Algorithm for the Incremental Updation on Association Rules in Large Databases","author":"Thomas","year":"1997"},{"year":"1994","series-title":"Introduction to Parallel Computing: Design and Analysis of Algorithms","author":"Grama","key":"10.1016\/S1319-1578(06)80003-0_bib27"},{"year":"1949","series-title":"Human Behavior and the Principle of Least Effort","author":"Zipf","key":"10.1016\/S1319-1578(06)80003-0_bib28"}],"container-title":["Journal of King Saud University - Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1319157806800030?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1319157806800030?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T17:16:29Z","timestamp":1736183789000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1319157806800030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"references-count":28,"alternative-id":["S1319157806800030"],"URL":"https:\/\/doi.org\/10.1016\/s1319-1578(06)80003-0","relation":{},"ISSN":["1319-1578"],"issn-type":[{"type":"print","value":"1319-1578"}],"subject":[],"published":{"date-parts":[[2006]]}}}