{"id":"https://openalex.org/W2064412333","doi":"https://doi.org/10.1145/1774088.1774442","title":"A time optimal algorithm for evaluating tree pattern queries","display_name":"A time optimal algorithm for evaluating tree pattern queries","publication_year":2010,"publication_date":"2010-03-22","ids":{"openalex":"https://openalex.org/W2064412333","doi":"https://doi.org/10.1145/1774088.1774442","mag":"2064412333"},"language":"en","primary_location":{"id":"doi:10.1145/1774088.1774442","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1774088.1774442","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2010 ACM Symposium on Applied Computing","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/A5115602977","display_name":"Yangjun Chen","orcid":"https://orcid.org/0000-0002-4991-9558"},"institutions":[{"id":"https://openalex.org/I872945872","display_name":"University of Winnipeg","ror":"https://ror.org/02gdzyx04","country_code":"CA","type":"education","lineage":["https://openalex.org/I872945872"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Yangjun Chen","raw_affiliation_strings":["University of Winnipeg, Winnipeg, Manitoba, Canada","Univ. of Winnipeg, Winnipeg, Manitoba, Canada#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Winnipeg, Winnipeg, Manitoba, Canada","institution_ids":["https://openalex.org/I872945872"]},{"raw_affiliation_string":"Univ. of Winnipeg, Winnipeg, Manitoba, Canada#TAB#","institution_ids":["https://openalex.org/I872945872"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5115602977"],"corresponding_institution_ids":["https://openalex.org/I872945872"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16278525,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1638","last_page":"1642"},"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.9998000264167786,"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.9998000264167786,"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/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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9919000267982483,"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.7701995372772217},{"id":"https://openalex.org/keywords/xml","display_name":"XML","score":0.6706689596176147},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.5866801142692566},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.5614444613456726},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5302326679229736},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.5143250226974487},{"id":"https://openalex.org/keywords/r-tree","display_name":"R-tree","score":0.4951111376285553},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4898485839366913},{"id":"https://openalex.org/keywords/segment-tree","display_name":"Segment tree","score":0.4534894526004791},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4453585147857666},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.4178135395050049},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41032978892326355},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3632080554962158},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.35924625396728516},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3547552227973938},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.3296348750591278},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3193904161453247},{"id":"https://openalex.org/keywords/spatial-database","display_name":"Spatial database","score":0.24994662404060364},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2305034101009369},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16803902387619019},{"id":"https://openalex.org/keywords/spatial-analysis","display_name":"Spatial analysis","score":0.13391590118408203},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.12458354234695435},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11409437656402588},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10836821794509888},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.0923754870891571}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7701995372772217},{"id":"https://openalex.org/C8797682","wikidata":"https://www.wikidata.org/wiki/Q2115","display_name":"XML","level":2,"score":0.6706689596176147},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.5866801142692566},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.5614444613456726},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5302326679229736},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.5143250226974487},{"id":"https://openalex.org/C106278948","wikidata":"https://www.wikidata.org/wiki/Q1198051","display_name":"R-tree","level":4,"score":0.4951111376285553},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4898485839366913},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.4534894526004791},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4453585147857666},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.4178135395050049},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41032978892326355},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3632080554962158},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.35924625396728516},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3547552227973938},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.3296348750591278},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3193904161453247},{"id":"https://openalex.org/C203689450","wikidata":"https://www.wikidata.org/wiki/Q2302053","display_name":"Spatial database","level":3,"score":0.24994662404060364},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2305034101009369},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16803902387619019},{"id":"https://openalex.org/C159620131","wikidata":"https://www.wikidata.org/wiki/Q1938983","display_name":"Spatial analysis","level":2,"score":0.13391590118408203},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.12458354234695435},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11409437656402588},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10836821794509888},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0923754870891571},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"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/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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.1145/1774088.1774442","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1774088.1774442","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2010 ACM Symposium on Applied Computing","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":11,"referenced_works":["https://openalex.org/W1491315301","https://openalex.org/W1508914815","https://openalex.org/W1932196479","https://openalex.org/W1994694191","https://openalex.org/W2014352286","https://openalex.org/W2061884758","https://openalex.org/W2098569470","https://openalex.org/W2113836856","https://openalex.org/W2140907203","https://openalex.org/W2142876691","https://openalex.org/W2421250929"],"related_works":["https://openalex.org/W22108090","https://openalex.org/W232438323","https://openalex.org/W1786504122","https://openalex.org/W2150556873","https://openalex.org/W2383581812","https://openalex.org/W2098841067","https://openalex.org/W2289983027","https://openalex.org/W2549663625","https://openalex.org/W2158047509","https://openalex.org/W780552203"],"abstract_inverted_index":{"The":[0],"tree":[1,13,42,57,78],"pattern":[2,14,43,58,79],"matching,":[3],"which":[4,45,94],"is":[5,19,51,82],"used":[6],"to":[7,113],"find":[8],"all":[9],"occurrences":[10],"of":[11,66,92],"a":[12,20,36,52,77,83,89],"in":[15],"an":[16,114],"XML":[17,24],"database,":[18],"core":[21],"operation":[22],"for":[23,39,56,76],"query":[25],"processing.":[26],"In":[27,106],"this":[28,32],"paper,":[29],"we":[30],"study":[31],"issue":[33],"and":[34,63,80],"discuss":[35],"new":[37,53],"algorithm":[38,68,109],"processing":[40],"unordered":[41],"queries,":[44],"works":[46],"bottom-up.":[47],"Its":[48],"main":[49],"idea":[50],"labeling":[54],"method":[55],"queries.":[59],"Both":[60],"the":[61,67,96,101,108],"time":[62],"space":[64],"complexities":[65],"are":[69],"bounded":[70],"by":[71],"O(|D|\u00b7|Q|),":[72],"where":[73],"Q":[74],"stands":[75],"D":[81],"largest":[84],"data":[85],"stream":[86],"associated":[87],"with":[88,117],"node":[90,102],"q":[91],"Q,":[93],"contains":[95],"database":[97],"nodes":[98],"that":[99],"match":[100],"predicate":[103],"at":[104],"q.":[105],"addition,":[107],"can":[110],"be":[111],"adapted":[112],"indexing":[115],"environment":[116],"XB-trees":[118],"being":[119],"used.":[120]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}