{"id":"https://openalex.org/W3029703673","doi":"https://doi.org/10.1145/3318464.3389736","title":"Aggify: Lifting the Curse of Cursor Loops using Custom Aggregates","display_name":"Aggify: Lifting the Curse of Cursor Loops using Custom Aggregates","publication_year":2020,"publication_date":"2020-05-29","ids":{"openalex":"https://openalex.org/W3029703673","doi":"https://doi.org/10.1145/3318464.3389736","mag":"3029703673"},"language":"en","primary_location":{"id":"doi:10.1145/3318464.3389736","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3318464.3389736","pdf_url":null,"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":["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/A5101656310","display_name":"Surabhi Gupta","orcid":"https://orcid.org/0000-0002-3963-3417"},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Surabhi Gupta","raw_affiliation_strings":["Microsoft Research India, Bengaluru, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research India, Bengaluru, India","institution_ids":["https://openalex.org/I4210124949"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108713661","display_name":"Sanket Purandare","orcid":null},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanket Purandare","raw_affiliation_strings":["Harvard University, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I2801851002"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004332087","display_name":"Karthik Ramachandra","orcid":null},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Karthik Ramachandra","raw_affiliation_strings":["Microsoft Research India, Bengaluru, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research India, Bengaluru, India","institution_ids":["https://openalex.org/I4210124949"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9449,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.86972612,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"559","last_page":"573"},"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.9990000128746033,"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.9990000128746033,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9975000023841858,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.8964987993240356},{"id":"https://openalex.org/keywords/cursor","display_name":"Cursor (databases)","score":0.5889655351638794},{"id":"https://openalex.org/keywords/for-loop","display_name":"For loop","score":0.5438360571861267},{"id":"https://openalex.org/keywords/online-aggregation","display_name":"Online aggregation","score":0.5181966423988342},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4885307550430298},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.4713308811187744},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.4602656662464142},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.425475150346756},{"id":"https://openalex.org/keywords/loop-tiling","display_name":"Loop tiling","score":0.4238680899143219},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.413326621055603},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.41208669543266296},{"id":"https://openalex.org/keywords/query-by-example","display_name":"Query by Example","score":0.379444420337677},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.33809375762939453},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.1875573694705963},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.1861613392829895},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.15311682224273682},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.09976553916931152}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8964987993240356},{"id":"https://openalex.org/C2776990265","wikidata":"https://www.wikidata.org/wiki/Q2998101","display_name":"Cursor (databases)","level":2,"score":0.5889655351638794},{"id":"https://openalex.org/C2779624466","wikidata":"https://www.wikidata.org/wiki/Q838119","display_name":"For loop","level":3,"score":0.5438360571861267},{"id":"https://openalex.org/C24028149","wikidata":"https://www.wikidata.org/wiki/Q7094056","display_name":"Online aggregation","level":5,"score":0.5181966423988342},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4885307550430298},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.4713308811187744},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.4602656662464142},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.425475150346756},{"id":"https://openalex.org/C11799548","wikidata":"https://www.wikidata.org/wiki/Q6675847","display_name":"Loop tiling","level":3,"score":0.4238680899143219},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.413326621055603},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.41208669543266296},{"id":"https://openalex.org/C194222762","wikidata":"https://www.wikidata.org/wiki/Q114486","display_name":"Query by Example","level":4,"score":0.379444420337677},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.33809375762939453},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.1875573694705963},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.1861613392829895},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.15311682224273682},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.09976553916931152},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3318464.3389736","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3318464.3389736","pdf_url":null,"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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6200000047683716,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W563453116","https://openalex.org/W1494930385","https://openalex.org/W1761301028","https://openalex.org/W1969460277","https://openalex.org/W1970165929","https://openalex.org/W2040943118","https://openalex.org/W2049594497","https://openalex.org/W2075827270","https://openalex.org/W2101000001","https://openalex.org/W2114067856","https://openalex.org/W2139508393","https://openalex.org/W2144344516","https://openalex.org/W2145061307","https://openalex.org/W2294598538","https://openalex.org/W2441695939","https://openalex.org/W2785559831","https://openalex.org/W2807893662","https://openalex.org/W2948175384","https://openalex.org/W2963423289","https://openalex.org/W2963741525","https://openalex.org/W3085921543","https://openalex.org/W3098585900","https://openalex.org/W4249745998"],"related_works":["https://openalex.org/W2169228170","https://openalex.org/W1596526459","https://openalex.org/W2554271401","https://openalex.org/W3022800428","https://openalex.org/W1529996718","https://openalex.org/W2342605656","https://openalex.org/W2955368753","https://openalex.org/W2058764256","https://openalex.org/W2062111218","https://openalex.org/W3029703673"],"abstract_inverted_index":{"Loops":[0],"that":[1,14,29,38,59,104,116,204],"iterate":[2],"over":[3,48,61,101,197],"SQL":[4],"query":[5,62,102,133,184],"results":[6,63,103],"are":[7,41,64,70,117],"quite":[8],"common,":[9],"both":[10],"in":[11,66,119,182],"application":[12,163],"programs":[13],"run":[15,30],"outside":[16],"the":[17,32,122,128,132,162,166,170,188,206],"DBMS,":[18,167],"as":[19,21,78,199,201],"well":[20,200],"User":[22],"Defined":[23],"Functions":[24],"(UDFs)":[25],"and":[26,44,69,85,91,192],"stored":[27],"procedures":[28],"within":[31],"DBMS.":[33],"It":[34,108],"can":[35],"be":[36,46],"argued":[37],"set-oriented":[39],"operations":[40,152],"more":[42],"efficient":[43,183],"should":[45],"preferred":[47,71],"iteration;":[49],"but":[50],"from":[51,161],"real":[52,202],"world":[53],"use":[54,135],"cases,":[55],"it":[56],"is":[57],"clear":[58],"loops":[60,100],"inevitable":[65],"many":[67,73],"situations,":[68],"by":[72,111,130],"users.":[74],"Such":[75],"loops,":[76,80],"known":[77],"cursor":[79,150],"come":[81],"with":[82],"huge":[83],"trade-offs":[84],"overheads":[86],"w.r.t.":[87],"performance,":[88],"resource":[89],"consumption":[90],"concurrency.":[92],"We":[93,186],"present":[94,193],"Aggify,":[95,191],"a":[96],"technique":[97,140,189],"for":[98],"optimizing":[99],"overcomes":[105],"these":[106],"overheads.":[107],"achieves":[109],"this":[110,136,210],"automatically":[112],"generating":[113],"custom":[114],"aggregates":[115],"equivalent":[118],"semantics":[120],"to":[121,134,169],"loop.":[123],"Thereby,":[124],"Aggify":[125],"completely":[126],"eliminates":[127],"loop":[129,151,159],"rewriting":[131],"generated":[137],"aggregate.":[138],"This":[139],"has":[141],"several":[142],"advantages":[143],"such":[144],"as:":[145],"(i)":[146],"pipelining":[147],"of":[148,154,178,209],"entire":[149],"instead":[153],"materialization,":[155],"(ii)":[156],"pushing":[157],"down":[158],"computation":[160],"layer":[164],"into":[165],"closer":[168],"data,":[171],"(iii)":[172],"leveraging":[173],"existing":[174],"work":[175],"on":[176],"optimization":[177],"aggregate":[179],"functions,":[180],"resulting":[181],"plans.":[185],"describe":[187],"underlying":[190],"our":[194],"experimental":[195],"evaluation":[196],"benchmarks":[198],"workloads":[203],"demonstrate":[205],"significant":[207],"benefits":[208],"technique.":[211]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}