{"id":"https://openalex.org/W4405623305","doi":"https://doi.org/10.1145/3698809","title":"DPconv: Super-Polynomially Faster Join Ordering","display_name":"DPconv: Super-Polynomially Faster Join Ordering","publication_year":2024,"publication_date":"2024-12-18","ids":{"openalex":"https://openalex.org/W4405623305","doi":"https://doi.org/10.1145/3698809"},"language":"en","primary_location":{"id":"doi:10.1145/3698809","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3698809","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029098584","display_name":"Mihail Stoian","orcid":"https://orcid.org/0000-0002-8843-3374"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mihail Stoian","raw_affiliation_strings":["UTN, Nuremberg, DE"],"raw_orcid":"https://orcid.org/0000-0002-8843-3374","affiliations":[{"raw_affiliation_string":"UTN, Nuremberg, DE","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046188245","display_name":"Andreas Kipf","orcid":"https://orcid.org/0000-0003-3463-0564"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andreas Kipf","raw_affiliation_strings":["UTN, Nuremberg, DE"],"raw_orcid":"https://orcid.org/0000-0003-3463-0564","affiliations":[{"raw_affiliation_string":"UTN, Nuremberg, DE","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24336213,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":"6","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9998000264167786,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.8229116201400757},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.7715336680412292},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.747673511505127},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6657800674438477},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6055222749710083},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.49189281463623047},{"id":"https://openalex.org/keywords/convolution","display_name":"Convolution (computer science)","score":0.479783833026886},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.47278499603271484},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.46771493554115295},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41568273305892944},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3427131175994873},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3419189155101776},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28902316093444824},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.22696378827095032},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0668049156665802}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.8229116201400757},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.7715336680412292},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.747673511505127},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6657800674438477},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6055222749710083},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.49189281463623047},{"id":"https://openalex.org/C45347329","wikidata":"https://www.wikidata.org/wiki/Q5166604","display_name":"Convolution (computer science)","level":3,"score":0.479783833026886},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.47278499603271484},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.46771493554115295},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41568273305892944},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3427131175994873},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3419189155101776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28902316093444824},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.22696378827095032},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0668049156665802},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3698809","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3698809","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W1777047301","https://openalex.org/W1968541019","https://openalex.org/W1969483458","https://openalex.org/W1987175217","https://openalex.org/W1996668544","https://openalex.org/W2026984353","https://openalex.org/W2030249095","https://openalex.org/W2033904205","https://openalex.org/W2035675039","https://openalex.org/W2045326192","https://openalex.org/W2052142033","https://openalex.org/W2066623874","https://openalex.org/W2074359677","https://openalex.org/W2079329679","https://openalex.org/W2153180521","https://openalex.org/W2153329411","https://openalex.org/W2154888102","https://openalex.org/W2154965336","https://openalex.org/W2160770337","https://openalex.org/W2161948155","https://openalex.org/W2164399715","https://openalex.org/W2185907055","https://openalex.org/W2261781002","https://openalex.org/W2396309311","https://openalex.org/W2788151607","https://openalex.org/W2790625403","https://openalex.org/W2790840297","https://openalex.org/W2798325362","https://openalex.org/W2920771172","https://openalex.org/W2942397913","https://openalex.org/W3099158806","https://openalex.org/W3101250927","https://openalex.org/W3197977787","https://openalex.org/W3201760816","https://openalex.org/W4230983477","https://openalex.org/W4379382789","https://openalex.org/W4380322754","https://openalex.org/W4380433146","https://openalex.org/W4380433183","https://openalex.org/W4398233610","https://openalex.org/W4399523294"],"related_works":["https://openalex.org/W2089134982","https://openalex.org/W4299305030","https://openalex.org/W2040347389","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W2113270940","https://openalex.org/W1886770168","https://openalex.org/W2900627138","https://openalex.org/W4390579151","https://openalex.org/W2537252502"],"abstract_inverted_index":{"We":[0,36,63],"revisit":[1],"the":[2,54,60,66,70],"join":[3],"ordering":[4],"problem":[5],"in":[6],"query":[7],"optimization.":[8],"The":[9],"standard":[10],"exact":[11],"algorithm,":[12],"DPccp,":[13,52],"has":[14],"a":[15,38,48],"worst-case":[16],"running":[17],"time":[18],"of":[19],"O(3":[20,55],"n":[21,56],").":[22],"This":[23],"is":[24,75],"prohibitively":[25],"expensive":[26],"for":[27,59,69,82],"large":[28,83],"queries,":[29],"which":[30],"are":[31],"not":[32],"that":[33,65],"uncommon":[34],"anymore.":[35],"develop":[37],"new":[39],"algorithmic":[40],"framework":[41,67],"based":[42],"on":[43],"subset":[44],"convolution.":[45],"DPconv":[46],"achieves":[47],"super-polynomial":[49],"speedup":[50],"over":[51],"breaking":[53],")":[57],"time-barrier":[58],"first":[61],"time.":[62],"show":[64],"instantiation":[68],"C":[71],"max":[72],"cost":[73],"function":[74],"up":[76],"to":[77],"30x":[78],"faster":[79],"than":[80],"DPccp":[81],"clique":[84],"queries.":[85]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}