About Me

Hi, my name is Yin Lin (林茵 in Chinese). I am a Ph.D. candidate in the Computer Science and Engineering Department at the University of Michigan, Ann Arbor. I consider myself fortunate to be advised by Dr. H. V. Jagadish. I am a member of the Database group. My current research focuses on data equality system preventing misuse and misinterpretation of big data.


I got my bachelor's degree from Shanghai Jiao Tong University under the supervision of Dr. Xiaofeng Gao.



Outside of my research and work, I love playing the GO game, badminton and running. I completed the Yangzhou half-marathon in 2016. I also like to play Zheng (A traditional Chinese instrument) and guitar! You can know more about my personal interests in my photo site.

    What's new!
  • Our paper ``Identifying Insufficient Data Coverage in Databases with Multiple Relations'' has been accepted in VLDB 2020.

Publications

1. Identifying Insufficient Data Coverage in Databases with Multiple Relations (pdf)


Yin Lin, Yifan Guan, Abolfazl Asudeh, H. V. Jagadish

VLDB 2020

2. MithraDetective: A System for Cherry-picked Trendlines Detection (pdf)


Yoko Nagafuchi, Yin Lin, Kaushal Mamgain, Abolfazl Asudeh, HV Jagadish, You (Will) Wu, Cong Yu

CoRR, 2020, Arxiv/2010.08807

3. On Structural vs. Proximity-based Temporal Node Embeddings (pdf)


Puja Trivedi, Alican Büyükçakır, Yin Lin, Yinlong Qian, Di Jin, Danai Koutra

MLG 2020

4. R2-Tree: An Efficient Indexing Scheme for Server-Centric Data Center Networks (pdf)


Yin Lin, Xinyi Chen, Xiaofeng , Guihai Chen

DEXA 2018


Education

Ph.D. student: Sept. 2019 - present

University of Michigan

Computer Science and Engineering (CSE)


Bachelor: Sept. 2015 - June 2019

Shanghai Jiao Tong University

Computer Science, School of Electronic Information and Electrical Engineering ( CS )


Summer Intern (2018.07-2018.10)

University of Waterloo

Software Architecture Group, David R. Cheriton School of Computer Science
Supervisor:Dr. Meiyappan Nagappan

Teaching

Teaching Assistant for CS 499, Mathematical Foundations of Computer Science (Spring 2018), Shanghai Jiao Tong University

Selected Projects

Identifying Insufficient Data Coverage in Databases with Multiple Relations
UMich, advised by Prof. H. V. Jagadish, Sept. 2019 - July 2020


We provide an efficient approach for coverage analysis, given a set of attributes across multiple tables. To identify regions with insufficient coverage in the combinatorially large set of value combinations, we design an index scheme to avoid explicit table joins, achieve efficient memory usage, and support predicate combination at a high level of parallelism. We also propose P-WALK, a priority-based search algorithm, to traverse the lattice space. Since in practice, coverage assessment typically does not require precise COUNT aggregation results, we further present approximate methods to reduce computation time.


R2-Tree data center indexing scheme
SJTU, advised by Prof. Xiaofeng Gao, Jun. 2016 - July 2017


R2-Tree is a scalable data center indexing scheme for high dimensional data. It follows the two layer indexing framework where we maintain a global index layer above the structured overlay. We use R-Tree to support both point and range query. Besides, bloom fliter is also realized to reduce the false possitive in the querying process. The experiments are conducted in Amazon's EC2 platform.

Scholarships and Awards

Outstanding Undergraduate in Shanghai Jiao Tong University

National Scholarship for Studying Abroad, China Scholarship Council

Chun Tsung Scholar from Shanghai Jiao Tong University ( top 50 in SJTU)