{"title":"配方流图在简洁数据结构中的表示","authors":"Takuya Namiki, Tomonobu Ozaki","doi":"10.1145/3326458.3326930","DOIUrl":null,"url":null,"abstract":"The recipe flow graph is a directed acyclic graph for representing the procedure of the cooking recipe, and it is expected to contribute to the research to understand the whole meaning of the recipe text precisely. The recent rapid increase in health awareness has generated a large amount of user-generated recipe texts and corresponding recipe flow graphs in social networking services. In this research, to alleviate the problem of huge memory consumption and long computation time for handling a large number of recipe flow graphs, we propose to utilize succinct data structures to store the databases of recipe flow graphs. The effectiveness of our implementations of flow graph databases in two types of succinct data structures for trees and graphs was confirmed by the preliminary experiments using real recipe flow graphs.","PeriodicalId":184771,"journal":{"name":"Proceedings of the 11th Workshop on Multimedia for Cooking and Eating Activities","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Representation of Recipe Flow Graphs in Succinct Data Structures\",\"authors\":\"Takuya Namiki, Tomonobu Ozaki\",\"doi\":\"10.1145/3326458.3326930\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The recipe flow graph is a directed acyclic graph for representing the procedure of the cooking recipe, and it is expected to contribute to the research to understand the whole meaning of the recipe text precisely. The recent rapid increase in health awareness has generated a large amount of user-generated recipe texts and corresponding recipe flow graphs in social networking services. In this research, to alleviate the problem of huge memory consumption and long computation time for handling a large number of recipe flow graphs, we propose to utilize succinct data structures to store the databases of recipe flow graphs. The effectiveness of our implementations of flow graph databases in two types of succinct data structures for trees and graphs was confirmed by the preliminary experiments using real recipe flow graphs.\",\"PeriodicalId\":184771,\"journal\":{\"name\":\"Proceedings of the 11th Workshop on Multimedia for Cooking and Eating Activities\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 11th Workshop on Multimedia for Cooking and Eating Activities\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3326458.3326930\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 11th Workshop on Multimedia for Cooking and Eating Activities","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3326458.3326930","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Representation of Recipe Flow Graphs in Succinct Data Structures
The recipe flow graph is a directed acyclic graph for representing the procedure of the cooking recipe, and it is expected to contribute to the research to understand the whole meaning of the recipe text precisely. The recent rapid increase in health awareness has generated a large amount of user-generated recipe texts and corresponding recipe flow graphs in social networking services. In this research, to alleviate the problem of huge memory consumption and long computation time for handling a large number of recipe flow graphs, we propose to utilize succinct data structures to store the databases of recipe flow graphs. The effectiveness of our implementations of flow graph databases in two types of succinct data structures for trees and graphs was confirmed by the preliminary experiments using real recipe flow graphs.