| |
      |
                                          |
Note: Links lead to the DBLP on the Web. Mayur Datar Gagan Aggarwal , Mayur Datar, Sridhar Rajagopalan , Matthias Ruhl : On the Streaming Model Augmented with a Sorting Primitive. FOCS 2004 : 540-549 Gagan Aggarwal , Mayur Datar, Nina Mishra , Rajeev Motwani : On Identifying Stable Ways to Configure Systems. ICAC 2004 : 148-153 Brian Babcock , Mayur Datar, Rajeev Motwani : Load Shedding for Aggregation Queries over Data Streams. ICDE 2004 : 350-361 Mayur Datar, Nicole Immorlica , Piotr Indyk , Vahab S. Mirrokni : Locality-sensitive hashing scheme based on p-stable distributions. Symposium on Computational Geometry 2004 : 253-262 Surajit Chaudhuri , Mayur Datar, Vivek R. Narasayya : Index Selection for Databases: A Hardness Study and a Principled Heuristic Solution. IEEE Trans. Knowl. Data Eng. 16 (11): 1313-1323 (2004) Brian Babcock , Shivnath Babu , Mayur Datar, Rajeev Motwani , Dilys Thomas : Operator scheduling in data stream systems. VLDB J. 13 (4): 333-353 (2004) Rajeev Motwani , Jennifer Widom , Arvind Arasu , Brian Babcock , Shivnath Babu , Mayur Datar, Gurmeet Singh Manku , Chris Olston , Justin Rosenstein , Rohit Varma : Query Processing, Approximation, and Resource Management in a Data Stream Management System. CIDR 2003 Brian Babcock , Mayur Datar, Rajeev Motwani , Liadan O'Callaghan : Maintaining variance and k-medians over data stream windows. PODS 2003 : 234-243 Brian Babcock , Shivnath Babu , Mayur Datar, Rajeev Motwani : Chain : Operator Scheduling for Memory Minimization in Data Stream Systems. SIGMOD Conference 2003 : 253-264 Arvind Arasu , Brian Babcock , Shivnath Babu , Mayur Datar, Keith Ito , Itaru Nishizawa , Justin Rosenstein , Jennifer Widom : STREAM: The Stanford Stream Data Manager. SIGMOD Conference 2003 : 665 Arvind Arasu , Brian Babcock , Shivnath Babu , Mayur Datar, Keith Ito , Rajeev Motwani , Itaru Nishizawa , Utkarsh Srivastava , Dilys Thomas , Rohit Varma , Jennifer Widom : STREAM: The Stanford Stream Data Manager. IEEE Data Eng. Bull. 26 (1): 19-26 (2003) Graham Cormode , Mayur Datar, Piotr Indyk , S. Muthukrishnan : Comparing Data Streams Using Hamming Norms (How to Zero In). IEEE Trans. Knowl. Data Eng. 15 (3): 529-540 (2003) Mayur Datar, Tomás Feder , Aristides Gionis , Rajeev Motwani , Rina Panigrahy : A combinatorial algorithm for MAX CSP. Inf. Process. Lett. 85 (6): 307-315 (2003) Mayur Datar: Butterflies and Peer-to-Peer Networks. ESA 2002 : 310-322 Mayur Datar, S. Muthukrishnan : Estimating Rarity and Similarity over Data Stream Windows. ESA 2002 : 323-334 Brian Babcock , Shivnath Babu , Mayur Datar, Rajeev Motwani , Jennifer Widom : Models and Issues in Data Stream Systems. PODS 2002 : 1-16 Brian Babcock , Mayur Datar, Rajeev Motwani : Sampling from a moving window over streaming data. SODA 2002 : 633-634 Mayur Datar, Aristides Gionis , Piotr Indyk , Rajeev Motwani : Maintaining stream statistics over sliding windows (extended abstract). SODA 2002 : 635-644 Graham Cormode , Mayur Datar, Piotr Indyk , S. Muthukrishnan : Comparing Data Streams Using Hamming Norms (How to Zero In). VLDB 2002 : 335-345 Mayur Datar, Aristides Gionis , Piotr Indyk , Rajeev Motwani : Maintaining Stream Statistics over Sliding Windows. SIAM J. Comput. 31 (6): 1794-1813 (2002) Surajit Chaudhuri , Gautam Das , Mayur Datar, Rajeev Motwani , Vivek R. Narasayya : Overcoming Limitations of Sampling for Aggregation Queries. ICDE 2001 : 534-542 Edith Cohen , Mayur Datar, Shinji Fujiwara , Aristides Gionis , Piotr Indyk , Rajeev Motwani , Jeffrey D. Ullman , Cheng Yang : Finding Interesting Associations without Support Pruning. IEEE Trans. Knowl. Data Eng. 13 (1): 64-78 (2001) Edith Cohen , Mayur Datar, Shinji Fujiwara , Aristides Gionis , Piotr Indyk , Rajeev Motwani , Jeffrey D. Ullman , Cheng Yang : Finding Interesting Associations without Support Pruning. ICDE 2000 : 489-499 Mayur Datar, Abhiram G. Ranade : Commuting with delay prone buses. SODA 2000 : 22-29 1 [ 23 ] [ 24 ] 2 [ 14 ] [ 15 ] [ 18 ] 3 [ 8 ] [ 9 ] [ 14 ] [ 15 ] [ 16 ] [ 17 ] [ 18 ] [ 19 ] [ 22 ] 4 [ 9 ] [ 14 ] [ 15 ] [ 16 ] [ 18 ] [ 19 ] 5 [ 4 ] [ 20 ] 6 [ 2 ] [ 3 ] 7 [ 6 ] [ 13 ] 8 [ 4 ] 9 [ 12 ] 10 [ 2 ] [ 3 ] 11 [ 2 ] [ 3 ] [ 5 ] [ 7 ] [ 12 ] 12 [ 21 ] 13 [ 2 ] [ 3 ] [ 5 ] [ 6 ] [ 7 ] [ 13 ] [ 21 ] 14 [ 14 ] [ 15 ] 15 [ 18 ] 16 [ 21 ] 17 [ 23 ] 18 [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 7 ] [ 8 ] [ 9 ] [ 12 ] [ 14 ] [ 16 ] [ 17 ] [ 18 ] [ 19 ] [ 22 ] [ 23 ] 19 [ 6 ] [ 10 ] [ 13 ] 20 [ 4 ] [ 20 ] 21 [ 14 ] [ 15 ] 22 [ 17 ] 23 [ 18 ] 24 [ 12 ] 25 [ 24 ] 26 [ 1 ] 27 [ 15 ] [ 18 ] 28 [ 24 ] 29 [ 14 ] 30 [ 14 ] [ 19 ] 31 [ 2 ] [ 3 ] 32 [ 14 ] [ 18 ] 33 [ 9 ] [ 14 ] [ 15 ] [ 18 ] 34 [ 2 ] [ 3 ]  ©2005 Association for Computing Machinery |
