Schedule for Seminar on Massive Data Sets

Please look frequently at the special announcements.

If you would like copies of papers presented here, send a request to matias+seminar@math.tau.ac.il

Association rules and their generalizations

24/3/98

  • Fast Algorithms for Mining Association Rules
    R. Agrawal and R. Srikant.
    Proc. of the 20th Int'l Conference on Very Large Databases, Santiago, Chile, Sept. 1994. Expanded version available as IBM Research Report RJ9839, June 1994.
    Lecturer: Rami Citrom

  • Dynamic Itemset Counting and Implication Rules for Market Basket Data
    S. Brin, R. Motwani, J.D. Ullman, S. Tsur.
    1997 ACM SIGMOD Conference on Management of Data, 1997, pp. 255-264.
    Lecturer: Ranen Goren

    31/3/98

  • Sampling large databases for association rules
    H. Toivonen
    Proc. of the Int'l Conf. on Very Large Data Bases (VLDB), 1996.
    Lecturer: Amitai Irron

    The presentation is available in ppt; handouts are given in doc.

  • Beyond Market Baskets: Generalizing Association Rules to Correlations.
    S. Brin, R. Motwani and C. Silverstein.
    1997 ACM SIGMOD Conference on Management of Data, 1997, pp. 265-276. Data Mining and Knowledge Discovery, 1998.
    Lecturer: Micky Frankel

    Time Sequences

    7/4/98

  • Efficiently supporting AD Hoc Queries in Large databases of Time sequences.
    F. Korn, H.V. Jagadish, and C. Faloutsos,
    Proc. SIGMOD, 1997.
    Lecturer: Zipi Fligelman

  • Efficient Retrieval of Similar Time Sequences Under Time Warping
    B.-K. Yi, H.V. Jagadish, C. Faloutsos,
    Proc. ICDE, 1998.
    Lecturer: Zipi Fligelman

    A summary is available here.

    14/4/98

    Happy Passover!

    Histograms

    21/4/98

  • Improved Histograms for Selectivity Estimation of Range Predicates.
    V. Poosala, Y.E. Ioannidis, P.J. Haas and E.J. Shekita,
    Proc. 1996 ACM SIGMOD Intl. Conf. Managment of Data, pages 294-305, 1996.
    Lecturer: Ran Shaham

    The presentation is available in doc.

  • Fast Incremental Maintenance of Approximate Histograms.
    P.B. Gibbons, Y. Matias and V. Poosala,
    Proceedings of the 23rd International Conference on Very Large Databases (VLDB), Athens, Greece, August 1997, pp. 466-475.
    Lecturer: Uri Stav

    Special Talk (note the unusual schedule)

    22/4/98, 2:15-3:15

  • Compressing Finite Strings: Optimal algorithms for non-asymptotic/non-probabilistic data
    Guest Lecturer: Dr. S. Cenk Sahinalp

    Histograms (cont.)

    28/4/98

  • Approximate Order Statistics in One Pass and with Limited Memory
    Sridhar Rajagopalan, Gurmeet Singh Manku, and Bruce Lindsay
    Proc. ACM SIGMOD, 1998 (to appear).
    Lecturer: Gil Arditi

    The presentation is available in doc.

    5/5/98

  • Wavelet-Based Histograms for Selectivity Estimation.
    Y. Matias, J. S. Vitter, and M. Wang.
    Proc. of the 1998 ACM SIGMOD International Conference on Management of Data (SIGMOD '98), Seattle, Washington, June 1998 (to appear).
    Lecturer: Ran Adler

    Clustering techniques

    12/5/98

  • BIRCH: an Efficient Data Clustering Method for Very Large Databases.
    T. Zhang, R. Ramakrishnan and M. Livny,
    Proc. 1996 SIGMOD, pp. 103-114, 1996.
    See also the BIRCH project home page
    Lecturer: Boaz Shaham

    The presentation is available in ppt.

  • CURE: An Efficient Clustering Algorithm for Large Databases.
    S. Guha, R. Rastogi and K. Shim.
    Proc. of the ACM SIGMOD Conference, 1998.
    Lecturer: Yakov Zakai

    The presentation is available in doc.

    Index Trees

    19/5/98

  • Generalized Search Trees for Database Systems.
    J.M. Hellerstein, J.F. Naughton, and A. Pfeffer.
    Proc. 21st International Conference on Very Large Data Bases (VLDB), Zurich, September 1995.
    See also the GIST project home page
    Lecturer: Assaf Almaz
    The speaker will also present indexing problems and solutions from (real-life) products related to massive document processing.

    The presentation is available in doc.

    Parallel and External Memory Algorithms

    26/5/98

  • Asynchronous Parallel Algorithms for Mining Association Rules on a Shared-memory Multi-processors
    D.W. Cheung, K. Hu, and S. Xia.
    Proc. SPAA, 1998. Proc. 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '98), (to appear) June 1998
    Lecturer: Saar Cohen

  • Simple Randomized Mergesort on Parallel Disks
    R. Barve, E. F. Grove and J. S. Vitter.
    Proc. 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '96), Padua, Italy, June 1996, 109-118.
    Lecturer: Ido Safruti

    The presentation is available in doc.

    2/6/98

    No Seminar.

    9/6/98

    High-Performance Sorting on Networks of Workstations
    A. C. Arpaci-Dusseau, R. H. Arpaci-Dusseau, D. E. Culler, J. M. Hellerstein, D. A. Patterson.
    Proc. of the ACM SIGMOD Conference, 1997.
    Lecturer: Nadav Grossaug

    Return to seminar home page

    For requests or corrections contact matias+seminar@math.tau.ac.il
    Last updated June 7, 1998