Most Significant Publications of Rui Zhang

  1. Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kulik. The V*-Diagram: A Query Dependent Approach to Moving KNN Queries. Proceedings of the VLDB Endowment (PVLDB), 1, 1095-1106, 2008. Slides    Google Scholar Page

    State-of-the-art for moving k nearest neighbor queries, the most typical query type in location based services.
     
  2. H.V. Jagadish, Beng Chin Ooi, Kian-Lee Tan, Cui Yu, Rui Zhang. iDistance: An Adaptive B+-tree Based Indexing Method for Nearest Neighbor Search. ACM Transactions on Data Base Systems (TODS), 30(2), 364-397, 2005.    Google Scholar Page

    State-of-the-art for the k nearest neighbor search problem in metric space, a difficult problem in databases. The code of this technique was implemented by me, released to the database community and has been widely used.
     
  3. Andy Yuan Xue, Jianzhong Qi, Xing Xie, Rui Zhang, Jin Huang, Yuan Li. Solving the Data Sparsity Problem in Destination Prediction. VLDB Journal, 24 (2): 219-243, 2015.  Google Scholar Page

    This technique can predict probable destinations of a traveler based only on her current partial route and the public¨s historical trajectories, avoiding the need of many other types of information such as average travel lengths, ground cover, road condition, etc, required by previous techniques. Therefore, this paper makes predicting destinations easier to be applied in practice. Preliminary version is the following:

    Andy Yuan Xue, Rui Zhang, Yu Zheng, Xing Xie, Jin Huang, Zhenghua Xu. Destination Prediction by Sub-Trajectory Synthesis and Privacy Protection Against Such Prediction. IEEE International Conference on Data Engineering (ICDE) 2013.
     
  4. Rui Zhang, Nick Koudas, Beng Chin Ooi, Divesh Srivastava, Pu Zhou. Streaming Multiple Aggregations Using Phantoms, VLDB Journal, 19(4): 557-583, 2010.    Google Scholar Page

    US patent granted on this technique. It has been used in a real software deployed on many servers of AT&T. Preliminary version is the following:

    Rui Zhang, Nick Koudas, Beng Chin Ooi, Divesh Srivastava. Multiple Aggregations Over Data Streams. ACM SIGMOD International Conference on Management of Data (SIGMOD), Baltimore, 2005. Slides
     
  5. Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhang. Approximate NN queries on Streams with Guaranteed Error/performance Bounds. International Conference on Very Large Data Bases (VLDB), Toronto, 2004. Slides    Google Scholar Page

    The first technique to solve the e-approximate k nearest neighbor problem on data streams.
     
  6. Christian S. Jensen, Dan Lin, Beng Chin Ooi, Rui Zhang. Effective Density Queries of Continuously Moving Objects. International Conference on Data Engineering (ICDE), Atlanta, 2006.    Google Scholar Page

    The first study on the density query on moving objects and was the first work that provided an efficient algorithm to the query.
     
  7. Rui Zhang, Dan Lin, Kotagiri Ramamohanarao, Elisa Bertino. Continuous Intersection Joins Over Moving Objects. International Conference on Data Engineering (ICDE), Cancun, Mexico, 2008. Slides    Google Scholar Page

    The first study on the continuous intersection join query on moving objects and provided a solution two orders of magnitude faster than existing ones, which remains the state-of-the-art.
     
  8. Rui Zhang, Beng Chin Ooi, Kian-Lee Tan. Making the Pyramid Technique Robust to Query Types and Workload. International Conference on Data Engineering (ICDE), Boston, 2004. Slides    Google Scholar Page

    The state-of-the-art for processing range queries on high-dimensional data. The code of this technique was released to research community.