Gautam Das (computer scientist)
{{Short description|Indian computer scientist}}
{{Use dmy dates|date=February 2023}}
{{Use Indian English|date=February 2023}}
{{Infobox scientist
| name = Gautam Das
| image = Gautam Das.jpg
| caption =
| field = Computer Science
| work_institution = Microsoft Research
Compaq
University of Memphis
University of Texas at Arlington
| alma_mater = University of Wisconsin, Madison
Indian Institute of Technology, Kanpur
| thesis_title = Approximation Schemes in Computational Geometry
| thesis_url = https://dl.acm.org/doi/book/10.5555/917456
| thesis_year = 1990
| doctoral_advisor = Deborah A. Joseph
| website = {{URL|ranger.uta.edu/~gdas}}
| known_for = {{unbulleted list|Databases|Data Mining|Computational Geometry|Algorithms}}
| awards = {{unbulleted list|ACM Fellow|IEEE Fellow}}
}}
Gautam Das{{cite web|url=http://ranger.uta.edu/~gdas/|title=Gautam Das|website=ranger.uta.edu|access-date=19 June 2019}} is a computer scientist in the field of databases research. He is an ACM Fellow (since 2021) and IEEE Fellow (since 2020).
He is a Distinguished University Chair Professor of Computer Science and Engineering, Associate Dean of Research of College of Engineering at the University of Texas at Arlington, and director of the Database Exploration Laboratory (DBXLAB) at the CSE department at UTA. His is known for his work in databases, data mining, computational geometry, and algorithms.
Biography
He graduated with a B.Tech. in computer science from IIT Kanpur, India, and with a Ph.D. in computer science from the University of Wisconsin, Madison. Prior to joining UTA in 2004, Das has held positions at Microsoft Research, Compaq and the University of Memphis.{{Citation needed|date=April 2025}}
Research
Das's early research interests were in computational geometry and graph algorithms. His Ph.D. dissertation{{r|gd1}} made several significant contributions, most notably the discovery of greedy graph spanners{{r|ad2j}}. Greedy spanners – for general weighted graphs as well as in the geometric setting – have been continuously and extensively studied ever since, and have been shown to be almost as good as any other graph spanner in both lightness and edge sparsity.
In the subsequent decades, his research interests broadened to all aspects of Big Data Exploration, including data management, data analytics, machine learning and data mining. He contributed to early research on the intersection of databases and information retrieval, in particular keyword search (e.g., the DBXplorer system{{r|dbxloper}}) and ranked retrieval{{r|rref}} in database systems. Other highlights of his research have been in time series mining{{r|rule}}, approximate query processing{{r|aqp}}, and Deep Web analytics{{r|dwr}}. He is presently working on areas such as machine learning approaches for approximate query processing, and fairness and explainability in data management systems.{{citation needed|date=February 2023}}
His work has received several awards, including the Communications of ACM Research Highlight in 2021{{r|arha}}, Research Highlight Award of SIGMOD 2019, ACM SIGKDD Doctoral Dissertation Award (honorable mention) in 2014 (for his student){{r|sda}}, IEEE ICDE 10-Year Influential Paper award received in 2012{{r|dbxloper}}, and numerous other awards.{{citation needed|date=February 2023}}
Gautam Das has been on the editorial board of the journals ACM TODS and IEEE TKDE. He has served in the organization roles of several major conferences, including as General Chair of ACM SIGMOD/PODS 2018.{{citation needed|date=February 2023}}
See also
References
{{reflist|refs=
| last1 = Das | first1 = Gautam | author1-link = Gautam_Das_(computer_scientist)
| url = http://worldcat.org/oclc/22935858
| title = Approximation schemes in computational geometry
| oclc=22935858
}}
| last1 = Althöfer | first1 = Ingo | author1-link = Ingo Althöfer
| last2 = Das | first2 = Gautam | author2-link = Gautam_Das_(computer_scientist)
| last3 = Dobkin | first3 = David | author3-link = David P. Dobkin
| last4 = Joseph | first4 = Deborah | author4-link = Deborah Joseph
| last5 = Soares | first5 = José
| doi = 10.1007/BF02189308
| issue = 1
| journal = Discrete & Computational Geometry
| mr = 1184695
| pages = 81–100
| title = On sparse spanners of weighted graphs
| volume = 9
| year = 1993| doi-access = free
}}
|last1=Agrawal | first1=Sanjay
|last2=Chaudhuri |first2=Surajit
|last3=Das |first3=Gautam
| title=Proceedings 18th International Conference on Data Engineering
| chapter=DBXplorer: A system for keyword-based search over relational databases
|date=2002
|pages=5–16
|doi=10.1109/ICDE.2002.994693
|citeseerx=10.1.1.114.5479
|isbn=0-7695-1531-2 | s2cid=3832378
}}
| last1=Agrawal | first1=Sanjay
| last2=Chaudhuri |first2=Surajit
| last3=Das |first3=Gautam
| last4=Gionis |first4=Aristides
| title= CIDR 2003, First Biennial Conference on Innovative Data Systems Research, Asilomar, CA, USA, January 5-8, 2003, Online Proceedings
| contribution=Automated Ranking of Database Query Results
| date=2003
| contribution-url=http://cidrdb.org/cidr2003/program/p9.pdf
}}
| last1=Das |first1=Gautam
| last2=Lin |first2=King-Ip
| last3=Mannila |first3=Heikki
| last4=Renganathan |first4=Gopal
| last5=Smyth |first5=Padhraic
| journal = Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98), New York City, New York, US, August 27–31
| title=Rule Discovery from Time Series
| pages=16–22
| date=1998
| url=https://www.aaai.org/Papers/KDD/1998/KDD98-003.pdf
}}
| last1 = Chaudhuri |first1 = Surajit
| last2 = Das |first2 = Gautam
| last3 = R. Narasayya |first3 = Vivek
| title = Optimized stratified sampling for approximate query processing
| journal = ACM Transactions on Database Systems
| volume = 32
| number = 2
| pages = 9
| year = 2007
| url = https://doi.org/10.1145/1242524.1242526
| doi = 10.1145/1242524.1242526
| s2cid = 7211932
| citeseerx= 10.1.1.107.8286
}}
| last1 = Dasgupta |first1 = Arjun
| last2 = Das |first2 = Gautam
| last3 = Mannila |first3 = Heikki
|title = Proceedings of the 2007 ACM SIGMOD international conference on Management of data
|chapter = A random walk approach to sampling hidden databases
| pages = 629–640
| year = 2007
| url = https://doi.org/10.1145/1247480.1247550
| doi = 10.1145/1247480.1247550
| hdl = 10106/96|isbn = 9781595936868
| s2cid = 14078452
| hdl-access = free}}
| last1=Asudeh|first1=Abolfazl
| last2=Augustine|first2=Jees
| last3=Thirumuruganathan|first3=Saravanan
| last4=Nazi|first4=Azade
| last5=Zhang|first5=Nan
| last6=Das|first6=Gautam
| last7=Srivastava|first7=Divesh
| date=2021-01-25
| title=Scalable signal reconstruction for a broad range of applications
| journal=Communications of the ACM
| volume=64
| issue=2
| pages=106–115
| doi=10.1145/3441689
| issn=0001-0782
| doi-access=free
| url=https://figshare.com/articles/journal_contribution/Scalable_signal_reconstruction_for_a_broad_range_of_applications/14869356/1/files/28624848.pdf
}}
| url=https://www.kdd.org/awards/view/2014-sigkdd-dissertation-award-winners
| title=SIGKDD Awards : 2014 SIGKDD Dissertation Award Winners
| website=www.kdd.org
| access-date=19 June 2019
}}
}}
{{Microsoft Research}}
{{Authority control}}
{{DEFAULTSORT:Das, Gauutam}}
Category:University of Wisconsin–Madison alumni
Category:University of Texas at Arlington faculty
Category:Microsoft Research people