Welcome to D
SIGMOD 2003
PODS 2003
SIGMOD-RECOR
ADBIS
CIDR 2003
CIKM 2003
DASFAA 2003
Data Enginee
DEBS
DMKD 2003
DOLAP 2003
DPDJ 2003
ER
GIS 2003
Hypertext 20
ICDE 2003
ICDM 2003
ICDT 2003
JCDL 2003
KRDB 2003
MIR 2003
MIS 2003
MMDB 2003
RIDE 2003
SBBD 2003
SIGIR 2003
SIGIR-FORUM
SIGKDD 2003
SIGKDD-EXP
SSDBM 2003
TIME 2003
TODS
VLDB 2003
VLDB Journal
WIDM 2003
About DiSC 2
Editorial Bo
Acknowledgem
DiSC 2004 Pr
ADVIS
DiSC'04 Feed
DiSC'04 Site
Search DiSC'
<<<Author Index>>>
Copyright No

Mayur Datar

Papers on DiSC'04


Chain : Operator Scheduling for Memory Minimization in Data Stream Systems

STREAM: The Stanford Stream Data Manager

Maintaining variance and k-medians over data stream windows

Query Processing, Approximation, and Resource Management in a Data Stream Management System

STREAM: The Stanford Stream Data Manager

Publications


Note: Links lead to the DBLP on the Web.

Mayur Datar

Brian Babcock , Mayur Datar, Rajeev Motwani : Load Shedding for Aggregation Queries over Data Streams. ICDE 2004 : 350-361

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 , U. Srivastava , D. 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 [ 14 ] [ 15 ] [ 18 ]

2 [ 8 ] [ 9 ] [ 14 ] [ 15 ] [ 16 ] [ 17 ] [ 18 ] [ 19 ]

3 [ 9 ] [ 14 ] [ 15 ] [ 16 ] [ 18 ]

4 [ 4 ]

5 [ 2 ] [ 3 ]

6 [ 6 ] [ 13 ]

7 [ 4 ]

8 [ 12 ]

9 [ 2 ] [ 3 ]

10 [ 2 ] [ 3 ] [ 5 ] [ 7 ] [ 12 ]

11 [ 2 ] [ 3 ] [ 5 ] [ 6 ] [ 7 ] [ 13 ]

12 [ 14 ] [ 15 ]

13 [ 18 ]

14 [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 7 ] [ 8 ] [ 9 ] [ 12 ] [ 14 ] [ 16 ] [ 17 ] [ 18 ] [ 19 ]

15 [ 6 ] [ 10 ] [ 13 ]

16 [ 4 ]

17 [ 14 ] [ 15 ]

18 [ 17 ]

19 [ 18 ]

20 [ 12 ]

21 [ 1 ]

22 [ 15 ] [ 18 ]

23 [ 14 ]

24 [ 14 ]

25 [ 2 ] [ 3 ]

26 [ 14 ] [ 18 ]

27 [ 9 ] [ 14 ] [ 15 ] [ 18 ]

28 [ 2 ] [ 3 ]




©2004 Association for Computing Machinery