Pub Date : 2023-01-01Epub Date: 2022-02-19DOI: 10.1007/s00778-022-00731-7
Wenfei Fan, Yuanhao Li, Muyang Liu, Can Lu
This paper proposes a scheme to reduce big graphs to small graphs. It contracts obsolete parts and regular structures into supernodes. The supernodes carry a synopsis for each query class in use, to abstract key features of the contracted parts for answering queries of . Moreover, for various types of graphs, we identify regular structures to contract. The contraction scheme provides a compact graph representation and prioritizes up-to-date data. Better still, it is generic and lossless. We show that the same contracted graph is able to support multiple query classes at the same time, no matter whether their queries are label based or not, local or non-local. Moreover, existing algorithms for these queries can be readily adapted to compute exact answers by using the synopses when possible and decontracting the supernodes only when necessary. As a proof of concept, we show how to adapt existing algorithms for subgraph isomorphism, triangle counting, shortest distance, connected component and clique decision to contracted graphs. We also provide a bounded incremental contraction algorithm in response to updates, such that its cost is determined by the size of areas affected by the updates alone, not by the entire graphs. We experimentally verify that on average, the contraction scheme reduces graphs by 71.9% and improves the evaluation of these queries by 1.69, 1.44, 1.47, 2.24 and 1.37 times, respectively.
{"title":"Making graphs compact by lossless contraction.","authors":"Wenfei Fan, Yuanhao Li, Muyang Liu, Can Lu","doi":"10.1007/s00778-022-00731-7","DOIUrl":"10.1007/s00778-022-00731-7","url":null,"abstract":"<p><p>This paper proposes a scheme to reduce big graphs to small graphs. It contracts obsolete parts and regular structures into supernodes. The supernodes carry a synopsis <math><msub><mi>S</mi> <mi>Q</mi></msub> </math> for each query class <math><mi>Q</mi></math> in use, to abstract key features of the contracted parts for answering queries of <math><mi>Q</mi></math> . Moreover, for various types of graphs, we identify regular structures to contract. The contraction scheme provides a compact graph representation and prioritizes up-to-date data. Better still, it is generic and lossless. We show that the same contracted graph is able to support multiple query classes at the same time, no matter whether their queries are label based or not, local or non-local. Moreover, existing algorithms for these queries can be readily adapted to compute exact answers by using the synopses when possible and decontracting the supernodes only when necessary. As a proof of concept, we show how to adapt existing algorithms for subgraph isomorphism, triangle counting, shortest distance, connected component and clique decision to contracted graphs. We also provide a bounded incremental contraction algorithm in response to updates, such that its cost is determined by the size of areas affected by the updates alone, not by the entire graphs. We experimentally verify that on average, the contraction scheme reduces graphs by 71.9% and improves the evaluation of these queries by 1.69, 1.44, 1.47, 2.24 and 1.37 times, respectively.</p>","PeriodicalId":49373,"journal":{"name":"Vldb Journal","volume":"32 1","pages":"49-73"},"PeriodicalIF":2.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9845199/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10573807","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-11-30DOI: 10.1007/s00778-022-00771-z
Karima Echihabi, Theophanis Tsandilas, Anna Gogolou, A. Bezerianos, Themis Palpanas
{"title":"ProS: data series progressive k-NN similarity search and classification with probabilistic quality guarantees","authors":"Karima Echihabi, Theophanis Tsandilas, Anna Gogolou, A. Bezerianos, Themis Palpanas","doi":"10.1007/s00778-022-00771-z","DOIUrl":"https://doi.org/10.1007/s00778-022-00771-z","url":null,"abstract":"","PeriodicalId":49373,"journal":{"name":"Vldb Journal","volume":"32 1","pages":"763 - 789"},"PeriodicalIF":4.2,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43604658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-11-23DOI: 10.1007/s00778-022-00769-7
Masaya Yamada, H. Kitagawa, T. Amagasa, Akiyoshi Matono
{"title":"Augmented lineage: traceability of data analysis including complex UDF processing","authors":"Masaya Yamada, H. Kitagawa, T. Amagasa, Akiyoshi Matono","doi":"10.1007/s00778-022-00769-7","DOIUrl":"https://doi.org/10.1007/s00778-022-00769-7","url":null,"abstract":"","PeriodicalId":49373,"journal":{"name":"Vldb Journal","volume":"32 1","pages":"963 - 983"},"PeriodicalIF":4.2,"publicationDate":"2022-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45659279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-22DOI: 10.1007/s00778-022-00765-x
Philipp Fent, Altan Birler, Thomas Neumann
{"title":"Practical planning and execution of groupjoin and nested aggregates","authors":"Philipp Fent, Altan Birler, Thomas Neumann","doi":"10.1007/s00778-022-00765-x","DOIUrl":"https://doi.org/10.1007/s00778-022-00765-x","url":null,"abstract":"","PeriodicalId":49373,"journal":{"name":"Vldb Journal","volume":"32 1","pages":"1165 - 1190"},"PeriodicalIF":4.2,"publicationDate":"2022-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51956498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-13DOI: 10.1007/s00778-022-00767-9
Liang Zhang, Noura A. Alghamdi, Huayi Zhang, M. Eltabakh, Elke A. Rundensteiner
{"title":"PARROT: pattern-based correlation exploitation in big partitioned data series","authors":"Liang Zhang, Noura A. Alghamdi, Huayi Zhang, M. Eltabakh, Elke A. Rundensteiner","doi":"10.1007/s00778-022-00767-9","DOIUrl":"https://doi.org/10.1007/s00778-022-00767-9","url":null,"abstract":"","PeriodicalId":49373,"journal":{"name":"Vldb Journal","volume":"32 1","pages":"665-688"},"PeriodicalIF":4.2,"publicationDate":"2022-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44587395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-07DOI: 10.1007/s00778-022-00766-w
Danica Porobic
{"title":"Special issue on the best papers of DaMoN 2020","authors":"Danica Porobic","doi":"10.1007/s00778-022-00766-w","DOIUrl":"https://doi.org/10.1007/s00778-022-00766-w","url":null,"abstract":"","PeriodicalId":49373,"journal":{"name":"Vldb Journal","volume":"31 1","pages":"1169 - 1169"},"PeriodicalIF":4.2,"publicationDate":"2022-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"51956604","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号