移至標頭
移至導覽
移至內部
移至註腳
登入
幫助
English
研究資源
CUHK UPDates
論文庫
專家名錄
使用指引
關於我們
研究人員名單
> Professor Yufei TAO
主頁
研究成果
研究人員專頁
學系學部專頁
研究範圍
陶宇飛教授
個人資料
職位/學系
教授
,
計算機科學與工程學系
ORCiD
0000-0003-3883-5452
中大研究成果
1/3
I/O-Efficient 2-d Orthogonal Range Skyline and Attrition Priority Queues
(
2021
)
A Simple Parallel Algorithm for Natural Joins on Binary Relations
(
2020
)
From Online to Non-i.i.d. Batch Learning
(
2020
)
Packing R-Trees with Space-Filling Curves: Theoretical Optimality, Empirical Efficiency, and Bulk-Loading Parallelizability
(
2020
)
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
(
2020
)
A Guide to Designing Top-k Indexes
(
2019
)
Building an Optimal Point-Location Structure in O(sort(n)) I/Os
(
2019
)
Distribution-Sensitive Bounds on Relative Approximations of Geometric Ranges
(
2019
)
Interactive Graph Search
(
2019
)
Output-Optimal Massively Parallel Algorithms for Similarity Joins
(
2019
)
Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks
(
2018
)
Entity Matching with Active Monotone Classification
(
2018
)
Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space
(
2018
)
Massively Parallel Entity Matching with Linear Classification in Low Dimensional Space
(
2018
)
Overlap Set Similarity Joins with Theoretical Guarantees
(
2018
)
Semi-Group Range Sum Revisited: Query-Space Lower Bound Tightened
(
2018
)
Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability
(
2018
)
Dynamic Density Based Clustering
(
2017
)
On the hardness and approximation of euclidean DBSCAN
(
2017
)
Output-optimal parallel algorithms for similarity joins
(
2017
)
Stream sampling over windows with worst-case optimality and ℓ-overlap independence
(
2017
)
Efficient Top-k Indexing via General Reductions
(
2016
)
Exact and approximate flexible aggregate similarity search
(
2016
)
I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration
(
2016
)
Range Thresholding on Streams
(
2016
)
DBSCAN revisited: Mis-claim, un-fixability, and approximation
(
2015
)
Distributed online tracking
(
2015
)
External Memory Stream Sampling
(
2015
)
Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration
(
2015
)
On Top-k Range Reporting in 2D Space
(
2015
)
The I/O Complexity of Dynamic Distinct Counting
(
2015
)
A dynamic I/O-efficient structure for one-dimensional top-k range reporting
(
2014
)
Concurrent range reporting in two-dimensional space
(
2014
)
Fast nearest neighbor search with keywords
(
2014
)
Finding approximate partitions and splitters in external memory
(
2014
)
Independent range sampling
(
2014
)
Instance-level worst-case query bounds on R-trees
(
2014
)
Instance-level worst-case query bounds on R-trees
(
2014
)
I/O-efficient algorithms on triangle listing and counting
(
2014
)
I/O-efficient bundled range aggregation
(
2014
)
Maximizing Range Sum in External Memory
(
2014
)
Range aggregation with set selection
(
2014
)
Shortest Unique Queries on Strings
(
2014
)
Approximate maxrs in spatial databases
(
2013
)
Clustering uncertain data based on probability distribution similarity
(
2013
)
I/O-efficient planar range skyline and attrition priority queues
(
2013
)
Massive graph triangulation
(
2013
)
Minimal MapReduce algorithms
(
2013
)
Optimal splitters for temporal and multi-version databases
(
2013
)
Output-sensitive skyline algorithms in external memory
(
2013
)
分享連結
上次更新時間 2020-14-06 於 06:36
分享連結
您的名稱*
您的電子郵件*
收件者名稱*
收件者電子郵件*
訊息
Auxilliary Information
不會儲存任何資訊或與任何第三方分享資訊。
Cancel
Our policy towards the use of cookies
All Clarivate Analytics websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.
Ok to Continue
Cookie Policy
