{"id":"https://openalex.org/W2133863472","doi":"https://doi.org/10.1145/1376916.1376924","title":"Evaluating rank joins with optimal cost","display_name":"Evaluating rank joins with optimal cost","publication_year":2008,"publication_date":"2008-06-09","ids":{"openalex":"https://openalex.org/W2133863472","doi":"https://doi.org/10.1145/1376916.1376924","mag":"2133863472"},"language":"en","primary_location":{"id":"doi:10.1145/1376916.1376924","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1376916.1376924","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-seventh 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/A5072157136","display_name":"Karl Schnaitter","orcid":null},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Karl Schnaitter","raw_affiliation_strings":["UC Santa Cruz, Santa Cruz, CA, USA"],"affiliations":[{"raw_affiliation_string":"UC Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010950113","display_name":"Neoklis Polyzotis","orcid":"https://orcid.org/0000-0002-2694-8591"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neoklis Polyzotis","raw_affiliation_strings":["UC Santa Cruz, Santa Cruz, CA, USA"],"affiliations":[{"raw_affiliation_string":"UC Santa Cruz, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072157136"],"corresponding_institution_ids":["https://openalex.org/I185103710"],"apc_list":null,"apc_paid":null,"fwci":8.7678,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.97874866,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"43","last_page":"52"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9975000023841858,"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/T11106","display_name":"Data Management and Algorithms","score":0.9970999956130981,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8045122623443604},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.7217975854873657},{"id":"https://openalex.org/keywords/statement","display_name":"Statement (logic)","score":0.6430261731147766},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.633551299571991},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.6211358904838562},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.5538613796234131},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5424784421920776},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5200897455215454},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.46486812829971313},{"id":"https://openalex.org/keywords/reading","display_name":"Reading (process)","score":0.4386396110057831},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4114609360694885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4016312062740326},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13033276796340942},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10662588477134705}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8045122623443604},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.7217975854873657},{"id":"https://openalex.org/C2777026412","wikidata":"https://www.wikidata.org/wiki/Q2684591","display_name":"Statement (logic)","level":2,"score":0.6430261731147766},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.633551299571991},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.6211358904838562},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.5538613796234131},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5424784421920776},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5200897455215454},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.46486812829971313},{"id":"https://openalex.org/C554936623","wikidata":"https://www.wikidata.org/wiki/Q199657","display_name":"Reading (process)","level":2,"score":0.4386396110057831},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4114609360694885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4016312062740326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13033276796340942},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10662588477134705},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1376916.1376924","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1376916.1376924","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-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.155.3649","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.3649","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.ucsc.edu/~alkis/papers/pbrj_pods.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.800000011920929,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1600580971","https://openalex.org/W1989800045","https://openalex.org/W2020919487","https://openalex.org/W2084538728","https://openalex.org/W2106376606","https://openalex.org/W2118265701","https://openalex.org/W2143682328","https://openalex.org/W2666600683","https://openalex.org/W6680122168"],"related_works":["https://openalex.org/W2393491644","https://openalex.org/W4206577045","https://openalex.org/W650102067","https://openalex.org/W3086237447","https://openalex.org/W2740404111","https://openalex.org/W1550806730","https://openalex.org/W1496672428","https://openalex.org/W2589740103","https://openalex.org/W1966967794","https://openalex.org/W2397450670"],"abstract_inverted_index":{"In":[0,70],"the":[1,17,22,26,33,38,47,60,68,108,123,153,166,177,195],"rank":[2,61,80],"join":[3,23,62,81],"problem,":[4],"we":[5,73],"are":[6,162],"given":[7],"a":[8,13,75,95,193,198,203],"set":[9],"of":[10,67,78,86,118,158,180,206],"relations":[11],"and":[12,16,46],"scoring":[14,48],"function,":[15],"goal":[18],"is":[19,31,50,89,92,112,146,201],"to":[20,107,148,186],"return":[21],"results":[24,120],"with":[25,168],"top":[27],"K":[28],"scores.":[29],"It":[30],"often":[32],"case":[34],"in":[35,43,152,184],"practice":[36],"that":[37,58,90,111,122,144,171,200],"inputs":[39],"may":[40],"be":[41],"accessed":[42],"ranked":[44],"order":[45,185],"function":[49],"monotonic.":[51],"These":[52],"conditions":[53],"allow":[54],"for":[55],"efficient":[56],"algorithms":[57],"solve":[59],"problem":[63,98],"without":[64],"reading":[65,135,181],"all":[66],"input.":[69],"this":[71,150],"paper,":[72],"present":[74],"thorough":[76],"analysis":[77,88],"such":[79],"algorithms.":[82],"A":[83],"strong":[84],"point":[85],"our":[87,119],"it":[91,104,131,145],"based":[93],"on":[94,176],"more":[96,105,182],"general":[97,154],"statement":[99],"than":[100],"previous":[101],"work,":[102],"making":[103],"relevant":[106],"execution":[109],"model":[110],"employed":[113],"by":[114],"database":[115],"systems.":[116],"One":[117],"indicates":[121],"well":[124],"known":[125],"HRJN":[126],"algorithm":[127,170,196],"has":[128],"shortcomings,":[129],"because":[130],"does":[132],"not":[133],"stop":[134,187],"its":[136],"input":[137,183],"as":[138,140,188,190],"soon":[139,189],"possible.":[141,191],"We":[142,164],"find":[143],"NP-hard":[147],"overcome":[149],"weakness":[151],"case,":[155],"but":[156],"cases":[157],"limited":[159],"query":[160],"complexity":[161],"tractable.":[163],"prove":[165],"latter":[167],"an":[169],"infers":[172],"provably":[173],"tight":[174],"bounds":[175],"potential":[178],"benefit":[179],"As":[192],"result,":[194],"achieves":[197],"cost":[199],"within":[202],"constant":[204],"factor":[205],"optimal.":[207]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}