CORC  > 天津大学
Near-accurate Multiset Reconciliation
Luo, L.a; Guo, D.a,b; Zhao, X.a,c; Wu, J.d; Rottenstreich, O.e; Luo, X.a
刊名IEEE Transactions on Knowledge & Data Engineering
2019
卷号Vol.31 No.5页码:952-964
关键词Computational Complexity Data Handling Data Structures Probability Set Theory Counting Bloom Filter Hash Collisions Time Complexity CBF Based Method Near Accurate Multiset Reconciliation Probabilistic Data Structures Communication Friendly Design Rationales Set Synchronization Data Structures Proposals Probabilistic Logic Peer To Peer Computing Synchronization Cloud Computing Force Multiset Reconciliation Trie Fenwick Tree Counting Bloom Filter
URL标识查看原文
内容类型期刊论文
URI标识http://www.corc.org.cn/handle/1471x/2895613
专题天津大学
作者单位1.aScience and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Hunan, 410073, China
2.bTianjin Key Laboratory of Advanced Networking, School of Computer Science and Technology, Tianjin University, Tianjin, 300350, China
3.cCollaborative Innovation Center of Geospatial Technology, Hubei, 430079, China
4.dDepartment of Computer and Information Science, College of Science and Technology, Temple University, Philadelphia, PA 19122, United States
5.eOrbs Research and Technion, Tel Aviv-Yafo, 320003, Israel
推荐引用方式
GB/T 7714
Luo, L.a,Guo, D.a,b,Zhao, X.a,c,et al. Near-accurate Multiset Reconciliation[J]. IEEE Transactions on Knowledge & Data Engineering,2019,Vol.31 No.5:952-964.
APA Luo, L.a,Guo, D.a,b,Zhao, X.a,c,Wu, J.d,Rottenstreich, O.e,&Luo, X.a.(2019).Near-accurate Multiset Reconciliation.IEEE Transactions on Knowledge & Data Engineering,Vol.31 No.5,952-964.
MLA Luo, L.a,et al."Near-accurate Multiset Reconciliation".IEEE Transactions on Knowledge & Data Engineering Vol.31 No.5(2019):952-964.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace