{"id":"https://openalex.org/W2972110076","doi":"https://doi.org/10.1109/ccoms.2019.8821730","title":"Graph Compression by Tree Grammars and Direct Evaluation of Regular Path Query","display_name":"Graph Compression by Tree Grammars and Direct Evaluation of Regular Path Query","publication_year":2019,"publication_date":"2019-02-01","ids":{"openalex":"https://openalex.org/W2972110076","doi":"https://doi.org/10.1109/ccoms.2019.8821730","mag":"2972110076"},"language":"en","primary_location":{"id":"doi:10.1109/ccoms.2019.8821730","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccoms.2019.8821730","pdf_url":null,"source":{"id":"https://openalex.org/S4306498485","display_name":"2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS)","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/A5100680392","display_name":"Takeshi Takeda","orcid":"https://orcid.org/0000-0003-1732-1583"},"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":true,"raw_author_name":"Takeshi Takeda","raw_affiliation_strings":["Graduate School of Informatics, Nagoya University, Nagoya, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Informatics, Nagoya University, Nagoya, Japan","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007690546","display_name":"Kenji Hashimoto","orcid":"https://orcid.org/0000-0003-2300-6766"},"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":"Kenji Hashimoto","raw_affiliation_strings":["Graduate School of Informatics, Nagoya University, Nagoya, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Informatics, Nagoya University, Nagoya, Japan","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018228908","display_name":"Hiroyuki Seki","orcid":"https://orcid.org/0000-0003-2001-7507"},"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":"Hiroyuki Seki","raw_affiliation_strings":["Graduate School of Informatics, Nagoya University, Nagoya, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Informatics, Nagoya University, Nagoya, Japan","institution_ids":["https://openalex.org/I60134161"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100680392"],"corresponding_institution_ids":["https://openalex.org/I60134161"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13453299,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"257","last_page":"262"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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.9997000098228455,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6502081155776978},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.6081528067588806},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5249326825141907},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.461264431476593},{"id":"https://openalex.org/keywords/parse-tree","display_name":"Parse tree","score":0.45019957423210144},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40543240308761597},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3697938919067383},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.325867623090744}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6502081155776978},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.6081528067588806},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5249326825141907},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.461264431476593},{"id":"https://openalex.org/C2781466058","wikidata":"https://www.wikidata.org/wiki/Q627921","display_name":"Parse tree","level":3,"score":0.45019957423210144},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40543240308761597},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3697938919067383},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.325867623090744}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ccoms.2019.8821730","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccoms.2019.8821730","pdf_url":null,"source":{"id":"https://openalex.org/S4306498485","display_name":"2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4000000059604645,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1593799327","https://openalex.org/W1980622548","https://openalex.org/W1997520998","https://openalex.org/W2041211107","https://openalex.org/W2151817903","https://openalex.org/W2154969915","https://openalex.org/W2266568276","https://openalex.org/W2884085626"],"related_works":["https://openalex.org/W2118045671","https://openalex.org/W4244615522","https://openalex.org/W1972256049","https://openalex.org/W2338828339","https://openalex.org/W2166677757","https://openalex.org/W2141288413","https://openalex.org/W3123688778","https://openalex.org/W1634973882","https://openalex.org/W2049995120","https://openalex.org/W2033808215"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,9,31,41,47,61,67,142],"graph":[4,27,64,102],"compression":[5,13,110],"method":[6,115],"that":[7,107],"embodies":[8],"good":[10],"trade-off":[11],"between":[12],"ratio":[14],"and":[15,60],"direct":[16,130],"evaluation":[17,132],"(of":[18],"regular":[19],"path":[20],"queries)":[21],"without":[22,88],"decompression.":[23,89],"A":[24],"given":[25],"directed":[26],"is":[28,38,73],"decomposed":[29],"into":[30],"set":[32,48],"of":[33,36,49,79,112],"trees,":[34],"each":[35],"which":[37],"compressed":[39],"to":[40,76,134],"tree":[42,50],"grammar":[43],"by":[44,95],"TreeRePair.":[45],"When":[46],"grammars":[51],"G":[52,80],"<sub":[53,57,81,85],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[54,58,82,86],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</sub>":[55,83],",\u22efG":[56],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">N</sub>":[59,87],"deterministic":[62],"selecting":[63],"automaton":[65],"(as":[66],"query)":[68],"M":[69,72],"are":[70],"given,":[71],"directly":[74],"applied":[75],"production":[77],"rules":[78],",\u22ef,G":[84],"Duplicate":[90],"computation":[91],"can":[92],"be":[93,135],"avoided":[94],"memorization.":[96],"We":[97],"conducted":[98],"experiments":[99],"on":[100],"real-world":[101],"data.":[103],"The":[104],"result":[105],"shows":[106],"while":[108],"the":[109,113,128],"ratios":[111],"proposed":[114,129],"do":[116],"not":[117],"outperform":[118],"previous":[119],"research":[120],"(supporting":[121],"only":[122],"simple":[123],"queries),":[124],"CPU":[125],"time":[126],"for":[127,137],"query":[131],"tends":[133],"shorter":[136],"larger":[138],"graphs":[139],"compared":[140],"with":[141],"naive":[143],"method.":[144]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}