• 06/12-08/12: Research Intern at Yahoo! Research, Barcelona, Spain.

• 04/12: Tutorial titled "Emerging Graph Queries In Linked Data" presented in ICDE 2012.

• 04/12: Paper titled "Find Skyline Nodes in Large Networks" presented in the 3rd International Workshop on Graph Data Management: Techniques and Applications (GDM 2012).

• 03/12: Received NSF ICDE 2012 Scholarship.

• 02/12: Received IBM Ph.D. Fellowship Award 2012-13 .

• 02/12: Paper titled "Workload Characterization and Prediction in the Cloud: A Multiple Time Series Approach" accepted in CloudMan 2012 workshop.

• 01/12: Paper titled "Towards Effective Partition Management for Large Graphs" accepted in SIGMOD 2012.

• 11/11: Invited paper titled "Find Skyline Nodes in Large Networks" accepted in the 3rd International Workshop on Graph Data Management: Techniques and Applications (GDM 2012).

• 11/11: Invited Talk "Novel Graph Queries in Large Networks" at IIT Guwahati (on 12/21/2011).

• 10/11: Tutorial titled "Emerging Graph Queries In Linked Data" accepted in ICDE 2012.

• 08/11: Attended KDD 2011 in San Diego, California, USA.

• 07/11-08/11: Mentored an undergraduate student in a research project under INSET program, CNS, UCSB.

• 06/11: Presented paper titled "Neighborhood Based Fast Graph Search in Large Networks" in SIGMOD 2011, Athens, Greece.

• 04/11: Presented paper titled "On Flow Authority Discovery in Social Networks" in SDM 2011, Phoenix, Arizona, USA.

• 04/11: Received the SDM Student Travel Award to attend the SDM Conference 2011 in Phoenix, Arizona, USA.

• 02/11: Paper titled "Neighborhood Based Fast Graph Search in Large Networks" accepted in SIGMOD 2011.

• 12/10: Paper titled "On Flow Authority Discovery in Social Networks" accepted in SDM 2011.

• 06/10-10/10: Research Intern at IBM TJ Watson, Hawthorne, NY.

• 06/10: Presented paper titled "Towards Proximity Pattern Mining in Large Graphs" in SIGMOD 2010, Indianapolis, Indiana, USA.

• 04/10: Received the P1 Fellowship Award for FALL 2010 from the Dept. of Computer Science, UCSB.

• 03/10: Passed the Major Area Examination in Dept. of Computer Science, UCSB.

• 01/10: Paper titled "Towards Proximity Pattern Mining in Large Graphs" accepted in SIGMOD 2010.

I am a fourth Year PhD Candidate of the Department of Computer Science, University of California, Santa Barbara. I am currently working with Prof. Xifeng Yan on graph querying. I am also a member of the Information Network Academic Research Center. I completed my BE (Bachelor of Engineering) from the Department of Computer Science and Engineering, Jadavpur University, India in 2008.

My reaserch interest lies in Graph Querying and Mining, Data Mining, Machine Learning, Algorithms, and Social Networks. My current research work is focused on querying of large-scale, semi-structured and heterogeneous network data. In the domain of semi-structured data, e.g., DBpedia, Online Government Records, Social networks, there exist relations between two entities. However, such relations are not very strict or typed, unlike the relational data. In other words, usually there is no standardized schema for the semi-structured data. Thus, without knowing the exact structure of the data and the semantics of the entity attributes and their relationships, can we still query them and get the relevent results? In our current work, we propose a graph-based query processing system, where both the input data and query are modeled as graphs; and we perform neighborhood-based subgraph matching for answering queries. [more]

Visitor