发布求助
文献互助 智能选刊 最新文献

Vldb Journal最新文献

筛选
英文 中文
SWOOP: top-k similarity joins over set streams. SWOOP：集合流上的top-k相似连接。
IF 2.8 2区 计算机科学
Vldb Journal Pub Date : 2025-01-01 Epub Date: 2024-12-23 DOI: 10.1007/s00778-024-00880-x
Willi Mann, Nikolaus Augsten, Christian S Jensen, Mateusz Pawlik
{"title":"SWOOP: top-k similarity joins over set streams.","authors":"Willi Mann, Nikolaus Augsten, Christian S Jensen, Mateusz Pawlik","doi":"10.1007/s00778-024-00880-x","DOIUrl":"10.1007/s00778-024-00880-x","url":null,"abstract":"<p><p>We provide efficient support for applications that aim to continuously find pairs of similar sets in rapid streams, such as Twitter streams that emit tweets as sets of words. Using a sliding window model, the top-<i>k</i> result changes as new sets enter the window or existing ones leave the window. Specifically, when a set arrives, it may form a new top-<i>k</i> result pair with any set already in the window. When a set leaves the window, all its pairings in the top-<i>k</i> result must be replaced with other pairs. It is therefore not sufficient to maintain the <i>k</i> most similar pairs since less similar pairs may become top-<i>k</i> pairs later. We propose SWOOP, a highly scalable stream join algorithm. Novel indexing techniques and sophisticated filters efficiently prune obsolete pairs as new sets enter the window. SWOOP incrementally maintains a provably minimal stock of similar pairs to update the top-<i>k</i> result at any time. Empirical studies confirm that SWOOP is able to support stream rates that are orders of magnitude faster than the rates supported by existing approaches.</p>","PeriodicalId":49373,"journal":{"name":"Vldb Journal","volume":"34 1","pages":"13"},"PeriodicalIF":2.8,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11666680/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142899857","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
Optimizing RPQs over a compact graph representation 优化rpq在一个紧凑的图表示
IF 4.2 2区 计算机科学
Vldb Journal Pub Date : 2023-09-07 DOI: 10.1007/s00778-023-00811-2
Diego Arroyuelo, Adrián Gómez-Brandón, A. Hogan, G. Navarro, J. Rojas-Ledesma
{"title":"Optimizing RPQs over a compact graph representation","authors":"Diego Arroyuelo, Adrián Gómez-Brandón, A. Hogan, G. Navarro, J. Rojas-Ledesma","doi":"10.1007/s00778-023-00811-2","DOIUrl":"https://doi.org/10.1007/s00778-023-00811-2","url":null,"abstract":"","PeriodicalId":49373,"journal":{"name":"Vldb Journal","volume":" ","pages":""},"PeriodicalIF":4.2,"publicationDate":"2023-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44150829","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}
引用次数: 0
Cardinality estimation using normalizing flow 使用归一化流的基数估计
IF 4.2 2区 计算机科学
Vldb Journal Pub Date : 2023-08-29 DOI: 10.1007/s00778-023-00808-x
Jiayi Wang, Chengliang Chai, Jiabin Liu, Guoliang Li
{"title":"Cardinality estimation using normalizing flow","authors":"Jiayi Wang, Chengliang Chai, Jiabin Liu, Guoliang Li","doi":"10.1007/s00778-023-00808-x","DOIUrl":"https://doi.org/10.1007/s00778-023-00808-x","url":null,"abstract":"","PeriodicalId":49373,"journal":{"name":"Vldb Journal","volume":" ","pages":""},"PeriodicalIF":4.2,"publicationDate":"2023-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45641911","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}
引用次数: 0
MinJoin++: a fast algorithm for string similarity joins under edit distance MinJoin++：一种编辑距离下字符串相似性联接的快速算法
IF 4.2 2区 计算机科学
Vldb Journal Pub Date : 2023-08-21 DOI: 10.1007/s00778-023-00806-z
Nikolai Karpov, Haoyu Zhang, Qin Zhang
{"title":"MinJoin++: a fast algorithm for string similarity joins under edit distance","authors":"Nikolai Karpov, Haoyu Zhang, Qin Zhang","doi":"10.1007/s00778-023-00806-z","DOIUrl":"https://doi.org/10.1007/s00778-023-00806-z","url":null,"abstract":"","PeriodicalId":49373,"journal":{"name":"Vldb Journal","volume":" ","pages":""},"PeriodicalIF":4.2,"publicationDate":"2023-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45719826","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}
引用次数: 0
Tabular data synthesis with generative adversarial networks: design space and optimizations 具有生成对抗性网络的表格数据合成：设计空间和优化
IF 4.2 2区 计算机科学
Vldb Journal Pub Date : 2023-08-15 DOI: 10.1007/s00778-023-00807-y
Tongyu Liu, Ju Fan, Guoliang Li, Nan Tang, Xiaoyong Du
{"title":"Tabular data synthesis with generative adversarial networks: design space and optimizations","authors":"Tongyu Liu, Ju Fan, Guoliang Li, Nan Tang, Xiaoyong Du","doi":"10.1007/s00778-023-00807-y","DOIUrl":"https://doi.org/10.1007/s00778-023-00807-y","url":null,"abstract":"","PeriodicalId":49373,"journal":{"name":"Vldb Journal","volume":" ","pages":""},"PeriodicalIF":4.2,"publicationDate":"2023-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43778051","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}
引用次数: 1
Quantifying the competitiveness of a dataset in relation to general preferences 量化数据集相对于一般偏好的竞争力
IF 4.2 2区 计算机科学
Vldb Journal Pub Date : 2023-08-08 DOI: 10.1007/s00778-023-00804-1
K. Mouratidis, Keming Li, Bo Tang
{"title":"Quantifying the competitiveness of a dataset in relation to general preferences","authors":"K. Mouratidis, Keming Li, Bo Tang","doi":"10.1007/s00778-023-00804-1","DOIUrl":"https://doi.org/10.1007/s00778-023-00804-1","url":null,"abstract":"","PeriodicalId":49373,"journal":{"name":"Vldb Journal","volume":" ","pages":""},"PeriodicalIF":4.2,"publicationDate":"2023-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46573430","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}
引用次数: 1
Accelerating directed densest subgraph queries with software and hardware approaches 用软件和硬件方法加速定向最密集子图查询
IF 4.2 2区 计算机科学
Vldb Journal Pub Date : 2023-07-31 DOI: 10.1007/s00778-023-00805-0
Chenhao Ma, Yixiang Fang, Reynold Cheng, L. Lakshmanan, Xiaolin Han, Xiaodong Li
{"title":"Accelerating directed densest subgraph queries with software and hardware approaches","authors":"Chenhao Ma, Yixiang Fang, Reynold Cheng, L. Lakshmanan, Xiaolin Han, Xiaodong Li","doi":"10.1007/s00778-023-00805-0","DOIUrl":"https://doi.org/10.1007/s00778-023-00805-0","url":null,"abstract":"","PeriodicalId":49373,"journal":{"name":"Vldb Journal","volume":"38 9","pages":""},"PeriodicalIF":4.2,"publicationDate":"2023-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41306900","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}
引用次数: 0
Coalition-based task assignment with priority-aware fairness in spatial crowdsourcing 空间众包中基于联盟的优先级公平任务分配
IF 4.2 2区 计算机科学
Vldb Journal Pub Date : 2023-07-07 DOI: 10.1007/s00778-023-00802-3
Yan Zhao, Kai Zheng, Ziwei Wang, Liwei Deng, B. Yang, T. Pedersen, Christian S. Jensen, Xiaofang Zhou
{"title":"Coalition-based task assignment with priority-aware fairness in spatial crowdsourcing","authors":"Yan Zhao, Kai Zheng, Ziwei Wang, Liwei Deng, B. Yang, T. Pedersen, Christian S. Jensen, Xiaofang Zhou","doi":"10.1007/s00778-023-00802-3","DOIUrl":"https://doi.org/10.1007/s00778-023-00802-3","url":null,"abstract":"","PeriodicalId":49373,"journal":{"name":"Vldb Journal","volume":" ","pages":""},"PeriodicalIF":4.2,"publicationDate":"2023-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42035332","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}
引用次数: 0
Anytime bottom-up rule learning for large-scale knowledge graph completion 用于大规模知识图完成的任意时间自下而上的规则学习
IF 4.2 2区 计算机科学
Vldb Journal Pub Date : 2023-06-16 DOI: 10.1007/s00778-023-00800-5
Christian Meilicke, M. Chekol, Patrick Betz, Manuel Fink, Heiner Stuckeschmidt
{"title":"Anytime bottom-up rule learning for large-scale knowledge graph completion","authors":"Christian Meilicke, M. Chekol, Patrick Betz, Manuel Fink, Heiner Stuckeschmidt","doi":"10.1007/s00778-023-00800-5","DOIUrl":"https://doi.org/10.1007/s00778-023-00800-5","url":null,"abstract":"","PeriodicalId":49373,"journal":{"name":"Vldb Journal","volume":" ","pages":""},"PeriodicalIF":4.2,"publicationDate":"2023-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47152879","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}
引用次数: 1
BatchHL$$^{+}$$: batch dynamic labelling for distance queries on large-scale networks BatchHL $$^{+}$$:大规模网络上批量动态标注距离查询
IF 4.2 2区 计算机科学
Vldb Journal Pub Date : 2023-06-07 DOI: 10.1007/s00778-023-00799-9
Muhammad Farhan, Henning Koehler, Qing Wang
{"title":"BatchHL$$^{+}$$: batch dynamic labelling for distance queries on large-scale networks","authors":"Muhammad Farhan, Henning Koehler, Qing Wang","doi":"10.1007/s00778-023-00799-9","DOIUrl":"https://doi.org/10.1007/s00778-023-00799-9","url":null,"abstract":"","PeriodicalId":49373,"journal":{"name":"Vldb Journal","volume":" ","pages":""},"PeriodicalIF":4.2,"publicationDate":"2023-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41900702","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}
引用次数: 1
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信