|
|
Yuanyuan Tian B1 431 email: ytian [at] us [dot] ibm [dot] com |
| Research | Publications | Software | Resume | Links | Album | Hobbies |
|
News:
[+] Yuanyuan is back from SIGMOD (July 2, 2009). |
Yuanyuan is currently a Research Staff Member at IBM Almaden Research Center. She received her PhD degree in Computer Science & Engineering from University of Michigan in 2008, under the guidance of Prof. Jignesh M. Patel. She got her MS degree in Computer Science & Engineering from the University of Michigan in 2005 and BS degree in Computer Science & Technology with honor from Peking University in 2003.ResearchYuanyuan's research focuses on scalable analytics on cloud, including designing distributed indexes and efficient join algorithms for log processing on the MapReduce platform. She also works on efficient querying of non-traditional data, particularly graph and sequence data. Her PhD work mainly constitutes the graph querying (GQ) part of the Periscope Project. The tools produced from her research have been widely applied in the National Center for Integrative Biomedical Informatics (NCIBI). PublicationsConference and Journal Papers Michigan Molecular Interactions R2:
From Interacting Proteins to Pathways
[PDF] Periscope/GQ: A Graph Querying
Toolkit [PDF] Efficient Aggregation for Graph
Summarization [PDF] [Presentation
Slides] TALE: A Tool for Approximate Large Graph Matching [PDF] [Extended
Version] [Presentation Slides] Posters SAGA: A Subgraph Matching
Tool for Biological Graphs
[Poster
Abstract] [Poster] Efficient Filtering and
Routing in a Scalable XML-Based Publish-Subscribe System
[Tech Report] [Poster] SAGA: A Fast and Flexible Graph Matching Tool ResumeLinks Research: SAGA, Periscope, Jaql Paper Writing: LaTeX Tips, TeXnik Algorithms: Algorithm Design Manual, A Compendium of NP Optimization Problems, Algorithms and Software for Partitioning Graphs C++ STL Reference: Module Reference, STL Programmer's Guide Graph Visualization Tools: Graphviz, Guess Last updated on 07/03/2009. ©2003-2009 Yuanyuan Tian. |