{"id":"https://openalex.org/W3094110505","doi":"https://doi.org/10.1145/3340531.3412026","title":"Minimal Edit-Based Diffs for Large Trees","display_name":"Minimal Edit-Based Diffs for Large Trees","publication_year":2020,"publication_date":"2020-10-19","ids":{"openalex":"https://openalex.org/W3094110505","doi":"https://doi.org/10.1145/3340531.3412026","mag":"3094110505"},"language":"en","primary_location":{"id":"doi:10.1145/3340531.3412026","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3340531.3412026","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3340531.3412026","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM International Conference on Information & Knowledge Management","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/3340531.3412026","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102713203","display_name":"Mateusz Pawlik","orcid":"https://orcid.org/0000-0003-0543-6332"},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Mateusz Pawlik","raw_affiliation_strings":["University of Salzburg, Salzburg, Austria"],"affiliations":[{"raw_affiliation_string":"University of Salzburg, Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089328860","display_name":"Nikolaus Augsten","orcid":"https://orcid.org/0000-0002-3036-6201"},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Nikolaus Augsten","raw_affiliation_strings":["University of Salzburg, Salzburg, Austria"],"affiliations":[{"raw_affiliation_string":"University of Salzburg, Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102713203"],"corresponding_institution_ids":["https://openalex.org/I182212641"],"apc_list":null,"apc_paid":null,"fwci":0.7709,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.74861526,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1225","last_page":"1234"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9991000294685364,"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.9965999722480774,"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/T12016","display_name":"Web Data Mining and Analysis","score":0.9940000176429749,"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/computer-science","display_name":"Computer science","score":0.7834830284118652},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.7214604020118713},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6616729497909546},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5818215608596802},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.5213850140571594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.510047972202301},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.49607571959495544},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4666137099266052},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.46009746193885803},{"id":"https://openalex.org/keywords/range-tree","display_name":"Range tree","score":0.45548975467681885},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4441800117492676},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4291197955608368},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.33949607610702515},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2039642632007599},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.17185822129249573},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11738097667694092},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11675652861595154},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.11074727773666382}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7834830284118652},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.7214604020118713},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6616729497909546},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5818215608596802},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.5213850140571594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.510047972202301},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.49607571959495544},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4666137099266052},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.46009746193885803},{"id":"https://openalex.org/C68775195","wikidata":"https://www.wikidata.org/wiki/Q818944","display_name":"Range tree","level":5,"score":0.45548975467681885},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4441800117492676},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4291197955608368},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.33949607610702515},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2039642632007599},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.17185822129249573},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11738097667694092},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11675652861595154},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.11074727773666382},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3340531.3412026","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3340531.3412026","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3340531.3412026","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM International Conference on Information & Knowledge Management","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3340531.3412026","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3340531.3412026","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3340531.3412026","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM International Conference on Information & Knowledge Management","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G535846211","display_name":null,"funder_award_id":"P 29859","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3094110505.pdf","grobid_xml":"https://content.openalex.org/works/W3094110505.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1488310749","https://openalex.org/W1861221087","https://openalex.org/W1973298440","https://openalex.org/W1975009259","https://openalex.org/W1976373002","https://openalex.org/W2003889154","https://openalex.org/W2022772986","https://openalex.org/W2028509346","https://openalex.org/W2046953300","https://openalex.org/W2048861113","https://openalex.org/W2057294899","https://openalex.org/W2082317627","https://openalex.org/W2127210827","https://openalex.org/W2137580272","https://openalex.org/W2152593687","https://openalex.org/W2171643895","https://openalex.org/W2245240469","https://openalex.org/W2493109812","https://openalex.org/W2543315719","https://openalex.org/W2598966460","https://openalex.org/W2907544011","https://openalex.org/W2953362850","https://openalex.org/W3208750584"],"related_works":["https://openalex.org/W2022598760","https://openalex.org/W2351720606","https://openalex.org/W2125650843","https://openalex.org/W2084831204","https://openalex.org/W2007609084","https://openalex.org/W2061004850","https://openalex.org/W2489256354","https://openalex.org/W2359807192","https://openalex.org/W3109340025","https://openalex.org/W2044936698"],"abstract_inverted_index":{"Hierarchically":[0],"structured":[1],"data":[2,14],"are":[3,72],"commonly":[4,50],"represented":[5],"as":[6,33,52],"trees":[7],"and":[8,68,71,134,159],"have":[9],"given":[10],"rise":[11],"to":[12],"popular":[13],"formats":[15],"like":[16],"XML":[17],"or":[18],"JSON.":[19],"An":[20],"interesting":[21],"query":[22],"computes":[23],"the":[24,34,53,58,84,87,100,116,127,139,151,166,169],"difference":[25,88],"between":[26,89],"two":[27,90],"versions":[28,91],"of":[29,37,92,130,153,168,174],"a":[30,93,106],"tree,":[31],"expressed":[32],"minimum":[35],"set":[36],"node":[38,132],"edits":[39],"(deletion,":[40],"insertion,":[41],"label":[42],"rename)":[43],"that":[44,86,112],"transform":[45],"one":[46],"tree":[47,54,60,94,102,108,117,146],"into":[48],"another,":[49],"known":[51],"edit":[55,61,109],"distance.":[56],"Unfortunately,":[57],"fastest":[59],"distance":[62,110,137],"algorithms":[63],"run":[64],"in":[65,115],"cubic":[66],"time":[67],"quadratic":[69],"space":[70],"therefore":[73],"not":[74],"feasible":[75],"for":[76,119,145],"large":[77,157],"inputs.":[78],"In":[79],"this":[80],"paper,":[81],"we":[82],"leverage":[83],"fact":[85],"is":[95,113,124],"typically":[96],"much":[97],"smaller":[98],"than":[99],"overall":[101],"size.":[103],"We":[104,148],"propose":[105],"new":[107,128],"algorithm":[111,123,155,163],"linear":[114],"size":[118],"similar":[120],"trees.":[121],"Our":[122],"based":[125],"on":[126,156],"concept":[129],"top":[131],"pairs":[133],"avoids":[135],"redundant":[136],"computations,":[138],"main":[140],"issue":[141],"with":[142],"previous":[143],"solutions":[144],"diffs.":[147],"empirically":[149],"evaluate":[150],"runtime":[152],"our":[154,162],"synthetic":[158],"real-world":[160],"trees;":[161],"clearly":[164],"outperforms":[165],"state":[167],"art,":[170],"often":[171],"by":[172],"orders":[173],"magnitude.":[175]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}