{"id":"https://openalex.org/W3208314873","doi":"https://doi.org/10.1145/3459637.3482304","title":"Top-k Tree Similarity Join","display_name":"Top-k Tree Similarity Join","publication_year":2021,"publication_date":"2021-10-26","ids":{"openalex":"https://openalex.org/W3208314873","doi":"https://doi.org/10.1145/3459637.3482304","mag":"3208314873"},"language":"en","primary_location":{"id":"doi:10.1145/3459637.3482304","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3459637.3482304","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th ACM International Conference on Information & Knowledge Management","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/A5100420031","display_name":"Jianhua Wang","orcid":"https://orcid.org/0000-0001-6090-1300"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jianhua Wang","raw_affiliation_strings":["Hunan University, Changsha, China"],"affiliations":[{"raw_affiliation_string":"Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059458833","display_name":"Jianye Yang","orcid":"https://orcid.org/0000-0003-3417-823X"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianye Yang","raw_affiliation_strings":["Hunan University, Changsha, China"],"affiliations":[{"raw_affiliation_string":"Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100385498","display_name":"Wenjie Zhang","orcid":"https://orcid.org/0000-0001-6572-2600"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Wenjie Zhang","raw_affiliation_strings":["University of New South Wales, Sydney, NSW, Australia"],"affiliations":[{"raw_affiliation_string":"University of New South Wales, Sydney, NSW, Australia","institution_ids":["https://openalex.org/I31746571"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100420031"],"corresponding_institution_ids":["https://openalex.org/I16609230"],"apc_list":null,"apc_paid":null,"fwci":0.1524,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.45875592,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1939","last_page":"1948"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991999864578247,"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.9991999864578247,"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.9979000091552734,"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/T12016","display_name":"Web Data Mining and Analysis","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/join","display_name":"Join (topology)","score":0.858430802822113},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.7330955862998962},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.7072020769119263},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7026388645172119},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5336730480194092},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.4561762511730194},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4376181364059448},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4200117290019989},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.41611480712890625},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.361880362033844},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27955126762390137},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24362802505493164},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2185644805431366},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1135718822479248},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.07031512260437012}],"concepts":[{"id":"https://openalex.org/C2776124973","wikidata":"https://www.wikidata.org/wiki/Q3183033","display_name":"Join (topology)","level":2,"score":0.858430802822113},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7330955862998962},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.7072020769119263},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7026388645172119},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5336730480194092},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.4561762511730194},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4376181364059448},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4200117290019989},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.41611480712890625},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.361880362033844},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27955126762390137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24362802505493164},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2185644805431366},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1135718822479248},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.07031512260437012}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3459637.3482304","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3459637.3482304","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th ACM International Conference on Information & Knowledge Management","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G706455544","display_name":null,"funder_award_id":"62002108","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1875120328","https://openalex.org/W1975009259","https://openalex.org/W1976373002","https://openalex.org/W1998067572","https://openalex.org/W2003889154","https://openalex.org/W2022772986","https://openalex.org/W2033629528","https://openalex.org/W2065110301","https://openalex.org/W2082317627","https://openalex.org/W2105436061","https://openalex.org/W2107412086","https://openalex.org/W2121269638","https://openalex.org/W2128782367","https://openalex.org/W2134206624","https://openalex.org/W2153150125","https://openalex.org/W2162675341","https://openalex.org/W2164501930","https://openalex.org/W2171643895","https://openalex.org/W2218134354","https://openalex.org/W2219975752","https://openalex.org/W2251939518","https://openalex.org/W2493109812","https://openalex.org/W2615445578","https://openalex.org/W2666600683","https://openalex.org/W2798412430","https://openalex.org/W2800982342","https://openalex.org/W2948082807","https://openalex.org/W2949562252","https://openalex.org/W3029266587","https://openalex.org/W3136558723","https://openalex.org/W3205835904"],"related_works":["https://openalex.org/W2227684440","https://openalex.org/W2343659340","https://openalex.org/W1559350420","https://openalex.org/W956035097","https://openalex.org/W2359095153","https://openalex.org/W2156833871","https://openalex.org/W1521720839","https://openalex.org/W2083751087","https://openalex.org/W2356601751","https://openalex.org/W2566588687"],"abstract_inverted_index":{"Tree":[0],"similarity":[1,14,18,39,53],"join":[2,15,54,125],"is":[3,21,83],"useful":[4],"for":[5,26,112],"analyzing":[6],"tree":[7,13,38,52,59,63,99,115],"structured":[8],"data.":[9],"The":[10,172],"traditional":[11],"threshold-based":[12,79],"requires":[16],"a":[17,23,42,47,132],"threshold,":[19],"which":[20,95],"usually":[22],"difficult":[24],"task":[25],"users.":[27],"To":[28,144],"remedy":[29],"this":[30,71,86],"issue,":[31],"we":[32,68,88,130,149],"advocate":[33],"the":[34,50,78,81,97,113,122,136,147,180],"problem":[35,72],"of":[36,44,121,156],"top-k":[37,51],"join.":[40],"Given":[41],"collection":[43],"trees":[45],"and":[46,159,169],"parameter":[48],"k,":[49],"aims":[55],"to":[56,134],"find":[57],"k":[58],"pairs":[60,100],"with":[61,118],"minimum":[62],"edit":[64],"distance":[65],"(TED).":[66],"Although":[67],"show":[69],"that":[70,176],"can":[73],"be":[74],"resolved":[75],"by":[76],"utilizing":[77],"join,":[80],"efficiency":[82],"unsatisfactory.":[84],"In":[85],"paper,":[87],"propose":[89,150],"an":[90,103],"efficient":[91],"algorithm,":[92],"namely":[93],"TopKTJoin,":[94],"generates":[96],"candidate":[98],"incrementally":[101],"using":[102],"inverted":[104],"index.":[105],"We":[106,162],"also":[107],"derive":[108],"TED":[109,119],"lower":[110],"bound":[111],"unseen":[114],"pairs.":[116],"Together":[117],"value":[120],"k-th":[123],"best":[124],"result":[126],"seen":[127],"so":[128],"far,":[129],"have":[131],"chance":[133],"terminate":[135],"algorithm":[137],"early":[138],"without":[139],"missing":[140],"any":[141],"correct":[142],"results.":[143],"further":[145],"improve":[146],"efficiency,":[148],"two":[151],"optimization":[152],"techniques":[153],"in":[154],"terms":[155],"index":[157],"structure":[158],"verification":[160],"mechanism.":[161],"conduct":[163],"comprehensive":[164],"performance":[165],"studies":[166],"on":[167],"real":[168],"synthetic":[170],"datasets.":[171],"experimental":[173],"results":[174],"demonstrate":[175],"TopKTJoin":[177],"significantly":[178],"outperforms":[179],"baseline":[181],"method.":[182]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}