| 2009 |
|---|
| 108 | | Athman Bouguettaya,
Xuemin Lin:
Database Technologies 2009, Twentieth Australasian Database Conference (ADC 2009), Wellington, New Zealand, 20-23 January, 2009, Proceedings
Australian Computer Society 2009 |
| 107 | EE | Shuxiang Yang,
Wenjie Zhang,
Ying Zhang,
Xuemin Lin:
Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data.
APWeb/WAIM 2009: 51-62 |
| 106 | EE | Wenjie Zhang,
Xuemin Lin,
Ying Zhang,
Wei Wang,
Jeffrey Xu Yu:
Probabilistic Skyline Operator over Sliding Windows.
ICDE 2009: 1060-1071 |
| 105 | EE | Ying Zhang,
Xuemin Lin,
Yufei Tao,
Wenjie Zhang:
Uncertain Location Based Range Aggregates in a Multi-dimensional Space.
ICDE 2009: 1247-1250 |
| 104 | EE | Yufei Tao,
Ling Ding,
Xuemin Lin,
Jian Pei:
Distance-Based Representative Skyline.
ICDE 2009: 892-903 |
| 103 | EE | Chuan Xiao,
Wei Wang,
Xuemin Lin,
Haichuan Shang:
Top-k Set Similarity Joins.
ICDE 2009: 916-927 |
| 2008 |
|---|
| 102 | | Alan Fekete,
Xuemin Lin:
Database Technologies 2008. Proceedings of the Nineteenth Australasian Database Conference, ADC 2008, January 22-25, 2008, Wollongang, NSW, Australia
Australian Computer Society 2008 |
| 101 | | Paolo Missier,
Xuemin Lin,
Ander de Keijzer,
Maurice van Keulen:
Proceedings of the International Workshop on Quality in Databases and Management of Uncertain Data, Auckland, New Zealand, August 2008
QDB/MUD 2008 |
| 100 | EE | Xuemin Lin,
Ying Zhang:
Aggregate Computation over Data Streams.
APWeb 2008: 10-25 |
| 99 | EE | Jiefeng Cheng,
Jeffrey Xu Yu,
Xuemin Lin,
Haixun Wang,
Philip S. Yu:
Fast computing reachability labelings for large graphs with high compression rate.
EDBT 2008: 193-204 |
| 98 | EE | Ming Hua,
Jian Pei,
Wenjie Zhang,
Xuemin Lin:
Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data.
ICDE 2008: 1403-1405 |
| 97 | EE | Yi Luo,
Wei Wang,
Xuemin Lin:
SPARK: A Keyword Search Engine on Relational Databases.
ICDE 2008: 1552-1555 |
| 96 | EE | Zheng Liu,
Jeffrey Xu Yu,
Yiping Ke,
Xuemin Lin,
Lei Chen:
Spotting Significant Changing Subgraphs in Evolving Graphs.
ICDM 2008: 917-922 |
| 95 | EE | Bin Jiang,
Jian Pei,
Xuemin Lin,
David W. Cheung,
Jiawei Han:
Mining preferences from superior and inferior examples.
KDD 2008: 390-398 |
| 94 | EE | Jian Pei,
Ming Hua,
Yufei Tao,
Xuemin Lin:
Query answering techniques on uncertain and probabilistic data: tutorial summary.
SIGMOD Conference 2008: 1357-1364 |
| 93 | EE | Ming Hua,
Jian Pei,
Wenjie Zhang,
Xuemin Lin:
Ranking queries on uncertain data: a probabilistic threshold approach.
SIGMOD Conference 2008: 673-686 |
| 92 | EE | Wenjie Zhang,
Xuemin Lin,
Jian Pei,
Ying Zhang:
Managing Uncertain Data: Probabilistic Approaches.
WAIM 2008: 405-412 |
| 91 | EE | Chuan Xiao,
Wei Wang,
Xuemin Lin,
Jeffrey Xu Yu:
Efficient similarity joins for near duplicate detection.
WWW 2008: 131-140 |
| 90 | EE | Bin Wang,
Xiaochun Yang,
Guoren Wang,
Ge Yu,
Lei Chen,
Xiaoyang Sean Wang,
Xuemin Lin:
Continually Answering Constraint k - NN Queries in Unstructured P2P Systems.
J. Comput. Sci. Technol. 23(4): 538-556 (2008) |
| 89 | EE | Cheqing Jin,
Ke Yi,
Lei Chen,
Jeffrey Xu Yu,
Xuemin Lin:
Sliding-window top-k queries on uncertain streams.
PVLDB 1(1): 301-312 (2008) |
| 88 | EE | Haichuan Shang,
Ying Zhang,
Xuemin Lin,
Jeffrey Xu Yu:
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism.
PVLDB 1(1): 364-375 (2008) |
| 87 | EE | Chuan Xiao,
Wei Wang,
Xuemin Lin:
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints.
PVLDB 1(1): 933-944 (2008) |
| 86 | EE | Ke Deng,
Xiaofang Zhou,
Heng Tao Shen,
Qing Liu,
Kai Xu,
Xuemin Lin:
A multi-resolution surface distance model for k-NN query processing.
VLDB J. 17(5): 1101-1119 (2008) |
| 85 | EE | Hongzhi Wang,
Jianzhong Li,
Wei Wang,
Xuemin Lin:
Coding-based Join Algorithms for Structural Queries on Graph-Structured XML Document.
World Wide Web 11(4): 485-510 (2008) |
| 2007 |
|---|
| 84 | | Guozhu Dong,
Xuemin Lin,
Wei Wang,
Yun Yang,
Jeffrey Xu Yu:
Advances in Data and Web Management, Joint 9th Asia-Pacific Web Conference, APWeb 2007, and 8th International Conference, on Web-Age Information Management, WAIM 2007, Huang Shan, China, June 16-18, 2007, Proceedings
Springer 2007 |
| 83 | EE | Xuemin Lin:
Continuously Maintaining Order Statistics over Data Streams.
ADC 2007: 7-10 |
| 82 | EE | Muhammad Aamir Cheema,
Yidong Yuan,
Xuemin Lin:
CircularTrip: An Effective Algorithm for Continuous k NN Queries.
DASFAA 2007: 863-869 |
| 81 | EE | Ying Zhang,
Xuemin Lin,
Yidong Yuan,
Masaru Kitsuregawa,
Xiaofang Zhou,
Jeffrey Xu Yu:
Summarizing Order Statistics over Data Streams with Duplicates.
ICDE 2007: 1329-1333 |
| 80 | EE | Bolin Ding,
Jeffrey Xu Yu,
Shan Wang,
Lu Qin,
Xiao Zhang,
Xuemin Lin:
Finding Top-k Min-Cost Connected Trees in Databases.
ICDE 2007: 836-845 |
| 79 | EE | Xuemin Lin,
Yidong Yuan,
Qing Zhang,
Ying Zhang:
Selecting Stars: The k Most Representative Skyline Operator.
ICDE 2007: 86-95 |
| 78 | EE | Jian Pei,
Ada Wai-Chee Fu,
Xuemin Lin,
Haixun Wang:
Computing Compressed Multidimensional Skyline Cubes Efficiently.
ICDE 2007: 96-105 |
| 77 | EE | Yi Luo,
Xuemin Lin,
Wei Wang,
Xiaofang Zhou:
Spark: top-k keyword query in relational databases.
SIGMOD Conference 2007: 115-126 |
| 76 | EE | Jian Pei,
Bin Jiang,
Xuemin Lin,
Yidong Yuan:
Probabilistic Skylines on Uncertain Data.
VLDB 2007: 15-26 |
| 75 | EE | Ming Hua,
Jian Pei,
Ada Wai-Chee Fu,
Xuemin Lin,
Ho-fung Leung:
Efficiently Answering Top-k Typicality Queries on Large Databases.
VLDB 2007: 890-901 |
| 74 | EE | Xuemin Lin,
Qing Zhang,
Yidong Yuan,
Qing Liu:
Error minimization in approximate range aggregates.
Data Knowl. Eng. 62(1): 156-176 (2007) |
| 2006 |
|---|
| 73 | EE | Bin Wang,
Xiaochun Yang,
Guoren Wang,
Lei Chen,
Xiaoyang Sean Wang,
Xuemin Lin,
Ge Yu:
Answering Constrained k-NN Queries in Unstructured P2P Systems.
DBISP2P 2006: 397-405 |
| 72 | EE | Jiefeng Cheng,
Jeffrey Xu Yu,
Xuemin Lin,
Haixun Wang,
Philip S. Yu:
Fast Computation of Reachability Labeling for Large Graphs.
EDBT 2006: 961-979 |
| 71 | EE | Ying Zhang,
Xuemin Lin,
Jian Xu,
Flip Korn,
Wei Wang:
Space-efficient Relative Error Order Sketch over Data Streams.
ICDE 2006: 51 |
| 70 | EE | Ke Deng,
Xiaofang Zhou,
Heng Tao Shen,
Kai Xu,
Xuemin Lin:
Surface k-NN Query Processing.
ICDE 2006: 78 |
| 69 | EE | Xuemin Lin,
Qing Liu,
Yidong Yuan,
Xiaofang Zhou,
Hongjun Lu:
Summarizing level-two topological relations in large spatial datasets.
ACM Trans. Database Syst. 31(2): 584-630 (2006) |
| 68 | EE | Jian Pei,
Yidong Yuan,
Xuemin Lin,
Wen Jin,
Martin Ester,
Qing Liu,
Wei Wang,
Yufei Tao,
Jeffrey Xu Yu,
Qing Zhang:
Towards multidimensional subspace skyline analysis.
ACM Trans. Database Syst. 31(4): 1335-1381 (2006) |
| 67 | EE | Peter Eades,
Qing-Wen Feng,
Xuemin Lin,
Hiroshi Nagamochi:
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs.
Algorithmica 44(1): 1-32 (2006) |
| 66 | EE | Kai Xu,
Xiaofang Zhou,
Xuemin Lin,
Heng Tao Shen,
Ke Deng:
A Multiresolution Terrain Model for Efficient Visualization Query Processing.
IEEE Trans. Knowl. Data Eng. 18(10): 1382-1396 (2006) |
| 65 | EE | Xuemin Lin,
Jian Xu,
Qing Zhang,
Hongjun Lu,
Jeffrey Xu Yu,
Xiaofang Zhou,
Yidong Yuan:
Approximate Processing of Massive Continuous Quantile Queries over High-Speed Data Streams.
IEEE Trans. Knowl. Data Eng. 18(5): 683-698 (2006) |
| 64 | EE | Zhihong Chong,
Jeffrey Xu Yu,
Zhengjie Zhang,
Xuemin Lin,
Wei Wang,
Aoying Zhou:
Efficient Computation of k-Medians over Data Streams Under Memory Constraints.
J. Comput. Sci. Technol. 21(2): 284-296 (2006) |
| 2005 |
|---|
| 63 | EE | Wei Wang,
Diep Bich Do,
Xuemin Lin:
Term Graph Model for Text Classification.
ADMA 2005: 19-30 |
| 62 | EE | Hongzhi Wang,
Wei Wang,
Xuemin Lin,
Jianzhong Li:
Labeling Scheme and Structural Joins for Graph-Structured XML Data.
APWeb 2005: 277-289 |
| 61 | EE | Qing Liu,
Xuemin Lin,
Yidong Yuan:
Summarizing Spatial Relations - A Hybrid Histogram.
APWeb 2005: 464-476 |
| 60 | EE | Hongzhi Wang,
Wei Wang,
Jianzhong Li,
Xuemin Lin,
Reymond Wong:
Practical Indexing XML Document for Twig Query.
ASIAN 2005: 208-222 |
| 59 | EE | Xuemin Lin,
Yidong Yuan,
Wei Wang,
Hongjun Lu:
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows.
ICDE 2005: 502-513 |
| 58 | EE | Zheng Liu,
Jeffrey Xu Yu,
Xuemin Lin,
Hongjun Lu,
Wei Wang:
Locating Motifs in Time-Series Data.
PAKDD 2005: 343-353 |
| 57 | EE | Wei Wang,
Hongzhi Wang,
Hongjun Lu,
Haifeng Jiang,
Xuemin Lin,
Jianzhong Li:
Efficient Processing of XML Path Queries Using the Disk-based F&B Index.
VLDB 2005: 145-156 |
| 56 | EE | Yidong Yuan,
Xuemin Lin,
Qing Liu,
Wei Wang,
Jeffrey Xu Yu,
Qing Zhang:
Efficient Computation of the Skyline Cube.
VLDB 2005: 241-252 |
| 55 | EE | Yi Luo,
Zheng Liu,
Xuemin Lin,
Wei Wang,
Jeffrey Xu Yu:
Similarity Search with Implicit Object Features.
WAIM 2005: 150-161 |
| 54 | EE | Hongzhi Wang,
Wei Wang,
Xuemin Lin,
Jianzhong Li:
Subgraph Join: Efficient Processing Subgraph Queries on Graph-Structured XML Document.
WAIM 2005: 68-80 |
| 2004 |
|---|
| 53 | | Jeffrey Xu Yu,
Xuemin Lin,
Hongjun Lu,
Yanchun Zhang:
Advanced Web Technologies and Applications, 6th Asia-Pacific Web Conference, APWeb 2004, Hangzhou, China, April 14-17, 2004, Proceedings
Springer 2004 |
| 52 | EE | Qing Zhang,
Xuemin Lin:
Clustering Moving Objects for Spatio-temporal Selectivity Estimation.
ADC 2004: 123-130 |
| 51 | EE | Xuemin Lin,
Hongjun Lu,
Jian Xu,
Jeffrey Xu Yu:
Continuously Maintaining Quantile Summaries of the Most Recent N Elements over a Data Stream.
ICDE 2004: 362-374 |
| 50 | EE | Kai Xu,
Xiaofang Zhou,
Xuemin Lin:
Direct Mesh: a Multiresolution Approach to Terrain Visualization.
ICDE 2004: 766-777 |
| 49 | EE | Yi Luo,
Hai-Xin Lu,
Xuemin Lin:
A Scalable and I/O Optimal Skyline Processing Algorithm.
WAIM 2004: 218-228 |
| 48 | EE | Jian Xu,
Xuemin Lin,
Xiaofang Zhou:
Space Efficient Quantile Summary for Constrained Sliding Windows on a Data Stream.
WAIM 2004: 34-44 |
| 2003 |
|---|
| 47 | EE | Hai-Xin Lu,
Yi Luo,
Xuemin Lin:
An Optimal Divide-Conquer Algorithm for 2D Skyline Queries.
ADBIS 2003: 46-60 |
| 46 | EE | Qing Liu,
Yidong Yuan,
Xuemin Lin:
Multi-resolution Algorithms for Building Spatial Histograms.
ADC 2003: 145-151 |
| 45 | EE | Xuemin Lin,
Qing Zhang:
Error Minimization for Approximate Computation of Range Aggregate.
DASFAA 2003: 165- |
| 44 | EE | Xuemin Lin,
Qing Liu,
Yidong Yuan,
Xiaofang Zhou:
Multiscale Histograms: Summarizing Topological Relations in Large Spatial Datasets.
VLDB 2003: 814-825 |
| 43 | EE | Xuemin Lin:
Delay Optimization in Quorum Consensus.
Algorithmica 38(2): 397-413 (2003) |
| 42 | EE | Chengfei Liu,
Xuemin Lin,
Maria E. Orlowska,
Xiaofang Zhou:
Confirmation: increasing resource availability for transactional workflows.
Inf. Sci. 153: 37-53 (2003) |
| 41 | | Xuemin Lin,
Peter Eades:
Towards area requirements for drawing hierarchically planar graphs.
Theor. Comput. Sci. 292(3): 679-695 (2003) |
| 2002 |
|---|
| 40 | EE | Xuemin Lin,
Hai-Xin Lu,
Qing Zhang:
Graph Partition Based Muti-Way Spatial Joins.
IDEAS 2002: 23-32 |
| 39 | EE | Qing Zhang,
Xuemin Lin:
On Linear-Spline Based Histograms.
WAIM 2002: 354-366 |
| 38 | | Ding-Zhu Du,
Peter Eades,
Xuemin Lin:
Foreword.
Theor. Comput. Sci. 289(2): 877 (2002) |
| 2001 |
|---|
| 37 | EE | Jialin Le,
Xuemin Lin:
On Processing Cycle Query's Strategy for Semistructure Data Model and Its Role in Design.
CSCWD 2001: 384-388 |
| 36 | | Chengfei Liu,
Maria E. Orlowska,
Xuemin Lin,
Xiaofang Zhou:
Improving Backward Recovery in Workflow Systems.
DASFAA 2001: 276- |
| 35 | EE | Xuemin Lin:
Delay Optimizations in Quorum Consensus.
ISAAC 2001: 575-586 |
| 34 | EE | Xuemin Lin,
Xiaomei Zhou,
Chengfei Liu,
Xiaofang Zhou:
Efficiently Computing Weighted Proximity Relationships in Spatial Databases.
WAIM 2001: 279-290 |
| 2000 |
|---|
| 33 | | Ding-Zhu Du,
Peter Eades,
Vladimir Estivill-Castro,
Xuemin Lin,
Arun Sharma:
Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings
Springer 2000 |
| 32 | EE | Yijun Li,
Xuemin Lin,
Chi Ping Tsang:
An Efficient Distributed Algorithm for Computing Association Rules.
Web-Age Information Management 2000: 109-120 |
| 31 | EE | Xuemin Lin,
Xiaomei Zhou,
Chengfei Liu:
Efficient computation of a proximity matching in spatial databases.
Data Knowl. Eng. 33(1): 85-102 (2000) |
| 30 | | Xuemin Lin:
On the computational complexity of edge concentration.
Discrete Applied Mathematics 101(1-3): 197-205 (2000) |
| 29 | | Xiaomei Zhou,
Xuemin Lin,
Chengfei Liu,
Jiannong Cao:
Spatial Query Processing Using Generalized Filter.
Int. J. Cooperative Inf. Syst. 9(1-2): 77-92 (2000) |
| 28 | EE | Peter Eades,
Xuemin Lin:
Spring algorithms and symmetry.
Theor. Comput. Sci. 240(2): 379-405 (2000) |
| 1999 |
|---|
| 27 | EE | Xuemin Lin,
Peter Eades:
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs.
COCOON 1999: 92-102 |
| 26 | | Xiaofang Zhou,
Yanchun Zhang,
Xuemin Lin,
Chengfei Liu:
On the Optimization of Complex Spatial Queries.
CODAS 1999: 252-263 |
| 25 | EE | Chengfei Liu,
Maria E. Orlowska,
Xiaofang Zhou,
Xuemin Lin:
Confirmation: A Solution for Non-Compensatability in Workflow Applications.
ICDE 1999: 102 |
| 24 | EE | Xuemin Lin,
Xiaomei Zhou,
Chengfei Liu:
Efficiently Matching Proximity Relationships in Spatial Databases.
SSD 1999: 188-206 |
| 23 | EE | Chengfei Liu,
Xuemin Lin,
Xiaofang Zhou,
Maria E. Orlowska:
Building a Repository for Workflow Systems.
TOOLS (31) 1999: 348-357 |
| 22 | EE | Xuemin Lin,
Chengfei Liu,
Yanchun Zhang,
Xiaofang Zhou:
Efficiently Computing Frequent Tree-Like Topology Patterns in a Web Environment.
TOOLS (31) 1999: 440-447 |
| 21 | | Xuemin Lin,
Yijun Li,
Chi Ping Tsang:
Applying On-line Bitmap Indexing to Reduce Counting Costs in Mining Association Rules.
Inf. Sci. 120(1-4): 197-208 (1999) |
| 1998 |
|---|
| 20 | | Xuemin Lin:
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), Perth, WA, Australia, February 2-3, 1998
Springer-Verlag Singapore Pte. Ltd. 1998 |
| 1997 |
|---|
| 19 | | Peter Eades,
Xuemin Lin:
Spring Algorithms and Symmetry.
COCOON 1997: 202-211 |
| 18 | | Xuemin Lin,
Peter Eades:
Area Requirements for Drawing Hierarchically Planar Graphs.
Graph Drawing 1997: 219-229 |
| 17 | EE | Xuemin Lin:
A Fully Distributed Quorum Consensus Method with High Fault-Tolerance and Low Communication Overhead.
Theor. Comput. Sci. 185(2): 259-275 (1997) |
| 1996 |
|---|
| 16 | | Peter Eades,
Qing-Wen Feng,
Xuemin Lin:
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs.
Graph Drawing 1996: 113-128 |
| 15 | EE | Xuemin Lin,
Jian Chen:
An optimal deadlock resolution algorithm in multidatabase systems.
ICPADS 1996: 516-521 |
| 14 | EE | Xuemin Lin,
S. Fox:
An effective parallelization of execution of multijoins in multiprocessor systems.
ISPAN 1996: 63-69 |
| 13 | | Peter Eades,
Xuemin Lin,
Roberto Tamassia:
An Algorithm for Drawing a Hierarchical Graph.
Int. J. Comput. Geometry Appl. 6(2): 145-156 (1996) |
| 12 | | Xuemin Lin,
Maria E. Orlowska:
An Optimal Voting Scheme for Minimizing the Overall Communication Cost in Replicated Data Management.
J. Parallel Distrib. Comput. 35(1): 97-103 (1996) |
| 1995 |
|---|
| 11 | | Xuemin Lin,
Maria E. Orlowska:
A Highly Fault-Tolerant Quorum Consensus Method for Managing Replicated Data.
COCOON 1995: 171-180 |
| 10 | EE | Xuemin Lin,
Maria E. Orlowska:
An Efficient Processing of a Chain Join with the Minimum Communication Cost in Distributed Database Systems.
Distributed and Parallel Databases 3(1): 69-83 (1995) |
| 9 | | Xuemin Lin,
Maria E. Orlowska:
An Integer Linear Programming Approach to Data Allocation with the Minimum Total Communication Cost in Distributed Database Systems.
Inf. Sci. 85(1-3): 1-10 (1995) |
| 1994 |
|---|
| 8 | | Xuemin Lin,
Maria E. Orlowska:
An Efficient Optimal Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management.
ISAAC 1994: 243-251 |
| 1993 |
|---|
| 7 | | Xuemin Lin,
Yanchun Zhang:
A New Graphical Method of Vertical Partitioning in Database Design.
Australian Database Conference 1993: 131-144 |
| 6 | | Xuemin Lin,
Maria E. Orlowska,
Yanchun Zhang:
On Data Allocation with the Minimum Overall Communication Costs in Distributed Database Design.
ICCI 1993: 539-544 |
| 5 | | Peter Eades,
Xuemin Lin,
Nicholas C. Wormald:
Performance Guarantees for Motion Planning with Temporal Uncertainty.
Australian Computer Journal 25(1): 21-28 (1993) |
| 4 | | Xuemin Lin,
Maria E. Orlowska,
Yanchun Zhang:
A Graph Based Cluster Approach for Vertical Partitioning in Database Design.
Data Knowl. Eng. 11(2): 151- (1993) |
| 3 | | Peter Eades,
Xuemin Lin,
W. F. Smyth:
A Fast and Effective Heuristic for the Feedback Arc Set Problem.
Inf. Process. Lett. 47(6): 319-323 (1993) |
| 2 | | Peter Eades,
Tao Lin,
Xuemin Lin:
Two Tree Drawing Conventions.
Int. J. Comput. Geometry Appl. 3(2): 133-153 (1993) |
| 1992 |
|---|
| 1 | | Peter Eades,
Tao Lin,
Xuemin Lin:
Minimum Size h-v Drawings.
Advanced Visual Interfaces 1992: 386-394 |
