{"id":"https://openalex.org/W2006308459","doi":"https://doi.org/10.1002/scj.4690240503","title":"A parallel algorithm for tree pattern matching","display_name":"A parallel algorithm for tree pattern matching","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W2006308459","doi":"https://doi.org/10.1002/scj.4690240503","mag":"2006308459"},"language":"en","primary_location":{"id":"doi:10.1002/scj.4690240503","is_oa":false,"landing_page_url":"https://doi.org/10.1002/scj.4690240503","pdf_url":null,"source":{"id":"https://openalex.org/S58208175","display_name":"Systems and Computers in Japan","issn_l":"0882-1666","issn":["0882-1666","1520-684X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems and Computers in Japan","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/A5059633402","display_name":"Koji Tarora","orcid":null},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Koji Tarora","raw_affiliation_strings":["Faculty of Engineering, Nagoya University, Nagoya, Japan 464","Koji Tarora received a B.S. in Information Engineering from Nagoya Unversity in 1991. He is currently with Recruit Co. and his research interests include parallel algorithms"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Nagoya University, Nagoya, Japan 464","institution_ids":["https://openalex.org/I60134161"]},{"raw_affiliation_string":"Koji Tarora received a B.S. in Information Engineering from Nagoya Unversity in 1991. He is currently with Recruit Co. and his research interests include parallel algorithms","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112718564","display_name":"Tomio Hirata","orcid":null},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tomio Hirata","raw_affiliation_strings":["Faculty of Engineering, Nagoya University, Nagoya, Japan 464","Tomio Hirata received a B.S. in Electrical Engineering and an M.S. and Ph.D in Computer Science, all from Tohoku University in 1976, 1978, and 1981, respectively. He is currently an Associate Professor in the Information Engineering Department, Nagoya University. From 1981 to 1986 he was an Assistant Professor of the Computer Science Department, Toyohashi University of Technology. His research interests include graph algorithms, data structures, and parallel algorithms"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Nagoya University, Nagoya, Japan 464","institution_ids":["https://openalex.org/I60134161"]},{"raw_affiliation_string":"Tomio Hirata received a B.S. in Electrical Engineering and an M.S. and Ph.D in Computer Science, all from Tohoku University in 1976, 1978, and 1981, respectively. He is currently an Associate Professor in the Information Engineering Department, Nagoya University. From 1981 to 1986 he was an Assistant Professor of the Computer Science Department, Toyohashi University of Technology. His research interests include graph algorithms, data structures, and parallel algorithms","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103350478","display_name":"Yasuyoshi Inagaki","orcid":null},"institutions":[{"id":"https://openalex.org/I4387930200","display_name":"Information Processing Society of Japan","ror":"https://ror.org/02v970d04","country_code":null,"type":"nonprofit","lineage":["https://openalex.org/I4387930200"]},{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yasuyoshi Inagaki","raw_affiliation_strings":["Faculty of Engineering, Nagoya University, Nagoya, Japan 464","Yasuyoshi Inagaki received a B.S. in 1962, and M.S. in 1964 and a Ph.D in Engineering in 1967 from Nagoya University. He was an Assistant Professor from 1970 to 1976 in the Department of Electrical Engineering and Information Engineering, Nagoya University, and a Full Professor from 1977 to 1980 in the Department of Electronics, Mie University. Since 1980, he has been a Full Professor in the Department of Electrical Engineering and Information Engineering, Nagoya University. His current research interests are in the area of algebraic theory of software specification, verification, and implementation, automata and languages theory, design and analysis of algorithms, and fundamental theory of artificial intelligence. He received the 1986 Inada Award from the Institute of Electrical Communication Engineers of Japan. Dr. Inagaki is a member of IEEE; ACM; EATCS; the Institute of Electrical Engineers of Japan; the information Processing Society of Japan; Japan Society for Software Science and Technology; Japanese Society for Artificial Intelligence; and the Operations Research Society of Japan","Japanese Society for Artificial Intelligence","EATCS","Yasuyoshi Inagaki received a B.S. in 1962, and M.S. in 1964 and a Ph.D in Engineering in 1967 from Nagoya University. He was an Assistant Professor from 1970 to 1976 in the Department of Electrical Engineering and Information Engineering, Nagoya University, and a Full Professor from 1977 to 1980 in the Department of Electronics, Mie University. Since 1980, he has been a Full Professor in the Department of Electrical Engineering and Information Engineering, Nagoya University. His current research interests are in the area of algebraic theory of software specification, verification, and implementation, automata and languages theory, design and analysis of algorithms, and fundamental theory of artificial intelligence. He received the 1986 Inada Award from the Institute of Electrical Communication Engineers of Japan. Dr. Inagaki is a member of IEEE","the information Processing Society of Japan","the Institute of Electrical Engineers of Japan","the Operations Research Society of Japan","Japan Society for Software Science and Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Nagoya University, Nagoya, Japan 464","institution_ids":["https://openalex.org/I60134161"]},{"raw_affiliation_string":"Yasuyoshi Inagaki received a B.S. in 1962, and M.S. in 1964 and a Ph.D in Engineering in 1967 from Nagoya University. He was an Assistant Professor from 1970 to 1976 in the Department of Electrical Engineering and Information Engineering, Nagoya University, and a Full Professor from 1977 to 1980 in the Department of Electronics, Mie University. Since 1980, he has been a Full Professor in the Department of Electrical Engineering and Information Engineering, Nagoya University. His current research interests are in the area of algebraic theory of software specification, verification, and implementation, automata and languages theory, design and analysis of algorithms, and fundamental theory of artificial intelligence. He received the 1986 Inada Award from the Institute of Electrical Communication Engineers of Japan. Dr. Inagaki is a member of IEEE; ACM; EATCS; the Institute of Electrical Engineers of Japan; the information Processing Society of Japan; Japan Society for Software Science and Technology; Japanese Society for Artificial Intelligence; and the Operations Research Society of Japan","institution_ids":["https://openalex.org/I60134161"]},{"raw_affiliation_string":"Japanese Society for Artificial Intelligence","institution_ids":[]},{"raw_affiliation_string":"EATCS","institution_ids":[]},{"raw_affiliation_string":"Yasuyoshi Inagaki received a B.S. in 1962, and M.S. in 1964 and a Ph.D in Engineering in 1967 from Nagoya University. He was an Assistant Professor from 1970 to 1976 in the Department of Electrical Engineering and Information Engineering, Nagoya University, and a Full Professor from 1977 to 1980 in the Department of Electronics, Mie University. Since 1980, he has been a Full Professor in the Department of Electrical Engineering and Information Engineering, Nagoya University. His current research interests are in the area of algebraic theory of software specification, verification, and implementation, automata and languages theory, design and analysis of algorithms, and fundamental theory of artificial intelligence. He received the 1986 Inada Award from the Institute of Electrical Communication Engineers of Japan. Dr. Inagaki is a member of IEEE","institution_ids":["https://openalex.org/I60134161"]},{"raw_affiliation_string":"the information Processing Society of Japan","institution_ids":["https://openalex.org/I4387930200"]},{"raw_affiliation_string":"the Institute of Electrical Engineers of Japan","institution_ids":[]},{"raw_affiliation_string":"the Operations Research Society of Japan","institution_ids":[]},{"raw_affiliation_string":"Japan Society for Software Science and Technology","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.12506712,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":"5","first_page":"30","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9962999820709229,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6938682794570923},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6192617416381836},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.6154598593711853},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5710442066192627},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.566072404384613},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5499399304389954},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5148788690567017},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5094252228736877},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48641395568847656},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4686046838760376},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4519313871860504},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35786595940589905},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.22798892855644226},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.22639140486717224},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09413102269172668},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0586317777633667}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6938682794570923},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6192617416381836},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.6154598593711853},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5710442066192627},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.566072404384613},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5499399304389954},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5148788690567017},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5094252228736877},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48641395568847656},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4686046838760376},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4519313871860504},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35786595940589905},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.22798892855644226},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.22639140486717224},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09413102269172668},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0586317777633667}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/scj.4690240503","is_oa":false,"landing_page_url":"https://doi.org/10.1002/scj.4690240503","pdf_url":null,"source":{"id":"https://openalex.org/S58208175","display_name":"Systems and Computers in Japan","issn_l":"0882-1666","issn":["0882-1666","1520-684X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems and Computers in Japan","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W124080003","https://openalex.org/W1545322556","https://openalex.org/W1581821235","https://openalex.org/W1586466644","https://openalex.org/W1967575173","https://openalex.org/W1979641885","https://openalex.org/W1983343295","https://openalex.org/W1985108724","https://openalex.org/W1995040285","https://openalex.org/W2007194876","https://openalex.org/W2015874281","https://openalex.org/W2032995245","https://openalex.org/W2036306887","https://openalex.org/W2042647740","https://openalex.org/W2062944884","https://openalex.org/W2064708943","https://openalex.org/W2067661972","https://openalex.org/W2130566259","https://openalex.org/W2131021748","https://openalex.org/W2154965336","https://openalex.org/W2156372444","https://openalex.org/W2223976777","https://openalex.org/W2421250929","https://openalex.org/W4212840250","https://openalex.org/W4299935650"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2145020325","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W2055625272","https://openalex.org/W2036758175"],"abstract_inverted_index":{"Abstract":[0],"Given":[1],"a":[2,7,26],"text":[3],"tree":[4,9,12,30],"t":[5,19,61],"and":[6,55,62],"pattern":[8,13,31],"p":[10,63,96],",":[11],"matching":[14],"involves":[15],"finding":[16],"subtrees":[17],"of":[18,60,69,93,95,103],"which":[20],"match":[21],"p.":[22],"This":[23,65],"paper":[24],"proposed":[25,111],"parallel":[27,44],"algorithm":[28,34],"for":[29],"matching.":[32],"The":[33],"is":[35,90,106],"designed":[36],"to":[37],"run":[38],"in":[39,75,109],"O":[40,76],"(log":[41,77],"n":[42,49,54,79,86],")":[43,80],"time":[45,81],"using":[46,82],"mn":[47],"/log":[48,84],"processors":[50],"on":[51],"CREW\u2010PRAM,":[52],"where":[53,88],"m":[56],"are":[57],"the":[58,67,91,101,110],"sizes":[59],"respectively.":[64],"improves":[66],"result":[68],"Ramesh":[70],"et":[71],"al.":[72],"that":[73],"runs":[74],"2":[78,85],"nr":[83],"processors,":[87],"r":[89],"number":[92],"vertices":[94],"labeled":[97],"with":[98],"variables.":[99],"Futhermore,":[100],"method":[102],"processor":[104],"allocation":[105],"described":[107],"specifically":[108],"algorithm.":[112]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}