{"id":"https://openalex.org/W4393184007","doi":"https://doi.org/10.1145/3639271","title":"Optimizing Nested Recursive Queries","display_name":"Optimizing Nested Recursive Queries","publication_year":2024,"publication_date":"2024-03-12","ids":{"openalex":"https://openalex.org/W4393184007","doi":"https://doi.org/10.1145/3639271"},"language":"en","primary_location":{"id":"doi:10.1145/3639271","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3639271","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3639271","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":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3639271","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025737201","display_name":"Amir Shaikhha","orcid":"https://orcid.org/0000-0002-9062-759X"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Amir Shaikhha","raw_affiliation_strings":["University of Edinburgh, Edinburgh, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048204602","display_name":"Dan Suciu","orcid":"https://orcid.org/0000-0002-4144-0868"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dan Suciu","raw_affiliation_strings":["University of Washington, Seattle, WA, USA"],"affiliations":[{"raw_affiliation_string":"University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028481269","display_name":"Maximilian Schleich","orcid":"https://orcid.org/0009-0004-5502-869X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maximilian Schleich","raw_affiliation_strings":["RelationalAI, Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"RelationalAI, Berkeley, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102964484","display_name":"Hung Q. Ngo","orcid":"https://orcid.org/0000-0002-3498-4744"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hung Ngo","raw_affiliation_strings":["RelationalAI, Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"RelationalAI, Berkeley, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5025737201"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":1.029,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.75825123,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"2","issue":"1","first_page":"1","last_page":"27"},"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.9997000098228455,"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.9997000098228455,"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.9991999864578247,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.6200540065765381},{"id":"https://openalex.org/keywords/nested-set-model","display_name":"Nested set model","score":0.504644513130188},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33990639448165894},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.32432234287261963},{"id":"https://openalex.org/keywords/relational-database","display_name":"Relational database","score":0.10139641165733337}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6200540065765381},{"id":"https://openalex.org/C103000020","wikidata":"https://www.wikidata.org/wiki/Q1978426","display_name":"Nested set model","level":3,"score":0.504644513130188},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33990639448165894},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.32432234287261963},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.10139641165733337}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3639271","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3639271","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3639271","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":{"id":"doi:10.1145/3639271","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3639271","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3639271","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"},"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.49000000953674316}],"awards":[{"id":"https://openalex.org/G3762871712","display_name":"SHF: Medium: Next Generation Equality Saturation by way of Datalog","funder_award_id":"2312195","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G802054471","display_name":null,"funder_award_id":"2314527,2312195,2109922","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"},{"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/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4393184007.pdf","grobid_xml":"https://content.openalex.org/works/W4393184007.grobid-xml"},"referenced_works_count":53,"referenced_works":["https://openalex.org/W953150943","https://openalex.org/W1511011071","https://openalex.org/W1584814208","https://openalex.org/W1660714679","https://openalex.org/W1971962972","https://openalex.org/W1998915208","https://openalex.org/W2003733792","https://openalex.org/W2008029457","https://openalex.org/W2008865455","https://openalex.org/W2016531106","https://openalex.org/W2032391783","https://openalex.org/W2049272900","https://openalex.org/W2082171780","https://openalex.org/W2087796842","https://openalex.org/W2106355650","https://openalex.org/W2106771621","https://openalex.org/W2131817760","https://openalex.org/W2139875914","https://openalex.org/W2144829796","https://openalex.org/W2145067417","https://openalex.org/W2159808530","https://openalex.org/W2167845698","https://openalex.org/W2215524946","https://openalex.org/W2340838390","https://openalex.org/W2433992225","https://openalex.org/W2543953340","https://openalex.org/W2780077279","https://openalex.org/W2797202077","https://openalex.org/W2867457158","https://openalex.org/W2898106867","https://openalex.org/W2903965607","https://openalex.org/W2948906765","https://openalex.org/W2962773216","https://openalex.org/W2963099300","https://openalex.org/W2964250337","https://openalex.org/W3013082216","https://openalex.org/W3028718318","https://openalex.org/W3030774843","https://openalex.org/W3031431535","https://openalex.org/W3122286897","https://openalex.org/W3135515481","https://openalex.org/W3168667958","https://openalex.org/W3173732543","https://openalex.org/W3205626426","https://openalex.org/W4206031975","https://openalex.org/W4247889999","https://openalex.org/W4282037052","https://openalex.org/W4288269198","https://openalex.org/W4288690063","https://openalex.org/W4292696229","https://openalex.org/W4296313421","https://openalex.org/W4321184658","https://openalex.org/W4380433265"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857","https://openalex.org/W2350741829","https://openalex.org/W2530322880"],"abstract_inverted_index":{"Datalog":[0,22,128],"is":[1,23],"a":[2,90,110,126,133,136,142],"declarative":[3],"programming":[4],"language":[5,44],"that":[6,37,92,114,122],"has":[7],"gained":[8],"popularity":[9],"in":[10,32,70],"various":[11],"domains":[12],"due":[13],"to":[14,25,49,95,150],"its":[15],"simplicity,":[16],"expressiveness,":[17],"and":[18,28,135],"efficiency.":[19],"But":[20,55],"\"pure\"":[21],"limited":[24],"monotone":[26],"queries,":[27],"cannot":[29],"be":[30,50,96],"used":[31],"most":[33],"practical":[34],"applications.":[35],"For":[36],"reason,":[38],"newer":[39],"systems":[40,67],"are":[41],"relaxing":[42],"the":[43,59,104],"by":[45,56,106],"allowing":[46],"non-monotone":[47,100],"queries":[48],"freely":[51,97],"combined":[52,98],"with":[53,99],"recursion.":[54],"departing":[57],"from":[58,147],"elegant":[60],"fixpoint":[61],"semantics":[62],"of":[63,145],"pure":[64],"datalog,":[65],"these":[66],"often":[68],"result":[69],"inefficient":[71],"query":[72],"execution,":[73],"for":[74,141],"example":[75],"they":[76],"perform":[77],"redundant":[78,82],"computations,":[79],"or":[80],"use":[81],"storage.":[83],"In":[84],"this":[85],"paper,":[86],"we":[87,115],"propose":[88],"Temporel,":[89],"system":[91,124,140],"allows":[93],"recursion":[94],"operators.":[101],"Temporel":[102],"optimizes":[103],"program":[105],"compiling":[107],"it":[108],"into":[109],"novel":[111],"intermediate":[112],"representation":[113],"call":[116],"TempoDL.":[117],"Our":[118],"experimental":[119],"results":[120],"show":[121],"our":[123],"outperforms":[125],"state-of-the-art":[127],"engine":[129],"as":[130,132],"well":[131],"vectorized":[134],"compiled":[137],"in-memory":[138],"database":[139],"wide":[143],"range":[144],"applications":[146],"machine":[148],"learning":[149],"graph":[151],"processing.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}