Contact

Mo Zhou

PhD Candidate of Computer Science

Indiana University Bloomington


Email: mozhou(at umail.iu.edu)

Office: Lindley Hall 401A



Research

I am a Computer Science PhD candidate at Indiana University, Bloomington. I am a member of Database Lab and supervised by Prof. Wu.

My research is on efficiently storing and querying graph data, as well as exploring new search methods on graph data in various domains, such as bioinformatics, cheminformatics, healthinformatics and social networks. I am also interested in parallel data processing and cloud computing.

The Semantic Web draw our interest as its quick development and wide usage. To efficiently store and query data on the Semantic Web (known as RDF data), we proposed a new RDF data storage and query evaluation framework that can maximally take advantage of the existing sophisticated XML technologies, such as structural join and index, while keeping the flexibility of the graph data model of RDF data. Our results showed that our framework can minimize data redundancy without losing structural information and thus can lead to efficient storage and query evaluation. Moreover the framework can take advantage of workload to greatly enhance the query locality that futher improves the query efficiency.

Our in-depth study of many domains and applications using graph data model, e.g. bioinformatics, cheminformatics, healthinformatics and social networks, showed a great need of searching associations (paths) between two nodes under constraints on nodes and/or edges. We formally defined a new type of search, CAP (Constraint Acyclic Path) search to feature the constraints that were confirmed to be critical by the domain experts. Moreover we proposed a new query language cSPARQL to integrate the new features of the CAP search into the framework of structural query language, SPARQL. Finally we proposed two families of algorithms that can efficiently answer the core CAP search query.

Future research directions include but not limited to parallel CAP search query answering and cSPARQL query optimization.



Bio

Academic

  • 2007 - present. PhD student Computer Science. Indiana University
  • 2002 - 2006. B.S. Computer Science. Peking University

Professional

  • June-August 2011. SDE Intern. Microsoft Corporation. Bellevue, WA.
  • Fall 2010. Research Assistant. Prof. Wu. Indiana University. Bloomington, IN
  • May-July 2010. Research Intern. NICS joint with ORNL. Oak Ridge, TN.
  • Fall 2007-Spring 2010. Teaching Assistant. Indiana University. Bloomington, IN
  • June-Auguest 2007. Research Assistant. Prof. Tang. Indiana University. Bloomington, IN

up


Publications

Mo Zhou, Yifan Pan, Yuqing Wu. Conkar:Constraint Keyword-based Association Discovery. In CIKM Demo, 2011.

Mo Zhou, Yifan Pan, Yuqing Wu. Efficient Association Discovery With Keyword-based Constraints on Large Graph Data. In CIKM, 2011.

Zhenhua Guo, Marlon Pierce, Geoffrey Fox, Mo Zhou. Automatic Task Re-organization in MapReduce. In IEEE Cluster 2011.

Vahid Jalalibarsari, Mo Zhou, Yuqing Wu. A study of RDB-based RDF Data Management Techniques. In WAIM 2011.

Mo Zhou, Yifan Pan, Yuqing Wu. Efficient Association Discovery with Keyword-based Constraints on Large Graph Data Technical Report, Indiana University Bloomington, 2011

Mo Zhou, Yuqing Wu. XML-Based RDF Data Management for Efficient Query Processing. In the 11th International Workshop on the Web and Databases. June, 2010. (pdf)

Mo Zhou, Yuqing Wu. XML-Based RDF Data Management for Efficient Query Processing. The CRA-W Grad Cohort Workshop, 2010 (pptx)

Mina Rho, Mo Zhou, Xiang Gao, Sun Kim, Haixu Tang, Michael Lynch.Independent Mammalian Genome Contractions Following the KT Boundary.Genome Biol Evol, Vol. 2009, No. 0. (22 June 2009), pp. 2-12. (pdf)

up


Teaching




Others

My Photo Gallery: landscape


up