{"id":"https://openalex.org/W7108908285","doi":"https://doi.org/10.1145/3769760","title":"Approximate Query Processing under Updates","display_name":"Approximate Query Processing under Updates","publication_year":2025,"publication_date":"2025-12-04","ids":{"openalex":"https://openalex.org/W7108908285","doi":"https://doi.org/10.1145/3769760"},"language":"en","primary_location":{"id":"doi:10.1145/3769760","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3769760","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Binyang Dai","orcid":"https://orcid.org/0009-0000-5438-7288"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Binyang Dai","raw_affiliation_strings":["Hong Kong University of Science and Technology, Hong Kong, Hong Kong"],"raw_orcid":"https://orcid.org/0009-0000-5438-7288","affiliations":[{"raw_affiliation_string":"Hong Kong University of Science and Technology, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"last","author":{"id":null,"display_name":"Ke Yi","orcid":"https://orcid.org/0000-0002-2178-3716"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Ke Yi","raw_affiliation_strings":["Hong Kong University of Science and Technology, Hong Kong, Hong Kong"],"raw_orcid":"https://orcid.org/0000-0002-2178-3716","affiliations":[{"raw_affiliation_string":"Hong Kong University of Science and Technology, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I200769079"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.59449738,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":"6","first_page":"1","last_page":"25"},"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.7785999774932861,"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.7785999774932861,"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.13600000739097595,"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.016499999910593033,"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/semiring","display_name":"Semiring","score":0.7206000089645386},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.670199990272522},{"id":"https://openalex.org/keywords/online-aggregation","display_name":"Online aggregation","score":0.5472000241279602},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.522599995136261},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.3813000023365021},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3790000081062317},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3517000079154968},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.33410000801086426}],"concepts":[{"id":"https://openalex.org/C21696900","wikidata":"https://www.wikidata.org/wiki/Q1333055","display_name":"Semiring","level":2,"score":0.7206000089645386},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.670199990272522},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6680999994277954},{"id":"https://openalex.org/C24028149","wikidata":"https://www.wikidata.org/wiki/Q7094056","display_name":"Online aggregation","level":5,"score":0.5472000241279602},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.522599995136261},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49729999899864197},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4269999861717224},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.3813000023365021},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3790000081062317},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3517000079154968},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.33410000801086426},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C138827492","wikidata":"https://www.wikidata.org/wiki/Q6661985","display_name":"Data processing","level":2,"score":0.2922999858856201},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2757999897003174},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.25859999656677246},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3769760","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3769760","pdf_url":null,"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":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W2028659807","https://openalex.org/W2050100848","https://openalex.org/W2141739881","https://openalex.org/W2145812340","https://openalex.org/W2396309311","https://openalex.org/W2952451116","https://openalex.org/W3024315987","https://openalex.org/W3197977787","https://openalex.org/W4239086110","https://openalex.org/W4323343708","https://openalex.org/W4366502978","https://openalex.org/W4375928209","https://openalex.org/W4388669487","https://openalex.org/W4404130348"],"related_works":[],"abstract_inverted_index":{"Query":[0],"processing":[1,75],"under":[2,66],"updates":[3],"(a.k.a.":[4],"incremental":[5],"view":[6],"maintenance)":[7],"has":[8],"received":[9],"increasing":[10],"attention":[11],"in":[12,26,88,159],"recent":[13],"years,":[14],"from":[15],"both":[16,103,125],"theoretical":[17],"and":[18,105,127,150,175],"practical":[19],"angles.":[20],"While":[21],"existing":[22],"algorithms":[23],"work":[24],"well":[25,123],"handling":[27],"reporting":[28],"queries,":[29,38],"they":[30],"may":[31],"incur":[32],"a":[33,56,71,138,160,166,180],"high":[34],"cost":[35],"on":[36,124],"aggregation":[37,60,86],"which":[39,164],"are":[40],"the":[41,81,107,142],"more":[42],"important":[43],"type":[44],"of":[45,83,147,168],"analytical":[46],"workload.":[47],"In":[48],"this":[49],"paper,":[50],"we":[51,69],"show":[52,135],"that":[53,78],"by":[54],"allowing":[55],"small":[57],"approximation":[58],"error,":[59],"queries":[61],"can":[62,79],"be":[63],"processed":[64],"efficiently":[65],"updates.":[67],"Specifically,":[68],"design":[70],"new":[72],"approximate":[73],"query":[74,87],"(AQP)":[76],"algorithm":[77,121,143,157],"maintain":[80],"result":[82],"any":[84],"free-connex":[85],"logarithmic":[89,108],"time":[90,109],"amortized":[91],"per":[92],"update":[93,97,100,130],"over":[94,152],"an":[95],"insertion-only":[96,126],"sequence.":[98],"For":[99],"sequences":[101],"with":[102,137,179],"insertions":[104],"deletions,":[106],"bound":[110],"does":[111],"not":[112],"hold,":[113],"due":[114],"to":[115],"known":[116],"lower":[117],"bounds.":[118],"Practically,":[119],"our":[120],"performs":[122],"fully":[128],"dynamic":[129],"sequences.":[131],"Our":[132,156],"experimental":[133],"results":[134],"that,":[136],"10%":[139],"error":[140],"guarantee,":[141],"achieves":[144],"average":[145],"speedups":[146],"1.5x,":[148],"4.8x,":[149],"13.4x":[151],"three":[153],"exact":[154],"solutions.":[155],"works":[158],"general":[161],"semiring":[162],"framework,":[163],"incorporates":[165],"variety":[167],"aggregations,":[169],"including":[170],"count,":[171],"sum,":[172],"avg,":[173],"max,":[174],"count":[176],"distinct,":[177],"possibly":[178],"group":[181],"by.":[182]},"counts_by_year":[],"updated_date":"2025-12-06T23:14:57.273132","created_date":"2025-12-06T00:00:00"}