Gagan Agrawal

Prof. Gagan Agrawal

School of Computer and Cyber Sciences, Augusta University, 100 Grace Hopper Lane, RV-1606 Augusta, GA 30901, USA

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2017 in Applied Thermal Engineering
Verified
Journal Article
Closed access
JJJeswin Joseph
Jeswin Joseph
GAGagan Agrawal
Gagan Agrawal
DADeepak Kumar Agarwal
Deepak Kumar Agarwal
JPJ.C. Pisharady
J.C. Pisharady
SKS. Sunil Kumar
S. Sunil Kumar

29 October 2005 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
RJRuoming Jin
Ruoming Jin
AGAnjan Goswami
Anjan Goswami
GAGagan Agrawal
Gagan Agrawal

24 November 2011 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
WMWenjing Ma
Wenjing Ma
SKSriram Krishnamoorthy
Sriram Krishnamoorthy
OVOreste Villa
Oreste Villa
KKKarol Kowalski
Karol Kowalski
GAGagan Agrawal
Gagan Agrawal

25 July 2015
Verified
Book Chapter
Closed access
PDF file
TBTekin Bicer
Tekin Bicer
DGDoga Gursoy
Doga Gursoy
RKRajkumar Kettimuthu
Rajkumar Kettimuthu
FCFrancesco De Carlo
Francesco De Carlo
GAGagan Agrawal
Gagan Agrawal
IFIan Foster
Ian Foster

30 August 2014
Verified
Book Chapter
Closed access
PDF file
VLVictor E. Lee
Victor E. Lee
RJRuoming Jin
Ruoming Jin
GAGagan Agrawal
Gagan Agrawal

21 March 2011
Verified
Conference Paper
Open access
Fan WangFan Wang
Fan Wang
GAGagan Agrawal
Gagan Agrawal
A large part of the data on the World Wide Web resides in the deep web. Executing structured, high-level queries on deep web data sources involves a number of challenges, several of which arise because query execution engines have a very limited access to data. In this paper, we consider the problem of executing aggregation queries involving data enumeration on these data sources, which requires sampling. The existing work in this area (HDSampler and its variants) is based on simple random sampling. We observe that this approach cannot obtain good estimates when the data is skewed. While there has been a lot of work on sampling skewed data, the existing methods are based on prior knowledge of data, and are therefore not applicable to hidden databases. In this paper, we present two prior-knowledge-free sampling algorithms, Adaptive Neighborhood Sampling (ANS) and Two Phase adaptive Sampling (TPS), which allow an aggregation query to be answered with a high accuracy (even when there is a skew), and a low sampling cost. For this purpose, we have developed robust estimators for aggregation functions including AVG, MAX, and MIN. Our experiments show that for data with a moderate or a large skew, ANS and TPS yield more accurate estimates, outperforming HDSampler by a factor of 4 on the average. Even for the cases where data has a small skew, our TPS method has an important advantage, which is that it has only one-third of the sampling costs of HDSampler.