| 1998 | ||
|---|---|---|
| j7 | G. D. Ramkumar, Arun N. Swami: Clustering Data Without Distance Functions. IEEE Data Eng. Bull. 21(1): 9-14 (1998) | |
| 1997 | ||
| c22 | ||
| c21 | ||
| 1996 | ||
| j6 | 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) | |
| 1995 | ||
| j5 | Maurice A. W. Houtsma, Arun N. Swami: Set-Oriented Data Mining in relational Databases. Data Knowl. Eng. 17(3): 245-262 (1995) | |
| j4 | Arun N. Swami, K. Bernhard Schiefer: Estimating Page Fetches for Index Scans with Finite LRU Buffers. VLDB J. 4(4): 675-701 (1995) | |
| c20 | Rakesh Agrawal, Arun N. Swami: A One-Pass Space-Efficient Algorithm for Finding Quantiles. COMAD 1995: 0- | |
| c19 | Maurice A. W. Houtsma, Arun N. Swami: Set-Oriented Mining for Association Rules in Relational Databases. ICDE 1995: 25-33 | |
| c18 | ||
| c17 | Peter J. Haas, Arun N. Swami: Sampling-Based Selectivity Estimation for Joins Using Augmented Frequent Value Statistics. ICDE 1995: 522-531 | |
| c16 | Honesty C. Young, Arun N. Swami: The parameterized Round-Robin partitioned algorithm for parallel external sort. IPPS 1995: 213- | |
| 1994 | ||
| j3 | Antoine N. Mourad, Robert J. T. Morris, Arun N. Swami, Honesty C. Young: Limits of Parallelism in Hash Join Algorithms. Perform. Eval. 20(1-3): 301-316 (1994) | |
| c15 | ||
| c14 | Peter J. Haas, Jeffrey F. Naughton, Arun N. Swami: On the Relative Cost of Sampling for Join Selectivity Estimation. PODS 1994: 14-24 | |
| c13 | Arun N. Swami, K. Bernhard Schiefer: Estimating Page Fetches for Index Scans with Finite LRU Buffers. SIGMOD Conference 1994: 173-184 | |
| c12 | Rakesh Agrawal, Michael J. Carey, Christos Faloutsos, Sakti P. Ghosh, Maurice A. W. Houtsma, Tomasz Imielinski, Balakrishna R. Iyer, A. Mahboob, H. Miranda, Ramakrishnan Srikant, Arun N. Swami: Quest: A Project on Database Mining. SIGMOD Conference 1994: 514 | |
| 1993 | ||
| j2 | Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami: Database Mining: A Performance Perspective. IEEE Trans. Knowl. Data Eng. 5(6): 914-925 (1993) | |
| c11 | Rakesh Agrawal, Christos Faloutsos, Arun N. Swami: Efficient Similarity Search In Sequence Databases. FODO 1993: 69-84 | |
| c10 | Arun N. Swami, Balakrishna R. Iyer: A Polynomial Time Algorithm for Optimizing Join Queries. ICDE 1993: 345-354 | |
| c9 | Arun N. Swami, Honesty C. Young: Online Algorithms for Handling Skew in Parallel Joins. ICPP 1993: 253-257 | |
| c8 | Peter J. Haas, Jeffrey F. Naughton, S. Seshadri, Arun N. Swami: Fixed-Precision Estimation of Join Selectivity. PODS 1993: 190-201 | |
| c7 | Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami: Mining Association Rules between Sets of Items in Large Databases. SIGMOD Conference 1993: 207-216 | |
| 1992 | ||
| j1 | Arun N. Swami, Honesty C. Young, Ashish Gupta: Algorithms for Handling Skew in Parallel Task Scheduling. J. Parallel Distrib. Comput. 16(4): 363-377 (1992) | |
| c6 | Arun N. Swami, Honesty C. Young: Algorithms for Handling Skew in Parallel Task Scheduling. RIDE-TQP 1992: 61-68 | |
| c5 | Peter J. Haas, Arun N. Swami: Sequential Sampling Procedures for Query Size Estimation. SIGMOD Conference 1992: 341-350 | |
| c4 | Rakesh Agrawal, Sakti P. Ghosh, Tomasz Imielinski, Balakrishna R. Iyer, Arun N. Swami: An Interval Classifier for Database Mining Applications. VLDB 1992: 560-573 | |
| 1989 | ||
| b1 | Arun N. Swami: Optimization of Large Join Queries. Stanford University, Department of Computer Science 1989 | |
| c3 | ||
| c2 | Arun N. Swami: Optimization of Large Join Queries: Combining Heuristic and Combinatorial Techniques. SIGMOD Conference 1989: 367-376 | |
| 1988 | ||
| c1 | ||
Data released under the ODC-BY 1.0 license — See also our legal information page