{"title":"QSGG","authors":"S. Böttcher, Rita Hartel, S. Peeters","doi":"10.1145/3391274.3393638","DOIUrl":null,"url":null,"abstract":"Like [1], we present QSGG, an algorithm to compute the simulation of a query pattern in a graph of labeled nodes and unlabeled edges. However, our algorithm, QSGG, works on a compressed graph grammar, instead of on the original graph. The speed-up of QSGG compared to a previous algorithm [1] grows with the size of the graph and with the compression strength of the grammar.","PeriodicalId":210506,"journal":{"name":"Proceedings of the International Workshop on Semantic Big Data","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Workshop on Semantic Big Data","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3391274.3393638","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Like [1], we present QSGG, an algorithm to compute the simulation of a query pattern in a graph of labeled nodes and unlabeled edges. However, our algorithm, QSGG, works on a compressed graph grammar, instead of on the original graph. The speed-up of QSGG compared to a previous algorithm [1] grows with the size of the graph and with the compression strength of the grammar.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
