Ke Yi

According to our database1, Ke Yi authored at least 109 papers between 2001 and 2020.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Infnote: A Decentralized Information Sharing Platform Based on Blockchain.
CoRR, 2020

2019
Output-Optimal Massively Parallel Algorithms for Similarity Joins.
ACM Trans. Database Syst., 2019

Technical Perspective: Online Model Management via Temporally Biased Sampling.
SIGMOD Record, 2019

Communication-Efficient Weighted Sampling and Quantile Summary for GBDT.
CoRR, 2019

Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks.
Algorithmica, 2019

Instance and Output Optimal Parallel Algorithms for Acyclic Joins.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Optimal Sparsity-Sensitive Bounds for Distributed Mean Estimation.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Streaming HyperCube: A Massively Parallel Stream Join Algorithm.
Proceedings of the Advances in Database Technology, 2019

2018
Tight Space Bounds for Two-Dimensional Approximate Range Counting.
ACM Trans. Algorithms, 2018

Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151).
Dagstuhl Manifestos, 2018

Random Sampling over Joins Revisited.
Proceedings of the 2018 International Conference on Management of Data, 2018

Join Algorithms: From External Memory to the BSP.
Proceedings of the 21st International Conference on Database Theory, 2018

2017
On Improving Wireless Channel Utilization: A Collision Tolerance-Based Approach.
IEEE Trans. Mob. Comput., 2017

Wander Join and XDB: Online Aggregation via Random Walks.
SIGMOD Record, 2017

The Communication Complexity of Distributed epsilon-Approximations.
SIAM J. Comput., 2017

Two-Level Sampling for Join Size Estimation.
Proceedings of the 2017 ACM International Conference on Management of Data, 2017

Output-optimal Parallel Algorithms for Similarity Joins.
Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017

TUM: Towards ubiquitous multi-device localization for cross-device interaction.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

2016
R-Trees.
Encyclopedia of Algorithms, 2016

Quantiles over data streams: experimental comparisons, new analyses, and further improvements.
VLDB J., 2016

Exact and approximate flexible aggregate similarity search.
VLDB J., 2016

Counting Triangles in Large Graphs by Random Sampling.
IEEE Trans. Knowl. Data Eng., 2016

Nearest-Neighbor Searching Under Uncertainty II.
ACM Trans. Algorithms, 2016

Research Directions for Principles of Data Management (Abridged).
SIGMOD Record, 2016

Wander Join: Online Aggregation for Joins.
Proceedings of the 2016 International Conference on Management of Data, 2016

Wander Join: Online Aggregation via Random Walks.
Proceedings of the 2016 International Conference on Management of Data, 2016

Towards a Worst-Case I/O-Optimal Algorithm for Acyclic Joins.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Indoor localization via multi-modal sensing on smartphones.
Proceedings of the 2016 ACM International Joint Conference on Pervasive and Ubiquitous Computing, 2016

2015
Spatial Online Sampling and Aggregation.
PVLDB, 2015

Persistent Data Sketching.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

STORM: Spatio-Temporal Online Reasoning and Management of Large Spatio-Temporal Data.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

Piecewise linear approximation of streaming time series data with max-error guarantees.
Proceedings of the 31st IEEE International Conference on Data Engineering, 2015

Enhancing wifi-based localization with visual clues.
Proceedings of the 2015 ACM International Joint Conference on Pervasive and Ubiquitous Computing, 2015

2014
Indexing for summary queries: Theory and practice.
ACM Trans. Database Syst., 2014

Tracking the Frequency Moments at All Times.
CoRR, 2014

Cache-Oblivious Hashing.
Algorithmica, 2014

Robust set reconciliation.
Proceedings of the International Conference on Management of Data, 2014

Equivalence between Priority Queues and Sorting in External Memory.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Mergeable summaries.
ACM Trans. Database Syst., 2013

Efficient external memory structures for range-aggregate queries.
Comput. Geom., 2013

Optimal Tracking of Distributed Heavy Hitters and Quantiles.
Algorithmica, 2013

The Space Complexity of 2-Dimensional Approximate Range Counting.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Quantiles over data streams: an experimental study.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2013

Voice over the dins: Improving wireless channel utilization with collision tolerance.
Proceedings of the 2013 21st IEEE International Conference on Network Protocols, 2013

Streaming Authenticated Data Structures.
Proceedings of the Advances in Cryptology, 2013

2012
Multidimensional online tracking.
ACM Trans. Algorithms, 2012

Range searching on uncertain data.
ACM Trans. Algorithms, 2012

The priority R-tree.
SIGSPATIAL Special, 2012

An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries.
SIAM J. Comput., 2012

Large-Scale Distributed Computation (NII Shonan Meeting 2012-1).
NII Shonan Meet. Rep., 2012

Dynamic Indexability and the Optimality of B-Trees.
J. ACM, 2012

Continuous sampling from distributed streams.
J. ACM, 2012

2011
The World in a Nutshell: Concise Range Queries.
IEEE Trans. Knowl. Data Eng., 2011

Semantics of Ranking Queries for Probabilistic Data.
IEEE Trans. Knowl. Data Eng., 2011

Algorithms for distributed functional monitoring.
ACM Trans. Algorithms, 2011

Building Wavelet Histograms on Large Data in MapReduce.
PVLDB, 2011

Cooperative Incumbent System Protection MAC Protocol for Multi-channel Ad-hoc Cognitive Radio Networks.
TIIS, 2011

Approximate Range Searching in External Memory.
Algorithmica, 2011

Flexible aggregate similarity search.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2011

Sampling based algorithms for quantile computation in sensor networks.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2011

Beyond simple aggregates: indexing for summary queries.
Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

Tracking distributed aggregates over time-based sliding windows.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Optimal sampling algorithms for frequency estimation in distributed data.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011

2010
Top-k queries on temporal data.
VLDB J., 2010

Sliding-window top-k queries on uncertain streams.
VLDB J., 2010

Efficient and accurate nearest neighbor and closest pair search in high-dimensional space.
ACM Trans. Database Syst., 2010

I/O-efficient batched union-find and its applications to terrain analysis.
ACM Trans. Algorithms, 2010

Tree Indexing on Solid State Drives.
PVLDB, 2010

Verifying Computations with Streaming Interactive Proofs.
Electronic Colloquium on Computational Complexity (ECCC), 2010

On the Cell Probe Complexity of Dynamic Membership.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Logging every footstep: quantile summaries for the entire history.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Probabilistic string similarity joins.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Optimal sampling from distributed streams.
Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

Correlation hiding by independence masking.
Proceedings of the 26th International Conference on Data Engineering, 2010

Clustering with Diversity.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

The hardness and approximation algorithms for l-diversity.
Proceedings of the EDBT 2010, 2010

2009
Small synopses for group-by query verification on outsourced data streams.
ACM Trans. Database Syst., 2009

Optimal External Memory Planar Point Enclosure.
Algorithmica, 2009

Dynamic external hashing: the limit of buffering.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Multi-dimensional online tracking.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Quality and efficiency in high dimensional nearest neighbor search.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009

Ranking distributed probabilistic data.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009

Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes.
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Indexing uncertain data.
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

A Concise Representation of Range Queries.
Proceedings of the 25th International Conference on Data Engineering, 2009

Tree Indexing on Flash Disks.
Proceedings of the 25th International Conference on Data Engineering, 2009

Semantics of Ranking Queries for Probabilistic Data and Expected Ranks.
Proceedings of the 25th International Conference on Data Engineering, 2009

2008
R-Trees.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations.
IEEE Trans. Knowl. Data Eng., 2008

A dynamic data structure for top-k queries on uncertain data.
Theor. Comput. Sci., 2008

The priority R-tree: A practically efficient and worst-case optimal R-tree.
ACM Trans. Algorithms, 2008

Sliding-window top-k queries on uncertain streams.
PVLDB, 2008

Dynamic Indexability: The Query-Update Tradeoff for One-Dimensional Range Queries
CoRR, 2008

Finding frequent items in probabilistic data.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Efficient Processing of Top-k Queries in Uncertain Databases.
Proceedings of the 24th International Conference on Data Engineering, 2008

Randomized Synopses for Query Assurance on Data Streams.
Proceedings of the 24th International Conference on Data Engineering, 2008

2007
Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams.
Proceedings of the 33rd International Conference on Very Large Data Bases, 2007

Restricted strip covering and the sensor cover problem.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Dynamic Structures for Top- k Queries on Uncertain Data.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

TerraStream: from elevation data to watershed hierarchies.
Proceedings of the 15th ACM International Symposium on Geographic Information Systems, 2007

2005
Optimal Lexicographic Shaping of Aggregate Streaming Data.
IEEE Trans. Computers, 2005

An optimal dynamic interval stabbing-max data structure?
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data.
Proceedings of the 21st International Conference on Data Engineering, 2005

I/O-Efficient Construction of Constrained Delaunay Triangulations.
Proceedings of the Algorithms, 2005

2004
Incremental Maintenance of XML Structural Indexes.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2004

2003
Efficient Maintenance of Materialized Top-k Views.
Proceedings of the 19th International Conference on Data Engineering, 2003

I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries.
Proceedings of the Algorithms, 2003

2002
Lexicographically optimal smoothing for broadband traffic multiplexing.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001
Experimental evaluation of a variable structure controller for constrained robots.
Int. J. Systems Science, 2001


  Loading...