Jianzhong Qi Lecturer School of Computing and Information Systems The University of Melbourne

Contact

General Information

• My research interests include location-based social networks, spatio-temporal databases, and text mining.


• February 2018: Visited the School of Computer Science and Engineering, University of New South Wales.
• June 2017 - July 2017: Visited the Department of Electrical Engineering and Computer Science, Northwestern University, as a Visiting Assistant Professor.
• July 2015: Joined the School of Computing and Information Systems, The University of Melbourne, as a lecturer.
• March 2014: Received my PhD degree from The University of Melbourne.
• November 2013 - January 2014: Interned at Microsoft Redmond working on SkyDrive (now OneDrive).
• February 2009 - May 2009: Interned at Toshiba China R&D Center working on text to speech (TTS) projects.

Selected Papers (full paper list)

1. Jianzhong Qi, Rui Zhang, Christian S. Jensen, Kotagiri Ramamohanarao, and Jiayuan He. Continuous Spatial Query Processing: A Survey of Safe Region Based Techniques. To appear in ACM Computing Surveys, 2018.


2. Jianzhong Qi, Yufei Tao, Yanchuan Chang, and Rui Zhang. Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability. PVLDB, 11(5): 621-634, 2018. BibTex


3. Jianzhong Qi, Vivek Kumar, Rui Zhang, Egemen Tanin, Goce Trajcevski, and Peter Scheuermann. Continuous Maintenance of Range Sum Heat Maps. To appear in ICDE, 2018. (demo)


4. Chuanwen Li, Yu Gu, Jianzhong Qi, Jiayuan He, Qingxu Deng, and Ge Yu. A GPU Accelerated Update Efficient Index for kNN Queries in Road Networks. To appear in ICDE, 2018.


5. Kotagiri Ramamohanarao, Jianzhong Qi, Egemen Tanin, and Sadegh Motallebi. From How to Where: Traffic Optimization in the Era of Automated Vehicles (Vision Paper). SIGSPATIAL, 10:1-10:4, 2017. BibTex. (Best Vision Paper)


6. Yu Gu, Guanli Liu, Jianzhong Qi, Hongfei Xu, Ge Yu, and Rui Zhang. The Moving K Diversified Nearest Neighbor Query (TKDE invited poster). ICDE, 31-32, 2017. BibTex


7. Saad Aljubayrin, Jianzhong Qi, Christian S. Jensen, Rui Zhang, Zhen He, and Yuan Li. Finding Lowest-Cost Paths in Settings with Safe and Preferred Zones. VLDB Journal, 26(3): 373-397, 2017. BibTex


8. Yu Gu, Guanli Liu, Jianzhong Qi, Hongfei Xu, Ge Yu, and Rui Zhang. The Moving K Diversified Nearest Neighbor Query. TKDE, 28(10): 2778-2792, 2016. BibTex


9. Yu Sun, Rui Zhang, Andy Yuan Xue, Jianzhong Qi, and Xiaoyong Du. Reverse Nearest Neighbor Heat Maps: A Tool for Influence Exploration. ICDE, 966-977, 2016. BibTex


10. Chuanwen Li, Yu Gu, Jianzhong Qi, Ge Yu, Rui Zhang, and Qingxu Deng. INSQ: An Influential Neighbor Set Based Moving kNN Query Processing System. ICDE, 1338-1341, 2016 (demo). BibTex


11. Jianzhong Qi, Rui Zhang, Kotagiri Ramamohanarao, Hongzhi Wang, Zeyi Wen, and Dan Wu. Indexable Online Time Series Segmentation with Error Bound Guarantee. World Wide Web, 18(2): 359-401, 2015. BibTex


12. Saad Aljubayrin, Jianzhong Qi, Christian Jensen, Rui Zhang, Zhen He, and Zeyi Wen. The Safest Path via Safe Zones. ICDE, 531-542, 2015. BibTex


13. Yu Sun, Jianzhong Qi, Yu Zheng, and Rui Zhang. K-Nearest Neighbor Temporal Aggregate Queries. EDBT, 493-504, 2015. BibTex


14. Andy Yuan Xue, Jianzhong Qi, Xing Xie, Rui Zhang, Jin Huang, and Yuan Li. Solving the Data Sparsity Problem in Destination Prediction. VLDB Journal, 24(2): 219-243, 2015. BibTex


15. Jianzhong Qi, Rui Zhang, Yanqiu Wang, Andy Yuan Xue, Ge Yu, and Lars Kulik. The Min-dist Location Selection and Facility Replacement Queries. World Wide Web, 17(6): 1261-1293, 2014. BibTex


16. Zeyi Wen, Rui Zhang, Kotagiri Ramamohanarao, Jianzhong Qi, and Kerry Taylor. MASCOT: Fast and Highly Scalable SVM Cross-validation using GPUs and SSDs. ICDM, 580-589, 2014. BibTex


17. Chuanwen Li, Yu Gu, Jianzhong Qi, Ge Yu, Rui Zhang, and Wang Yi. Processing Moving kNN Queries Using Influential Neighbor Sets. PVLDB, 8(2): 113-124, 2014. BibTex


18. Phillip G. D. Ward, Zhen He, Rui Zhang, and Jianzhong Qi. Real-time Continuous Intersection Joins over Large Sets of Moving Objects using Graphic Processing Units. VLDB Journal, 23(6): 965-985, 2014. BibTex


19. Yanqiu Wang, Rui Zhang, Chuanfei Xu, Jianzhong Qi, Yu Gu, and Ge Yu. Continuous Visible k Nearest Neighbor Query on Moving Objects. Information Systems, 44: 1-21, 2014. BibTex


20. Rui Zhang, Jianzhong Qi, Martin Stradling, and Jin Huang. Towards a Painless Index for Spatial Objects. ACM TODS, 39(3): 19:1-19:42, 2014. BibTex.


21. Jianzhong Qi, Rui Zhang, Lars Kulik, Dan Lin, and Yuan Xue. The Min-dist Location Selection Query. ICDE, 366-377, 2012. (Slides) BibTex


22. Rui Zhang, Jianzhong Qi, Dan Lin, Wei Wang, and Raymond Chi-Wing Wong. A Highly Optimized Algorithm for Continuous Intersection Join Queries over Moving Objects. VLDB Journal, 21(4): 561-586, 2012. BibTex


23. Jianzhong Qi, Zhenghua Xu, Yuan Xue, and Zeyi Wen. A Branch and Bound Method for Min-dist Location Selection Queries. Australasian Database Conference (ADC), 51-60, 2012 (Runner-up for Best Paper). BibTex


24. Jin Huang, Zeyi Wen, Jianzhong Qi, Rui Zhang, Jian Chen, and Zhen He. Top-k Most Influential Location Selection. CIKM, 2377-2380, 2011 (poster paper). BibTex

Professional Services

• Journal reviewer:
  • ACM Computing Surveys
  • ACM Transactions on Spatial Algorithms and Systems
  • Distributed and Parallel Databases
  • IEEE Transactions on Knowledge and Data Engineering
  • Journal of Parallel and Distributed Computing
  • Parallel Computing
• Proceedings Chair: ADC 2015, ADC 2018.
• Track Chair: CSS 2017.
• PC member:
  • 2018: CIKM, APWeb-WAIM, AusDM, MDM
  • 2017: ICDE, CIKM, SIGSPATIAL, ACSW, AusDM, BigCom, IWSC, APWeb-WAIM
  • 2016: APWeb
  • 2015: APWeb
  • 2014: ICDM-IDP Workshop, HuMoComp.
• External reviewer: DCC 2017, SIGMOD 2015, WWW 2014, SSTD 2013, WISE 2013.

Grants and Awards

• 2018 - 2020, ARC Discovery Project x 2, Australian Research Council.
• 2017, Eshbach Visiting Scholar Fellowship, Northwestern University.
• 2016, Early Career Researcher (ECR) Grant, University of Melbourne.
• 2015, Early Career Researcher (ECR) Grant, Melbourne School of Engineering.


• 2017, Best Vision Paper, SIGSPATIAL.
• 2015, Nominee, MERIT Prize for the Best PhD Thesis in Engineering, Melbourne School of Engineering.
• 2015, Nominee, John Makepeace Bennett Best PhD Thesis Award, Computing Research and Education Association of Australasia (CORE).
• 2015, Best Poster Award, ADC.
• 2013, Student travel scholarship, ICDE.
• 2012, Runner-up for Best Paper, ADC.
• 2011, Google PhD Travel Prize, Google.
• 2010-2013, Melbourne International Fee Remission Scholarship, University of Melbourne.
• 2010-2013, Special Postgraduate Studentship, University of Melbourne.

Teaching

• Lecturing:
  • Semester 1, 2016 - 2018, Foundations of Algorithms (COMP10002).
  • Semester 2, 2015 - 2018, Engineering Computation (COMP20005).
  • Semester 1, 2015, Advanced Database Systems (COMP90050).
  • Semester 1, 2014 - 2016, Programming and Software Development (COMP90041).


• Tutoring:
  • Semester 1, 2013, Engineering Computation (COMP20005) (Head Tutor).
  • Semester Summer, 2013, Advanced Studies in Computing 6B (COMP90005).
  • Semester 2, 2012, 2013, Foundations of Algorithms (COMP10002).
  • Semester 1, 2012, Programming and Software Development (COMP90041) (Lab Demonstrator).

Affiliations and Positions Held

• 2012 - present, IEEE member.
• March, 2011 - April, 2012, Postgraduate Seminar Coordinator, Department of Computing and Information Systems.
• March, 2011 - December, 2011, Toy Library Volunteer, Save the Children Australia.

Graduated Research Students

• Gitansh Khirbat (MPhil), 2014-2017.
• Han Li (MPhil), 2014-2016.
• Yu Sun (PhD), 2013-2017, first job at Twitter.
• Jin Huang (PhD), 2012-2016, first job at University of Melbourne.
• Andy Yuan Xue (PhD), 2012-2016, first job at startup.

Released Code

• Painless Index for Large Scale Spatial Objects
  Related paper:
  • Towards a Painless Index for Spatial Objects. ACM TODS, 2014.
• Min-dist Location Selection and Facility Replacement
  Version 2.0 (941KB).
  With three datasets C, F and P (source code for the data generator, 177KB).
  |C|: 100, 000, |F|: 5, 000, |P|: 5, 000.
  All the datasets follow uniform distribution.
  Space domain: 1000*1000.
  Related papers:
  • The Min-dist Location Selection Query. ICDE, 2012.
  • A Branch and Bound Method for Min-dist Location Selection Queries. ADC, 2012.
  • The Min-dist Location Selection and Facility Replacement Queries. WWWJ, 2014.
• Continuous Intersection Join on Moving Objects
  Version 1.1 (4.5MB).
  With two moving object sets and an object update set.
  Every object set has 10, 000 objects with uniform distribution in a 1000*1000 space domain.
  Object velocities follow a uniform distribution with the maximum speed being 1.
  Every object issues an update every T_M timestamps (source code for the object update generator, 248KB).
  Related papers:
  • A Highly Optimized Algorithm for Continuous Intersection Join Queries over Moving Objects. VLDB Journal, 2012.
  • Continuous Intersection Joins Over Moving Objects, ICDE, 2008.
  • Continuous Intersection Joins Over Moving Objects, March 2007 (a technical report).

Miscellaneous

Visitor IP count:

Created by Jianzhong Qi.
Last modified: 03/03/2018.

Mandatory disclaimer: This page, its content and style, are the responsibility of the author and do not necessarily represent the views, policies, or opinions of The University of Melbourne.