{"id":"https://openalex.org/W7138868136","doi":"https://doi.org/10.48550/arxiv.2603.16474","title":"Practical MCTS-based Query Optimization: A Reproducibility Study and new MCTS algorithm for complex queries","display_name":"Practical MCTS-based Query Optimization: A Reproducibility Study and new MCTS algorithm for complex queries","publication_year":2026,"publication_date":"2026-03-17","ids":{"openalex":"https://openalex.org/W7138868136","doi":"https://doi.org/10.48550/arxiv.2603.16474"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.16474","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.16474","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.16474","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026947730","display_name":"V.V. Burlakov","orcid":"https://orcid.org/0000-0002-4110-3618"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Burlakov, Vladimir","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129783449","display_name":"Alena Rybakina","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rybakina, Alena","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109278273","display_name":"Sergey Fedorovich Kudashev","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kudashev, Sergey","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078638612","display_name":"Konstantin V. Gilev","orcid":"https://orcid.org/0000-0001-8517-4074"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gilev, Konstantin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029896301","display_name":"Alexander Demin","orcid":"https://orcid.org/0000-0002-2535-2016"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Demin, Alexander","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034928626","display_name":"Denis Ponomaryov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ponomaryov, Denis","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5069069110","display_name":"Yuriy Dorn","orcid":"https://orcid.org/0000-0003-0533-3018"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dorn, Yuriy","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5026947730"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.5616000294685364,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.5616000294685364,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.3163999915122986,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10286","display_name":"Information Retrieval and Search Behavior","score":0.02280000038444996,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7330999970436096},{"id":"https://openalex.org/keywords/generalizability-theory","display_name":"Generalizability theory","score":0.6164000034332275},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.5669999718666077},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4781999886035919},{"id":"https://openalex.org/keywords/query-expansion","display_name":"Query expansion","score":0.4447000026702881},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4377000033855438},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4237000048160553},{"id":"https://openalex.org/keywords/software-deployment","display_name":"Software deployment","score":0.3441999852657318},{"id":"https://openalex.org/keywords/benchmarking","display_name":"Benchmarking","score":0.34119999408721924}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.847000002861023},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7330999970436096},{"id":"https://openalex.org/C27158222","wikidata":"https://www.wikidata.org/wiki/Q5532422","display_name":"Generalizability theory","level":2,"score":0.6164000034332275},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.5669999718666077},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4781999886035919},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4672999978065491},{"id":"https://openalex.org/C99016210","wikidata":"https://www.wikidata.org/wiki/Q5488129","display_name":"Query expansion","level":2,"score":0.4447000026702881},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4377000033855438},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4237000048160553},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4178999960422516},{"id":"https://openalex.org/C105339364","wikidata":"https://www.wikidata.org/wiki/Q2297740","display_name":"Software deployment","level":2,"score":0.3441999852657318},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.34119999408721924},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.33480000495910645},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3244999945163727},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.32269999384880066},{"id":"https://openalex.org/C24028149","wikidata":"https://www.wikidata.org/wiki/Q7094056","display_name":"Online aggregation","level":5,"score":0.3005000054836273},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.295199990272522},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2743000090122223},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.27239999175071716},{"id":"https://openalex.org/C118689300","wikidata":"https://www.wikidata.org/wiki/Q7978614","display_name":"Web query classification","level":4,"score":0.26260000467300415},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26100000739097595},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.2587999999523163},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.257999986410141},{"id":"https://openalex.org/C165838908","wikidata":"https://www.wikidata.org/wiki/Q736777","display_name":"Calibration","level":2,"score":0.2554999887943268},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.25110000371932983},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.250900000333786}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.16474","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.16474","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.16474","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.16474","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"score":0.4576404094696045,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Monte":[0],"Carlo":[1],"Tree":[2],"Search":[3],"(MCTS)":[4],"has":[5],"been":[6],"proposed":[7],"as":[8,23,164,166],"a":[9,54,111,135,204],"transformative":[10],"approach":[11,125,195],"to":[12,28,46,66,74,143,147,223],"join-order":[13],"optimization":[14],"in":[15,208],"database":[16,128],"query":[17,206],"processing,":[18],"with":[19],"recent":[20],"frameworks":[21,37],"such":[22],"AlphaJoin":[24,161],"and":[25,48,162,173,185,200,220],"HyperQO":[26],"claiming":[27],"outperform":[29],"traditional":[30],"methods.":[31],"However,":[32],"the":[33,68,83,90,96,127,149,159,179,186,217],"fact":[34],"that":[35,62,118,193],"these":[36,59],"rely":[38,119],"on":[39,120,212],"learned":[40,98,122,197],"cost":[41,99,131],"models":[42,100],"raises":[43],"concerns":[44],"related":[45],"generalizability":[47],"deployment":[49],"readiness.":[50],"This":[51],"paper":[52],"presents":[53],"comprehensive":[55],"reproducibility":[56],"study":[57],"of":[58,86],"methods,":[60],"revealing":[61],"they":[63],"often":[64],"fail":[65],"support":[67,224],"claimed":[69],"performance":[70],"gains":[71],"when":[72],"subjected":[73],"diverse":[75],"workloads.":[76],"Through":[77],"an":[78],"ablation":[79],"study,":[80],"we":[81,109],"diagnose":[82],"root":[84],"cause":[85],"this":[87],"instability:":[88],"while":[89],"MCTS":[91,113,198],"search":[92,150],"strategy":[93],"is":[94],"effective,":[95],"accompanying":[97],"suffer":[101],"from":[102],"severe":[103],"out-of-distribution":[104],"generalization":[105],"errors.":[106],"Addressing":[107],"this,":[108],"propose":[110],"novel":[112],"framework.":[114],"Unlike":[115],"prior":[116],"methods":[117,199],"unstable":[121],"components,":[123],"our":[124,156,194],"utilizes":[126],"standard":[129],"internal":[130],"model,":[132],"augmented":[133],"by":[134],"new":[136,187],"Extreme":[137],"UCT":[138],"(Upper":[139],"Confidence":[140],"Bound":[141],"applied":[142],"Trees)":[144],"selection":[145],"policy":[146],"navigate":[148],"space":[151],"more":[152],"robustly.":[153],"We":[154,215],"benchmark":[155],"method":[157],"against":[158],"original":[160],"HyperQO,":[163],"well":[165],"industry-standard":[167],"baselines":[168],"including":[169],"Dynamic":[170],"Programming":[171],"(DP)":[172],"Genetic":[174],"Query":[175],"Optimization":[176],"(GEQO),":[177],"using":[178],"well-known":[180],"Join":[181],"Order":[182],"Benchmark":[183],"(JOB)":[184],"JOB-Complex":[188],"benchmark.":[189],"The":[190],"results":[191],"demonstrate":[192],"outperforms":[196],"achieves":[201],"superiority":[202],"over":[203],"SOTA":[205],"optimizer":[207],"complex":[209],"join":[210],"scenarios":[211],"real-world":[213],"data.":[214],"release":[216],"full":[218],"implementation":[219],"experimental":[221],"artifacts":[222],"further":[225],"research.":[226]},"counts_by_year":[],"updated_date":"2026-03-20T20:54:20.808490","created_date":"2026-03-20T00:00:00"}