{"id":"https://openalex.org/W2029985800","doi":"https://doi.org/10.1145/1670243.1670249","title":"Optimal algorithms for evaluating rank joins in database systems","display_name":"Optimal algorithms for evaluating rank joins in database systems","publication_year":2008,"publication_date":"2008-02-15","ids":{"openalex":"https://openalex.org/W2029985800","doi":"https://doi.org/10.1145/1670243.1670249","mag":"2029985800"},"language":"en","primary_location":{"id":"doi:10.1145/1670243.1670249","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1670243.1670249","pdf_url":null,"source":{"id":"https://openalex.org/S90119964","display_name":"ACM Transactions on Database Systems","issn_l":"0362-5915","issn":["0362-5915","1557-4644"],"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":"ACM Transactions on Database Systems","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/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":["University of California, Santa Cruz, Santa Cruz, CA"],"affiliations":[{"raw_affiliation_string":"University of California, Santa Cruz, Santa Cruz, CA","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":["University of California, Santa Cruz, Santa Cruz, CA"],"affiliations":[{"raw_affiliation_string":"University of California, Santa Cruz, Santa Cruz, CA","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":0.7465,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.70464219,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"35","issue":"1","first_page":"1","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.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/T12288","display_name":"Optimization and Search Problems","score":0.9970999956130981,"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/computer-science","display_name":"Computer science","score":0.8909367322921753},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.6486415266990662},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6402286887168884},{"id":"https://openalex.org/keywords/statement","display_name":"Statement (logic)","score":0.5869007110595703},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5713329315185547},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.5149784684181213},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5105611085891724},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5077725052833557},{"id":"https://openalex.org/keywords/join","display_name":"Join (topology)","score":0.4814152717590332},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.41020381450653076},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3719859719276428},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.115724116563797}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8909367322921753},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.6486415266990662},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6402286887168884},{"id":"https://openalex.org/C2777026412","wikidata":"https://www.wikidata.org/wiki/Q2684591","display_name":"Statement (logic)","level":2,"score":0.5869007110595703},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5713329315185547},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.5149784684181213},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5105611085891724},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5077725052833557},{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.4814152717590332},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.41020381450653076},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3719859719276428},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.115724116563797},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"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/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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1670243.1670249","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1670243.1670249","pdf_url":null,"source":{"id":"https://openalex.org/S90119964","display_name":"ACM Transactions on Database Systems","issn_l":"0362-5915","issn":["0362-5915","1557-4644"],"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":"ACM Transactions on Database Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8100000023841858,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[{"id":"https://openalex.org/G6821537093","display_name":null,"funder_award_id":"IIS-0447966p","funder_id":"https://openalex.org/F4320337389","funder_display_name":"Division of Information and Intelligent Systems"}],"funders":[{"id":"https://openalex.org/F4320337389","display_name":"Division of Information and Intelligent Systems","ror":"https://ror.org/053a2cp42"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W65091138","https://openalex.org/W1488719427","https://openalex.org/W1505212787","https://openalex.org/W1600580971","https://openalex.org/W1761301028","https://openalex.org/W1989800045","https://openalex.org/W2020919487","https://openalex.org/W2041882671","https://openalex.org/W2083039049","https://openalex.org/W2084538728","https://openalex.org/W2090682579","https://openalex.org/W2098025050","https://openalex.org/W2106376606","https://openalex.org/W2109402524","https://openalex.org/W2118265701","https://openalex.org/W2133863472","https://openalex.org/W2143682328","https://openalex.org/W2158237121","https://openalex.org/W2160987984","https://openalex.org/W2164520297","https://openalex.org/W2166855749","https://openalex.org/W2666600683","https://openalex.org/W6600150513"],"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,152,165,176,194],"rank":[2,61,80],"join":[3,23,62,81],"problem,":[4],"we":[5,73],"are":[6,161],"given":[7],"a":[8,13,75,95,192,197,202],"set":[9],"of":[10,67,78,86,118,157,179,205],"relations":[11],"and":[12,16,46],"scoring":[14,48],"function,":[15],"goal":[18],"is":[19,31,50,89,92,112,145,200],"to":[20,107,147,185],"return":[21],"results":[24,120],"with":[25,167],"top":[27],"k":[28],"scores.":[29],"It":[30],"often":[32],"case":[34],"in":[35,43,151,183],"practice":[36],"that":[37,58,90,111,122,143,170,199],"inputs":[39],"may":[40],"be":[41],"accessed":[42],"ranked":[44],"order":[45,184],"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,134,180],"all":[66],"input.":[69],"this":[71,149],"article,":[72],"present":[74],"thorough":[76],"analysis":[77,88],"such":[79],"algorithms.":[82],"A":[83],"strong":[84],"point":[85],"our":[87,119],"it":[91,104,130,144],"based":[93],"on":[94,175],"more":[96,105,181],"general":[97,153],"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-known":[124],"HRJN":[125],"algorithm":[126,169,195],"has":[127],"shortcomings,":[128],"because":[129],"does":[131],"not":[132],"stop":[133,186],"its":[135],"input":[136,182],"as":[137,139,187,189],"soon":[138,188],"possible.":[140,190],"We":[141,163],"find":[142],"NP-hard":[146],"overcome":[148],"weakness":[150],"case,":[154],"but":[155],"cases":[156],"limited":[158],"query":[159],"complexity":[160],"tractable.":[162],"prove":[164],"latter":[166],"an":[168],"infers":[171],"provably":[172],"tight":[173],"bounds":[174],"potential":[177],"benefit":[178],"As":[191],"result,":[193],"achieves":[196],"cost":[198],"within":[201],"constant":[203],"factor":[204],"optimal.":[206]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}