2013
165AVR-Tree: Speeding Up the NN and ANN Queries on Location Data. Qianlu Lin, Ying Zhang, Wenjie Zhang, Xuemin Lin. DASFAA (1) 2013, 116-130. Web SearchBibTeXDownload
164On Efficient Graph Substructure Selection. Xiang Zhao, Haichuan Shang, Wenjie Zhang, Xuemin Lin, Weidong Xiao. DASFAA (2) 2013, 284-300. Web SearchBibTeXDownload
163Skyline probability over uncertain preferences. Qing Zhang, Pengjie Ye, Xuemin Lin, Ying Zhang. EDBT 2013, 395-405. Web SearchBibTeXDownload
162A safe zone based approach for monitoring moving skyline queries. Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang, Ying Zhang. EDBT 2013, 275-286. Web SearchBibTeXDownload
161Clustering Uncertain Data Based on Probability Distribution Similarity. Bin Jiang, Jian Pei, Yufei Tao, Xuemin Lin. IEEE Trans. Knowl. Data Eng. (25): 751-763 (2013). Web SearchBibTeXDownload
160Multi-Manifold Ranking: Using Multiple Features for Better Image Retrieval. Yang Wang, Muhammad Aamir Cheema, Xuemin Lin, Qing Zhang. PAKDD (2) 2013, 449-460. Web SearchBibTeXDownload
159High efficiency and quality: large graphs matching. Yuanyuan Zhu, Lu Qin, Jeffrey Xu Yu, Yiping Ke, Xuemin Lin. VLDB J. (22): 345-368 (2013). Web SearchBibTeXDownload
158Efficient general spatial skyline computation. Qianlu Lin, Ying Zhang, Wenjie Zhang, Xuemin Lin. World Wide Web (16): 247-270 (2013). Web SearchBibTeXDownload
2012
157Stochastic skylines. Wenjie Zhang, Xuemin Lin, Ying Zhang, Muhammad Aamir Cheema, Qing Zhang. ACM Trans. Database Syst. (37): 14 (2012). Web SearchBibTeXDownload
156Loyalty-based selection: retrieving objects that persistently satisfy criteria. Zhitao Shen, Muhammad Aamir Cheema, Xuemin Lin. CIKM 2012, 2189-2193. Web SearchBibTeXDownload
155Finding top k most influential spatial facilities over uncertain objects. Liming Zhan, Ying Zhang, Wenjie Zhang, Xuemin Lin. CIKM 2012, 922-931. Web SearchBibTeXDownload
154Human Action Recognition from Video Sequences by Enforcing Tri-view Constraints. Yang Wang, Lin Wu, Xiaodi Huang, Xuemin Lin. Comput. J. (55): 1030-1040 (2012). Web SearchBibTeXDownload
153Top-k Similarity Join over Multi-valued Objects. Wenjie Zhang, Jing Xu, Xin Liang, Ying Zhang, Xuemin Lin. DASFAA (1) 2012, 509-525. Web SearchBibTeXDownload
152Efficient Subgraph Similarity All-Matching. Gaoping Zhu, Ke Zhu, Wenjie Zhang, Xuemin Lin, Chuan Xiao. DASFAA (1) 2012, 455-469. Web SearchBibTeXDownload
151DuoWave: Mitigating the curse of dimensionality for uncertain data. Chunyang Ma, Rui Zhang, Xuemin Lin, Gang Chen. Data Knowl. Eng. (76): 16-38 (2012). Web SearchBibTeXDownload
150Effectively indexing the multi-dimensional uncertain objects for range searching. Ying Zhang, Wenjie Zhang, Qianlu Lin, Xuemin Lin. EDBT 2012, 504-515. Web SearchBibTeXDownload
149Efficiently Monitoring Top-k Pairs over Sliding Windows. Zhitao Shen, Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang, Haixun Wang. ICDE 2012, 798-809. Web SearchBibTeXDownload
148Efficient Graph Similarity Joins with Edit Distance Constraints. Xiang Zhao, Chuan Xiao, Xuemin Lin, Wei Wang. ICDE 2012, 834-845. Web SearchBibTeXDownload
147Efficient Computation of Range Aggregates against Uncertain Location-Based Queries. Ying Zhang, Xuemin Lin, Yufei Tao, Wenjie Zhang, Haixun Wang. IEEE Trans. Knowl. Data Eng. (24): 1244-1258 (2012). Web SearchBibTeXDownload
146Probabilistic skylines on uncertain data: model and bounding-pruning-refining methods. Bin Jiang, Jian Pei, Xuemin Lin, Yidong Yuan. J. Intell. Inf. Syst. (38): 1-39 (2012). Web SearchBibTeXDownload
145SimFusion+: extending simfusion towards efficient estimation on large and dynamic networks. Weiren Yu, Xuemin Lin, Wenjie Zhang, Ying Zhang, Jiajin Le. SIGIR 2012, 365-374. Web SearchBibTeXDownload
144TreeSpan: efficiently computing similarity all-matching. Gaoping Zhu, Xuemin Lin, Ke Zhu, Wenjie Zhang, Jeffrey Xu Yu. SIGMOD Conference 2012, 529-540. Web SearchBibTeXDownload
143On the Efficiency of Estimating Penetrating Rank on Large Graphs. Weiren Yu, Jiajin Le, Xuemin Lin, Wenjie Zhang. SSDBM 2012, 231-249. Web SearchBibTeXDownload
142Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks. Muhammad Aamir Cheema, Wenjie Zhang, Xuemin Lin, Ying Zhang, Xuefei Li. VLDB J. (21): 69-95 (2012). Web SearchBibTeXDownload
141Efficiently processing snapshot and continuous reverse k nearest neighbors queries. Muhammad Aamir Cheema, Wenjie Zhang, Xuemin Lin, Ying Zhang. VLDB J. (21): 703-728 (2012). Web SearchBibTeXDownload
140A Space-Efficient Indexing Algorithm for Boolean Query Processing. Jianbin Qin, Chuan Xiao, Wei Wang, Xuemin Lin. WISE 2012, 638-644. Web SearchBibTeXDownload
139A space and time efficient algorithm for SimRank computation. Weiren Yu, Wenjie Zhang, Xuemin Lin, Qing Zhang, Jiajin Le. World Wide Web (15): 327-353 (2012). Web SearchBibTeXDownload
2011
138Efficient similarity joins for near-duplicate detection. Chuan Xiao, Wei Wang, Xuemin Lin, Jeffrey Xu Yu, Guoren Wang. ACM Trans. Database Syst. (36): 15 (2011). Web SearchBibTeXDownload
137High efficiency and quality: large graphs matching. Yuanyuan Zhu, Lu Qin, Jeffrey Xu Yu, Yiping Ke, Xuemin Lin. CIKM 2011, 1755-1764. Web SearchBibTeXDownload
136BMC: An Efficient Method to Evaluate Probabilistic Reachability Queries. Ke Zhu, Wenjie Zhang, Gaoping Zhu, Ying Zhang, Xuemin Lin. DASFAA (1) 2011, 434-449. Web SearchBibTeXDownload
135A Unified Algorithm for Continuous Monitoring of Spatial Queries. Mahady Hasan, Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang. DASFAA (2) 2011, 104-118. Web SearchBibTeXDownload
134Influence zone: Efficiently processing reverse k nearest neighbors queries. Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang, Ying Zhang. ICDE 2011, 577-588. Web SearchBibTeXDownload
133A unified approach for computing top-k pairs in multidimensional space. Muhammad Aamir Cheema, Xuemin Lin, Haixun Wang, Jianmin Wang, Wenjie Zhang. ICDE 2011, 1031-1042. Web SearchBibTeXDownload
132Stochastic skyline operator. Xuemin Lin, Ying Zhang, Wenjie Zhang, Muhammad Aamir Cheema. ICDE 2011, 721-732. Web SearchBibTeXDownload
131SPARK2: Top-k Keyword Query in Relational Databases. Yi Luo, Wei Wang, Xuemin Lin, Xiaofang Zhou, Jianmin Wang, Keqiu Li. IEEE Trans. Knowl. Data Eng. (23): 1763-1780 (2011). Web SearchBibTeXDownload
130Continuous Monitoring of Distance-Based Range Queries. Muhammad Aamir Cheema, Ljiljana Brankovic, Xuemin Lin, Wenjie Zhang, Wei Wang. IEEE Trans. Knowl. Data Eng. (23): 1182-1199 (2011). Web SearchBibTeXDownload
129Ranking uncertain sky: The probabilistic top-k skyline operator. Ying Zhang, Wenjie Zhang, Xuemin Lin, Bin Jiang, Jian Pei. Inf. Syst. (36): 898-915 (2011). Web SearchBibTeXDownload
128Advanced topics in cloud computing. Keqiu Li, Laurence Tianruo Yang, Xuemin Lin. J. Network and Computer Applications (34): 1033-1034 (2011). Web SearchBibTeXDownload
127Efficient exact edit similarity query processing with the asymmetric signature scheme. Jianbin Qin, Wei Wang, Yifei Lu, Chuan Xiao, Xuemin Lin. SIGMOD Conference 2011, 1033-1044. Web SearchBibTeXDownload
126Subgraph Search over Massive Disk Resident Graphs. Peng Peng, Lei Zou, Lei Chen, Xuemin Lin, Dongyan Zhao. SSDBM 2011, 312-321. Web SearchBibTeXDownload
125Ranking queries on uncertain data. Ming Hua, Jian Pei, Xuemin Lin. VLDB J. (20): 129-153 (2011). Web SearchBibTeXDownload
2010
124Counting distinct objects over sliding windows. Wenjie Zhang, Ying Zhang, Muhammad Aamir Cheema, Xuemin Lin. ADC 2010, 75-84. Web SearchBibTeXDownload
123A Space and Time Efficient Algorithm for SimRank Computation. Weiren Yu, Xuemin Lin, Jiajin Le. APWeb 2010, 164-170. Web SearchBibTeXDownload
122NOVA: A Novel and Efficient Framework for Finding Subgraph Isomorphism Mappings in Large Graphs. Ke Zhu, Ying Zhang, Xuemin Lin, Gaoping Zhu, Wei Wang. DASFAA (1) 2010, 140-154. Web SearchBibTeXDownload
121Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries. Mahady Hasan, Muhammad Aamir Cheema, Wenyu Qu, Xuemin Lin. DASFAA (1) 2010, 233-249. Web SearchBibTeXDownload
120Probabilistic ranking over relations. Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin. EDBT 2010, 477-488. Web SearchBibTeXDownload
119Similarity search on supergraph containment. Haichuan Shang, Ke Zhu, Xuemin Lin, Ying Zhang, Ryutaro Ichise. ICDE 2010, 637-648. Web SearchBibTeXDownload
118Efficient rank based KNN query processing over uncertain data. Ying Zhang, Xuemin Lin, Gaoping Zhu, Wenjie Zhang, Qianlu Lin. ICDE 2010, 28-39. Web SearchBibTeXDownload
117Multi-guarded safe zone: An effective technique to monitor moving circular range queries. Muhammad Aamir Cheema, Ljiljana Brankovic, Xuemin Lin, Wenjie Zhang, Wei Wang. ICDE 2010, 189-200. Web SearchBibTeXDownload
116Quantile-based KNN over multi-valued objects. Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Ying Zhang, Wei Wang. ICDE 2010, 16-27. Web SearchBibTeXDownload
115Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data. Muhammad Aamir Cheema, Xuemin Lin, Wei Wang, Wenjie Zhang, Jian Pei. IEEE Trans. Knowl. Data Eng. (22): 550-564 (2010). Web SearchBibTeXDownload
114Effectively Indexing the Uncertain Space. Ying Zhang, Xuemin Lin, Wenjie Zhang, Jianmin Wang, Qianlu Lin. IEEE Trans. Knowl. Data Eng. (22): 1247-1261 (2010). Web SearchBibTeXDownload
113Duplicate-Insensitive Order Statistics Computation over Data Streams. Ying Zhang, Xuemin Lin, Yidong Yuan, Masaru Kitsuregawa, Xiaofang Zhou, Jeffrey Xu Yu. IEEE Trans. Knowl. Data Eng. (22): 493-507 (2010). Web SearchBibTeXDownload
112MapDupReducer: detecting near duplicates over massive datasets. Chaokun Wang, Jianmin Wang, Xuemin Lin, Wei Wang, Haixun Wang, Hongsong Li, Wanpeng Tian, Jun Xu, Rui Li. SIGMOD Conference 2010, 1119-1122. Web SearchBibTeXDownload
111Connected substructure similarity search. Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu Yu, Wei Wang. SIGMOD Conference 2010, 903-914. Web SearchBibTeXDownload
110PrefIndex: An Efficient Supergraph Containment Search Technique. Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, Haichuan Shang. SSDBM 2010, 360-378. Web SearchBibTeXDownload
109Threshold-based probabilistic top-k dominating queries. Wenjie Zhang, Xuemin Lin, Ying Zhang, Jian Pei, Wei Wang. VLDB J. (19): 283-305 (2010). Web SearchBibTeXDownload
108Sliding-window top-k queries on uncertain streams. Cheqing Jin, Ke Yi, Lei Chen, Jeffrey Xu Yu, Xuemin Lin. VLDB J. (19): 411-435 (2010). Cited by 13Web SearchBibTeXDownload
107Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs. Weiren Yu, Xuemin Lin, Jiajin Le. WAIM 2010, 280-296. Web SearchBibTeXDownload
2009
106Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data. Shuxiang Yang, Wenjie Zhang, Ying Zhang, Xuemin Lin. APWeb/WAIM 2009, 51-62. Web SearchBibTeXDownload
105Data Sketch/Synopsis. Xuemin Lin. Encyclopedia of Database Systems 2009, 634. Web SearchBibTeXDownload
104Uncertain Location Based Range Aggregates in a Multi-dimensional Space. Ying Zhang, Xuemin Lin, Yufei Tao, Wenjie Zhang. ICDE 2009, 1247-1250. Web SearchBibTeXDownload
103Top-k Set Similarity Joins. Chuan Xiao, Wei Wang, Xuemin Lin, Haichuan Shang. ICDE 2009, 916-927. Web SearchBibTeXDownload
102Distance-Based Representative Skyline. Yufei Tao, Ling Ding, Xuemin Lin, Jian Pei. ICDE 2009, 892-903. Cited by 5Web SearchBibTeXDownload
101Probabilistic Skyline Operator over Sliding Windows. Wenjie Zhang, Xuemin Lin, Ying Zhang, Wei Wang, Jeffrey Xu Yu. ICDE 2009, 1060-1071. Cited by 3Web SearchBibTeXDownload
100Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN. Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang, Wei Wang, Wenjie Zhang. PVLDB (2): 1138-1149 (2009). Web SearchBibTeXDownload
99Keyword search on structured and semi-structured data. Yi Chen, Wei Wang, Ziyang Liu, Xuemin Lin. SIGMOD Conference 2009, 1005-1010. Web SearchBibTeXDownload
98Efficient approximate entity extraction with edit distance constraints. Wei Wang, Chuan Xiao, Xuemin Lin, Chengqi Zhang. SIGMOD Conference 2009, 759-770. Web SearchBibTeXDownload
97Efficient Construction of Safe Regions for Moving kNN Queries over Dynamic Datasets. Mahady Hasan, Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang. SSTD 2009, 373-379. Web SearchBibTeXDownload
96Top-k typicality queries and efficient query answering methods on large databases. Ming Hua, Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Ho-Fung Leung. VLDB J. (18): 809-835 (2009). Cited by 1Web SearchBibTeXDownload
2008
95Aggregate Computation over Data Streams. Xuemin Lin, Ying Zhang. APWeb 2008, 10-25. Web SearchBibTeXDownload
94Fast computing reachability labelings for large graphs with high compression rate. Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun Wang, Philip S. Yu. EDBT 2008, 193-204. Cited by 6Web SearchBibTeXDownload
93SPARK: A Keyword Search Engine on Relational Databases. Yi Luo, Wei Wang, Xuemin Lin. ICDE 2008, 1552-1555. Web SearchBibTeXDownload
92Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data. Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin. ICDE 2008, 1403-1405. Cited by 21Web SearchBibTeXDownload
91Spotting Significant Changing Subgraphs in Evolving Graphs. Zheng Liu, Jeffrey Xu Yu, Yiping Ke, Xuemin Lin, Lei Chen. ICDM 2008, 917-922. Cited by 4Web SearchBibTeXDownload
90Continually Answering Constraint k - NN Queries in Unstructured P2P Systems. Bin Wang, Xiaochun Yang, Guoren Wang, Ge Yu, Lei Chen, Xiaoyang Sean Wang, Xuemin Lin. J. Comput. Sci. Technol. (23): 538-556 (2008). Web SearchBibTeXDownload
89Mining preferences from superior and inferior examples. Bin Jiang, Jian Pei, Xuemin Lin, David W. Cheung, Jiawei Han. KDD 2008, 390-398. Web SearchBibTeXDownload
88Sliding-window top-k queries on uncertain streams. Cheqing Jin, Ke Yi, Lei Chen, Jeffrey Xu Yu, Xuemin Lin. PVLDB (1): 301-312 (2008). Cited by 13Web SearchBibTeXDownload
87Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu Yu. PVLDB (1): 364-375 (2008). Cited by 4Web SearchBibTeXDownload
86Ed-Join: an efficient algorithm for similarity joins with edit distance constraints. Chuan Xiao, Wei Wang, Xuemin Lin. PVLDB (1): 933-944 (2008). Cited by 6Web SearchBibTeXDownload
85Query answering techniques on uncertain and probabilistic data: tutorial summary. Jian Pei, Ming Hua, Yufei Tao, Xuemin Lin. SIGMOD Conference 2008, 1357-1364. Cited by 7Web SearchBibTeXDownload
84Ranking queries on uncertain data: a probabilistic threshold approach. Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin. SIGMOD Conference 2008, 673-686. Cited by 43Web SearchBibTeXDownload
83A multi-resolution surface distance model for k-NN query processing. Ke Deng, Xiaofang Zhou, Heng Tao Shen, Qing Liu, Kai Xu, Xuemin Lin. VLDB J. (17): 1101-1119 (2008). Cited by 2Web SearchBibTeXDownload
82Managing Uncertain Data: Probabilistic Approaches. Wenjie Zhang, Xuemin Lin, Jian Pei, Ying Zhang. WAIM 2008, 405-412. Cited by 1Web SearchBibTeXDownload
81Coding-based Join Algorithms for Structural Queries on Graph-Structured XML Document. Hongzhi Wang, Jianzhong Li, Wei Wang, Xuemin Lin. World Wide Web (11): 485-510 (2008). Web SearchBibTeXDownload
80Efficient similarity joins for near duplicate detection. Chuan Xiao, Wei Wang, Xuemin Lin, Jeffrey Xu Yu. WWW 2008, 131-140. Cited by 28Web SearchBibTeXDownload
2007
79Continuously Maintaining Order Statistics over Data Streams. Xuemin Lin. ADC 2007, 7-10. Web SearchBibTeXDownload
78CircularTrip: An Effective Algorithm for Continuous k NN Queries. Muhammad Aamir Cheema, Yidong Yuan, Xuemin Lin. DASFAA 2007, 863-869. Web SearchBibTeXDownload
77Error minimization in approximate range aggregates. Xuemin Lin, Qing Zhang, Yidong Yuan, Qing Liu. Data Knowl. Eng. (62): 156-176 (2007). Web SearchBibTeXDownload
76Selecting Stars: The k Most Representative Skyline Operator. Xuemin Lin, Yidong Yuan, Qing Zhang, Ying Zhang. ICDE 2007, 86-95. Web SearchBibTeXDownload
75Finding Top-k Min-Cost Connected Trees in Databases. Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao Zhang, Xuemin Lin. ICDE 2007, 836-845. Cited by 52Web SearchBibTeXDownload
74Summarizing Order Statistics over Data Streams with Duplicates. Ying Zhang, Xuemin Lin, Yidong Yuan, Masaru Kitsuregawa, Xiaofang Zhou, Jeffrey Xu Yu. ICDE 2007, 1329-1333. Cited by 2Web SearchBibTeXDownload
73Computing Compressed Multidimensional Skyline Cubes Efficiently. Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Haixun Wang. ICDE 2007, 96-105. Cited by 25Web SearchBibTeXDownload
72Spark: top-k keyword query in relational databases. Yi Luo, Xuemin Lin, Wei Wang, Xiaofang Zhou. SIGMOD Conference 2007, 115-126. Cited by 64Web SearchBibTeXDownload
71Efficiently Answering Top-k Typicality Queries on Large Databases. Ming Hua, Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Ho-fung Leung. VLDB 2007, 890-901. Cited by 15Web SearchBibTeXDownload
70Probabilistic Skylines on Uncertain Data. Jian Pei, Bin Jiang, Xuemin Lin, Yidong Yuan. VLDB 2007, 15-26. Cited by 80Web SearchBibTeXDownload
2006
69Towards multidimensional subspace skyline analysis. Jian Pei, Yidong Yuan, Xuemin Lin, Wen Jin, Martin Ester, Qing Liu, Wei Wang, Yufei Tao, Jeffrey Xu Yu, Qing Zhang. ACM Trans. Database Syst. (31): 1335-1381 (2006). Cited by 22Web SearchBibTeXDownload
68Summarizing level-two topological relations in large spatial datasets. Xuemin Lin, Qing Liu, Yidong Yuan, Xiaofang Zhou, Hongjun Lu. ACM Trans. Database Syst. (31): 584-630 (2006). Cited by 5Web SearchBibTeXDownload
67Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi. Algorithmica (44): 1-32 (2006). Cited by 114Web SearchBibTeXDownload
66Answering Constrained k-NN Queries in Unstructured P2P Systems. Bin Wang, Xiaochun Yang, Guoren Wang, Lei Chen, Xiaoyang Sean Wang, Xuemin Lin, Ge Yu. DBISP2P 2006, 397-405. Web SearchBibTeXDownload
65Fast Computation of Reachability Labeling for Large Graphs. Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun Wang, Philip S. Yu. EDBT 2006, 961-979. Cited by 23Web SearchBibTeXDownload
64Surface k-NN Query Processing. Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu, Xuemin Lin. ICDE 2006, 78. Cited by 10Web SearchBibTeXDownload
63Space-efficient Relative Error Order Sketch over Data Streams. Ying Zhang, Xuemin Lin, Jian Xu, Flip Korn, Wei Wang. ICDE 2006, 51. Cited by 6Web SearchBibTeXDownload
62Approximate Processing of Massive Continuous Quantile Queries over High-Speed Data Streams. Xuemin Lin, Jian Xu, Qing Zhang, Hongjun Lu, Jeffrey Xu Yu, Xiaofang Zhou, Yidong Yuan. IEEE Trans. Knowl. Data Eng. (18): 683-698 (2006). Cited by 6Web SearchBibTeXDownload
61A Multiresolution Terrain Model for Efficient Visualization Query Processing. Kai Xu, Xiaofang Zhou, Xuemin Lin, Heng Tao Shen, Ke Deng. IEEE Trans. Knowl. Data Eng. (18): 1382-1396 (2006). Web SearchBibTeXDownload
60Efficient Computation of k-Medians over Data Streams Under Memory Constraints. Zhihong Chong, Jeffrey Xu Yu, Zhengjie Zhang, Xuemin Lin, Wei Wang, Aoying Zhou. J. Comput. Sci. Technol. (21): 284-296 (2006). Cited by 4Web SearchBibTeXDownload
2005
59Term Graph Model for Text Classification. Wei Wang, Diep Bich Do, Xuemin Lin. ADMA 2005, 19-30. Web SearchBibTeXDownload
58Labeling Scheme and Structural Joins for Graph-Structured XML Data. Hongzhi Wang, Wei Wang, Xuemin Lin, Jianzhong Li. APWeb 2005, 277-289. Cited by 6Web SearchBibTeXDownload
57Summarizing Spatial Relations - A Hybrid Histogram. Qing Liu, Xuemin Lin, Yidong Yuan. APWeb 2005, 464-476. Web SearchBibTeXDownload
56Practical Indexing XML Document for Twig Query. Hongzhi Wang, Wei Wang, Jianzhong Li, Xuemin Lin, Reymond Wong. ASIAN 2005, 208-222. Web SearchBibTeXDownload
55Stabbing the Sky: Efficient Skyline Computation over Sliding Windows. Xuemin Lin, Yidong Yuan, Wei Wang, Hongjun Lu. ICDE 2005, 502-513. Cited by 120Web SearchBibTeXDownload
54Locating Motifs in Time-Series Data. Zheng Liu, Jeffrey Xu Yu, Xuemin Lin, Hongjun Lu, Wei Wang. PAKDD 2005, 343-353. Cited by 6Web SearchBibTeXDownload
53Efficient Processing of XML Path Queries Using the Disk-based F&B Index. Wei Wang, Hongzhi Wang, Hongjun Lu, Haifeng Jiang, Xuemin Lin, Jianzhong Li. VLDB 2005, 145-156. Cited by 40Web SearchBibTeXDownload
52Efficient Computation of the Skyline Cube. Yidong Yuan, Xuemin Lin, Qing Liu, Wei Wang, Jeffrey Xu Yu, Qing Zhang. VLDB 2005, 241-252. Cited by 125Web SearchBibTeXDownload
51Similarity Search with Implicit Object Features. Yi Luo, Zheng Liu, Xuemin Lin, Wei Wang, Jeffrey Xu Yu. WAIM 2005, 150-161. Web SearchBibTeXDownload
50Subgraph Join: Efficient Processing Subgraph Queries on Graph-Structured XML Document. Hongzhi Wang, Wei Wang, Xuemin Lin, Jianzhong Li. WAIM 2005, 68-80. Cited by 3Web SearchBibTeXDownload
2004
49Clustering Moving Objects for Spatio-temporal Selectivity Estimation. Qing Zhang, Xuemin Lin. ADC 2004, 123-130. Cited by 15Web SearchBibTeXDownload
48Continuously Maintaining Quantile Summaries of the Most Recent N Elements over a Data Stream. Xuemin Lin, Hongjun Lu, Jian Xu, Jeffrey Xu Yu. ICDE 2004, 362-373. Cited by 41Web SearchBibTeXDownload
47Direct Mesh: a Multiresolution Approach to Terrain Visualization. Kai Xu, Xiaofang Zhou, Xuemin Lin. ICDE 2004, 766-776. Cited by 13Web SearchBibTeXDownload
46A Scalable and I/O Optimal Skyline Processing Algorithm. Yi Luo, Hai-Xin Lu, Xuemin Lin. WAIM 2004, 218-228. Cited by 4Web SearchBibTeXDownload
45Space Efficient Quantile Summary for Constrained Sliding Windows on a Data Stream. Jian Xu, Xuemin Lin, Xiaofang Zhou. WAIM 2004, 34-44. Cited by 6Web SearchBibTeXDownload
2003
44An Optimal Divide-Conquer Algorithm for 2D Skyline Queries. Hai-Xin Lu, Yi Luo, Xuemin Lin. ADBIS 2003, 46-60. Cited by 9Web SearchBibTeXDownload
43Multi-resolution Algorithms for Building Spatial Histograms. Qing Liu, Yidong Yuan, Xuemin Lin. ADC 2003, 145-151. Web SearchBibTeXDownload
42Delay Optimization in Quorum Consensus. Xuemin Lin. Algorithmica (38): 397-413 (2003). Cited by 5Web SearchBibTeXDownload
41Error Minimization for Approximate Computation of Range Aggregate. Xuemin Lin, Qing Zhang. DASFAA 2003, 165-172. Web SearchBibTeXDownload
40Confirmation: increasing resource availability for transactional workflows. Chengfei Liu, Xuemin Lin, Maria E. Orlowska, Xiaofang Zhou. Inf. Sci. (153): 37-53 (2003). Web SearchBibTeXDownload
39Towards area requirements for drawing hierarchically planar graphs. Xuemin Lin, Peter Eades. Theor. Comput. Sci. (292): 679-695 (2003). Web SearchBibTeXDownload
38Multiscale Histograms: Summarizing Topological Relations in Large Spatial Datasets. Xuemin Lin, Qing Liu, Yidong Yuan, Xiaofang Zhou. VLDB 2003, 814-825. Cited by 12Web SearchBibTeXDownload
2002
37Graph Partition Based Muti-Way Spatial Joins. Xuemin Lin, Hai-Xin Lu, Qing Zhang. IDEAS 2002, 23-32. Web SearchBibTeXDownload
36On Linear-Spline Based Histograms. Qing Zhang, Xuemin Lin. WAIM 2002, 354-366. Cited by 3Web SearchBibTeXDownload
2001
35On Processing Cycle Query's Strategy for Semistructure Data Model and Its Role in Design. Jialin Le, Xuemin Lin. CSCWD 2001, 384-388. Web SearchBibTeXDownload
34Improving Backward Recovery in Workflow Systems. Chengfei Liu, Maria E. Orlowska, Xuemin Lin, Xiaofang Zhou. DASFAA 2001, 276-283. Cited by 11Web SearchBibTeXDownload
33Delay Optimizations in Quorum Consensus. Xuemin Lin. ISAAC 2001, 575-586. Web SearchBibTeXDownload
32Efficiently Computing Weighted Proximity Relationships in Spatial Databases. Xuemin Lin, Xiaomei Zhou, Chengfei Liu, Xiaofang Zhou. WAIM 2001, 279-290. Web SearchBibTeXDownload
2000
31Efficient computation of a proximity matching in spatial databases. Xuemin Lin, Xiaomei Zhou, Chengfei Liu. Data Knowl. Eng. (33): 85-102 (2000). Cited by 10Web SearchBibTeXDownload
30On the computational complexity of edge concentration. Xuemin Lin. Discrete Applied Mathematics (101): 197-205 (2000). Cited by 5Web SearchBibTeXDownload
29Spatial Query Processing Using Generalized Filter. Xiaomei Zhou, Xuemin Lin, Chengfei Liu, Jiannong Cao. Int. J. Cooperative Inf. Syst. (9): 77-92 (2000). Web SearchBibTeXDownload
28Spring algorithms and symmetry. Peter Eades, Xuemin Lin. Theor. Comput. Sci. (240): 379-405 (2000). Cited by 52Web SearchBibTeXDownload
27An Efficient Distributed Algorithm for Computing Association Rules. Yijun Li, Xuemin Lin, Chi Ping Tsang. Web-Age Information Management 2000, 109-120. Web SearchBibTeXDownload
1999
26Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. Xuemin Lin, Peter Eades. COCOON 1999, 92-102. Cited by 3Web SearchBibTeXDownload
25On the Optimization of Complex Spatial Queries. Xiaofang Zhou, Yanchun Zhang, Xuemin Lin, Chengfei Liu. CODAS 1999, 252-263. Cited by 2Web SearchBibTeX
24Confirmation: A Solution for Non-Compensatability in Workflow Applications. Chengfei Liu, Maria E. Orlowska, Xiaofang Zhou, Xuemin Lin. ICDE 1999, 102. Web SearchBibTeXDownload
23Applying On-line Bitmap Indexing to Reduce Counting Costs in Mining Association Rules. Xuemin Lin, Yijun Li, Chi Ping Tsang. Inf. Sci. (120): 197-208 (1999). Cited by 9Web SearchBibTeXDownload
22Efficiently Matching Proximity Relationships in Spatial Databases. Xuemin Lin, Xiaomei Zhou, Chengfei Liu. SSD 1999, 188-206. Web SearchBibTeXDownload
21Efficiently Computing Frequent Tree-Like Topology Patterns in a Web Environment. Xuemin Lin, Chengfei Liu, Yanchun Zhang, Xiaofang Zhou. TOOLS (31) 1999, 440-447. Cited by 21Web SearchBibTeXDownload
20Building a Repository for Workflow Systems. Chengfei Liu, Xuemin Lin, Xiaofang Zhou, Maria E. Orlowska. TOOLS (31) 1999, 348-357. Cited by 4Web SearchBibTeXDownload
1997
19Spring Algorithms and Symmetry. Peter Eades, Xuemin Lin. COCOON 1997, 202-211. Web SearchBibTeXDownload
18Area Requirements for Drawing Hierarchically Planar Graphs. Xuemin Lin, Peter Eades. Graph Drawing 1997, 219-229. Cited by 8Web SearchBibTeXDownload
17A Fully Distributed Quorum Consensus Method with High Fault-Tolerance and Low Communication Overhead. Xuemin Lin. Theor. Comput. Sci. (185): 259-275 (1997). Cited by 6Web SearchBibTeXDownload
1996
16Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi. Graph Drawing 1996, 113-128. Cited by 114Web SearchBibTeXDownload
15An optimal deadlock resolution algorithm in multidatabase systems. Xuemin Lin, Jian Chen. ICPADS 1996, 516-521. Cited by 3Web SearchBibTeXDownload
14An Algorithm for Drawing a Hierarchical Graph. Peter Eades, Xuemin Lin, Roberto Tamassia. Int. J. Comput. Geometry Appl. (6): 145-156 (1996). Cited by 30Web SearchBibTeXDownload
13An effective parallelization of execution of multijoins in multiprocessor systems. Xuemin Lin, S. Fox. ISPAN 1996, 63-69. Web SearchBibTeXDownload
12An Optimal Voting Scheme for Minimizing the Overall Communication Cost in Replicated Data Management. Xuemin Lin, Maria E. Orlowska. J. Parallel Distrib. Comput. (35): 97-103 (1996). Cited by 1Web SearchBibTeXDownload
1995
11A Highly Fault-Tolerant Quorum Consensus Method for Managing Replicated Data. Xuemin Lin, Maria E. Orlowska. COCOON 1995, 171-180. Web SearchBibTeXDownload
10An Efficient Processing of a Chain Join with the Minimum Communication Cost in Distributed Database Systems. Xuemin Lin, Maria E. Orlowska. Distributed and Parallel Databases (3): 69-83 (1995). Cited by 2Web SearchBibTeXDownload
9An Integer Linear Programming Approach to Data Allocation with the Minimum Total Communication Cost in Distributed Database Systems. Xuemin Lin, Maria E. Orlowska. Inf. Sci. (85): 1-10 (1995). Web SearchBibTeXDownload
1994
8An Efficient Optimal Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management. Xuemin Lin, Maria E. Orlowska. ISAAC 1994, 243-251. Cited by 1Web SearchBibTeXDownload
1993
7Performance Guarantees for Motion Planning with Temporal Uncertainty. Peter Eades, Xuemin Lin, Nicholas C. Wormald. Australian Computer Journal (25): 21-28 (1993). Cited by 20Web SearchBibTeX
6A New Graphical Method of Vertical Partitioning in Database Design. Xuemin Lin, Yanchun Zhang. Australian Database Conference 1993, 131-144. Cited by 5Web SearchBibTeX
5A Graph Based Cluster Approach for Vertical Partitioning in Database Design. Xuemin Lin, Maria E. Orlowska, Yanchun Zhang. Data Knowl. Eng. (11): 151-169 (1993). Cited by 14Web SearchBibTeXDownload
4On Data Allocation with the Minimum Overall Communication Costs in Distributed Database Design. Xuemin Lin, Maria E. Orlowska, Yanchun Zhang. ICCI 1993, 539-544. Cited by 18Web SearchBibTeX
3A Fast and Effective Heuristic for the Feedback Arc Set Problem. Peter Eades, Xuemin Lin, W. F. Smyth. Inf. Process. Lett. (47): 319-323 (1993). Cited by 55Web SearchBibTeXDownload
2Two Tree Drawing Conventions. Peter Eades, Tao Lin, Xuemin Lin. Int. J. Comput. Geometry Appl. (3): 133-153 (1993). Cited by 46Web SearchBibTeXDownload
1992
1Minimum Size h-v Drawings. Peter Eades, Tao Lin, Xuemin Lin. Advanced Visual Interfaces 1992, 386-394. Web SearchBibTeX
from DBLP and Google Scholar
References
1. ^ The ACM SIGMOD/PODS Conference: Providence, Rhode Island, USA, 2009 - Organization: SIGMOD Program Committee - Retrieved 2009-11-21 - details
2. ^ The ACM SIGMOD/PODS Conference: Vancouver, 2008 - Program: Overview - Retrieved 2009-11-21 - details
3. ^ The ACM SIGMOD/PODS Conference: Providence, Rhode Island, USA, 2009 - Program: SIGMOD Accepted Papers - Retrieved 2009-11-21 - details
Developed by the Database Group at the University of Wisconsin and Yahoo! Research