Welcome to my homepage

Actually, I am not good at introducing myself. This is a bad news for a researcher, because it means that he even does not do good research about himself. Well, I think I just follow the traditional format, telling my story from high school to now. Actually, you can view my CV for a short version.

As a Researcher At national univ. of singapore

From July 2005, I become a Ph.D student of School of Computing, National University of Singapore. I join the database research group. And my supervisor is Professor Beng Chin Ooi.

RESEARCH TOPIC

My research mainly focuses on Peer-to-Peer (P2P) systems, especially the structured P2P systems. My interest includes query processing, data management, load balancing, security and other issues in P2P systems. In my opinion, the P2P technique is still at its early stage and far from being a mature business solution. So that means we still get a lot of work to do.

PROJECTS

I participate into three P2P projects, BestPeer, S3 and a P2P Video Stream project. In BestPeer, we try to build a hybrid structured P2P system for the business applications. And we extend our idea to S3 project, which aims to build a scalable,shareable and secure p2p based data management system. P2P Video Stream project is a small demo project for illustrating the power of P2P techniques in video sharing systems.

LIVING IN SINGAPORE

Singapore is a beautiful garden city. For me, there are two reasons that I want to stay here. 1. The city has good public services. Life becomes easier here. 2. The low criminal rate. You do not need to worry about your girl friend, even if she walks at mid-night. Actually, there are two other reasons that I do not want to stay here. 1. The city is boring. People say that Singapore is a civilization desert. 2. I do not like 4 summers in a year.

PUBLICATIONS

C. Chen, F. Li, B. C. Ooi, S. Wu: TI: An Efficient Indexing Mechanism for Real-Time Search on Tweets. ACM Int'l. Conference on Management of Data (SIGMOD), 2011.

Y. Lin, D. Agrawal, C. Chen, B. C. Ooi, S. Wu: Llama: Leveraging Columnar Storage for Scalable Join Processing in the MapReduce. ACM Int'l. Conference on Management of Data (SIGMOD), 2011.

Yu Cao, Chun Chen, Fei Guo, Dawei Jiang, Yuting Lin, Beng Chin Ooi, Hoang Tam Vo, Sai Wu, Quan- qing Xu: A Cloud Data Storage System for Supporting Both OLTP and OLAP. 27th IEEE International Conference on Data Engineering (ICDE) 2011.

Chun Chen, Gang Chen, Dawei Jiang, Beng Chin Ooi, Hoang Tam Vo, Sai Wu, Quanqing Xu: Providing Scalable Database Services on the Cloud. WISE 2010 (keynote)

Dalie Sun, Sai Wu, Shouxu Jiang, Jiangzhong Li: Approximate Aggregations in Structured P2P Networks. To appear on IEEE Transactions on Knowledge and Data Engineering (TKDE), 2010.

Dawei Jiang, Beng Chin Ooi, Lei Shi, Sai Wu: The Performance of MapReduce: An In-depth Study. Int'l Conference on Very Large Data Bases (VLDB), 2010.

Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun Lun Wu: Efficient B+-tree Based Indexing for Cloud Data Processing. Int'l Conference on Very Large Data Bases (VLDB), 2010.

J. Wang, S. Wu, H. Gao, J. Li, B. C. Ooi: Indexing Multi-dimensional Data in a Cloud System. ACM Int'l. Conference on Management of Data (SIGMOD), 2010.

S. Wu, B. C. Ooi, K. L. Tan:Continuous Sampling for Online Aggregation Over Multiple Queries. ACM Int'l. Conference on Management of Data (SIGMOD), 2010.

Sai Wu, Shouxu Jiang, Beng Chin Ooi, Kian-Lee Tan. Distributed Online Aggregation. VLDB 2009.

Quang Hieu Vu, Mihai Lupu, Sai Wu. SiMPSON: Efficient Similarity Search in Metric Spaces over P2P Structured Overlay Networks. Euro-Par 2009.

Sai Wu, Kun-Lung Wu. An Indexing Framework for Efficient Retrieval on the Cloud. IEEE Data Eng. Bull. 32(1): 75-82 (2009)

Sai Wu, Quang Hieu Vu, Jianzhong Li and Kian-Lee Tan. Adaptive Multi-Join Query Processing in PDBMS. ICDE, 2008 (short paper).

Sai Wu, Beng Chin Ooi, Jianzhong Li, Kian Lee Tan. Just-In-Time Query Retrieval Over Partially Indexed Data on Structured P2P Overlays. In Proceeding of the ACM SIGMOD Conference, Vancouver, Canada, 2008. (pdf file)

Dalie Sun, Sai Wu, Jianzhong Li, Anthony K.h.Tung. Skyline-Join in Distributed Databases. NetDB 08.(pdf file)

Sai Wu, Hong Gao, Bei Yu. Supporting High Dimensional Range Queries in Peer-to-Peer Systems DBISP2P 2007. Austria (pdf file)

 

RECOMMENDED SITES

If you want to get a quick overview of P2P research, I suggest you some good websites.

• BestPeer
• PIER Group
• P-Grid Group
• Chord Project at MIT
• Stanford University P2P Research

Now, I am interested in the Cloud system. We are studying the source code of Hadoop. And we have built a data storage service for the Cloud system and test it on Amazon's EC2. We look forward to facilitating the support of database applications on the Cloud. See more at our epiC project.

UNDERGRADUATE AT PEKING UNIVERSITY, BEING, CHINA

I spend almost 7 years at Peking University. 4 years for my undergraduate and 3 years for my master. Peking University is said to be one of the most beautiful Universities in China. I do agree with it. In spring, there are all kinds of flowers in the campus. In autumn, leaves of gingkgo dance in the air. In winter, you can skate on the frozen lake. In summer... opps, enough summer at Singapore.

In Peking University, you do not only study the science. You are also immersed by a special atmosphere. You become a good poet, a knowledge historian or a sharp politician. I love that feeling and miss my friends there.

 

HiGH school at Xianyang, Shannxi, CHINA

Before going to college, I lived in a city near Xi'an (25km distance). Now, the two cities are combined into one. Well, I think my hometown is most famous for the clay soldiers. The ancient emperor built them and hoped to lead them to win the battle at the underworld after his death. Now, they can be only used as the advertisement for the tourists or as a topic appeared in National Geography. At least, they can prove that my hometown is a city with 2000 years' history. I though I should be a archaeologist, hehe. Ok, besides history, my hometown is also well known for foods. If you drop by, you must try.