The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Arun N. Swami: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami
    Mining Association Rules between Sets of Items in Large Databases. [Citation Graph (111, 7)][DBLP]
    SIGMOD Conference, 1993, pp:207-216 [Conf]
  2. Rakesh Agrawal, Christos Faloutsos, Arun N. Swami
    Efficient Similarity Search In Sequence Databases. [Citation Graph (43, 0)][DBLP]
    FODO, 1993, pp:69-84 [Conf]
  3. Rakesh Agrawal, Sakti P. Ghosh, Tomasz Imielinski, Balakrishna R. Iyer, Arun N. Swami
    An Interval Classifier for Database Mining Applications. [Citation Graph (40, 6)][DBLP]
    VLDB, 1992, pp:560-573 [Conf]
  4. Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami
    Database Mining: A Performance Perspective. [Citation Graph (40, 7)][DBLP]
    IEEE Trans. Knowl. Data Eng., 1993, v:5, n:6, pp:914-925 [Journal]
  5. Arun N. Swami, Anoop Gupta
    Optimization of Large Join Queries. [Citation Graph (39, 8)][DBLP]
    SIGMOD Conference, 1988, pp:8-17 [Conf]
  6. Arun N. Swami
    Optimization of Large Join Queries: Combining Heuristic and Combinatorial Techniques. [Citation Graph (35, 9)][DBLP]
    SIGMOD Conference, 1989, pp:367-376 [Conf]
  7. Peter J. Haas, Arun N. Swami
    Sequential Sampling Procedures for Query Size Estimation. [Citation Graph (28, 10)][DBLP]
    SIGMOD Conference, 1992, pp:341-350 [Conf]
  8. Maurice A. W. Houtsma, Arun N. Swami
    Set-Oriented Mining for Association Rules in Relational Databases. [Citation Graph (16, 11)][DBLP]
    ICDE, 1995, pp:25-33 [Conf]
  9. Peter J. Haas, Jeffrey F. Naughton, S. Seshadri, Arun N. Swami
    Selectivity and Cost Estimation for Joins Based on Random Sampling. [Citation Graph (9, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:3, pp:550-569 [Journal]
  10. Arun N. Swami, Balakrishna R. Iyer
    A Polynomial Time Algorithm for Optimizing Join Queries. [Citation Graph (7, 8)][DBLP]
    ICDE, 1993, pp:345-354 [Conf]
  11. Peter J. Haas, Arun N. Swami
    Sampling-Based Selectivity Estimation for Joins Using Augmented Frequent Value Statistics. [Citation Graph (6, 10)][DBLP]
    ICDE, 1995, pp:522-531 [Conf]
  12. Brian Lent, Arun N. Swami, Jennifer Widom
    Clustering Association Rules. [Citation Graph (6, 11)][DBLP]
    ICDE, 1997, pp:220-231 [Conf]
  13. Peter J. Haas, Jeffrey F. Naughton, Arun N. Swami
    On the Relative Cost of Sampling for Join Selectivity Estimation. [Citation Graph (6, 12)][DBLP]
    PODS, 1994, pp:14-24 [Conf]
  14. Peter J. Haas, Jeffrey F. Naughton, S. Seshadri, Arun N. Swami
    Fixed-Precision Estimation of Join Selectivity. [Citation Graph (5, 8)][DBLP]
    PODS, 1993, pp:190-201 [Conf]
  15. Rakesh Agrawal, Arun N. Swami
    A One-Pass Space-Efficient Algorithm for Finding Quantiles. [Citation Graph (3, 0)][DBLP]
    COMAD, 1995, pp:0-0 [Conf]
  16. Arun N. Swami, K. Bernhard Schiefer
    On the Estimation of Join Result Sizes. [Citation Graph (3, 13)][DBLP]
    EDBT, 1994, pp:287-300 [Conf]
  17. Arun N. Swami
    A Validated Cost Model for Main Memory Databases. [Citation Graph (3, 0)][DBLP]
    SIGMETRICS, 1989, pp:235- [Conf]
  18. G. D. Ramkumar, Arun N. Swami
    Clustering Data Without Distance Functions. [Citation Graph (2, 7)][DBLP]
    IEEE Data Eng. Bull., 1998, v:21, n:1, pp:9-14 [Journal]
  19. Praveen Seshadri, Arun N. Swami
    Generalized Partial Indexes. [Citation Graph (1, 6)][DBLP]
    ICDE, 1995, pp:420-427 [Conf]
  20. 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. [Citation Graph (1, 4)][DBLP]
    SIGMOD Conference, 1994, pp:514- [Conf]
  21. Arun N. Swami, Brian Lent
    Sharing Processing in Data Mining System. [Citation Graph (0, 0)][DBLP]
    DMKD, 1997, pp:0-0 [Conf]
  22. Arun N. Swami, Honesty C. Young
    Online Algorithms for Handling Skew in Parallel Joins. [Citation Graph (0, 0)][DBLP]
    ICPP, 1993, pp:253-257 [Conf]
  23. Honesty C. Young, Arun N. Swami
    The parameterized Round-Robin partitioned algorithm for parallel external sort. [Citation Graph (0, 0)][DBLP]
    IPPS, 1995, pp:213-0 [Conf]
  24. Arun N. Swami, Honesty C. Young
    Algorithms for Handling Skew in Parallel Task Scheduling. [Citation Graph (0, 0)][DBLP]
    RIDE-TQP, 1992, pp:61-68 [Conf]
  25. Arun N. Swami, K. Bernhard Schiefer
    Estimating Page Fetches for Index Scans with Finite LRU Buffers. [Citation Graph (0, 9)][DBLP]
    SIGMOD Conference, 1994, pp:173-184 [Conf]
  26. Maurice A. W. Houtsma, Arun N. Swami
    Set-Oriented Data Mining in relational Databases. [Citation Graph (0, 0)][DBLP]
    Data Knowl. Eng., 1995, v:17, n:3, pp:245-262 [Journal]
  27. Arun N. Swami, Honesty C. Young, Ashish Gupta
    Algorithms for Handling Skew in Parallel Task Scheduling. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1992, v:16, n:4, pp:363-377 [Journal]
  28. Antoine N. Mourad, Robert J. T. Morris, Arun N. Swami, Honesty C. Young
    Limits of Parallelism in Hash Join Algorithms. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 1994, v:20, n:1-3, pp:301-316 [Journal]
  29. Arun N. Swami, K. Bernhard Schiefer
    Estimating Page Fetches for Index Scans with Finite LRU Buffers [Citation Graph (0, 8)][DBLP]
    VLDB J., 1995, v:4, n:4, pp:675-701 [Journal]

Search in 0.016secs, Finished in 0.017secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002