{"id":"https://openalex.org/W2461474581","doi":"https://doi.org/10.1177/0165551515602805","title":"A stream-based method to detect differences between XML documents","display_name":"A stream-based method to detect differences between XML documents","publication_year":2015,"publication_date":"2015-11-05","ids":{"openalex":"https://openalex.org/W2461474581","doi":"https://doi.org/10.1177/0165551515602805","mag":"2461474581"},"language":"en","primary_location":{"id":"doi:10.1177/0165551515602805","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0165551515602805","pdf_url":null,"source":{"id":"https://openalex.org/S68913162","display_name":"Journal of Information Science","issn_l":"0165-5515","issn":["0165-5515","1741-6485"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information Science","raw_type":"journal-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/A5008799656","display_name":"Bumsuk Jang","orcid":null},"institutions":[{"id":"https://openalex.org/I24062138","display_name":"Konkuk University","ror":"https://ror.org/025h1m602","country_code":"KR","type":"education","lineage":["https://openalex.org/I24062138"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Bumsuk Jang","raw_affiliation_strings":["Department of Computer Science and Engineering, Konkuk University, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Konkuk University, South Korea","institution_ids":["https://openalex.org/I24062138"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034659328","display_name":"Seong-hun Park","orcid":null},"institutions":[{"id":"https://openalex.org/I24062138","display_name":"Konkuk University","ror":"https://ror.org/025h1m602","country_code":"KR","type":"education","lineage":["https://openalex.org/I24062138"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"SeongHun Park","raw_affiliation_strings":["Department of Computer Science and Engineering, Konkuk University, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Konkuk University, South Korea","institution_ids":["https://openalex.org/I24062138"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027874948","display_name":"Young-Guk Ha","orcid":"https://orcid.org/0000-0002-1336-9216"},"institutions":[{"id":"https://openalex.org/I24062138","display_name":"Konkuk University","ror":"https://ror.org/025h1m602","country_code":"KR","type":"education","lineage":["https://openalex.org/I24062138"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Young-guk Ha","raw_affiliation_strings":["Department of Computer Science and Engineering, Konkuk University, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Konkuk University, South Korea","institution_ids":["https://openalex.org/I24062138"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008799656"],"corresponding_institution_ids":["https://openalex.org/I24062138"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.16630894,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"43","issue":"1","first_page":"39","last_page":"53"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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.9993000030517578,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9962999820709229,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9959999918937683,"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.8857077360153198},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.7530683875083923},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.728550136089325},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6539865136146545},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.5713294148445129},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.552466630935669},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.4864901900291443},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.48068055510520935},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.47994425892829895},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45798978209495544},{"id":"https://openalex.org/keywords/xml-database","display_name":"XML database","score":0.44465190172195435},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4444350302219391},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4254522919654846},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3650737404823303},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.35706186294555664},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.19960647821426392},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1487247347831726},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12844225764274597},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.12113365530967712}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8857077360153198},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.7530683875083923},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.728550136089325},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6539865136146545},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5713294148445129},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.552466630935669},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.4864901900291443},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.48068055510520935},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.47994425892829895},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45798978209495544},{"id":"https://openalex.org/C183068750","wikidata":"https://www.wikidata.org/wiki/Q357393","display_name":"XML database","level":3,"score":0.44465190172195435},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4444350302219391},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4254522919654846},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3650737404823303},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.35706186294555664},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.19960647821426392},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1487247347831726},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12844225764274597},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.12113365530967712},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/0165551515602805","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0165551515602805","pdf_url":null,"source":{"id":"https://openalex.org/S68913162","display_name":"Journal of Information Science","issn_l":"0165-5515","issn":["0165-5515","1741-6485"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Information Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W105372224","https://openalex.org/W130502426","https://openalex.org/W194774756","https://openalex.org/W1017562866","https://openalex.org/W1533573623","https://openalex.org/W1603549363","https://openalex.org/W1964451961","https://openalex.org/W1967541846","https://openalex.org/W1969483458","https://openalex.org/W1975009259","https://openalex.org/W1995793878","https://openalex.org/W2004686283","https://openalex.org/W2024797550","https://openalex.org/W2033357720","https://openalex.org/W2040816013","https://openalex.org/W2048001624","https://openalex.org/W2056708848","https://openalex.org/W2057294899","https://openalex.org/W2108584692","https://openalex.org/W2128920332","https://openalex.org/W2130200371","https://openalex.org/W2136393336","https://openalex.org/W2152593687","https://openalex.org/W2162744351","https://openalex.org/W2729358768"],"related_works":["https://openalex.org/W2371125232","https://openalex.org/W2113886942","https://openalex.org/W2377411012","https://openalex.org/W2348501364","https://openalex.org/W2351841572","https://openalex.org/W2491277646","https://openalex.org/W2133665016","https://openalex.org/W2792946098","https://openalex.org/W1514170290","https://openalex.org/W2461474581"],"abstract_inverted_index":{"Detecting":[0],"differences":[1,34],"between":[2,112],"XML":[3,15,68,89,129],"documents":[4,16],"is":[5,72,90,167,181],"one":[6],"of":[7,50,81,88],"most":[8,27,39],"important":[9],"research":[10,29],"topics":[11],"for":[12,109,156],"XML.":[13],"Since":[14],"are":[17],"generally":[18],"considered":[19],"to":[20,32,46,74,79,95,133,142,161],"be":[21],"organized":[22],"in":[23,48,65,93,140],"a":[24,60,100,117],"tree":[25],"structure,":[26],"previous":[28,82],"has":[30,104,116],"attempted":[31],"detect":[33,96],"using":[35],"tree-matching":[36,40,83],"algorithms.":[37,84],"However,":[38],"algorithms":[41],"have":[42],"inadequate":[43],"performance":[44,77],"owing":[45],"limitations":[47],"terms":[49],"the":[51,127,135,138,157,179],"execution":[52,165],"time,":[53],"optimality":[54],"and":[55,115,137],"scalability.":[56],"This":[57],"study":[58],"proposes":[59],"stream-based":[61],"difference":[62,110],"detection":[63,111],"method":[64,132,159],"which":[66],"an":[67,105],"binary":[69,130],"encoding":[70,131],"algorithm":[71,102,139,148],"used":[73],"provide":[75],"improved":[76],"relative":[78,160],"that":[80,103],"A":[85],"tree-structured":[86],"analysis":[87],"not":[91],"essential":[92],"order":[94,141],"differences.":[97],"We":[98,124],"use":[99],"D-Path":[101,147],"optimal":[106],"result":[107],"quality":[108],"two":[113],"streams":[114],"lower":[118],"time":[119,166],"complexity":[120],"than":[121,146,173],"tree-based":[122,162,175],"methods.":[123,163,176],"then":[125],"modify":[126],"existing":[128],"tokenize":[134],"stream":[136],"support":[143],"more":[144,183],"operations":[145],"does.":[149],"The":[150,164],"experimental":[151],"results":[152],"reveal":[153],"greater":[154],"efficiency":[155],"proposed":[158],"at":[168],"least":[169],"4":[170],"times":[171],"faster":[172],"state-of-the-art":[174],"In":[177],"addition,":[178],"scalability":[180],"much":[182],"efficient.":[184]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-05T06:06:40.768181","created_date":"2025-10-10T00:00:00"}