首頁
聯系我們
EN
首頁
科(kē)學研究
創新理(lǐ)論
有界計(jì)算理(lǐ)論
近似計(jì)算理(lǐ)論
并行可(kě)擴展理(lǐ)論
增量計(jì)算理(lǐ)論
跨模融合計(jì)算理(lǐ)論
大(dà)數據質量保證模型與方法
邏輯+AI
大(dà)數據計(jì)算複雜性理(lǐ)論
論文發表
知識産權
産品與解決方案
崖山(shān)DB
采石矶
釣魚城(chéng)
新聞中心
綜合新聞
科(kē)研動态
媒體(tǐ)宣傳
通知公告
關于我們
研究院概況
組織架構
聯系我們
招納賢才
基礎研究招聘
博士後招聘
社會招聘
校(xiào)園招聘
文化黨建
信息公開
科(kē)學研究
創新理(lǐ)論
論文發表
知識産權
首頁
·
科(kē)學研究
·
創新理(lǐ)論
Wang Yue
有界計(jì)算理(lǐ)論
研究簡介
在大(dà)數據環境下,我們要處理(lǐ)PB級乃至EB級數據,量級達10的15次方乃至18次方,計(jì)算成本過于高昂, 這讓大(dà)多數中小企業對大(dà)數據計(jì)算依然可(kě)望而不可(kě)及。我們緻力于重新構建一套資源受限下的大(dà)數據查詢處理(lǐ)框架,把大(dà)數據變小,讓資源受限的中小企業也能享受大(dà)數據帶來(lái)的便利。
研究領域
多數計(jì)算不需要訪問(wèn)全部數據,隻需要取其中的小數據集就(jiù)能得(de)到我們想要的答案。我們正在建立基于訪問(wèn)約束的有界計(jì)算模型與理(lǐ)論,把大(dà)數據計(jì)算規約成小數據上的處理(lǐ); 針對不同計(jì)算問(wèn)題,設計(jì)基于訪問(wèn)約束的小數據識别方法;研究訪問(wèn)約束的自(zì)動挖掘和動态維護算法;研究基于非行式數據庫存儲的有界計(jì)算模型。 依托有界計(jì)算所研發的大(dà)數據實時分(fēn)析系統YashanDB,經實測,可(kě)提高通信數據查詢速度25-10萬倍(5個數量級),極大(dà)地節約了計(jì)算資源。
最新相(xiàng)關發表
A Hierarchical Contraction Scheme for Querying Big Graphs
Wenfei Fan, Yuanhao Li, Muyang Liu, Can Lu.
ACM SIGMOD Conference on Management of Data (SIGMOD), 2022
Publishing Graphs under Node Differential Privacy.
Xun Jian, Yue Wang, Lei Chen.
IEEE Transactions on Knowledge and Data Engineering(TKDE 2021)
Interactive Search for One of the Top-k
Weicheng Wang, Raymond Chi-Wing Wong, Min Xie
"ACM Conference on Management of Data (SIGMOD 2021),June 20-25,2021, Xi'an, Shaanxi, China"
Making Graphs Compact by Lossless Contraction
WenFeiFan, YuanHaoLi, MuYangLiu, CanLu
ACM Conference on Management of Data (SIGMOD 2021),June 20-25,2021, Xi'an, Shanxi, China
Dynamic Inference In Probabilistic Graphical Models
WeimingFeng, KunHe, XiaomingSun, YitongYin
12th Innovations in Theoretical Computer Science Conference (ITCS 2021)
New versions of Lovasz Local Lemma and their applications
Kun He, Xiaoming Sun
SCIENCE CHINA Information Sciences (SCIS 2020)
Finding Large Diverse Communities on Networks: The Edge Maximum k*-Partite Clique
Alexander Zhou, Yue Wang, Lei Chen
International Conference on Very Large Data Bases (VLDB 2020) International
Optimizing DNN Computation Graph using Graph Substitutions
Jingzhi Fang, Yanyan Shen, Yue Wang, Lei Chen
International Conference on Very Large Data Bases (VLDB 2020), Aug 31- Sept 4, 2020, Tokyo, Japan
Approximate Single-Peakedness in Large Elections
Zhihuai Chen, Qian Li, Xiaoming Sun, Lirong Xia, and Jialin Zhang
IEEE International Conference on Knowledge Graph (ICKG 2020), Aug 9-11, 2020, Nanjing, China
Tight Bounds for Popping Algorithms
Heng Guo, Kun He
RANDOM STRUCTURES & ALGORITHMS
On the Optimality of Tape Merge of Two Lists with Similar Size
Qian Li, Xiaoming Sun, Jialin Zhang
Algorithmica
Efficient Query Autocompletion with Edit Distance-based Error Tolerance
Jianbin Qin, Chuan Xiao, Sheng Hu, Jie Zhang, Wei Wang, Yoshiharu Ishikawa, Koji Tsuda, Kunihiko Sadakane
VLDB Journal(VLDBJ)
Autocompletion for Prefix-Abbreviated Input
Sheng Hu, Chuan Xiao, Jianbin Qin, Yoshiharu Ishikawa, Qiang Ma
ACM Conference on Management of Data(SIGMOD 2019), June 30 - July 5, 2019, Amsterdam, The Netherlands
Making Big Data Small
Wenfei Fan
Royal Society A: Mathematical, physical and engineering sciences
Generalizing the Pigeonhole Principle for Similarity Search in Hamming Space
Jianbin Qin, Chuan Xiao, Yaoshu Wang, Wei Wang, Xuemin Lin, Yoshiharu Ishikawa, Guoren Wang
IEEE Transactions on Knowledge and Data Engineering(TKDE 2019)