{"id":"https://openalex.org/W2528111042","doi":"https://doi.org/10.1109/iiswc.2016.7581286","title":"Treelogy: a benchmark suite for tree traversal applications","display_name":"Treelogy: a benchmark suite for tree traversal applications","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2528111042","doi":"https://doi.org/10.1109/iiswc.2016.7581286","mag":"2528111042"},"language":"en","primary_location":{"id":"doi:10.1109/iiswc.2016.7581286","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iiswc.2016.7581286","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Workload Characterization (IISWC)","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/A5031419424","display_name":"Nikhil Hegde","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nikhil Hegde","raw_affiliation_strings":["School of Electrical and Computer Engineering, Purdue University, hegden"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, hegden","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101876435","display_name":"Jianqiao Liu","orcid":"https://orcid.org/0000-0003-4022-8897"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jianqiao Liu","raw_affiliation_strings":["School of Electrical and Computer Engineering, Purdue University, hegden"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, hegden","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075916086","display_name":"Milind Kulkarni","orcid":"https://orcid.org/0000-0001-6827-345X"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Milind Kulkarni","raw_affiliation_strings":["School of Electrical and Computer Engineering, Purdue University, hegden"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, hegden","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5031419424"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.259,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.54349284,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"2"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"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.9993000030517578,"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/T10799","display_name":"Data Visualization and Analytics","score":0.9763000011444092,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9731000065803528,"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/tree-traversal","display_name":"Tree traversal","score":0.9817739725112915},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8330951929092407},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6969887018203735},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5971642732620239},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5949261784553528},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.582496166229248},{"id":"https://openalex.org/keywords/suite","display_name":"Suite","score":0.5099009275436401},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4975731670856476},{"id":"https://openalex.org/keywords/test-suite","display_name":"Test suite","score":0.4663879871368408},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4219720959663391},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4080933928489685},{"id":"https://openalex.org/keywords/test-case","display_name":"Test case","score":0.19683554768562317},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.16933250427246094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11231991648674011},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.07468464970588684}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.9817739725112915},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8330951929092407},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6969887018203735},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5971642732620239},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5949261784553528},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.582496166229248},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.5099009275436401},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4975731670856476},{"id":"https://openalex.org/C151552104","wikidata":"https://www.wikidata.org/wiki/Q7705809","display_name":"Test suite","level":4,"score":0.4663879871368408},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4219720959663391},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4080933928489685},{"id":"https://openalex.org/C128942645","wikidata":"https://www.wikidata.org/wiki/Q1568346","display_name":"Test case","level":3,"score":0.19683554768562317},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.16933250427246094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11231991648674011},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.07468464970588684},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C152877465","wikidata":"https://www.wikidata.org/wiki/Q208042","display_name":"Regression analysis","level":2,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iiswc.2016.7581286","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iiswc.2016.7581286","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on Workload Characterization (IISWC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1985239701","https://openalex.org/W2064446724","https://openalex.org/W2065179797","https://openalex.org/W2068306188","https://openalex.org/W2096592175","https://openalex.org/W2097921974","https://openalex.org/W2129490689","https://openalex.org/W2142761843","https://openalex.org/W2146558186","https://openalex.org/W2165428671","https://openalex.org/W2408916298","https://openalex.org/W4254836043","https://openalex.org/W6674878074","https://openalex.org/W6681144579","https://openalex.org/W6693883757"],"related_works":["https://openalex.org/W2377402383","https://openalex.org/W2380835401","https://openalex.org/W2381912691","https://openalex.org/W2350381577","https://openalex.org/W2353618196","https://openalex.org/W2348074676","https://openalex.org/W2366394613","https://openalex.org/W1485837041","https://openalex.org/W2152421698","https://openalex.org/W3204955359"],"abstract_inverted_index":{"An":[0],"interesting":[1],"class":[2],"of":[3,27,38,52,71,83,90,98,105,125,133],"irregular":[4],"algorithms":[5,22,29,78],"are":[6,40],"tree":[7,20,53,76,166],"traversal":[8,21,54,77,99],"algorithms,":[9],"which":[10,30,36],"repeatedly":[11],"traverse":[12],"spatial":[13],"trees":[14],"to":[15,42,80,109],"perform":[16,43],"efficient":[17],"computations.":[18],"Optimizing":[19],"requires":[23],"understanding":[24],"specific":[25],"characteristics":[26],"these":[28,91,126,134],"affect":[31],"their":[32],"behavior":[33],"and":[34,144,157],"govern":[35],"types":[37,167],"optimizations":[39],"likely":[41],"well.":[44],"In":[45],"this":[46],"work,":[47],"we":[48],"present":[49],"a":[50],"set":[51],"applications,":[55],"drawn":[56],"from":[57],"multiple":[58],"domains,":[59],"called":[60],"Treelogy.":[61],"This":[62],"benchmark":[63],"suite":[64],"can":[65],"be":[66],"studied":[67],"through":[68],"the":[69,84,103,123,131,170],"use":[70],"an":[72],"ontology":[73,112],"that":[74,121,151],"characterizes":[75],"according":[79,108],"structural":[81,111],"properties":[82],"algorithm.":[85],"We":[86,101,128,148],"describe":[87],"how":[88],"each":[89],"attributes":[92],"constrains":[93],"or":[94],"allows":[95],"different":[96],"kinds":[97],"optimizations.":[100],"characterize":[102],"applications":[104,135],"Treelogy":[106],"both":[107],"our":[110],"as":[113,115],"well":[114],"by":[116],"various":[117],"applicationand":[118],"input-dependent":[119],"metrics":[120],"measure":[122],"irregularity":[124],"applications.":[127],"then":[129],"show":[130],"scalability":[132],"implemented":[136,164],"using":[137],"generic":[138],"frameworks":[139],"for":[140,152],"GPU,":[141],"shared":[142],"memory,":[143],"distributed":[145],"memory":[146],"systems.":[147],"also":[149],"find":[150],"certain":[153],"input":[154],"distributions,":[155],"Barnes-Hut":[156],"2-point":[158],"correlation":[159],"yield":[160],"better":[161],"performance":[162],"when":[163],"with":[165],"other":[168],"than":[169],"\"standard\"":[171],"tree.":[172]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}