{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T08:02:40Z","timestamp":1774252960556,"version":"3.50.1"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,28]],"date-time":"2025-12-28T00:00:00Z","timestamp":1766880000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T00:00:00Z","timestamp":1766966400000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100012246","name":"Priority Academic Program Development of Jiangsu Higher Education Institutions","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012246","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Huawei","award":["\"Smart Base\" Industry-Education Integration Collaborative Education Program"],"award-info":[{"award-number":["\"Smart Base\" Industry-Education Integration Collaborative Education Program"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s41019-025-00325-7","type":"journal-article","created":{"date-parts":[[2025,12,28]],"date-time":"2025-12-28T13:44:37Z","timestamp":1766929477000},"page":"143-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SieveJoin: Boosting Multi-way Joins by Filtering Unneeded Intermediate Results"],"prefix":"10.1007","volume":"11","author":[{"given":"Renrui","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2418-090X","authenticated-orcid":false,"given":"Qingzhi","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Xiaomeng","family":"Shi","sequence":"additional","affiliation":[]},{"given":"An","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,28]]},"reference":[{"key":"325_CR1","first-page":"40","volume":"35","author":"SIFGN Nes","year":"2012","unstructured":"Nes SIFGN, Kersten SMSMM (2012) Monetdb: two decades of research in column-oriented database architectures. Data Eng 35:40","journal-title":"Data Eng"},{"issue":"2","key":"325_CR2","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1145\/16856.16888","volume":"15","author":"M Stonebraker","year":"1986","unstructured":"Stonebraker M, Rowe LA (1986) The design of postgres. ACM SIGMOD Rec 15(2):340\u2013355","journal-title":"ACM SIGMOD Rec"},{"issue":"2","key":"325_CR3","first-page":"6","volume":"36","author":"T Lahiri","year":"2013","unstructured":"Lahiri T, Neimat M-A, Folkman S (2013) Oracle timesten: an in-memory database for enterprise applications. IEEE Data Eng Bull 36(2):6\u201313","journal-title":"IEEE Data Eng Bull"},{"key":"325_CR4","doi-asserted-by":"crossref","unstructured":"Idris M, Ugarte M, Vansummeren S (2017) The dynamic yannakakis algorithm: compact and efficient query processing under updates. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp 1259\u20131274","DOI":"10.1145\/3035918.3064027"},{"key":"325_CR5","unstructured":"Yannakakis M (1981) Algorithms for acyclic database schemes. In: VLDB, vol. 81, pp 82\u201394"},{"key":"325_CR6","doi-asserted-by":"crossref","unstructured":"Goodman N, Shmueli O, Tay YC (1983) Gyo reductions, canonical connections, tree and cyclic schemas and tree projections. In: Proceedings of the 2nd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pp 267\u2013278","DOI":"10.1145\/588058.588089"},{"issue":"3","key":"325_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3180143","volume":"65","author":"HQ Ngo","year":"2018","unstructured":"Ngo HQ, Porat E, R\u00e9 C, Rudra A (2018) Worst-case optimal join algorithms. J of the ACM (JACM) 65(3):1\u201340","journal-title":"J of the ACM (JACM)"},{"issue":"4","key":"325_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/2590989.2590991","volume":"42","author":"HQ Ngo","year":"2014","unstructured":"Ngo HQ, R\u00e9 C, Rudra A (2014) Skew strikes back: new developments in the theory of join algorithms. ACM SIGMOD Rec 42(4):5\u201316","journal-title":"ACM SIGMOD Rec"},{"key":"325_CR9","unstructured":"Graefe G, Bunker R, Cooper S (1998) Hash joins and hash teams in microsoft sql server. In: VLDB, vol. 98, pp 86\u201397"},{"key":"325_CR10","unstructured":"Veldhuizen TL (2014) Leapfrog triejoin: a simple, worst-case optimal join algorithm. In: Proc. International Conference on Database Theory"},{"issue":"12","key":"325_CR11","doi-asserted-by":"publisher","first-page":"1891","DOI":"10.14778\/3407790.3407797","volume":"13","author":"M Freitag","year":"2020","unstructured":"Freitag M, Bandle M, Schmidt T, Kemper A, Neumann T (2020) Adopting worst-case optimal joins in relational database systems. Proc VLDB Endow 13(12):1891\u20131904","journal-title":"Proc VLDB Endow"},{"key":"325_CR12","unstructured":"Shanghooshabad AM, Triantafillou P (2022) Graphical join: a new physical join algorithm for rdbmss. arXiv preprint arXiv:2206.10435"},{"key":"325_CR13","doi-asserted-by":"crossref","unstructured":"Avnur R, Hellerstein JM (2000) Eddies: continuously adaptive query processing. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pp 261\u2013272","DOI":"10.1145\/342009.335420"},{"issue":"4","key":"325_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3129246","volume":"42","author":"CR Aberger","year":"2017","unstructured":"Aberger CR, Lamb A, Tu S, N\u00f6tzli A, Olukotun K, R\u00e9 C (2017) Emptyheaded: a relational engine for graph processing. ACM Trans Datab Syst (TODS) 42(4):1\u201344","journal-title":"ACM Trans Datab Syst (TODS)"},{"key":"325_CR15","doi-asserted-by":"crossref","unstructured":"Aberger C, Lamb A, Olukotun K, R\u00e9 C (2018) Levelheaded: a unified engine for business intelligence and linear algebra querying. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp 449\u2013460. IEEE","DOI":"10.1109\/ICDE.2018.00048"},{"key":"325_CR16","unstructured":"Kemper A, Kossmann D, Wiesner C (1999) Generalised hash teams for join and group-by. In: VLDB, vol 99, pp 30\u201341. Citeseer"},{"key":"325_CR17","doi-asserted-by":"crossref","unstructured":"Zukowski M, Wiel M, Boncz P (2012) Vectorwise: a vectorized analytical dbms. In: 2012 IEEE 28th International Conference on Data Engineering, pp 1349\u20131350. IEEE","DOI":"10.1109\/ICDE.2012.148"},{"key":"325_CR18","doi-asserted-by":"crossref","unstructured":"Chu S, Balazinska M, Suciu D (2015) From theory to practice: efficient join query evaluation in a parallel database system. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp 63\u201378","DOI":"10.1145\/2723372.2750545"},{"key":"325_CR19","unstructured":"Wu H, Zinn D, Aref M, Yalamanchili S (2014) Multipredicate join algorithms for accelerating relational graph processing on gpus. In: International Workshop on Accelerating Data Management Systems Using Modern Processor and Storage Architectures, vol. 10"},{"issue":"8","key":"325_CR20","doi-asserted-by":"publisher","first-page":"482","DOI":"10.14778\/2002974.2002976","volume":"4","author":"L Zou","year":"2011","unstructured":"Zou L, Mo J, Chen L, \u00d6zsu MT, Zhao D (2011) Gstore: answering sparql queries via subgraph matching. Proc VLDB Endow 4(8):482\u2013493","journal-title":"Proc VLDB Endow"},{"issue":"7","key":"325_CR21","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom BH (1970) Space\/time trade-offs in hash coding with allowable errors. Commun ACM 13(7):422\u2013426","journal-title":"Commun ACM"},{"key":"325_CR22","doi-asserted-by":"crossref","unstructured":"Kirsch A, Mitzenmacher M (2006) Less hashing, same performance: Building a better bloom filter. In: Algorithms\u2013ESA 2006: 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006. Proceedings 14, pp 456\u2013467. Springer","DOI":"10.1007\/11841036_42"},{"issue":"2","key":"325_CR23","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1109\/COMST.2018.2889329","volume":"21","author":"L Luo","year":"2018","unstructured":"Luo L, Guo D, Ma RT, Rottenstreich O, Luo X (2018) Optimizing bloom filter: challenges, solutions, and comparisons. IEEE Commun Surv Tutor 21(2):1912\u20131949","journal-title":"IEEE Commun Surv Tutor"},{"issue":"1","key":"325_CR24","first-page":"1","volume":"1","author":"Y Li","year":"2023","unstructured":"Li Y, Wang F, Yu X, Yang Y, Yang K, Yang T, Ma Z, Cui B, Uhlig S (2023) Ladderfilter: filtering infrequent items with small memory and time overhead. Proc ACM on Manag Data 1(1):1\u201321","journal-title":"Proc ACM on Manag Data"},{"key":"325_CR25","unstructured":"Bratbergsengen K (1984) Hashing methods and relational algebra operations. In: Proceedings of the 10th International Conference on Very Large Data Bases, pp 323\u2013333"},{"key":"325_CR26","doi-asserted-by":"crossref","unstructured":"Mackert LF, Lohman GM (1986) R* optimizer validation and performance evaluation for local queries. In: Proceedings of the 1986 ACM SIGMOD International Conference on Management of Data, pp 84\u201395","DOI":"10.1145\/16894.16863"},{"key":"325_CR27","doi-asserted-by":"crossref","unstructured":"Cohen S, Matias Y (2003) Spectral bloom filters. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp 241\u2013252","DOI":"10.1145\/872757.872787"},{"key":"325_CR28","doi-asserted-by":"crossref","unstructured":"Michael L, Nejdl W, Papapetrou O, Siberski W (2007) Improving distributed join efficiency with extended bloom filter operations. In: 21st International Conference on Advanced Information Networking and Applications (AINA\u201907), pp 187\u2013194. IEEE","DOI":"10.1109\/AINA.2007.80"},{"key":"325_CR29","unstructured":"Koutris P (2011) Bloom filters in distributed query execution. University of Washington, CSE 544"},{"key":"325_CR30","doi-asserted-by":"crossref","unstructured":"Lee T, Kim K, Kim H-J (2012) Join processing using bloom filter in mapreduce. In: Proceedings of the 2012 ACM Research in Applied Computation Symposium, pp 100\u2013105","DOI":"10.1145\/2401603.2401626"},{"key":"325_CR31","doi-asserted-by":"crossref","unstructured":"Ramesh S, Papapetrou O, Siberski W (2009) Optimizing distributed joins with bloom filters. In: Distributed Computing and Internet Technology: 5th International Conference, ICDCIT 2008 New Delhi, India, December 10-12, 2008. Proceedings 5, pp 145\u2013156. Springer","DOI":"10.1007\/978-3-540-89737-8_15"},{"issue":"6","key":"325_CR32","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","volume":"31","author":"TS Caetano","year":"2009","unstructured":"Caetano TS, McAuley JJ, Cheng L, Le QV, Smola AJ (2009) Learning graph matching. IEEE Trans Pattern Anal Mach Intell 31(6):1048\u20131058","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"325_CR33","doi-asserted-by":"crossref","unstructured":"Bunke H (2000) Recent developments in graph matching. In: Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, vol 2, pp 117\u2013124. IEEE","DOI":"10.1109\/ICPR.2000.906030"},{"key":"325_CR34","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10044-012-0284-8","volume":"16","author":"L Livi","year":"2013","unstructured":"Livi L, Rizzi A (2013) The graph matching problem. Pattern Anal Appl 16:253\u2013283","journal-title":"Pattern Anal Appl"},{"key":"325_CR35","volume-title":"The maximum clique problem handbook of combinatorial optimization","author":"IM Bomze","year":"1999","unstructured":"Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem handbook of combinatorial optimization. Kluwer Academic Publishers, Boston"},{"key":"325_CR36","volume-title":"Handbook of Graph Theory (Discrete Mathematics and Its Applications)","author":"JL Gross","year":"2003","unstructured":"Gross JL, Yellen J (2003) Handbook of Graph Theory (Discrete Mathematics and Its Applications). CRC Press"},{"key":"325_CR37","doi-asserted-by":"crossref","unstructured":"Chandra AK, Merlin PM (1977) Optimal implementation of conjunctive queries in relational data bases. In: Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, pp 77\u201390","DOI":"10.1145\/800105.803397"},{"issue":"2","key":"325_CR38","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(99)00220-0","volume":"239","author":"C Chekuri","year":"2000","unstructured":"Chekuri C, Rajaraman A (2000) Conjunctive query containment revisited. Theoret Comput Sci 239(2):211\u2013229","journal-title":"Theoret Comput Sci"},{"key":"325_CR39","doi-asserted-by":"crossref","unstructured":"Chaudhuri S, Vardi MY (1993) Optimization of real conjunctive queries. In: Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp 59\u201370","DOI":"10.1145\/153850.153856"},{"key":"325_CR40","doi-asserted-by":"crossref","unstructured":"Nguyen D, Aref M, Bravenboer M, Kollias G, Ngo HQ, R\u00e9 C, Rudra A (2015) Join processing for graph patterns: An old dog with new tricks. In: Proceedings of the GRADES\u201915, pp 1\u20138","DOI":"10.1145\/2764947.2764948"},{"issue":"3","key":"325_CR41","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/320473.320484","volume":"1","author":"DG Severance","year":"1976","unstructured":"Severance DG, Lohman GM (1976) Differential files: their application to the maintenance of large databases. ACM Trans Database Syst (TODS) 1(3):256\u2013267","journal-title":"ACM Trans Database Syst (TODS)"},{"issue":"2","key":"325_CR42","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1145\/235968.233338","volume":"25","author":"JM Patel","year":"1996","unstructured":"Patel JM, DeWitt DJ (1996) Partition based spatial-merge join. ACM SIGMOD Rec 25(2):259\u2013270","journal-title":"ACM SIGMOD Rec"},{"key":"325_CR43","doi-asserted-by":"crossref","unstructured":"DeWitt DJ, Naughton JF, Burger J (1993) Nested loops revisited. In: [1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems, pp 230\u2013242. IEEE","DOI":"10.1109\/PDIS.1993.253088"},{"key":"325_CR44","doi-asserted-by":"crossref","unstructured":"Lo M-L, Ravishankar CV (1996) Spatial hash-joins. In: Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, pp 247\u2013258","DOI":"10.1145\/233269.233337"},{"key":"325_CR45","doi-asserted-by":"crossref","unstructured":"Blanas S, Li Y, Patel JM (2011) Design and evaluation of main memory hash join algorithms for multi-core cpus. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, pp 37\u201348","DOI":"10.1145\/1989323.1989328"},{"issue":"4","key":"325_CR46","doi-asserted-by":"publisher","first-page":"353","DOI":"10.14778\/2735496.2735499","volume":"8","author":"R Barber","year":"2014","unstructured":"Barber R, Lohman G, Pandis I, Raman V, Sidle R, Attaluri G, Chainani N, Lightstone S, Sharpe D (2014) Memory-efficient hash joins. Proc VLDB Endow 8(4):353\u2013364","journal-title":"Proc VLDB Endow"},{"key":"325_CR47","unstructured":"Boncz PA, Zukowski M, Nes N (2005) Monetdb\/x100: hyper-pipelining query execution. In: Cidr, vol 5, pp 225\u2013237"},{"key":"325_CR48","doi-asserted-by":"crossref","unstructured":"Zhao Z, Christensen R, Li F, Hu X, Yi K (2018) Random sampling over joins revisited. In: Proceedings of the 2018 International Conference on Management of Data, pp 1525\u20131539","DOI":"10.1145\/3183713.3183739"},{"key":"325_CR49","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp 177\u2013187","DOI":"10.1145\/1081870.1081893"},{"issue":"2","key":"325_CR50","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/980972.980992","volume":"5","author":"J Gehrke","year":"2003","unstructured":"Gehrke J, Ginsparg P, Kleinberg J (2003) Overview of the 2003 kdd cup. ACM SIGKDD Explor Newsl 5(2):149\u2013151","journal-title":"ACM SIGKDD Explor Newsl"},{"issue":"4","key":"325_CR51","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1561\/1900000028","volume":"3","author":"G Graefe","year":"2011","unstructured":"Graefe G et al (2011) Modern b-tree techniques. Found Trends\u00ae Datab 3(4):203\u2013402","journal-title":"Found Trends\u00ae Datab"},{"key":"325_CR52","doi-asserted-by":"crossref","unstructured":"Chan C-Y, Ioannidis YE (1998) Bitmap index design and evaluation. In: Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pp 355\u2013366","DOI":"10.1145\/276304.276336"},{"issue":"4","key":"325_CR53","doi-asserted-by":"publisher","first-page":"401","DOI":"10.14778\/2735496.2735503","volume":"8","author":"B Chandramouli","year":"2014","unstructured":"Chandramouli B, Goldstein J, Barnett M, DeLine R, Fisher D, Platt JC, Terwilliger JF, Wernsing J (2014) Trill: a high-performance incremental query processor for diverse analytics. Proc VLDB Endow 8(4):401\u2013412","journal-title":"Proc VLDB Endow"},{"key":"325_CR54","doi-asserted-by":"crossref","unstructured":"Bykov S, Geller A, Kliot G, Larus JR, Pandya R, Thelin J (2011) Orleans: cloud computing for everyone. In: Proceedings of the 2nd ACM Symposium on Cloud Computing, pp 1\u201314","DOI":"10.1145\/2038916.2038932"},{"key":"325_CR55","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00778-019-00581-w","volume":"29","author":"J Fang","year":"2020","unstructured":"Fang J, Mulder YT, Hidders J, Lee J, Hofstee HP (2020) In-memory database acceleration on fpgas: a survey. VLDB J 29:33\u201359","journal-title":"VLDB J"},{"key":"325_CR56","doi-asserted-by":"crossref","unstructured":"Ngo HQ, Nguyen DT, Re C, Rudra A (2014) Beyond worst-case analysis for joins with minesweeper. In: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp 234\u2013245","DOI":"10.1145\/2594538.2594547"},{"key":"325_CR57","doi-asserted-by":"crossref","unstructured":"Aref M, Cate B, Green TJ, Kimelfeld B, Olteanu D, Pasalic E, Veldhuizen TL, Washburn G (2015) Design and implementation of the logicblox system. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp 1371\u20131382","DOI":"10.1145\/2723372.2742796"},{"issue":"9","key":"325_CR58","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1109\/TKDE.2011.47","volume":"23","author":"FN Afrati","year":"2011","unstructured":"Afrati FN, Ullman JD (2011) Optimizing multiway joins in a map-reduce environment. IEEE Trans Knowl Data Eng 23(9):1282\u20131298","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6","key":"325_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.14778\/3184470.3184473","volume":"11","author":"K Ammar","year":"2018","unstructured":"Ammar K, McSherry F, Salihoglu S, Joglekar M (2018) Distributed evaluation of subgraph queries using worst-case optimal low-memory dataflows. Proc VLDB Endowm 11(6):1","journal-title":"Proc VLDB Endowm"},{"key":"325_CR60","doi-asserted-by":"crossref","unstructured":"Hogan A, Riveros C, Rojas C, Soto A (2019) A worst-case optimal join algorithm for sparql. In: The Semantic Web\u2013ISWC 2019: 18th International Semantic Web Conference, Auckland, New Zealand, October 26\u201330, 2019, Proceedings, Part I 18. Springer, pp 258\u2013275","DOI":"10.1007\/978-3-030-30793-6_15"},{"key":"325_CR61","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342643","author":"A Mhedhbi","year":"2019","unstructured":"Mhedhbi A, Salihoglu S (2019) Optimizing subgraph queries by combining binary and worst-case optimal joins. Proc VLDB Endow. https:\/\/doi.org\/10.14778\/3342263.3342643","journal-title":"Proc VLDB Endow"},{"key":"325_CR62","doi-asserted-by":"crossref","unstructured":"Le-Phuoc D (2018) Adaptive optimisation for continuous multi-way joins over rdf streams. In: Companion Proceedings of the The Web Conference 2018, pp 1857\u20131865","DOI":"10.1145\/3184558.3191653"},{"key":"325_CR63","doi-asserted-by":"crossref","unstructured":"Viglas SD, Naughton JF, Burger J (2003) Maximizing the output rate of multi-way join queries over streaming information sources. In: Proceedings 2003 VLDB Conference. Elsevier, pp 285\u2013296","DOI":"10.1016\/B978-012722442-8\/50033-1"},{"issue":"8","key":"325_CR64","doi-asserted-by":"publisher","first-page":"889","DOI":"10.14778\/3090163.3090167","volume":"10","author":"J Zhu","year":"2017","unstructured":"Zhu J, Potti N, Saurabh S, Patel JM (2017) Looking ahead makes query plans robust: making the initial case with in-memory star schema data warehouse workloads. Proc VLDB Endow 10(8):889\u2013900","journal-title":"Proc VLDB Endow"},{"key":"325_CR65","doi-asserted-by":"crossref","unstructured":"Ding B, Chaudhuri S, Narasayya V (2020) Bitvector-aware query optimization for decision support queries. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp 2011\u20132026","DOI":"10.1145\/3318464.3389769"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-025-00325-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-025-00325-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-025-00325-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T07:18:45Z","timestamp":1774250325000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-025-00325-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,28]]},"references-count":65,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["325"],"URL":"https:\/\/doi.org\/10.1007\/s41019-025-00325-7","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,28]]},"assertion":[{"value":"2 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Peter Triantafillou, University of Warwick 1\u00a0cmQing Li, Hong Kong Polytechnic University.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}