Lin, Xuemin - School of Computer Science and Engineering, University of New South Wales

• Spotting Significant Changing Subgraphs in Evolving Graphs Zheng Liu, Jeffrey Xu Yu, Yiping Ke
• Probabilistic Skylines on Uncertain Data Yidong Yuan
• SPARK: Top-k Keyword Query in Relational Databases Yi Luo Xuemin Lin Wei Wang
• MapDupReducer: Detecting Near Duplicates over Massive Chaokun Wang Jianmin Wang Xuemin Lin Wei Wang Haixun Wang
• TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1 Probabilistic Reverse Nearest Neighbor
• A Space and Time Efficient Algorithm for SimRank Computation Dept. of Computer Science & Technology
• The VLDB Journal (2008) 17:11011119 DOI 10.1007/s00778-007-0053-2
• Probabilistic Skyline Operator over Sliding Wenjie Zhang #1
• Summarizing Spatial Relations -A Hybrid Qing Liu1,2
• Efficient Processing of XML Path Queries Using the Disk-based F&B Index
• An Optimal Voting Scheme for Minimizing the Overall Communication Cost in Replicated Data
• Efficient Construction of Safe Regions for Moving kNN Queries Over Dynamic Datasets
• An Optimal Victim Selection Algorithm for Removing Global Deadlocks in Multidatabase Systems
• Noname manuscript No. (will be inserted by the editor)
• Top-k Set Similarity Joins Chuan Xiao Wei Wang Xuemin Lin Haichuan Shang
• Towards Multidimensional Subspace Skyline Analysis
• International Journal of Computational Geometry & Applications fl World Scientific Publishing Company
• Surface k-NN Query Processing Ke Deng Xiaofang Zhou Heng Tao Shen
• TKDE SPECIAL ISSUE: KEYWORD SEARCH ON STRUCTURED DATA, 2011 1 SPARK2: Top-k Keyword Query in Relational
• PrefIndex: An Efficient Supergraph Containment Search Technique
• Sliding-Window Top-k Queries on Uncertain Streams Cheqing Jin1
• Efficiently Computing Frequent TreeLike Topology Patterns in a Web Environment
• Finding Top-k Min-Cost Connected Trees in Databases Bolin Ding1
• Clustering Moving Objects for Spatiotemporal Selectivity Estimation Qing Zhang Xuemin Lin
• Improving Backward Recovery in Workflow Systems Chengfei Liuy Maria Orlowskaz Xuemin Lin] Xiaofang Zhouz
• Ecient Computation of a Proximity Matching in Spatial Xuemin Lin and Xiaomei Zhou
• Confirmation: increasing resource availability for transactional workflows
• Duplicate-insensitive Order Statistics Computation over Data Streams
• Selecting Stars: The k Most Representative Skyline Operator Xuemin Lin1
• On the Computational Complexity of Edge Concentration
• Spaceefficient Relative Error Order Sketch over Data Streams Ying Zhang + Xuemin Lin + Jian Xu + Flip Korn Wei Wang +
• An Optimal DivideConquer Algorithm for 2D Skyline Queries
• StraightLine Drawing Algorithms for Hierarchical Graphs and Clustered Graphs #
• Eciently Computing Weighted Proximity Relationships in Spatial Databases
• Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
• Managing Uncertain Data: Probabilistic Approaches Wenjie Zhang #1
• Spring Algorithms and Symmetry \Lambda Peter Eades y Xuemin Lin z
• Error minimization in approximate range aggregates Xuemin Lin *, Qing Zhang, Yidong Yuan, Qing Liu
• Approximate Processing of Massive Continuous Quantile Queries over
• An Efficient Distributed Algorithm for Computing Association Rules
• A Fully Distributed Quorum Consensus Method with High FaultTolerance and Low
• Keyword Search on Structured and Semi-Structured Data , Wei Wang2
• Applying On-Line Bitmap Indexing to Reducing Counting Costs in Mining Association Rules
• Error Minimization for Approximate Computation of Range Aggregates Xuemin Lin and Qing Zhang
• Efficient Similarity Joins for Near Duplicate Detection Chuan Xiao Wei Wang Xuemin Lin
• Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN
• Area Requirements for Drawing Hierarchically Planar Graphs
• Labeling Scheme and Structural Joins for Graph-Structured XML Data
• On Data Allocation With the Minimum Overall CommunicationCosts
• Building a Repository for Workflow Systems Chengfei Liu Xuemin Lin
• Stochastic Skyline Operator Xuemin Lin, Ying Zhang, Wenjie Zhang, Muhammad Aamir Cheema
• Summarizing Level-Two Topological Relations in Large Spatial Datasets
• Connected Substructure Similarity Search Haichuan Shang
• An Optimal Deadlock Resolution Algorithm in Multidatabase Department of Computer Science
• Probabilistic Ranking over Relations Lijun Chang , Jeffrey Xu Yu, Lu Qin
• Subgraph Join: Efficient Processing Subgraph Queries on Graph-Structured XML Document
• Graph Partition Based Multi-Way Spatial Joins Xuemin Lin, Hai-Xin Lu, Qing Zhang
• Delay Optimizations in Quorum Consensus School of Computer Science and Engineering
• Efficient Rank Based KNN Query Processing Over Uncertain Data
• Using Parallel Semi-Join Reduction to Minimize Distributed Query Response Time
• Distributed and Parallel Databases, 3, 69-83 (1995) @ 1995 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
• Influence Zone: Efficiently Processing Reverse k Nearest Neighbors Queries
• TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1 Continuous Monitoring of Distance
• Effectively Indexing the Uncertain Space Ying Zhang, Member, IEEE, Xuemin Lin, Wenjie Zhang, Jianmin Wang, and Qianlu Lin
• Quantile-Based KNN Over Multi-Valued Objects Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Ying Zhang, Wei Wang
• Multi-Guarded Safe Zone: An Effective Technique to Monitor Moving Circular Range Queries
• The VLDB Journal manuscript No. (will be inserted by the editor)
• Efficient Approximate Entity Extraction with Edit Distance Constraints
• Uncertain Location based Range Aggregates in a multi-dimensional space Ying Zhang #
• Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism
• Mining Preferences from Superior and Inferior Examples Xuemin Lin2
• Ranking Queries on Uncertain Data: A Probabilistic Threshold Approach
• Summarizing Order Statistics over Data Streams with Duplicates Ying Zhang1
• Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
• Fast Computation of Reachability Labeling for Large Graphs
• Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs
• Counting Distinct Objects over Sliding Windows Wenjie Zhang 1,2
• Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data
• World Wide Web (2008) 11:485510 DOI 10.1007/s11280-008-0050-4
• Wang B, Yang XC, Wang GR et al. Continually answering constraint k-NN queries in unstructured P2P systems. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 23(4): 538556 July 2008
• Answering Constrained k-NN Queries in Unstructured P2P Systems
• Term Graph Model for Text Classification Wei Wang, Diep Bich Do, and Xuemin Lin
• Similarity Search with Implicit Object Features Xuemin Lin1
• Practical Indexing XML Document for Hongzhi Wang1
• Multi-resolution Algorithms for Building Spatial Histograms Qing Liu Yidong Yuan Xuemin Lin
• On Linear-Spline Based Histograms Qing Zhang and Xuemin Lin
• Efficiently Matching Proximity Relationships in Spatial Databases
• An Effective Parallelization of Execution of Multijoins in Multiprocessor Systems
• Multiscale Histograms: Summarizing Topological Relations in Large Spatial Datasets
• A Multi-Resolution Terrain Model for Efficient Visualization Query Processing
• An Efficient Optimal Algorithm for Minimizing the Overall Communication Cost in Replicated
• Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries
• Confirmation: a Solution for Non-compensatability in Workflow Applications Chengfei Liu Maria Orlowska Xiaofang Zhou Xuemin Lin
• Similarity Search on Supergraph Containment Haichuan Shang #1
• SPARK: A Keyword Search Engine on Relational Databases
• Query Answering Techniques on Uncertain and Probabilistic Data
• A Highly Fault-Tolerant Quorum Consensus Method for Managing Replicated Data
• Towards Area Requirements for Drawing Hierarchically Planar School of Computer Science and Engineering
• On Delay Optimization in Quorum Consensus School of Computer Science and Engineering,
• Stabbing the Sky: Efficient Skyline Computation over Sliding Windows Xuemin Lin Yidong Yuan Wei Wang
• Aggregate Computation over Data Streams Xuemin Lin and Ying Zhang
• A Unified Approach for Computing Top-k Pairs in Multidimensional Space
• Direct Mesh: a Multiresolution Approach to Terrain Visualization Kai Xu Xiaofang Zhou
• J Intell Inf Syst DOI 10.1007/s10844-010-0141-4
• Distance-based Representative Skyline Yufei Tao1 Ling Ding1 Xuemin Lin2 Jian Pei3
• Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data (Extended Abstract)
• Efficiently Mining Tree Traversal Patterns in a Web Environment Xuemin Lin & Xiaomei Zhou
• CircularTrip: An Effective Algorithm for Continuous kNN Queries
• Efficient Computation of the Skyline Cube Yidong Yuan
• Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints
• Continuously Maintaining Order Statistics over Data Streams (Extended Abstract)
• Continuously Maintaining Quantile Summaries of the Most Recent N Elements over a Data Stream
• Fast Computing Reachability Labelings for Large Graphs with High Compression Rate