![]() | 2009 | |
---|---|---|
43 | ![]() ![]() ![]() ![]() ![]() ![]() | Ke Yi, Xiang Lian, Feifei Li, Lei Chen: A Concise Representation of Range Queries. ICDE 2009: 1179-1182 |
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Yinan Li, Bingsheng He, Qiong Luo, Ke Yi: Tree Indexing on Flash Disks. ICDE 2009: 1303-1306 |
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Graham Cormode, Feifei Li, Ke Yi: Semantics of Ranking Queries for Probabilistic Data and Expected Ranks. ICDE 2009: 305-316 |
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Pankaj K. Agarwal, Siu-Wing Cheng, Yufei Tao, Ke Yi: Indexing uncertain data. PODS 2009: 137-146 |
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Ke Yi, Qin Zhang: Optimal tracking of distributed heavy hitters and quantiles. PODS 2009: 167-174 |
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Ke Yi: Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes. PODS 2009: 187-196 |
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Feifei Li, Ke Yi, Jeffrey Jestes: Ranking distributed probabilistic data. SIGMOD Conference 2009: 361-374 |
36 | ![]() ![]() ![]() ![]() ![]() ![]() | Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis: Quality and efficiency in high dimensional nearest neighbor search. SIGMOD Conference 2009: 563-576 |
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Ke Yi, Qin Zhang: Multi-dimensional online tracking. SODA 2009: 1098-1107 |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | Zhewei Wei, Ke Yi, Qin Zhang: Dynamic external hashing: the limit of buffering. SPAA 2009: 253-259 |
33 | ![]() ![]() ![]() ![]() ![]() ![]() | Ke Yi, Feifei Li, Graham Cormode, Marios Hadjieleftheriou, George Kollios, Divesh Srivastava: Small synopses for group-by query verification on outsourced data streams. ACM Trans. Database Syst. 34(3): (2009) |
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Lars Arge, Vasilis Samoladas, Ke Yi: Optimal External Memory Planar Point Enclosure. Algorithmica 54(3): 337-352 (2009) |
31 | ![]() ![]() ![]() ![]() ![]() ![]() | Xiaokui Xiao, Ke Yi, Yufei Tao: The Hardness and Approximation Algorithms for L-Diversity CoRR abs/0912.5426: (2009) |
2008 | ||
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Ke Yi, Feifei Li, George Kollios, Divesh Srivastava: Efficient Processing of Top-k Queries in Uncertain Databases. ICDE 2008: 1406-1408 |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Ke Yi, Feifei Li, Marios Hadjieleftheriou, George Kollios, Divesh Srivastava: Randomized Synopses for Query Assurance on Data Streams. ICDE 2008: 416-425 |
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Qin Zhang, Feifei Li, Ke Yi: Finding frequent items in probabilistic data. SIGMOD Conference 2008: 819-832 |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Graham Cormode, S. Muthukrishnan, Ke Yi: Algorithms for distributed functional monitoring. SODA 2008: 1076-1085 |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | Ke Yi: R-Trees. Encyclopedia of Algorithms 2008 |
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi: The priority R-tree: A practically efficient and worst-case optimal R-tree. ACM Transactions on Algorithms 4(1): (2008) |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Zhewei Wei, Ke Yi, Qin Zhang: Dynamic External Hashing: The Limit of Buffering CoRR abs/0811.3062: (2008) |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Ke Yi: Dynamic Indexability: The Query-Update Tradeoff for One-Dimensional Range Queries CoRR abs/0811.4346: (2008) |
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Ke Yi, Qin Zhang: Optimal Tracking of Distributed Heavy Hitters and Quantiles CoRR abs/0812.0209: (2008) |
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Ke Yi, Feifei Li, George Kollios, Divesh Srivastava: Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations. IEEE Trans. Knowl. Data Eng. 20(12): 1669-1682 (2008) |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Cheqing Jin, Ke Yi, Lei Chen, Jeffrey Xu Yu, Xuemin Lin: Sliding-window top-k queries on uncertain streams. PVLDB 1(1): 301-312 (2008) |
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Jiang Chen, Ke Yi: A dynamic data structure for top-k queries on uncertain data. Theor. Comput. Sci. 407(1-3): 310-317 (2008) |
2007 | ||
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Andrew Danner, Thomas Mølhave, Ke Yi, Pankaj K. Agarwal, Lars Arge, Helena Mitásová: TerraStream: from elevation data to watershed hierarchies. GIS 2007: 28 |
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Jiang Chen, Ke Yi: Dynamic Structures for Top- k Queries on Uncertain Data. ISAAC 2007: 427-438 |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | Micha Streppel, Ke Yi: Approximate Range Searching in External Memory. ISAAC 2007: 536-548 |
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi: Restricted strip covering and the sensor cover problem. SODA 2007: 1056-1063 |
14 | ![]() ![]() ![]() ![]() ![]() ![]() | Feifei Li, Ke Yi, Marios Hadjieleftheriou, George Kollios: Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams. VLDB 2007: 147-158 |
2006 | ||
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Pankaj K. Agarwal, Lars Arge, Ke Yi: I/O-efficient batched union-find and its applications to terrain analysis. Symposium on Computational Geometry 2006: 167-176 |
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh Venkatasubramanian, Ke Yi: Restricted Strip Covering and the Sensor Cover Problem CoRR abs/cs/0605102: (2006) |
2005 | ||
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Pankaj K. Agarwal, Lars Arge, Ke Yi: I/O-Efficient Construction of Constrained Delaunay Triangulations. ESA 2005: 355-366 |
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Adam Silberstein, Hao He, Ke Yi, Jun Yang: BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data. ICDE 2005: 285-296 |
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Pankaj K. Agarwal, Lars Arge, Ke Yi: An optimal dynamic interval stabbing-max data structure? SODA 2005: 803-812 |
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Stergios V. Anastasiadis, Peter J. Varman, Jeffrey Scott Vitter, Ke Yi: Optimal Lexicographic Shaping of Aggregate Streaming Data. IEEE Trans. Computers 54(4): 398-408 (2005) |
2004 | ||
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi: The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. Cache-Oblivious and Cache-Aware Algorithms 2004 |
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Lars Arge, Vasilis Samoladas, Ke Yi: Optimal External Memory Planar Point Enclosure. ESA 2004: 40-52 |
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi: The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. SIGMOD Conference 2004: 347-358 |
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Ke Yi, Hao He, Ioana Stanoi, Jun Yang: Incremental Maintenance of XML Structural Indexes. SIGMOD Conference 2004: 491-502 |
2003 | ||
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Pankaj K. Agarwal, Lars Arge, Jun Yang, Ke Yi: I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. ESA 2003: 7-18 |
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Ke Yi, Hai Yu, Jun Yang, Gangqiang Xia, Yuguo Chen: Efficient Maintenance of Materialized Top-k Views. ICDE 2003: 189-200 |
2002 | ||
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Stergios V. Anastasiadis, Peter J. Varman, Jeffrey Scott Vitter, Ke Yi: Lexicographically optimal smoothing for broadband traffic multiplexing. PODC 2002: 68-77 |