{"id":"https://openalex.org/W4415710480","doi":"https://doi.org/10.46298/lmcs-21(4:17)2025","title":"Range (R\u00e9nyi) Entropy Queries and Partitioning","display_name":"Range (R\u00e9nyi) Entropy Queries and Partitioning","publication_year":2025,"publication_date":"2025-10-30","ids":{"openalex":"https://openalex.org/W4415710480","doi":"https://doi.org/10.46298/lmcs-21(4:17)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(4:17)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:17)2025","pdf_url":"https://lmcs.episciences.org/16821/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/16821/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114419945","display_name":"Aryan Esmailpour","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Aryan Esmailpour","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018480426","display_name":"Sanjay Krishnan","orcid":"https://orcid.org/0000-0001-6968-4090"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sanjay Krishnan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5015883931","display_name":"Stavros Sintos","orcid":"https://orcid.org/0000-0002-2114-8886"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stavros Sintos","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5114419945"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17371386,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 4","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.6776000261306763,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.6776000261306763,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.093299999833107,"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.03539999946951866,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5249999761581421},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.5241000056266785},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.4860999882221222},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.45410001277923584},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.3970000147819519},{"id":"https://openalex.org/keywords/joint-entropy","display_name":"Joint entropy","score":0.39100000262260437},{"id":"https://openalex.org/keywords/conditional-entropy","display_name":"Conditional entropy","score":0.3806999921798706},{"id":"https://openalex.org/keywords/principle-of-maximum-entropy","display_name":"Principle of maximum entropy","score":0.3700000047683716},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.353300005197525}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5249999761581421},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.5241000056266785},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.4860999882221222},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47609999775886536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46869999170303345},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.45410001277923584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4235999882221222},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.3970000147819519},{"id":"https://openalex.org/C106752470","wikidata":"https://www.wikidata.org/wiki/Q1364826","display_name":"Joint entropy","level":3,"score":0.39100000262260437},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38449999690055847},{"id":"https://openalex.org/C101721835","wikidata":"https://www.wikidata.org/wiki/Q813908","display_name":"Conditional entropy","level":3,"score":0.3806999921798706},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"score":0.3700000047683716},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.353300005197525},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.3400000035762787},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.3287999927997589},{"id":"https://openalex.org/C44415725","wikidata":"https://www.wikidata.org/wiki/Q4913893","display_name":"Binary entropy function","level":3,"score":0.31940001249313354},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.3181999921798706},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.3043999969959259},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3012000024318695},{"id":"https://openalex.org/C67935508","wikidata":"https://www.wikidata.org/wiki/Q17078448","display_name":"Information diagram","level":5,"score":0.30079999566078186},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.2896000146865845},{"id":"https://openalex.org/C196083917","wikidata":"https://www.wikidata.org/wiki/Q17103874","display_name":"Min entropy","level":5,"score":0.2888999879360199},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C142611142","wikidata":"https://www.wikidata.org/wiki/Q1433083","display_name":"R\u00e9nyi entropy","level":3,"score":0.28189998865127563},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.27549999952316284},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.257099986076355},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.25699999928474426},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.46298/lmcs-21(4:17)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:17)2025","pdf_url":"https://lmcs.episciences.org/16821/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(4:17)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:17)2025","pdf_url":"https://lmcs.episciences.org/16821/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415710480.pdf","grobid_xml":"https://content.openalex.org/works/W4415710480.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Data":[0],"partitioning":[1],"that":[2,122,194,229],"maximizes/minimizes":[3],"the":[4,10,40,48,86,89,97,106,115,176,183,202,209,212,215,245,290],"Shannon":[5,87,203,291],"entropy,":[6],"or":[7,88,99,285],"more":[8],"generally":[9,81],"R\u00e9nyi":[11,90],"entropy":[12,41,91,116,206,294],"is":[13,80,151,172,185],"a":[14,35,58,93,118,132,152,159,173,188,196,286],"crucial":[15],"subroutine":[16],"in":[17,42,96,131,168,217,220,295],"data":[18,36,46,59,66,72,121,142,191,234,256,278],"compression,":[19],"columnar":[20],"storage,":[21],"and":[22,147,165,211,239,248,260,265],"cardinality":[23],"estimation":[24],"algorithms.":[25],"These":[26],"partition":[27],"algorithms":[28],"can":[29],"be":[30,63],"accelerated":[31],"if":[32],"we":[33,103,110,136,157,230,253,273],"have":[34],"structure":[37,60],"to":[38,51,55,73,84,112,186],"compute":[39,85],"different":[43,69],"subsets":[44,70],"of":[45,71,76,92,120,162,214,289],"when":[47,135],"algorithm":[49],"needs":[50],"decide":[52],"what":[53],"block":[54],"construct.":[56],"Such":[57],"will":[61],"also":[62],"useful":[64],"for":[65,233,243,258,269,280],"analysts":[67],"exploring":[68],"identify":[74],"areas":[75],"interest.":[77],"While":[78],"it":[79,200],"known":[82],"how":[83],"discrete":[94],"distribution":[95],"offline":[98],"streaming":[100],"setting":[101,108,134],"efficiently,":[102],"focus":[104],"on":[105,208],"query":[107,153,181,197,241,250,267],"where":[109,141,170],"aim":[111],"efficiently":[113],"derive":[114],"among":[117],"subset":[119],"satisfy":[123],"some":[124],"linear":[125,276],"predicates.":[126],"We":[127,223],"solve":[128],"this":[129],"problem":[130],"typical":[133],"deal":[137],"with":[138,236,262],"real":[139],"data,":[140],"items":[143],"are":[144],"geometric":[145],"points":[146,167,216],"each":[148],"requested":[149],"area":[150],"(hyper)rectangle.":[154],"More":[155],"specifically,":[156],"consider":[158],"set":[160],"$P$":[161],"$n$":[163],"weighted":[164],"colored":[166],"$\\mathbb{R}^d$,":[169],"$d$":[171],"constant.":[174],"For":[175],"range":[177,246],"S-entropy":[178,247],"(resp.":[179,204,292],"R-entropy)":[180],"problem,":[182],"goal":[184],"construct":[187],"low":[189],"space":[190,238,264,277],"structure,":[192],"such":[193],"given":[195],"(hyper)rectangle":[198],"$R$,":[199],"computes":[201],"R\u00e9nyi)":[205,293],"based":[207],"colors":[210],"weights":[213],"$P\\cap":[218,296],"R$,":[219],"sublinear":[221],"time.":[222],"show":[224],"conditional":[225],"lower":[226],"bounds":[227],"proving":[228],"cannot":[231],"hope":[232],"structures":[235,257,279],"near-linear":[237],"near-constant":[240],"time":[242,268],"both":[244,270],"R-entropy":[249],"problems.":[251,271],"Then,":[252],"propose":[254,274],"exact":[255],"$d=1$":[259],"$d>1$":[261],"$o(n^{2d})$":[263],"$o(n)$":[266],"Finally,":[272],"near":[275],"returning":[281],"either":[282],"an":[283],"additive":[284],"multiplicative":[287],"approximation":[288],"R$.":[297]},"counts_by_year":[],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-30T00:00:00"}