default search action
Arun N. Swami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1989
- [b1]Arun N. Swami:
Optimization of Large Join Queries. Stanford University, Department of Computer Science, 1989
Journal Articles
- 1998
- [j7]G. D. Ramkumar, Arun N. Swami:
Clustering Data Without Distance Functions. IEEE Data Eng. Bull. 21(1): 9-14 (1998) - 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) - 1994
- [j3]Antoine N. Mourad, Robert J. T. Morris
, Arun N. Swami, Honesty C. Young:
Limits of Parallelism in Hash Join Algorithms. Perform. Evaluation 20(1-3): 301-316 (1994) - 1993
- [j2]Rakesh Agrawal, Tomasz Imielinski, Arun N. Swami:
Database Mining: A Performance Perspective. IEEE Trans. Knowl. Data Eng. 5(6): 914-925 (1993) - 1992
- [j1]Arun N. Swami, Honesty C. Young, Ashish Gupta:
Algorithms for Handling Skew in Parallel Task Scheduling. J. Parallel Distributed Comput. 16(4): 363-377 (1992)
Conference and Workshop Papers
- 1997
- [c22]Arun N. Swami, Brian Lent:
Sharing Processing in Data Mining System. DMKD 1997 - [c21]Brian Lent, Arun N. Swami, Jennifer Widom:
Clustering Association Rules. ICDE 1997: 220-231 - 1995
- [c20]Rakesh Agrawal, Arun N. Swami:
A One-Pass Space-Efficient Algorithm for Finding Quantiles. COMAD 1995 - [c19]Maurice A. W. Houtsma, Arun N. Swami:
Set-Oriented Mining for Association Rules in Relational Databases. ICDE 1995: 25-33 - [c18]Praveen Seshadri, Arun N. Swami:
Generalized Partial Indexes. ICDE 1995: 420-427 - [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-219 - 1994
- [c15]Arun N. Swami, K. Bernhard Schiefer:
On the Estimation of Join Result Sizes. EDBT 1994: 287-300 - [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
Quest: A Project on Database Mining. SIGMOD Conference 1994: 514 - 1993
- [c11]Rakesh Agrawal, Christos Faloutsos
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 (3) 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
- [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
- [c3]Arun N. Swami:
A Validated Cost Model for Main Memory Databases. SIGMETRICS 1989: 235 - [c2]Arun N. Swami:
Optimization of Large Join Queries: Combining Heuristic and Combinatorial Techniques. SIGMOD Conference 1989: 367-376 - 1988
- [c1]Arun N. Swami, Anoop Gupta:
Optimization of Large Join Queries. SIGMOD Conference 1988: 8-17
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: