Selected Conference Publications

DBLP Page Publications in Reverse Chronological Order

Conference Papers

  1. Zhitao Shen, Muhammad Aamir Cheema, XUEMIN LIN, Wenjie Zhang, Haixun Wang, Efficiently Monitoring Top-k Pairs over Sliding Windows, ICDE 2012.

  2. Xiang Zhao, Chuan Xiao, XUEMIN LIN, Wei Wang, Efficient Graph Similarity Joins with Edit Distance Constraints, ICDE 2012.

  3. Yuanyuan Zhu, Lu Qin, Jeffrey Xu Yu, Yiping Ke, XUEMIN LIN, High Efficiency and Quality: Large Graphs Matching, CIKM 2011.

  4. P. Peng, L. Zou, L. Chen, X. LIN, D. Zhao, Subgraph Search Over Massive Disk Resident Graphs, SSDBM11 (short paper).

  5. J. Qin, W. Wang, Y. Lu, C. Xiao, X. LIN, Efficient Exact Edit Similarity Query Processing with Asymmetric Signature Schemes,SIGMOD 2011.

  6. X. LIN, Y. Zhang, W. Zhang, M. A. Cheema, Stochastic Skyline Operator, ICDE 2011.( Technical Report )

  7. M. A. Cheema, X. LIN, W. Zhang, Y. Zhang, Influence Zone: Efficiently Processing Reverse k Nearest Neighbors Queries, ICDE 201 1.

  8. M. A. Cheema, X. LIN, H. Wang, J. Wang, W, Zhang, A Unified Approach for Computing Top-k Pairs in Multidimensional Space, ICDE 2011.

  9. K. Zhu, W. Zhang, G. Zhu, Y. Zhang, X. LIN, BMC: An Efficient Method to Evaluate Probabilistic Reachability Queries, DASFAA 2011.

  10. M. Hasan, M. A. Cheema, X. LIN, W. Zhang, A Unified Algorithm for Continuous Monitoring of Spatial Queries , DASFAA 2011.

  11. W. Yu, X. LIN, J. Le Taming Computational Complexity: Efficient and Parallel SimRank Optimizzations on Undirected Graphs, pages 280-296, WAIM 2010. Best Paper Runner-Up Award

  12. G. Zhu, X. LIN, W. Zhang, W. Wang, and H. Shang, PrefIndex: An Efficient Supergraph Containment Search Technique , pages 360-378, SSDBM 2010.

  13. W. Yu, X. LIN, J. Le, A Space and Time Efficient Algorithm for SimRank Computation , pages 164-170, APWeb 2010 Best Paper Award

  14. H. Shang, X. LIN, Y. Zhang, J. X. Yu, and W. Wang Connected Substructure Similarity Search , pages 903-914, SIGMOD 2010.

  15. C. Wang, J. Wang, X. LIN, W. Wang, H. Wang, H. Li, MapDupReducer: Detecting Near Duplicates over Massive Datasets (demo), pages 1119-1122, SIGMOD 2010.

  16. K. Zhu, Y. Zhang, X. LIN, G. Zhu, and W. Wang NOVA: A Novel and Efficient Framework for Finding Subgraph Insomophism Mappings in Large Graphs , pages 140-154, DASFAA 2010.

  17. M. Hasan, M. A. Cheema, W. Qu, X. LIN, Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries, pages 233-249, DASFAA 2010.

  18. L. Chang, J. X. Yu, L. Qin and X. LIN, Probabilistic Ranking over Relations , pages 477-488, EDBT 2010.

  19. W. Zhang, Y. Zhang, M. A. Cheema, X. LIN, Counting Distincet Objects over Sliding Windows , ADC 2010. Best Paper Award

  20. W. Zhang, X. LIN, M. A. Cheema, Y. Zhang, W. Wang, Quantile-Based KNN Over Multi-Valued Objects, pages 16-27, ICDE 2010.

  21. Y. Zhang, X. LIN, G. Zhu, W. Zhang, Q. Lin, Efficient Rank Based KNN Processing over Uncertain Data, pages 28-39, ICDE 2010.

  22. M. A. Cheema, L. Brankovic, X. LIN, W. Zhang, W. Wang, Multi-Guarded Safe Zone: An Efficient Technique to Monitor Moving Circular Range Queries , pages 189-200, ICDE 2010.

  23. H. Shang, K. Zhu, X. LIN, Y. Zhang, R. Ichise, Similarity Search on Supergraph Containment , pages 637-648, ICDE 2010.

  24. M. A. Cheema, X. LIN, Y. Zhang, W. Wang, W. Zhang, Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN, pages 1138-1149, VLDB 2009.

  25. W. Wang, C. Xiao, X. LIN, C. Zhang, Efficient Approximate Entity Extraction with Edit Distance Constraints, pages 759-770, SIGMOD 09.

  26. Y. Chen, W. Wang, Z. Liu, X. LIN, Keyword Search on Structured and Semi-structured Data, pages 1005-1010. (tutorial slides)

  27. W. Zhang, X. LIN, Y. Zhang, W. Wang, J.X. Yu , Probilistic Skyline Operator over Sliding Windows, in the Proceedings of 25th IEEE Intational Conference on Data Engineering (ICDE09), pages 1060-1071, Shanghai, China.

  28. C. Xiao, W. Wang, X. LIN, H. Shang, Top-k Set Similarity Joins, in the Proceedings of 25th IEEE Intational Conference on Data Engineering (ICDE09), pages 916-927, Shanghai, China.

  29. Y. Tao, Ling Ding, X. LIN, J. Pei, Distance-based Representative Skyline, in the Proceedings of 25th IEEE Intational Conference on Data Engineering (ICDE09), pages 892-903, Shanghai, China.

  30. Y. Zhang, X. LIN, Y. Tao, W. Zhang, Uncertain Location based Range Aggregates in a multi-dimensional space (short paper), in the Proceedings of 25th IEEE Intational Conference on Data Engineering (ICDE09), pages 1247-1250, Shanghai, China.

  31. M. Hasan, M. A. Cheema, X. LIN, Y. Zhang, Efficient Construction of Safe Regions for moving kNN Queries over Dynamic Datasets, (short paper) in the 11th International Symposium on Spatial and Temporal Databases (SSTD), Aalborg, Denmark, 2009.

  32. S. Yang, W. Zhang, Y. Zhang, X. Lin, Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data, pages 51-62, APWebWAIM 2009 ( Best Paper Award )

  33. Z. Liu, J. Yu, Y. Ke, X. LIN, L. Chen, Spotting Significant Changing Subgraphs in Evolving Graphs (Short Paper), 8th International Conference on Data Mining (ICDM08), pages 917-922, Pisa, Italy.

  34. H. Shang, Y. Zhang, X. LIN, J. Yu, Taming Verification Hardness: an efficient algorithm for testing subgraph isomorphism, pages 364-375, VLDB2008.

  35. C. Xiao, W. Wang, X. LIN, Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints, pages 933-944, VLDB2008.

  36. C. Jin, K. Yi, L. Chen, J. Yu, X. LIN, Space-Efficient Synopses for Sliding-Window Top-k Queries on Uncertain Streams, pages 301-312, VLDB2008.

  37. W. Zhang, X. LIN, J. Pei, Y. Zhang, Managing Uncertain Data: Probabilistic Approaches (Invited Paper) WAIM 2008: pages 405-412.

  38. X. LIN, Y. Zhang, Aggregate Computation over Data Streams, pages 10-25, APWEB08 (Invited paper and Keynote).

  39. B. Jiang, J. Pei, X. LIN, D. Cheung, J. Han, Mining Preferences from Superi or and Inferior Examples, pages 390-398, KDD08.

  40. J. Pei, M. Hua, Y. Tao, and X. LIN. Mining Uncertain and Probabilistic Data: Problems, Challenges, Methods and Applications, pages 1357-1364, KDD 08. (tutorial slides)

  41. M. Hua, J. Pei, W. Zhang, X. LIN, Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach , in the proceedings of SIGMOD2008, pages 673-686, Canada.

  42. J. Pei, M. Hua, Y. Tao, X. LIN, Query Answering Techniques on Uncertain and Probabilistic Data: tutorial summary, pages 1357-1364, SIGMOD 2008. (tutorial slides)

  43. C. Xiao, W. Wang, X. LIN, J.X. Yu, Efficient Similarity Joins for Near Duplicate Detection , in the proceedings of WWW08, Beijing, China, pages 131-140.

  44. J. Chen, J.X. Yu, X. LIN, H. Wang, P.S. Yu, Fast Computing Reachability for Large Graphs with Hogh Compresion Rate , in the proceedings of EDBT08, pages 193-204, France.

  45. M. Hua, J. Pei, W. Zhang, and X. LIN. Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data, pages 1403-1405, in ICDE08 (poster).

  46. Y. Luo, W. Wang, X. LIN. SPARK: A Keyword Search Engine on Relational Database, pages 1552-1555, ICDE08 (demo).

  47. J. Pei, B. Jiang, X. LIN, and Y. Yuan. Probabilistic Skylines on Uncertain Data . In Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB'07), pages 15-26, Vienna, Austria, September 23-28 2007.

  48. M. Hua, J. Pei, A. W-C Fu, X. LIN, and H-F Leung. Efficiently Answering Top-k Typicality Queries on Large Databases . In Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB'07), pages 890-901, Vienna, Austria, September 23-28

  49. Y. Luo, X. LIN, W. Wang, X. Zhou, SPARK: Top-k Keyword Query in Relational Databases, 26th ACM SIGMOD International Conference on Management o f Data (SIGMOD'07), pages 115-126, 2007.

  50. J. Pei, A.W-C. Fu, X. LIN, H. Wang, Computing Compressed Multidimension al Skyline Cubes Efficiently, IEEE 23rd International Conference on Data Engineering (ICDE'07), pages 96-105, 2007.

  51. X. LIN, Y. Yuan, Q. Zhang, Y. Zhang, Selecting Stars: the k Most Representitive Skyline Operator, IEEE 23rd International Conference on Data Engineering (ICDE'07), pages 86-95, 2007.

  52. B. Ding, J.X. Yu, S. Wang, L. Qing, X. Zhang, X. LIN, Finding Top-k Min-Cost Connected Trees in Databases, IEEE 23rd International Conference on Data Engineering (ICDE'07, Best Student Paper Award), pages 836-845, 2007.

  53. Y. Zhang, X. LIN, Y. Yuan, M. Kitsuregawa, X. Zhou, J. Yu, Summarizing Order Statistics over Data Streams with Duplicates, IEEE 23rd International Conference on Data Engineering (ICDE'07 Short Paper), pages 1329-1333, 2007.

  54. X. LIN, Continuously Maintaining Order Statistics over Data Streams , in the proceedings of 18th Australasian Database Conference (Invited Talk), pages 7-10, 2007.

  55. M.A. Cheema, Y. Yuan, X. LIN, CircularTrip: An Effective Algorithm for Continuous kNN Queries, the 12th International Conference on Database Systems for Advanced Applications (DASFAA2007, short paper), 863-869, 2007.

  56. J. Cheng, J.X. Yu, X. LIN, H. Wang, P.S. Yu, Fast Computation of Reachability Labeling for Large Graphs , in 10th International Conference on Extending Database Technology (EDBT06), pages 961-979.

  57. K. Deng, X. Zhou, H.T. Shen, K. Xu, X. LIN, Surface kNN Query Processing,in the proceedings of 22nd International Conference on Data Engineering (ICDE06), page 78.

  58. Y. Zhang, X. LIN, J. Xu, F. Korn, W. Wang, Space-efficient Relative Error Order Sketch over Data Streams , in the proceedings of 22nd International Conference on Data Engineering (ICDE06), page 51.

  59. B. Wang, X. Yang, G. Wang, L. Chen, S.X. Sean, X. LIN, Continually Answering Constrained k-NN Queries in an Unstructured P2P System, DBISP2P'06 (VLDB'06 workshop), LNCS, pages 397-405, Springer.

  60. Y. Yuan, X. LIN, Q. Liu, W. Wang, J.X. Yu, & Q. Zhang, Efficient Computation of the Skyline Cube , The Proceedings of 31th International Conference on Very Large Databases (VLDB 2005), pages 241-252, Trondheim, Norway, 2005.

  61. W. Wang, H. Wang, H. Lu, H. Jiang, X. LIN, & J. Li, Efficient Processing of XML Path Queries Using the Disk-based F&B Index, The Proceedings of 31th International Conference on Very Large Databases (VLDB 2005), pages 145-156, Trondheim, Norway, 2005.

  62. X. LIN, Y. Yuan, W. Wang, & H. Lu, Stabbing the Sky: Efficient Skyline Computation over Sliding Windows, The Proceedings of 21st International Conference on Data Engineering (ICDE 2005), pages 502-513, 2005.

  63. Z. Liu, J.X. Yu, X. LIN, H. Lu, & W. Wang, Where are the motifs in time-series data, PAKDD05, pages 343-353, LNCS3518 Springer, 2005.

  64. W. Wang, D.B. Do, X. LIN, Term Graph Model for Text Classification, to appear in ADMA2005 (Invited Paper), pages 19-30, LNCS3584 Springer, 2005.

  65. Yi Luo, Zheng Liu, XUEMIN LIN, Wei Wang, Jeffrey Xu Yu, Similarity Search with Implicit Object Features, WAIM2005, pages 150-161, LNCS3739 Springer, 2005.

  66. Hongzhi Wang, Wei Wang, Jianzhong Li, XUEMIN LIN, Practical Indexing of XML Documents for Twig Queries, in ASIAN2005, LNCS, Springer, pages 208-222, 2005.

  67. Hongzhi Wang, Wei Wang, XUEMIN LIN, Jianzhong Li, Subgraph Join: Efficient Processing Subgraph Queries on Graph-structured XML Document, WAIM2005, pages 68-80, LNCS3739 Springer,2005

  68. Q. Liu, X. LIN, & Y. Yuan, Summarizing Spatial Relations - A Hybrid Histogram Technique, APweb05 (Best Student Paper Award to Liu and Yuan), pages 464-476, LNCS3399 2005.

  69. H. Wang, W. Wang, X. LIN, J. Li, Labelling scheme and Structural join for Graph-Structured XML Data, APweb05, pages 277-289, LNCS3399, 2005.
  70. X. LIN, H. Lu, J. Xu, and J.X. Yu, Continuously Maintaining Quantile Summaries of the Most Recent N Elements over a Data Stream , The Proceedings of 20th International Conference on Data Engineering (ICDE 2004), pages, 362-374, 2004.

  71. K. Xu, X. Zhou, and X. LIN, Direct Mesh: a Multiresolution Approach to Terrain Visualisation, The Proceedings of 20th International Conference on Data Engineering (ICDE 2004)), pages 766-777, 2004.

  72. Q. Zhang and X. LIN, Clustering Moving Objects for Spatio-temporal Selectivity Estimation, The Proceedings of 15th Australasian Database Conference, (ADC 2004, Best Student Paper Award to Zhang), pages 123-130, 2004.

  73. J. Xu, X. LIN, and X. Zhou, Space Efficient Quantile Summary for Constrained Sliding Windows on a Data Stream, WAIM04, Springer, pages LNCS, pages 34-44, 2004.

  74. Y. Luo, Hai-Xin Lu, and X. LIN, A Scalable and I/O Optimal Skyline Processing Algorithm, WAIM04, Springer, LNCS, pages 218-288, 2004.
  75. X. LIN, Q. Liu, Y. Yuan, and X. Zhou, Multiscale Histograms: Summarizing Topological Relations in Large Spatial Datasets, The proceedings of 29th International Conference on Very Large Data Bases (VLDB'03), pages 814-825, 2003.

  76. H.-X. Lu, Y. Luo, and X. LIN, An Optimal Divide-Conquer Algorithm for 2D Skyline Queries, ADBIS'03, LNCS, pages 46-50, 2003.

  77. X. LIN and Q. Zhang, Error Minimization for Approximate Computation of Range Aggregates, DASFAA03, pages 161-168, 2003.

  78. Q. Liu, Y. Yuan, and X. LIN, Multiresolution Algorithms for Building Spatial Histograms , 14th Australasian Database Conference (ADC2003), pages 145-151, 2003.

  79. Q. Zhang and X. LIN, On Linear-Spline Based Histograms, WAIM 2002, LNCS, Springer-Verlag, pages 354-366, 2002.

  80. X. LIN, H.X. Lu, and Q. Zhang, Graph Partition Based Multi-Way Joins, IDEAS02, IEEE CS Press, pages 23-32, 2002.

  81. X. LIN, Delay Optimizations in Quorum Consensus, to appear in 12th Annual International Symposium on Algorithms on Algorithms and Computation (ISAAC01), LNCS, Springer-Verlag, pages 575-586, 2001. ( Full paper )

  82. X. LIN, X. Zhou, C. Liu, and X. Zhou, Efficiently Computing Weighted Proximity Relationships in Spatial Databases, WAIM2001, LNCS, Springer-Verlag, pages 279-290, 2001.

  83. C. Liu, M. Orlowska, X. LIN, X. Zhou, Improving Backward Recovery in Workflow Systems, in 7th International Conference on Database Systyems for Advanced Applications (DASFAA01), pages 276-283, IEEE cs press, 2001.

  84. Y. Li, X. LIN, C. Tsang, An Efficient Distributed Algorithm for Computing Association Rules, Proceedings of 1st International Conference on Web Age Information Management, LNCS 1846, Springer-Verlag, 2000.

  85. X. LIN, X. Zhou, and C. Liu, Efficiently Matching Proximity Relationships in Spatial Database, Proceedings of 6th International Symposium on Spatial Databases (SSD'99), LNCS 1651, Springer-Verlag, pages 188-206, 1999.

  86. X. LIN and P. Eades, Area Minimization for Grid Representation of Hierachically Planar Graphs, COCOON'99, LNCS 1627, Springer-Verlag, 1999.

  87. X. Zhou, Y. Zhang, X. LIN, and C. Liu, On the Optimization of Complex Spatial Queries", Proceedings of 2nd International Symposium on Cooperative Database Systems for Advanced Applications (CODAS'99), Springer-Verlag, pages 252-263, 1999.

  88. C. Liu, M. Orlowska, X. LIN, and X. Zhou, Confirmation: A Solution for Non-compensatability in Workflow Applications, the Proceedings of 15th International Conference on Data Engineering (poster paper), page 102, IEEE cs press, 1999.

  89. X. LIN, C. Liu, Y. Zhang, and X. Zhou, Efficiently Computing Frequent Tree-Like Topology Patterns in a Web Environment , 31st Tool's Asia, IEEE cs press, pages 440-447, 1999.

  90. C. Liu, X. LIN, X. Zhou, and M. Orlowska, Building a Repository for Workflow Systems, 31st Tools's Asia, IEEE cs press, pages 348-357, 1999.

  91. C. Liu, X. Zhou, J. Cao, X. LIN, Global Transaction Management in a Cooperative Database Systems, Proceedings of the 1999 International Symposium on Database, Web and Cooperative Systems, pages 73-78, 1999.

  92. X. LIN, Y. Li, and C. P. Tsang, Reducing Counting Costs in Mining Association Rules by an On-Line Bitmap Index", Proceedings of 9th International Conference on Computing and Information , pages 3-9, 1998.

  93. Y. Li, X. LIN, and C. P. Tsang, An Efficient Algorithm for Mining Distributed Association Rules, Proceedings of 1998 International Conference on Parallel and Distributed Processing Techniques and Applications , pages 1169-1175, 1998.

  94. Y. C. Lin, X. LIN, and X. Zhou, Efficiently Mining Tree Traversal Patterns in a Web Environment, IEEE TENCOON'98 , IEEE, pages 115-118, 1998.

  95. X. LIN and P. Eades, Area Requirements for Drawing Hierarchically Planar Graphs, Graph Grawing'97 , Lecture Notes in Computer Science 1353, Springer-Verlag, pages 219-229, 1998.

  96. P. Eades and X. LIN, Spring Algorithms and Symmetry, COCOON'97 , Lecture Notes in Computer Science 1276, Springer-Verlag, pages 202-211, 1997.

  97. X. LIN, On the Computational Complexity of Optimization of Edges Concentration in Bipartite Graphs, Australian Computer Science Communications (CATS'97), 19(2), pages 9-16, 1997.

  98. P. Eades, Q. Feng, and X. LIN, Straight-Line Drawing Algorithms for Hiera rchical Graphs and Clustered Graphs, Lecture Notes in Computer Science 1190, Springer-Verlag, pages 113-128, 1996 (Graph Drawing'96).

  99. X. LIN and S. Fox, An Effective Parallelization of Execution of Multijoins in Multiprocessor Systems, 2nd International Symposium on Parallel Architectures, Algorithms, and Networks , IEEE cs press, pages 63-69, 1996.

  100. X. LIN and J. Chen, An Optimal Deadlock Resolution Algorithm in Multidatabase Systems, 4th International Conference on Parallel and Distributed Systems , IEEE cs press, pages 516-521, 1996.

  101. X. LIN, A New Quorum Consensus Method with High Fault-Tolerance for Managing Replicated Data, CATS'96 , Australian Computer Science Communication, 18(3), pages 90-99, 1996.

  102. X. LIN and M. E. Orlowska, A Highly Fault-Tolerant Quorum Consenus Method for Managing Replicated Data, 1st Annual International Computing and Combinatorics Conference (COCOON'95), Lecture Notes in Computer Science 959, Springer-Verlag, pages 171-180, 1995.

  103. X. LIN, M. Orlowska and X. Zhou, Using Parallel Semi-Join Reduction to Minimize Distributed Query Response Time, IEEE International Conference on Algorithms and Architectures for Parallel Processing (ICA^3P'95), IEEE CS press, pages 517-526, 1995.

  104. J. Chen and X. LIN, "Clustering Classes Through Graph Transformations", 5th International CASE Symposium , pages 211-216, 1995.

  105. X. LIN and M. Orlowska, "An Efficient Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management", 5th Annual International Symposium on Algorithms and Computation (ISAAC'95), Lecture Notes in Computer Science, Springer-Verlag, pages 246-254, 1994.

  106. X. LIN, M. Orlowska and Y. Zhang, On Data Allocation with the Minimum Overall Communication Cost in Distributed Database Design, Proc. of 5th International Conference on Computing and Information , IEEE CS press, pages 539-544, 1993.

  107. X. LIN, M. Orlowska and Y. Zhang, An Optimal Victim Selection Algorithm for Removing Global Deadlocks in Multidatabase Systems, IEEE Region 10's Ninth Annual International Conference on "Frontiers of Computer Technology", IEEE cs press, pages 501-505, 1994.

  108. X. LIN and Y. Zhang, A New Graphical Method for Vertical Partitioning in Database Design, Advances in Database Research 93, World Scientific, ed. M. E. Orlowska and M. Papazoglo, 131-144, 1993.

  109. P. Eades, T. Lin and X. LIN, Minimum Size h-v Drawings", Advanced Visual Interfaces 1992, Rome, Italy, World Scientific Series in Computer Science Volume 36, 386-394, 1992.

  110. P. Eades and X. LIN, Notes on the Layer Assignment Problem for Drawing Directed Graphs, Proc. of Australian Computer Science Conference 14, 26.1-26.10, 1991.

  111. P. Eades, T. Lin and X. LIN, Representing Trees by Rectangle Inclusion, Proc. of Australian Computer Science Conference 14, 25.1-25.10, 1991.

  112. P. Eades, X. LIN and R. Tamassia, A New Approach for Drawing a Hierarchical Graph, Proc. of Second Canadian Conference on Computational Geometry, 142-146, 1990.

  113. P. Eades, X. LIN and N. Wormald, Performance Guarantees for Motion Planning with Temporal Uncertainty, Proc. of Australian Computer Science Conference 13, 25, 78-87, 1990.

  114. P. Eades and X. LIN, How to Draw a Directed Graph, Proc. of IEEE Workshop on Visual Language, IEEE cs press, 13 -17, 1989.