Vldb Journal最新文献_第4页

Time-topology analysis on temporal graphs 时间图的时间拓扑分析

IF 4.2 2区计算机科学

Vldb Journal Pub Date : 2023-01-06 DOI: 10.1007/s00778-022-00772-y

Yunkai Lou, Chaokun Wang, Tiankai Gu, Hao Feng, Jun Chen, J. Yu

引用次数: 1

Making graphs compact by lossless contraction. 通过无损收缩使图形紧凑

IF 2.8 2区计算机科学

Vldb Journal Pub Date : 2023-01-01 Epub Date: 2022-02-19 DOI: 10.1007/s00778-022-00731-7

Wenfei Fan, Yuanhao Li, Muyang Liu, Can Lu

{"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}

引用次数: 0

ProS: data series progressive k-NN similarity search and classification with probabilistic quality guarantees 优点:具有概率质量保证的数据序列渐进式k-NN相似性搜索和分类

IF 4.2 2区计算机科学

Vldb Journal Pub Date : 2022-11-30 DOI: 10.1007/s00778-022-00771-z

Karima Echihabi, Theophanis Tsandilas, Anna Gogolou, A. Bezerianos, Themis Palpanas

引用次数: 9

A generic framework for efficient computation of top-k diverse results 一种高效计算top-k不同结果的通用框架

IF 4.2 2区计算机科学

Vldb Journal Pub Date : 2022-11-28 DOI: 10.1007/s00778-022-00770-0

Md Mouinul Islam, Mahsa Asadi, S. Amer-Yahia, Senjuti Basu Roy

引用次数: 1

Augmented lineage: traceability of data analysis including complex UDF processing 增强谱系：数据分析的可追溯性，包括复杂的UDF处理