Fall 2004

List of Suggested Papers
Mon Sep 6 13:11:20 EDT 2004


Overview of Data Streams

1 Continuous Queries over Data Streams

by S. Babu, J. Widom

In SIGMOD Record, September 2001

2 NiagaraCQ: A Scalable Continuous Query System for Internet Databases

by J. Chen, D. DeWitt, F. Tian, Y. Wang

In Proc. of the 2000 ACM SIGMOD Intnl. Conf. on Management of data

Data Mining on Data Streams

3 Mining High-Speed Data Streams

by P. Domingos, G. Hulten

In Sixth International Conference on Knowledge Discovery and Data Mining 2000

4 Online Data Mining for Co-Evolving Time Sequences

by B. Yi, N. Sidiropoulos, T. Johnson, H. Jagadish, C. Faloutso, A. Biliris

In ICDE 2000

5 Mining Time-Changing Data Streams

by G. Hulten, L. Spencer, P. Domingos

In Seventh International Conference on Knowledge Discovery and Data Mining 2001

Hidden Web

6 Crawling the Hidden Web

by S. Raghavan, H. Garcia-Molina

In VLDB 2001

7 Probe, Count, and Classify: Categorizing Hidden-Web Databases

by P. Ipeirotis, L. Gravano, M. Sahami

In SIGMOD 2000

Caching Dynamic Web Content

8 Form-Based Proxy Caching for Database-Backed Web Sites

by Q. Luo, J. Naughton

In VLDB 2001

9 Enabling Dynamic Content Caching for Database-Driven Web Sites

by K.S. Candan, W-S. Li, Q. Luo, W-P. Hsiung, D. Agrawal

In SIGMOD 2001

Spatio-Temporal Databases

10 Moving Databases: Issues and Solutions

by O. Wolfson, B. Xu, S. Chamberlain, L. Jiang

In SSDBM 1998

11 Capturing the Uncertainty of Moving-Object Representations

by D. Pfoser, C. Jensen

In SSD 1999

Peer-to-Peer Systems

12 What Can Databases do for Peer-to-Peer?

by S. Gribble, A. Halevy, Z. Ives, M. Rodrig, D. Suciu

In WebDB 2001

13 Storage management and caching in PAST, a large-scale, persistent

by A. Rowston, P. Druschel

In SOSP 2001

14 Chapter 1: A Network of Peers

by N. Minar, M. Hedlund

In Peer-to-Peer: Harnessing the Power of Disruptive Technologies (O'Reilly)

15 Comparing Hybrid Peer-to-Peer Systems

by B. Yang, H. Garcia-Molina

In VLDB 2001

Data Replication

16 Design and Evaluation of a Continuous Consistency Model for Replicated Services

by H. Yu, A. Vahdat

In OSDI 2000

17 Efficient Numerical Error Bounding for Replicated Network Services

by H. Yu, A. Vahdat

In VLDB 2000

18 Flexible Update Propagation for Weakly Consistent Replication

by K. Petersen, M.J. Spreitzer, D.B. Terry, M.M. Theimer, A.J. Demers

In SOSP-16 1997

Data Mining Distributed Sources

19 Toward a Theoretical Framework for Analysis and Synthesis of Agents that Learn from Distributed Dynamic Data Sources

by D. Caragea, A. Silvescu, V. Honavar

In Distributed and Parallel Knowledge Discovery 2000

20 An approach to online Bayesian learning from multiple data streams

by R. Chen, K. Sivakumar, H. Kargupta

In IEEE International Conference of Data Mining

21 Distributed Data Clustering can be Efficient and Exact

by G. Forman, B. Zhang

In SIGKDD Explorations Volumn 2 Issue 2

Intrusion Detection in Mobile Sensor Networks

22 Next Century Challenges: Scalable Coordination in Sensor Networks

by D. Estrin, R. Govindan, J. Heidermann, S. Kumar

In ACM/IEEE International Conference on Mobile Computing and Networking, August 1999

23 Intrusion Detection in Wireless Ad-Hoc Networks

by Y. Zhang, W. Lee

In Sixth Annual International Conference IEEE International Conference on Mobile Computing and Networking (MobiCom 2000)

Data Approximation

24 Quasi-Cubes: A space-efficient way to support approximate multidimensiona

by D. Barbara, M. Sullivan

In Technical Report, ISE Dept., George Mason University, 1998

25 NetCube: A Scalable Tool for Fast Data Mining and Compression

by D. Margaritis, C. Faloutsos, S. Thrun

In VLDB 2001


Back to the DBchat page.

adeli at umiacs.umd.edu