{"id":"https://openalex.org/W2126624503","doi":"https://doi.org/10.1145/1142351.1142384","title":"Scalable computation of acyclic joins","display_name":"Scalable computation of acyclic joins","publication_year":2006,"publication_date":"2006-06-26","ids":{"openalex":"https://openalex.org/W2126624503","doi":"https://doi.org/10.1145/1142351.1142384","mag":"2126624503"},"language":"en","primary_location":{"id":"doi:10.1145/1142351.1142384","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1142351.1142384","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-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/A5085243083","display_name":"Anna Pagh","orcid":null},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Anna Pagh","raw_affiliation_strings":["IT University of Copenhagen, K\u00f8benhavn, Denmark"],"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, K\u00f8benhavn, Denmark","institution_ids":["https://openalex.org/I83467386"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014293815","display_name":"Rasmus Pagh","orcid":"https://orcid.org/0000-0002-1516-9306"},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Rasmus Pagh","raw_affiliation_strings":["IT University of Copenhagen, K\u00f8benhavn, Denmark"],"affiliations":[{"raw_affiliation_string":"IT University of Copenhagen, K\u00f8benhavn, Denmark","institution_ids":["https://openalex.org/I83467386"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085243083"],"corresponding_institution_ids":["https://openalex.org/I83467386"],"apc_list":null,"apc_paid":null,"fwci":0.3018,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.64960224,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"225","last_page":"232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9998999834060669,"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/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.9909999966621399,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.9308840036392212},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.83186936378479},{"id":"https://openalex.org/keywords/sort-merge-join","display_name":"Sort-merge join","score":0.8172053098678589},{"id":"https://openalex.org/keywords/hash-join","display_name":"Hash join","score":0.6906462907791138},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6309676170349121},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6233824491500854},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.6198275089263916},{"id":"https://openalex.org/keywords/relational-algebra","display_name":"Relational algebra","score":0.600415825843811},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.5244260430335999},{"id":"https://openalex.org/keywords/binary-relation","display_name":"Binary relation","score":0.500140905380249},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.4839187264442444},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.46929317712783813},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4381174147129059},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42015692591667175},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.41807079315185547},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4140027165412903},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3407285213470459},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.33334851264953613},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31485235691070557},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.31281715631484985},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2513945698738098},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.13976606726646423},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11888405680656433}],"concepts":[{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.9308840036392212},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.83186936378479},{"id":"https://openalex.org/C203570394","wikidata":"https://www.wikidata.org/wiki/Q4060688","display_name":"Sort-merge join","level":3,"score":0.8172053098678589},{"id":"https://openalex.org/C188805328","wikidata":"https://www.wikidata.org/wiki/Q4060691","display_name":"Hash join","level":3,"score":0.6906462907791138},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6309676170349121},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6233824491500854},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.6198275089263916},{"id":"https://openalex.org/C95916125","wikidata":"https://www.wikidata.org/wiki/Q840540","display_name":"Relational algebra","level":3,"score":0.600415825843811},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5244260430335999},{"id":"https://openalex.org/C65180967","wikidata":"https://www.wikidata.org/wiki/Q130901","display_name":"Binary relation","level":2,"score":0.500140905380249},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.4839187264442444},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.46929317712783813},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4381174147129059},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42015692591667175},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.41807079315185547},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4140027165412903},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3407285213470459},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.33334851264953613},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31485235691070557},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31281715631484985},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2513945698738098},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.13976606726646423},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11888405680656433}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1142351.1142384","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1142351.1142384","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W52840101","https://openalex.org/W144096106","https://openalex.org/W199029439","https://openalex.org/W1483819513","https://openalex.org/W1607456165","https://openalex.org/W1996327385","https://openalex.org/W2006564766","https://openalex.org/W2007069074","https://openalex.org/W2038142281","https://openalex.org/W2066623874","https://openalex.org/W2127707114","https://openalex.org/W2144235399","https://openalex.org/W2148706674","https://openalex.org/W2153329411","https://openalex.org/W2171361281","https://openalex.org/W2185907055","https://openalex.org/W2293896416","https://openalex.org/W2714497087","https://openalex.org/W2988119170","https://openalex.org/W6602175484"],"related_works":["https://openalex.org/W2074890970","https://openalex.org/W2404915542","https://openalex.org/W2381211091","https://openalex.org/W2091359263","https://openalex.org/W1603474531","https://openalex.org/W4283362132","https://openalex.org/W2804964192","https://openalex.org/W2063259549","https://openalex.org/W2126624503","https://openalex.org/W2015372451"],"abstract_inverted_index":{"The":[0],"join":[1,15,37,72,96,108,137,155,220,222],"operation":[2],"of":[3,9,16,59,73,81,94,119,122,135,159,182,185,196,207,235],"relational":[4,10],"algebra":[5],"is":[6,19,91,114,140,176,224,232],"a":[7,45,63,79,110,116,124,132,157,219,225],"cornerstone":[8],"database":[11],"systems.":[12],"Computing":[13],"the":[14,57,60,92,95,107,120,129,144,154,180,186,194,201,211,233],"several":[17],"relations":[18],"NP-hard":[20],"in":[21,98,109,200,210,227,237],"general,":[22],"whereas":[23],"special":[24],"(and":[25],"typical)":[26],"cases":[27],"are":[28,163],"tractable.":[29],"This":[30],"paper":[31,101],"considers":[32],"joins":[33,209],"having":[34],"an":[35,70,204],"acyclic":[36,71,136],"graph,":[38],"for":[39,68],"which":[40,162],"current":[41],"methods":[42,152],"initially":[43],"apply":[44],"full":[46,125],"reducer":[47,126],"to":[48,56,105,192,217],"efficiently":[49],"eliminate":[50],"tuples":[51],"that":[52,113],"will":[53],"not":[54],"contribute":[55],"result":[58,97],"join.":[61],"From":[62],"worst-case":[64],"perspective,":[65],"previous":[66,149],"algorithms":[67],"computing":[69,179],"k":[74,147],"fully":[75],"reduced":[76],"relations,":[77],"occupying":[78],"total":[80],"n\u2265k":[82],"blocks":[83,236],"on":[84,146,178],"disk,":[85],"use":[86],"\u03a9((n+z)k)":[87],"I/Os,":[88,142,229],"where":[89,230],"z":[90],"size":[93,181],"blocks.In":[99],"this":[100,139,172],"we":[102,214],"show":[103,215],"how":[104,216],"compute":[106,193,218],"time":[111],"bound":[112],"within":[115],"constant":[117],"factor":[118],"cost":[121],"running":[123],"plus":[127],"sorting":[128],"output.":[130],"For":[131],"broad":[133],"class":[134],"graphs":[138],"O(sort(n+z))":[141],"removing":[143],"dependence":[145],"from":[148,171],"bounds.":[150],"Traditional":[151],"decompose":[153],"into":[156],"number":[158,234],"binary":[160],"joins,":[161],"then":[164],"carried":[165],"out":[166],"one":[167],"by":[168],"one.":[169],"Departing":[170],"approach,":[173],"our":[174],"technique":[175],"based":[177],"certain":[183],"subsets":[184],"result,":[187],"and":[188],"using":[189],"these":[190],"sizes":[191],"location(s)":[195],"each":[197],"data":[198],"item":[199],"result.Finally,":[202],"as":[203],"initial":[205],"study":[206],"cyclic":[208],"I/O":[212],"model,":[213],"whose":[221],"graph":[223],"3-cycle,":[226],"O(n2/m+sort(n+z))":[228],"m":[231],"internal":[238],"memory.":[239]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}