{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T15:09:28Z","timestamp":1744384168049},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T00:00:00Z","timestamp":1691020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T00:00:00Z","timestamp":1691020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s11280-023-01199-3","type":"journal-article","created":{"date-parts":[[2023,8,3]],"date-time":"2023-08-03T02:02:06Z","timestamp":1691028126000},"page":"3503-3533","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["SAT: sampling acceleration tree for adaptive database repartition"],"prefix":"10.1007","volume":"26","author":[{"given":"Xiaoxiao","family":"Xie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengfei","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongzhi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,3]]},"reference":[{"key":"1199_CR1","doi-asserted-by":"crossref","unstructured":"Rao, J., Zhang, C., Megiddo, N., Lohman, G.: Automating physical database design in a parallel database. Proceedings of the 2002 ACM SIGMOD international conference on Management of data, 558\u2013569 (2002)","DOI":"10.1145\/564691.564757"},{"key":"1199_CR2","doi-asserted-by":"crossref","unstructured":"Zhou, J., Bruno, N., Lin, W.: Advanced partitioning techniques for massively distributed computation. Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, 13\u201324 (2012)","DOI":"10.1145\/2213836.2213839"},{"key":"1199_CR3","doi-asserted-by":"crossref","unstructured":"Curino, C., Jones, E.P.C., Zhang, Y., Madden, S.R.: Schism: a workload-driven approach to database replication and partitioning (2010)","DOI":"10.14778\/1920841.1920853"},{"key":"1199_CR4","unstructured":"Alagiannis, I., Idreos, S., Ailamaki, A.: H2O: a Hands-free Adaptive Store"},{"issue":"2","key":"1199_CR5","doi-asserted-by":"publisher","first-page":"105","DOI":"10.14778\/1921071.1921077","volume":"4","author":"M Grund","year":"2010","unstructured":"Grund, M., Kr\u00fcger, J., Plattner, H., Zeier, A., Cudre-Mauroux, P., Madden, S.: Hyrise: a main memory hybrid storage engine. Proc. VLDB Endow. 4(2), 105\u2013116 (2010)","journal-title":"Proc. VLDB Endow."},{"key":"1199_CR6","doi-asserted-by":"crossref","unstructured":"Lamb, A., Fuller, M., Varadarajan, R., Tran, N., Vandier, B., Doshi, L., Bear, C.: The vertica analytic database: C-store 7 years later. arXiv preprint arXiv:1208.4173 (2012)","DOI":"10.14778\/2367502.2367518"},{"key":"1199_CR7","doi-asserted-by":"crossref","unstructured":"Arulraj, J., Pavlo, A., Menon, P.: Bridging the archipelago between row-stores and column-stores for hybrid workloads. Proceedings of the 2016 International Conference on Management of Data, 583\u2013598 (2016)","DOI":"10.1145\/2882903.2915231"},{"key":"1199_CR8","doi-asserted-by":"crossref","unstructured":"Kang, D., Jiang, R., Blanas, S.: Jigsaw: A data storage and query processing engine for irregular table partitioning. Proceedings of the 2021 International Conference on Management of Data, 898\u2013911 (2021)","DOI":"10.1145\/3448016.3457547"},{"key":"1199_CR9","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. Proceedings of the 1984 ACM SIGMOD international conference on Management of data, 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"issue":"9","key":"1199_CR10","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"issue":"13","key":"1199_CR11","doi-asserted-by":"publisher","first-page":"2062","DOI":"10.14778\/2831360.2831361","volume":"8","author":"AM Aly","year":"2015","unstructured":"Aly, A.M., Mahmood, A.R., Hassan, M.S., Aref, W.G., Ouzzani, M., Elmeleegy, H., Qadah, T.: Aqwa: adaptive query workload aware partitioning of big spatial data. Proc. VLDB Endow. 8(13), 2062\u20132073 (2015)","journal-title":"Proc. VLDB Endow."},{"key":"1199_CR12","doi-asserted-by":"crossref","unstructured":"Sun, L., Franklin, M.J., Krishnan, S., Xin, R.S.: Fine-grained partitioning for aggressive data skipping. Proceedings of the 2014 ACM SIGMOD international conference on Management of data, 1115\u20131126 (2014)","DOI":"10.1145\/2588555.2610515"},{"issue":"4","key":"1199_CR13","doi-asserted-by":"publisher","first-page":"421","DOI":"10.14778\/3025111.3025123","volume":"10","author":"L Sun","year":"2016","unstructured":"Sun, L., Franklin, M.J., Wang, J., Wu, E.: Skipping-oriented partitioning for columnar layouts. Proc. VLDB Endow. 10(4), 421\u2013432 (2016)","journal-title":"Proc. VLDB Endow."},{"key":"1199_CR14","doi-asserted-by":"crossref","unstructured":"Hilprecht, B., Binnig, C., R\u00f6hm, U.: Learning a partitioning advisor for cloud databases. Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, 143\u2013157 (2020)","DOI":"10.1145\/3318464.3389704"},{"key":"1199_CR15","doi-asserted-by":"crossref","unstructured":"Yang, Z., Chandramouli, B., Wang, C., Gehrke, J., Li, Y., Minhas, U.F., Larson, P.\u00c5., Kossmann, D., Acharya, R.: Qd-tree: Learning data layouts for big data analytics. Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, 193\u2013208 (2020)","DOI":"10.1145\/3318464.3389770"},{"issue":"3","key":"1199_CR16","first-page":"7","volume":"29","author":"S Agrawal","year":"2006","unstructured":"Agrawal, S., Bruno, N., Chaudhuri, S., Narasayya, V.R.: Autoadmin: Self-tuning database systemstechnology. IEEE Data Eng. Bull. 29(3), 7\u201315 (2006)","journal-title":"IEEE Data Eng. Bull."},{"key":"1199_CR17","doi-asserted-by":"crossref","unstructured":"Rao, J., Zhang, C., Megiddo, N., Lohman, G.: Automating physical database design in a parallel database. Proceedings of the 2002 ACM SIGMOD international conference on Management of data, 558\u2013569 (2002)","DOI":"10.1145\/564691.564757"},{"issue":"10","key":"1199_CR18","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.14778\/3115404.3115415","volume":"10","author":"M Olma","year":"2017","unstructured":"Olma, M., Karpathiotakis, M., Alagiannis, I., Athanassoulis, M., Ailamaki, A.: Slalom: Coasting through raw data via adaptive partitioning and indexing. Proc. VLDB Endow. 10(10), 1106\u20131117 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"1199_CR19","doi-asserted-by":"crossref","unstructured":"Liroz-Gistau, M., Akbarinia, R., Pacitti, E., Porto, F., Valduriez, P.: Dynamic workload-based partitioning algorithms for continuously growing databases. Transactions on Large-Scale Data-and Knowledge-Centered Systems XII, 105\u2013128 (2013)","DOI":"10.1007\/978-3-642-45315-1_5"},{"key":"1199_CR20","doi-asserted-by":"crossref","unstructured":"Shanbhag, A., Jindal, A., Madden, S., Quiane, J., Elmore, A.J.: A robust partitioning scheme for ad-hoc query workloads. Proceedings of the 2017 Symposium on Cloud Computing, 229\u2013241 (2017)","DOI":"10.1145\/3127479.3131613"},{"key":"1199_CR21","doi-asserted-by":"crossref","unstructured":"Lu, Y.: Adaptdb: adaptive partitioning for distributed joins. PhD thesis, Massachusetts Institute of Technology (2017)","DOI":"10.14778\/3055540.3055551"},{"key":"1199_CR22","unstructured":"Nguyen, Q.T.: Robust data partitioning for ad-hoc query processing. PhD thesis, Massachusetts Institute of Technology (2015)"},{"key":"1199_CR23","doi-asserted-by":"crossref","unstructured":"Ding, J., Minhas, U.F., Chandramouli, B., Wang, C., Li, Y., Li, Y., Kossmann, D., Gehrke, J., Kraska, T.: Instance-optimized data layouts for cloud analytics workloads. Proceedings of the 2021 International Conference on Management of Data, 418\u2013431 (2021)","DOI":"10.1145\/3448016.3457270"},{"key":"1199_CR24","doi-asserted-by":"crossref","unstructured":"Ding, J., Nathan, V., Alizadeh, M., Kraska, T.: Tsunami: A learned multi-dimensional index for correlated data and skewed workloads. arXiv preprint arXiv:2006.13282 (2020)","DOI":"10.14778\/3425879.3425880"},{"key":"1199_CR25","doi-asserted-by":"crossref","unstructured":"Li, P., Lu, H., Zheng, Q., Yang, L., Pan, G.: Lisa: A learned index structure for spatial data. Proceedings of the 2020 ACM SIGMOD international conference on management of data, 2119\u20132133 (2020)","DOI":"10.1145\/3318464.3389703"},{"key":"1199_CR26","doi-asserted-by":"crossref","unstructured":"Nathan, V., Ding, J., Alizadeh, M., Kraska, T.: Learning multi-dimensional indexes. Proceedings of the 2020 ACM SIGMOD international conference on management of data, 985\u20131000 (2020)","DOI":"10.1145\/3318464.3380579"},{"issue":"3","key":"1199_CR27","doi-asserted-by":"publisher","first-page":"252","DOI":"10.14778\/3368289.3368292","volume":"13","author":"S Kandula","year":"2019","unstructured":"Kandula, S., Orr, L., Chaudhuri, S.: Pushing data-induced predicates through joins in big-data clusters. Proc. VLDB Endow. 13(3), 252\u2013265 (2019)","journal-title":"Proc. VLDB Endow."},{"issue":"6","key":"1199_CR28","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1007\/s00778-021-00693-2","volume":"31","author":"S Kandula","year":"2022","unstructured":"Kandula, S., Orr, L., Chaudhuri, S.: Data-induced predicates for sideways information passing in query optimizers. VLDB J. 31(6), 1263\u20131290 (2022)","journal-title":"VLDB J."},{"key":"1199_CR29","unstructured":"TPC: TPC-H. http:\/\/www.tpc.org\/tpch\/ (2020)"},{"key":"1199_CR30","unstructured":"Graefe, G.: Volcano, an extensible and parallel query evaluation system; cu-cs-481-90 (1990)"},{"key":"1199_CR31","unstructured":"Nes, S.I.F.G.N., Kersten, S.M.S.M.M.: Monetdb: Two decades of research in column-oriented database architectures. Data Eng. 40 (2012)"},{"key":"1199_CR32","doi-asserted-by":"crossref","unstructured":"Li, Z., Yiu, M.L., Chan, T.N.: Paw: Data partitioning meets workload variance. 2022 IEEE 38th International Conference on Data Engineering (ICDE), 123\u2013135 (2022). IEEE","DOI":"10.1109\/ICDE53745.2022.00014"},{"key":"1199_CR33","doi-asserted-by":"crossref","unstructured":"Eldawy, A., Mokbel, M.F.: Spatialhadoop: A mapreduce framework for spatial data. 2015 IEEE 31st international conference on Data Engineering, 1352\u20131363 (2015). IEEE","DOI":"10.1109\/ICDE.2015.7113382"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-023-01199-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-023-01199-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-023-01199-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T00:27:30Z","timestamp":1696984050000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-023-01199-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,3]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1199"],"URL":"https:\/\/doi.org\/10.1007\/s11280-023-01199-3","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"type":"print","value":"1386-145X"},{"type":"electronic","value":"1573-1413"}],"subject":[],"published":{"date-parts":[[2023,8,3]]},"assertion":[{"value":"10 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Ethical Approval is not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"There is no conflict of interest among the authors or any others.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"The TPC-H is a decision support benchmark. It consists of a suite of business oriented ad-hoc queries and concurrent data modifications. The queries and the data populating the database have been chosen to have broad industry-wide relevance. This benchmark illustrates decision support systems that examine large volumes of data, execute queries with a high degree of complexity, and give answers to critical business questions. The performance metric reported by TPC-H is called the TPC-H Composite Query-per-Hour Performance Metric (QphH@Size), and reflects multiple aspects of the capability of the system to process queries. These aspects include the selected database size against which the queries are executed, the query processing power when queries are submitted by a single stream, and the query throughput when queries are submitted by multiple concurrent users. We can get it on website .","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Availability of data and materials"}}]}}