{"id":"https://openalex.org/W2085886750","doi":"https://doi.org/10.1145/1514894.1514908","title":"Efficient data structures for range-aggregate queries on trees","display_name":"Efficient data structures for range-aggregate queries on trees","publication_year":2009,"publication_date":"2009-03-23","ids":{"openalex":"https://openalex.org/W2085886750","doi":"https://doi.org/10.1145/1514894.1514908","mag":"2085886750"},"language":"en","primary_location":{"id":"doi:10.1145/1514894.1514908","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1514894.1514908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Database Theory","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/A5100619853","display_name":"Hao Yuan","orcid":"https://orcid.org/0000-0002-9416-2929"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hao Yuan","raw_affiliation_strings":["Purdue University, Lafayette, IN","Purdue University, Lafayette, In"],"affiliations":[{"raw_affiliation_string":"Purdue University, Lafayette, IN","institution_ids":[]},{"raw_affiliation_string":"Purdue University, Lafayette, In","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113562454","display_name":"Mikhail J. Atallah","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mikhail J. Atallah","raw_affiliation_strings":["Purdue University, Lafayette, IN","Purdue University, Lafayette, In"],"affiliations":[{"raw_affiliation_string":"Purdue University, Lafayette, IN","institution_ids":[]},{"raw_affiliation_string":"Purdue University, Lafayette, In","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100619853"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3571,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.5653183,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"111","last_page":"120"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9958000183105469,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9944000244140625,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5901650786399841},{"id":"https://openalex.org/keywords/aggregate","display_name":"Aggregate (composite)","score":0.5871841311454773},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5466930270195007},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.5442195534706116},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.5129868388175964},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4838208556175232},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.47826921939849854},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4688127040863037},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.46432653069496155},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45935654640197754},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4537813663482666},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4414108097553253},{"id":"https://openalex.org/keywords/online-aggregation","display_name":"Online aggregation","score":0.4190727472305298},{"id":"https://openalex.org/keywords/database-query","display_name":"Database query","score":0.41794830560684204},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4109310209751129},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37265703082084656},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3631134629249573},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3239233195781708},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25938332080841064},{"id":"https://openalex.org/keywords/sargable","display_name":"Sargable","score":0.2503308653831482},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.24644020199775696},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.16580551862716675},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.15960898995399475},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.15364065766334534},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.13341927528381348}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5901650786399841},{"id":"https://openalex.org/C4679612","wikidata":"https://www.wikidata.org/wiki/Q866298","display_name":"Aggregate (composite)","level":2,"score":0.5871841311454773},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5466930270195007},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.5442195534706116},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.5129868388175964},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4838208556175232},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.47826921939849854},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4688127040863037},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.46432653069496155},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45935654640197754},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4537813663482666},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4414108097553253},{"id":"https://openalex.org/C24028149","wikidata":"https://www.wikidata.org/wiki/Q7094056","display_name":"Online aggregation","level":5,"score":0.4190727472305298},{"id":"https://openalex.org/C2989070954","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database query","level":2,"score":0.41794830560684204},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4109310209751129},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37265703082084656},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3631134629249573},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3239233195781708},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25938332080841064},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.2503308653831482},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.24644020199775696},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.16580551862716675},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.15960898995399475},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.15364065766334534},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.13341927528381348},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1514894.1514908","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1514894.1514908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Database Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.155.1665","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.1665","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.purdue.edu/homes/yuan3/icdt09treemin.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.377.4819","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.377.4819","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.edbt.org/Proceedings/2009-StPetersburg/icdt/papers/p0111-Yuan.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2072475279","display_name":null,"funder_award_id":"CNS-0627488","funder_id":"https://openalex.org/F4320337388","funder_display_name":"Division of Computer and Network Systems"}],"funders":[{"id":"https://openalex.org/F4320337388","display_name":"Division of Computer and Network Systems","ror":"https://ror.org/02rdzmk74"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1507016795","https://openalex.org/W1737517293","https://openalex.org/W1974185069","https://openalex.org/W1979109797","https://openalex.org/W1990061958","https://openalex.org/W2011999472","https://openalex.org/W2031916245","https://openalex.org/W2047298278","https://openalex.org/W2048500523","https://openalex.org/W2071425575","https://openalex.org/W2076009323","https://openalex.org/W2096765938","https://openalex.org/W2128152149","https://openalex.org/W2137120608","https://openalex.org/W2138522392","https://openalex.org/W2143100570","https://openalex.org/W2145555113","https://openalex.org/W2150567347","https://openalex.org/W2165505682","https://openalex.org/W3042165818","https://openalex.org/W4206206918"],"related_works":["https://openalex.org/W3125756434","https://openalex.org/W2349153818","https://openalex.org/W2107022098","https://openalex.org/W2385851311","https://openalex.org/W2347809727","https://openalex.org/W2118790811","https://openalex.org/W1928358804","https://openalex.org/W1537332853","https://openalex.org/W2398728746","https://openalex.org/W2369651738"],"abstract_inverted_index":{"Graph-theoretic":[0],"aggregation":[1,21,63,87],"problems":[2],"have":[3],"been":[4],"considered":[5],"both":[6],"in":[7,22,30],"OLAP":[8],"(grid":[9],"graph)":[10],"and":[11,50,81,121],"XML":[12],"(tree).":[13],"This":[14],"paper":[15],"gives":[16],"new":[17],"results":[18],"for":[19,76,84],"MIN":[20,29,86],"a":[23,31,40],"tree,":[24],"where":[25],"we":[26,101],"want":[27],"the":[28,36,62,70,77,85,90,96,111,114,122],"query":[32,53,107,123],"subtree":[33],"consisting":[34],"of":[35,45,92],"nodes":[37],"reachable":[38],"from":[39],"node":[41],"u":[42],"along":[43],"paths":[44],"length":[46],"\u2264":[47],"k":[48,51],"(u":[49],"are":[52],"parameters).":[54],"The":[55],"same":[56],"problem":[57],"is":[58,64,89,117,125],"well":[59],"solved":[60],"when":[61],"SUM":[65],"rather":[66],"than":[67],"MIN,":[68],"but":[69],"solutions":[71],"rely":[72],"on":[73],"additive":[74],"inverses":[75],"\u201c+":[78],"\u201d":[79],"operator,":[80],"they":[82],"fail":[83],"which":[88],"topic":[91],"this":[93],"paper.":[94],"For":[95,110],"directed":[97],"(rooted":[98],"tree)":[99],"case,":[100,113],"give":[102],"an":[103],"O(n)":[104],"space,":[105],"constant":[106],"time":[108,124],"solution.":[109],"undirected":[112],"space":[115],"complexity":[116],"O(n":[118],"log":[119],"n)":[120],"O(log":[126],"n).":[127]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}