Welcome to D
SIGMOD 2004
PODS 2004
SIGMOD RECOR
CIKM 2004
DASFAA 2004
DBPL 2003
DE-BULLETIN
DEBS 2004
DMKD 2004
DMSN 2004
DOLAP 2004
DPDJ 2004
EDBT 2004
ER 2003
GIS 2004
HDP 2004
HYPERTEXT 20
ICDE 2004
ICDT 2003
JCDL 2004
MDM
MIR 2004
MIS 2004
MMDB 2004
MOBIDE 2003
RIDE 2004
SBBD 2003
SIGIR FORUM
SIGIR 2004
SIGKDD EXPLO
SIGKDD 2004
SSDBM 2004
SSTD 2003
TIME 2004
TODS 2004
VLDB 2004
VLDB Journal
WEBDB 2004
WIDM 2004
XIME-P 2004
Footer

Peter J. Haas

Papers on DiSC'04


A Bi-Level Bernoulli Scheme for Database Sampling

CORDS: Automatic Discovery of Correlations and Soft Functional Dependencies

Automated Statistics Collection in DB2 UDB

CORDS: Automatic Generation of Correlation Statistics in DB2

Publications


Note: Links lead to the DBLP on the Web.

Peter J. Haas

Ihab F. Ilyas , Volker Markl , Peter J. Haas, Paul G. Brown , Ashraf Aboulnaga : Automatic Relationship Discovery in Self-Managing Database Systems. ICAC 2004 : 340-341

Peter J. Haas, Christian Koenig : A Bi-Level Bernoulli Scheme for Database Sampling. SIGMOD Conference 2004 : 275-286

Ihab F. Ilyas , Volker Markl , Peter J. Haas, Paul Brown , Ashraf Aboulnaga : CORDS: Automatic Discovery of Correlations and Soft Functional Dependencies. SIGMOD Conference 2004 : 647-658

Ashraf Aboulnaga , Peter J. Haas, Sam Lightstone , Guy M. Lohman , Volker Markl , Ivan Popivanov , Vijayshankar Raman : Automated Statistics Collection in DB2 UDB. VLDB 2004 : 1146-1157

Ihab F. Ilyas , Volker Markl , Peter J. Haas, Paul G. Brown , Ashraf Aboulnaga : CORDS: Automatic Generation of Correlation Statistics in DB2. VLDB 2004 : 1341-1344

Hervé Brönnimann , Bin Chen , Manoranjan Dash , Peter J. Haas, Peter Scheuermann : Efficient data reduction with EASE. KDD 2003 : 59-68

Rakesh Agrawal , Peter J. Haas, Jerry Kiernan : A System for Watermarking Relational Databases. SIGMOD Conference 2003 : 674

Paul Brown , Peter J. Haas: BHUNT: Automatic Discovery of Fuzzy Algebraic Constraints in Relational Data. VLDB 2003 : 668-679

Rakesh Agrawal , Peter J. Haas, Jerry Kiernan : Watermarking relational data: framework, algorithms and analysis. VLDB J. 12 (2): 157-169 (2003)

Bin Chen , Peter J. Haas, Peter Scheuermann : FAST: A New Sampling-Based Algorithm for Discovering Association Rules. ICDE 2002 : 263

Bin Chen , Peter J. Haas, Peter Scheuermann : A new two-phase sampling based algorithm for discovering association rules. KDD 2002 : 462-468

Gang Luo , Curt Ellmann , Peter J. Haas, Jeffrey F. Naughton : A scalable hash ripple join algorithm. SIGMOD Conference 2002 : 252-262

Peter J. Haas, Peter W. Glynn : On the validity of long-run estimation methods for discrete-event systems. SIGMETRICS Performance Evaluation Review 30 (3): 35-37 (2002)

Peter J. Haas, Joseph M. Hellerstein : Online Query Processing. SIGMOD Conference 2001

Peter J. Haas: Estimation of delays in non-regenerative discrete-event stochastic systems. SIGMETRICS Performance Evaluation Review 28 (4): 36-38 (2001)

Peter J. Haas, Joseph M. Hellerstein : Ripple Joins for Online Aggregation. SIGMOD Conference 1999 : 287-298

Peter J. Haas: Techniques for Online Exploration of Large Object-Relational Datasets. SSDBM 1999 : 4-12

Joseph M. Hellerstein , Ron Avnur , Andy Chou , Christian Hidber , Chris Olston , Vijayshankar Raman , Tali Roth , Peter J. Haas: Interactive data Analysis: The Control Project. IEEE Computer 32 (8): 51-59 (1999)

Peter J. Haas: Estimation Methods for Nonregenerative Stochastic Petri Nets. IEEE Trans. Software Eng. 25 (2): 218-236 (1999)

Joseph M. Hellerstein , Peter J. Haas, Helen J. Wang : Online Aggregation. SIGMOD Conference 1997 : 171-182

Peter J. Haas: Large-Sample and Deterministic Confidence Intervals for Online Aggregation. SSDBM 1997 : 51-63

Daniel Barbará , William DuMouchel , Christos Faloutsos , Peter J. Haas, Joseph M. Hellerstein , Yannis E. Ioannidis , H. V. Jagadish , Theodore Johnson , Raymond T. Ng , Viswanath Poosala , Kenneth A. Ross , Kenneth C. Sevcik : The New Jersey Data Reduction Report. IEEE Data Eng. Bull. 20 (4): 3-45 (1997)

Viswanath Poosala , Yannis E. Ioannidis , Peter J. Haas, Eugene J. Shekita : Improved Histograms for Selectivity Estimation of Range Predicates. SIGMOD Conference 1996 : 294-305

Peter J. Haas, Jeffrey F. Naughton , S. Seshadri , Arun N. Swami : Selectivity and Cost Estimation for Joins Based on Random Sampling. J. Comput. Syst. Sci. 52 (3): 550-569 (1996)

Peter J. Haas, Arun N. Swami : Sampling-Based Selectivity Estimation for Joins Using Augmented Frequent Value Statistics. ICDE 1995 : 522-531

Peter J. Haas, Jeffrey F. Naughton , S. Seshadri , Lynne Stokes : Sampling-Based Estimation of the Number of Distinct Values of an Attribute. VLDB 1995 : 311-322

Peter J. Haas, Paul Christ : Networking Issues in PAGEIN: The "N" of "HPCN". HPCN 1994 : 86-93

Peter J. Haas, Jeffrey F. Naughton , Arun N. Swami : On the Relative Cost of Sampling for Join Selectivity Estimation. PODS 1994 : 14-24

Peter J. Haas, Jeffrey F. Naughton , S. Seshadri , Arun N. Swami : Fixed-Precision Estimation of Join Selectivity. PODS 1993 : 190-201

Peter J. Haas, Arun N. Swami : Sequential Sampling Procedures for Query Size Estimation. SIGMOD Conference 1992 : 341-350

Peter J. Haas, Gerald S. Shedler : Stochastic Petri Net Representation of Discrete Event Simulations. IEEE Trans. Software Eng. 15 (4): 381-393 (1989)

Peter J. Haas, Gerald S. Shedler : Stochastic Petri Nets with Simultaneous Transition Firings. PNPM 1987 : 24-33

Peter J. Haas, Gerald S. Shedler : Regenerative Stochastic Petri Nets. Perform. Eval. 6 (3): 189-204 (1986)

Peter J. Haas, Gerald S. Shedler : Regenerative Simulation of Stochastic Petri Nets. PNPM 1985 : 14-21

Peter J. Haas, Gerald S. Shedler : Regenerative Simulation Methods for Local Area Computer Networks. IBM Journal of Research and Development 29 (2): 194-205 (1985)

1 [ 31 ] [ 32 ] [ 33 ] [ 35 ]

2 [ 27 ] [ 29 ]

3 [ 18 ]

4 [ 14 ]

5 [ 30 ]

6 [ 28 ] [ 33 ]

7 [ 31 ] [ 35 ]

8 [ 25 ] [ 26 ] [ 30 ]

9 [ 18 ]

10 [ 9 ]

11 [ 30 ]

12 [ 14 ]

13 [ 24 ]

14 [ 14 ]

15 [ 23 ]

16 [ 14 ] [ 16 ] [ 18 ] [ 20 ] [ 22 ]

17 [ 18 ]

18 [ 31 ] [ 33 ] [ 35 ]

19 [ 13 ] [ 14 ]

20 [ 14 ]

21 [ 14 ]

22 [ 27 ] [ 29 ]

23 [ 34 ]

24 [ 32 ]

25 [ 32 ]

26 [ 24 ]

27 [ 31 ] [ 32 ] [ 33 ] [ 35 ]

28 [ 7 ] [ 8 ] [ 10 ] [ 12 ] [ 24 ]

29 [ 14 ]

30 [ 18 ]

31 [ 13 ] [ 14 ]

32 [ 32 ]

33 [ 18 ] [ 32 ]

34 [ 14 ]

35 [ 18 ]

36 [ 25 ] [ 26 ] [ 30 ]

37 [ 7 ] [ 10 ] [ 12 ]

38 [ 14 ]

39 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ]

40 [ 13 ]

41 [ 10 ]

42 [ 6 ] [ 7 ] [ 8 ] [ 11 ] [ 12 ]

43 [ 16 ]




©2005 Association for Computing Machinery