{"id":"https://openalex.org/W3023361615","doi":"https://doi.org/10.1145/3318464.3383132","title":"Optimal Join Algorithms Meet Top-k","display_name":"Optimal Join Algorithms Meet Top-k","publication_year":2020,"publication_date":"2020-05-29","ids":{"openalex":"https://openalex.org/W3023361615","doi":"https://doi.org/10.1145/3318464.3383132","mag":"3023361615","pmid":"https://pubmed.ncbi.nlm.nih.gov/33568888"},"language":"en","primary_location":{"id":"doi:10.1145/3318464.3383132","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3318464.3383132","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3318464.3383132","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref","pubmed"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3318464.3383132","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Nikolaos Tziavelis","orcid":null},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nikolaos Tziavelis","raw_affiliation_strings":["Northeastern University, Boston, MA, USA"],"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, MA, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Wolfgang Gatterbauer","orcid":null},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wolfgang Gatterbauer","raw_affiliation_strings":["Northeastern University, Boston, MA, USA"],"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, MA, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":null,"display_name":"Mirek Riedewald","orcid":null},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mirek Riedewald","raw_affiliation_strings":["Northeastern University, Boston, MA, USA"],"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, MA, USA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I12912129"],"apc_list":null,"apc_paid":null,"fwci":0.6086,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.65813135,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"2020","issue":null,"first_page":"2659","last_page":"2665"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9958000183105469,"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/join","display_name":"Join (topology)","score":0.7631999850273132},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6765999794006348},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6492000222206116},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5371000170707703},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5256999731063843},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5245000123977661},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5045999884605408},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.3644999861717224}],"concepts":[{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.7631999850273132},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7628999948501587},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6765999794006348},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6492000222206116},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5371000170707703},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5256999731063843},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5245000123977661},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5045999884605408},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4530999958515167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42590001225471497},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3644999861717224},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.3538999855518341},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.32839998602867126},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3111000061035156},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2854999899864197},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.266400009393692},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.2630000114440918},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.26159998774528503},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2572000026702881},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3318464.3383132","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3318464.3383132","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3318464.3383132","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-article"},{"id":"pmid:33568888","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/33568888","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. ACM-SIGMOD International Conference on Management of Data","raw_type":null},{"id":"pmh:oai:arXiv.org:2005.00448","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2005.00448","pdf_url":"https://arxiv.org/pdf/2005.00448","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pubmedcentral.nih.gov:7872590","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/7872590","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proc ACM SIGMOD Int Conf Manag Data","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1145/3318464.3383132","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3318464.3383132","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3318464.3383132","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1582928494","display_name":null,"funder_award_id":"R01 NS091421","funder_id":"https://openalex.org/F4320332161","funder_display_name":"National Institutes of Health"},{"id":"https://openalex.org/G2699994585","display_name":"CAREER: Scaling Approximate Inference and Approximation-Aware Learning","funder_award_id":"1762268","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3497591915","display_name":null,"funder_award_id":"(NIH)","funder_id":"https://openalex.org/F4320332161","funder_display_name":"National Institutes of Health"},{"id":"https://openalex.org/G4700852728","display_name":null,"funder_award_id":"R01 NS","funder_id":"https://openalex.org/F4320332161","funder_display_name":"National Institutes of Health"},{"id":"https://openalex.org/G5213409069","display_name":null,"funder_award_id":"CAREER IIS-1762268","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5921281487","display_name":null,"funder_award_id":"number","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332161","display_name":"National Institutes of Health","ror":"https://ror.org/01cwqze88"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3023361615.pdf","grobid_xml":"https://content.openalex.org/works/W3023361615.grobid-xml"},"referenced_works_count":82,"referenced_works":["https://openalex.org/W1505212787","https://openalex.org/W1564964551","https://openalex.org/W1584375184","https://openalex.org/W1984407615","https://openalex.org/W1989800045","https://openalex.org/W1994694864","https://openalex.org/W2009688537","https://openalex.org/W2011087880","https://openalex.org/W2018177083","https://openalex.org/W2020919487","https://openalex.org/W2023132252","https://openalex.org/W2028659807","https://openalex.org/W2029448190","https://openalex.org/W2030076354","https://openalex.org/W2030985429","https://openalex.org/W2032775418","https://openalex.org/W2033325972","https://openalex.org/W2041961594","https://openalex.org/W2046167302","https://openalex.org/W2050100848","https://openalex.org/W2056102316","https://openalex.org/W2065023965","https://openalex.org/W2086174602","https://openalex.org/W2089845007","https://openalex.org/W2094320135","https://openalex.org/W2106376606","https://openalex.org/W2113123266","https://openalex.org/W2118265701","https://openalex.org/W2131058166","https://openalex.org/W2133863472","https://openalex.org/W2135463074","https://openalex.org/W2143238590","https://openalex.org/W2143682328","https://openalex.org/W2144050074","https://openalex.org/W2151645025","https://openalex.org/W2153485419","https://openalex.org/W2160987984","https://openalex.org/W2161956202","https://openalex.org/W2163316275","https://openalex.org/W2169998163","https://openalex.org/W2234276446","https://openalex.org/W2284514301","https://openalex.org/W2291572755","https://openalex.org/W2326948987","https://openalex.org/W2401576518","https://openalex.org/W2423871547","https://openalex.org/W2536131596","https://openalex.org/W2548695101","https://openalex.org/W2552956925","https://openalex.org/W2585424461","https://openalex.org/W2592257482","https://openalex.org/W2604519798","https://openalex.org/W2604533660","https://openalex.org/W2612337305","https://openalex.org/W2624220145","https://openalex.org/W2628596753","https://openalex.org/W2666600683","https://openalex.org/W2731670349","https://openalex.org/W2752064797","https://openalex.org/W2754879912","https://openalex.org/W2765827685","https://openalex.org/W2790840297","https://openalex.org/W2794645646","https://openalex.org/W2795570227","https://openalex.org/W2906408488","https://openalex.org/W2942813159","https://openalex.org/W2948257569","https://openalex.org/W2962730682","https://openalex.org/W2962896117","https://openalex.org/W2962991166","https://openalex.org/W2963066364","https://openalex.org/W2963448011","https://openalex.org/W2963560792","https://openalex.org/W2964101393","https://openalex.org/W2980615028","https://openalex.org/W2987825175","https://openalex.org/W2990166677","https://openalex.org/W2995253092","https://openalex.org/W2997488476","https://openalex.org/W3012308567","https://openalex.org/W3103899640","https://openalex.org/W4244579861"],"related_works":[],"abstract_inverted_index":{"<i>Top-k":[0],"queries</i>":[1],"have":[2],"been":[3],"studied":[4,152],"intensively":[5],"in":[6,48,159,164,260],"the":[7,22,32,41,60,78,81,90,102,126,145,165,191,199,217,248,261],"database":[8],"community":[9],"and":[10,67,149,189,195,237],"they":[11,45],"are":[12,28,228],"an":[13],"important":[14],"means":[15],"to":[16,108,121,161,219,230,247],"reduce":[17],"query":[18],"cost":[19,61,75],"when":[20],"only":[21,47],"\"best\"":[23],"or":[24],"\"most":[25],"interesting\"":[26],"results":[27,38,66,87],"needed":[29],"instead":[30],"of":[31,53,83,93,106,118,124,129,157,168,175,198,224,243,255,264],"full":[33],"output.":[34],"While":[35],"some":[36,211,242],"optimality":[37,163],"exist,":[39],"e.g.,":[40],"famous":[42],"Threshold":[43],"Algorithm,":[44],"hold":[46],"a":[49,116,154,171],"fairly":[50],"limited":[51],"model":[52,105,167],"computation":[54,107,169],"that":[55,144,214,252],"does":[56],"not":[57,70],"account":[58],"for":[59,170,267],"incurred":[62],"by":[63],"large":[64,85],"intermediate":[65,86],"hence":[68],"is":[69,88],"aligned":[71],"with":[72,132],"typical":[73],"database-optimizer":[74],"models.":[76],"On":[77],"other":[79],"hand,":[80],"idea":[82],"avoiding":[84],"arguably":[89],"main":[91,183,192],"goal":[92],"recent":[94],"work":[95,232],"on":[96,139,233],"<i>optimal":[97],"join":[98,130,177,269],"algorithms</i>,":[99],"which":[100,244],"uses":[101],"standard":[103],"RAM":[104],"determine":[109],"algorithm":[110],"complexity.":[111],"This":[112,179],"research":[113,201,256],"has":[114,136,181],"created":[115],"lot":[117],"excitement":[119],"due":[120],"its":[122],"promise":[123],"reducing":[125],"time":[127],"complexity":[128],"queries":[131],"cycles,":[133],"but":[134],"it":[135],"mostly":[137],"focused":[138],"full-output":[140],"computation.":[141],"We":[142,250],"argue":[143],"two":[146,182,200],"areas":[147],"can":[148],"should":[150],"be":[151],"from":[153],"unified":[155],"point":[156],"view":[158],"order":[160],"achieve":[162],"common":[166],"very":[172],"general":[173,239,268],"class":[174],"top-<i>k</i>-style":[176],"queries.":[178,270],"tutorial":[180],"objectives.":[184],"First,":[185],"we":[186,204],"will":[187,205],"explore":[188],"contrast":[190],"assumptions,":[193],"concepts,":[194],"algorithmic":[196],"achievements":[197],"areas.":[202],"Second,":[203],"cover":[206],"recent,":[207],"as":[208,210],"well":[209],"older,":[212],"approaches":[213],"emerged":[215],"at":[216],"intersection":[218],"support":[220],"efficient":[221],"<i>ranked":[222],"enumeration":[223,266],"join-query":[225],"results</i>.":[226],"These":[227],"related":[229],"classic":[231],"<i>k</i>-shortest":[234],"path":[235],"algorithms":[236],"more":[238],"optimization":[240],"problems,":[241],"dates":[245],"back":[246],"1950s.":[249],"demonstrate":[251],"this":[253],"line":[254],"warrants":[257],"renewed":[258],"attention":[259],"challenging":[262],"context":[263],"ranked":[265]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2020-05-13T00:00:00"}