{"id":"https://openalex.org/W4240822282","doi":"https://doi.org/10.1109/ideas.2007.4318089","title":"Approximate Structural Matching over Ordered XML Documents","display_name":"Approximate Structural Matching over Ordered XML Documents","publication_year":2007,"publication_date":"2007-09-01","ids":{"openalex":"https://openalex.org/W4240822282","doi":"https://doi.org/10.1109/ideas.2007.4318089"},"language":"en","primary_location":{"id":"doi:10.1109/ideas.2007.4318089","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ideas.2007.4318089","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"11th International Database Engineering and Applications Symposium (IDEAS 2007)","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/A5068923033","display_name":"Nitin Agarwal","orcid":"https://orcid.org/0000-0002-5612-4753"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nitin Agarwal","raw_affiliation_strings":["Arizona State University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Arizona State University, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055888553","display_name":"Magdiel Galan Oliveras","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Magdiel Galan Oliveras","raw_affiliation_strings":["Arizona State University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Arizona State University, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100419293","display_name":"Yi Chen","orcid":"https://orcid.org/0000-0003-3669-1643"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yi Chen","raw_affiliation_strings":["Arizona State University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Arizona State University, USA","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6737,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.77842016,"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":"54","last_page":"62"},"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.9997000098228455,"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.9997000098228455,"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.9983999729156494,"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/T11106","display_name":"Data Management and Algorithms","score":0.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8187164068222046},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.8046599626541138},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6410555243492126},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.6341418027877808},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.619835615158081},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.5697306394577026},{"id":"https://openalex.org/keywords/xml-database","display_name":"XML database","score":0.47536152601242065},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.47461405396461487},{"id":"https://openalex.org/keywords/sargable","display_name":"Sargable","score":0.4741474986076355},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.4675307273864746},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45388397574424744},{"id":"https://openalex.org/keywords/xpath","display_name":"XPath","score":0.43702417612075806},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.4316181242465973},{"id":"https://openalex.org/keywords/query-language","display_name":"Query language","score":0.4315001964569092},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.42725318670272827},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.4213504493236542},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.367293119430542},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2986447811126709},{"id":"https://openalex.org/keywords/web-search-query","display_name":"Web search query","score":0.29794567823410034},{"id":"https://openalex.org/keywords/search-engine","display_name":"Search engine","score":0.21623986959457397},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18353760242462158},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1451939344406128},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.083372563123703}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8187164068222046},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.8046599626541138},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6410555243492126},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.6341418027877808},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.619835615158081},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.5697306394577026},{"id":"https://openalex.org/C183068750","wikidata":"https://www.wikidata.org/wiki/Q357393","display_name":"XML database","level":3,"score":0.47536152601242065},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.47461405396461487},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.4741474986076355},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.4675307273864746},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45388397574424744},{"id":"https://openalex.org/C2780213375","wikidata":"https://www.wikidata.org/wiki/Q16340","display_name":"XPath","level":4,"score":0.43702417612075806},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.4316181242465973},{"id":"https://openalex.org/C192028432","wikidata":"https://www.wikidata.org/wiki/Q845739","display_name":"Query language","level":2,"score":0.4315001964569092},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.42725318670272827},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.4213504493236542},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.367293119430542},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2986447811126709},{"id":"https://openalex.org/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.29794567823410034},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.21623986959457397},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18353760242462158},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1451939344406128},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.083372563123703},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ideas.2007.4318089","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ideas.2007.4318089","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"11th International Database Engineering and Applications Symposium (IDEAS 2007)","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":19,"referenced_works":["https://openalex.org/W7950900","https://openalex.org/W1513916588","https://openalex.org/W1875120328","https://openalex.org/W2024375476","https://openalex.org/W2032123413","https://openalex.org/W2057712948","https://openalex.org/W2107412086","https://openalex.org/W2111071245","https://openalex.org/W2138757450","https://openalex.org/W2147909264","https://openalex.org/W2148353345","https://openalex.org/W2151406030","https://openalex.org/W2156664231","https://openalex.org/W2164501930","https://openalex.org/W6600317020","https://openalex.org/W6630731242","https://openalex.org/W6639471703","https://openalex.org/W6681594052","https://openalex.org/W6682452324"],"related_works":["https://openalex.org/W25732909","https://openalex.org/W4323338832","https://openalex.org/W4289596129","https://openalex.org/W170643605","https://openalex.org/W1999879627","https://openalex.org/W4295189757","https://openalex.org/W2088055539","https://openalex.org/W1574834681","https://openalex.org/W2389167168","https://openalex.org/W2170721049"],"abstract_inverted_index":{"There":[0],"is":[1,67],"an":[2,6,31],"increasing":[3],"need":[4],"for":[5,14],"XML":[7,74],"query":[8,19,37,77,110],"engine":[9],"that":[10],"not":[11,58],"only":[12],"searches":[13],"exact":[15],"matches":[16,95],"to":[17,49,62,69],"a":[18,50],"but":[20],"also":[21],"returns":[22],"\"query-like\"":[23],"structures.":[24],"We":[25],"have":[26],"designed":[27],"and":[28,76,78,90,109],"developed":[29],"XFinder,":[30],"efficient":[32],"top":[33],"K":[34],"tree":[35,46,64],"pattern":[36],"evaluation":[38],"system,":[39],"which":[40],"reduces":[41],"the":[42,81,102],"problem":[43,52],"of":[44,53,104],"approximate":[45],"structural":[47],"matching":[48],"simpler":[51],"subsequence":[54,94],"matching.":[55],"However,":[56],"since":[57],"all":[59],"subsequences":[60,72],"correspond":[61],"valid":[63],"structures,":[65],"it":[66],"expensive":[68],"enumerate":[70],"common":[71],"between":[73],"data":[75,108],"then":[79],"filter":[80],"invalid":[82],"ones.":[83],"XFinder":[84,105],"addresses":[85],"this":[86],"challenge":[87],"by":[88],"detecting":[89],"pruning":[91],"structurally":[92],"irrelevant":[93],"as":[96,98],"early":[97],"possible.":[99],"Experiments":[100],"show":[101],"efficiency":[103],"on":[106],"various":[107],"sets.":[111]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}