{"id":"https://openalex.org/W2014569888","doi":"https://doi.org/10.1145/2745754.2745772","title":"Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms","display_name":"Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms","publication_year":2015,"publication_date":"2015-05-20","ids":{"openalex":"https://openalex.org/W2014569888","doi":"https://doi.org/10.1145/2745754.2745772","mag":"2014569888"},"language":"en","primary_location":{"id":"doi:10.1145/2745754.2745772","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2745754.2745772","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2745754.2745772?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI  Symposium on Principles of Database Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2745754.2745772?download=true","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022867638","display_name":"Jayadev Acharya","orcid":"https://orcid.org/0000-0003-2170-3015"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jayadev Acharya","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology; ,; Cambridge MA USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology; ,; Cambridge MA USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054966819","display_name":"Ilias Diakonikolas","orcid":"https://orcid.org/0000-0002-5486-1856"},"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":false,"raw_author_name":"Ilias Diakonikolas","raw_affiliation_strings":["University of Edinburgh, Edinburgh, UNK, United Kingdom"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, UNK, United Kingdom","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066142047","display_name":"Chinmay Hegde","orcid":"https://orcid.org/0000-0003-4574-8066"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chinmay Hegde","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology; ,; Cambridge MA USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology; ,; Cambridge MA USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071686168","display_name":"Jerry Zheng Li","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jerry Zheng Li","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology; ,; Cambridge MA USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology; ,; Cambridge MA USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110578233","display_name":"Ludwig Schmidt","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ludwig Schmidt","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology; ,; Cambridge MA USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology; ,; Cambridge MA USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5022867638"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":5.2111,"has_fulltext":true,"cited_by_count":42,"citation_normalized_percentile":{"value":0.96107698,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"249","last_page":"263"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/automatic-summarization","display_name":"Automatic summarization","score":0.9139670133590698},{"id":"https://openalex.org/keywords/histogram","display_name":"Histogram","score":0.9029871821403503},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6723203659057617},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.6169723272323608},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5499276518821716},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23630982637405396},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.1697487235069275}],"concepts":[{"id":"https://openalex.org/C170858558","wikidata":"https://www.wikidata.org/wiki/Q1394144","display_name":"Automatic summarization","level":2,"score":0.9139670133590698},{"id":"https://openalex.org/C53533937","wikidata":"https://www.wikidata.org/wiki/Q185020","display_name":"Histogram","level":3,"score":0.9029871821403503},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6723203659057617},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.6169723272323608},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5499276518821716},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23630982637405396},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.1697487235069275}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/2745754.2745772","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2745754.2745772","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2745754.2745772?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI  Symposium on Principles of Database Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/ec13f0a7-a33e-4f04-9eb1-bce4dbccb3ea","is_oa":true,"landing_page_url":"https://hdl.handle.net/20.500.11820/ec13f0a7-a33e-4f04-9eb1-bce4dbccb3ea","pdf_url":"https://www.research.ed.ac.uk/files/23119475/pods_hist.pdf","source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Acharya, J, Diakonikolas, I, Hegde, C, Li, J Z & Schmidt, L 2015, Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms. in Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. PODS '15, Association for Computing Machinery (ACM), pp. 249-263. https://doi.org/10.1145/2745754.2745772","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/ec13f0a7-a33e-4f04-9eb1-bce4dbccb3ea","is_oa":true,"landing_page_url":null,"pdf_url":"https://www.research.ed.ac.uk/en/publications/ec13f0a7-a33e-4f04-9eb1-bce4dbccb3ea","source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.724.6627","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.724.6627","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://home.engineering.iastate.edu/%7Echinmay/files/papers/hist_pods15.pdf","raw_type":"text"},{"id":"pmh:oai:pure.ed.ac.uk:publications/ec13f0a7-a33e-4f04-9eb1-bce4dbccb3ea","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/ec13f0a7-a33e-4f04-9eb1-bce4dbccb3ea","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Acharya, J, Diakonikolas, I, Hegde, C, Li, J Z & Schmidt, L 2015, Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms. in Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. PODS '15, Association for Computing Machinery (ACM), pp. 249-263. https://doi.org/10.1145/2745754.2745772","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1145/2745754.2745772","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2745754.2745772","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2745754.2745772?download=true","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI  Symposium on Principles of Database Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3330119427","display_name":null,"funder_award_id":"EPSRC","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4252671323","display_name":"SHF: Small: Multicore Data-Structures: Relaxed, Flat, and Randomized","funder_award_id":"1217921","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6117372585","display_name":null,"funder_award_id":"DE-SC000892","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G6615897007","display_name":null,"funder_award_id":"EP/L021749/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8022311792","display_name":"Sublinear Algorithms for Approximating Probability Distributions","funder_award_id":"EP/L021749/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8693430560","display_name":null,"funder_award_id":"CCF-1217921","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8839178245","display_name":null,"funder_award_id":"DE-SC0008923","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2014569888.pdf","grobid_xml":"https://content.openalex.org/works/W2014569888.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W69989483","https://openalex.org/W1822348499","https://openalex.org/W1970695542","https://openalex.org/W2002869784","https://openalex.org/W2005188603","https://openalex.org/W2022858489","https://openalex.org/W2047424291","https://openalex.org/W2053075747","https://openalex.org/W2057058417","https://openalex.org/W2092015529","https://openalex.org/W2105910802","https://openalex.org/W2118229812","https://openalex.org/W2122512929","https://openalex.org/W2124701120","https://openalex.org/W2136499803","https://openalex.org/W2143122862","https://openalex.org/W2144181355","https://openalex.org/W2151203234","https://openalex.org/W2161463763","https://openalex.org/W2169956976","https://openalex.org/W2752885492","https://openalex.org/W2964044021","https://openalex.org/W2989661724","https://openalex.org/W3145128584","https://openalex.org/W3147513489","https://openalex.org/W4233014035","https://openalex.org/W6991953935"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2366403280","https://openalex.org/W1495108544","https://openalex.org/W3148229873","https://openalex.org/W2150160875","https://openalex.org/W4242223894","https://openalex.org/W2091301346","https://openalex.org/W1517524280","https://openalex.org/W4389760904","https://openalex.org/W2351187795"],"abstract_inverted_index":{"Histograms":[0],"are":[1],"among":[2],"the":[3,8],"most":[4],"popular":[5],"structures":[6],"for":[7,28],"succinct":[9],"summarization":[10],"of":[11,16],"data":[12,33],"in":[13],"a":[14],"variety":[15],"database":[17],"applications.":[18],"In":[19],"this":[20],"work,":[21],"we":[22],"provide":[23],"fast":[24],"and":[25],"near-optimal":[26],"algorithms":[27],"approximating":[29],"arbitrary":[30],"one":[31],"dimensional":[32],"distributions":[34],"by":[35],"histograms.":[36]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":6}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}