The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Xuemin Lin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Xuemin Lin, Maria E. Orlowska, Yanchun Zhang
    A Graph Based Cluster Approach for Vertical Partitioning in Database Design. [Citation Graph (1, 0)][DBLP]
    Data Knowl. Eng., 1993, v:11, n:2, pp:151-0 [Journal]
  2. Hai-Xin Lu, Yi Luo, Xuemin Lin
    An Optimal Divide-Conquer Algorithm for 2D Skyline Queries. [Citation Graph (0, 0)][DBLP]
    ADBIS, 2003, pp:46-60 [Conf]
  3. Qing Liu, Yidong Yuan, Xuemin Lin
    Multi-resolution Algorithms for Building Spatial Histograms. [Citation Graph (0, 0)][DBLP]
    ADC, 2003, pp:145-151 [Conf]
  4. Xuemin Lin, Yanchun Zhang
    A New Graphical Method of Vertical Partitioning in Database Design. [Citation Graph (0, 0)][DBLP]
    Australian Database Conference, 1993, pp:131-144 [Conf]
  5. Qing Zhang, Xuemin Lin
    Clustering Moving Objects for Spatio-temporal Selectivity Estimation. [Citation Graph (0, 0)][DBLP]
    ADC, 2004, pp:123-130 [Conf]
  6. Wei Wang, Diep Bich Do, Xuemin Lin
    Term Graph Model for Text Classification. [Citation Graph (0, 0)][DBLP]
    ADMA, 2005, pp:19-30 [Conf]
  7. Qing Liu, Xuemin Lin, Yidong Yuan
    Summarizing Spatial Relations - A Hybrid Histogram. [Citation Graph (0, 0)][DBLP]
    APWeb, 2005, pp:464-476 [Conf]
  8. Hongzhi Wang, Wei Wang, Xuemin Lin, Jianzhong Li
    Labeling Scheme and Structural Joins for Graph-Structured XML Data. [Citation Graph (0, 0)][DBLP]
    APWeb, 2005, pp:277-289 [Conf]
  9. Hongzhi Wang, Wei Wang, Jianzhong Li, Xuemin Lin, Reymond Wong
    Practical Indexing XML Document for Twig Query. [Citation Graph (0, 0)][DBLP]
    ASIAN, 2005, pp:208-222 [Conf]
  10. Peter Eades, Tao Lin, Xuemin Lin
    Minimum Size h-v Drawings. [Citation Graph (0, 0)][DBLP]
    Advanced Visual Interfaces, 1992, pp:386-394 [Conf]
  11. Peter Eades, Xuemin Lin
    Spring Algorithms and Symmetry. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:202-211 [Conf]
  12. Xuemin Lin, Peter Eades
    Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:92-102 [Conf]
  13. Xuemin Lin, Maria E. Orlowska
    A Highly Fault-Tolerant Quorum Consensus Method for Managing Replicated Data. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:171-180 [Conf]
  14. Xiaofang Zhou, Yanchun Zhang, Xuemin Lin, Chengfei Liu
    On the Optimization of Complex Spatial Queries. [Citation Graph (0, 0)][DBLP]
    CODAS, 1999, pp:252-263 [Conf]
  15. Xuemin Lin, Qing Zhang
    Error Minimization for Approximate Computation of Range Aggregate. [Citation Graph (0, 0)][DBLP]
    DASFAA, 2003, pp:165-0 [Conf]
  16. Chengfei Liu, Maria E. Orlowska, Xuemin Lin, Xiaofang Zhou
    Improving Backward Recovery in Workflow Systems. [Citation Graph (0, 0)][DBLP]
    DASFAA, 2001, pp:276-0 [Conf]
  17. Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun Wang, Philip S. Yu
    Fast Computation of Reachability Labeling for Large Graphs. [Citation Graph (0, 0)][DBLP]
    EDBT, 2006, pp:961-979 [Conf]
  18. Peter Eades, Qing-Wen Feng, Xuemin Lin
    Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:113-128 [Conf]
  19. Xuemin Lin, Peter Eades
    Area Requirements for Drawing Hierarchically Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:219-229 [Conf]
  20. Xuemin Lin, Maria E. Orlowska, Yanchun Zhang
    On Data Allocation with the Minimum Overall Communication Costs in Distributed Database Design. [Citation Graph (0, 0)][DBLP]
    ICCI, 1993, pp:539-544 [Conf]
  21. Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu, Xuemin Lin
    Surface k-NN Query Processing. [Citation Graph (0, 0)][DBLP]
    ICDE, 2006, pp:78- [Conf]
  22. Xuemin Lin, Hongjun Lu, Jian Xu, Jeffrey Xu Yu
    Continuously Maintaining Quantile Summaries of the Most Recent N Elements over a Data Stream. [Citation Graph (0, 0)][DBLP]
    ICDE, 2004, pp:362-374 [Conf]
  23. Xuemin Lin, Yidong Yuan, Wei Wang, Hongjun Lu
    Stabbing the Sky: Efficient Skyline Computation over Sliding Windows. [Citation Graph (0, 0)][DBLP]
    ICDE, 2005, pp:502-513 [Conf]
  24. Chengfei Liu, Maria E. Orlowska, Xiaofang Zhou, Xuemin Lin
    Confirmation: A Solution for Non-Compensatability in Workflow Applications. [Citation Graph (0, 0)][DBLP]
    ICDE, 1999, pp:102- [Conf]
  25. Kai Xu, Xiaofang Zhou, Xuemin Lin
    Direct Mesh: a Multiresolution Approach to Terrain Visualization. [Citation Graph (0, 0)][DBLP]
    ICDE, 2004, pp:766-777 [Conf]
  26. Ying Zhang, Xuemin Lin, Jian Xu, Flip Korn, Wei Wang
    Space-efficient Relative Error Order Sketch over Data Streams. [Citation Graph (0, 0)][DBLP]
    ICDE, 2006, pp:51- [Conf]
  27. Xuemin Lin, Jian Chen
    An optimal deadlock resolution algorithm in multidatabase systems. [Citation Graph (0, 0)][DBLP]
    ICPADS, 1996, pp:516-521 [Conf]
  28. Xuemin Lin, Hai-Xin Lu, Qing Zhang
    Graph Partition Based Muti-Way Spatial Joins. [Citation Graph (0, 0)][DBLP]
    IDEAS, 2002, pp:23-32 [Conf]
  29. Xuemin Lin
    Delay Optimizations in Quorum Consensus. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:575-586 [Conf]
  30. Xuemin Lin, Maria E. Orlowska
    An Efficient Optimal Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:243-251 [Conf]
  31. Xuemin Lin, S. Fox
    An effective parallelization of execution of multijoins in multiprocessor systems. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1996, pp:63-69 [Conf]
  32. Zheng Liu, Jeffrey Xu Yu, Xuemin Lin, Hongjun Lu, Wei Wang
    Locating Motifs in Time-Series Data. [Citation Graph (0, 0)][DBLP]
    PAKDD, 2005, pp:343-353 [Conf]
  33. Xuemin Lin, Xiaomei Zhou, Chengfei Liu
    Efficiently Matching Proximity Relationships in Spatial Databases. [Citation Graph (0, 0)][DBLP]
    SSD, 1999, pp:188-206 [Conf]
  34. Xuemin Lin, Qing Liu, Yidong Yuan, Xiaofang Zhou
    Multiscale Histograms: Summarizing Topological Relations in Large Spatial Datasets. [Citation Graph (0, 0)][DBLP]
    VLDB, 2003, pp:814-825 [Conf]
  35. 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. [Citation Graph (0, 0)][DBLP]
    VLDB, 2005, pp:145-156 [Conf]
  36. Yidong Yuan, Xuemin Lin, Qing Liu, Wei Wang, Jeffrey Xu Yu, Qing Zhang
    Efficient Computation of the Skyline Cube. [Citation Graph (0, 0)][DBLP]
    VLDB, 2005, pp:241-252 [Conf]
  37. Yijun Li, Xuemin Lin, Chi Ping Tsang
    An Efficient Distributed Algorithm for Computing Association Rules. [Citation Graph (0, 0)][DBLP]
    Web-Age Information Management, 2000, pp:109-120 [Conf]
  38. Xuemin Lin, Xiaomei Zhou, Chengfei Liu, Xiaofang Zhou
    Efficiently Computing Weighted Proximity Relationships in Spatial Databases. [Citation Graph (0, 0)][DBLP]
    WAIM, 2001, pp:279-290 [Conf]
  39. Yi Luo, Hai-Xin Lu, Xuemin Lin
    A Scalable and I/O Optimal Skyline Processing Algorithm. [Citation Graph (0, 0)][DBLP]
    WAIM, 2004, pp:218-228 [Conf]
  40. Yi Luo, Zheng Liu, Xuemin Lin, Wei Wang, Jeffrey Xu Yu
    Similarity Search with Implicit Object Features. [Citation Graph (0, 0)][DBLP]
    WAIM, 2005, pp:150-161 [Conf]
  41. Hongzhi Wang, Wei Wang, Xuemin Lin, Jianzhong Li
    Subgraph Join: Efficient Processing Subgraph Queries on Graph-Structured XML Document. [Citation Graph (0, 0)][DBLP]
    WAIM, 2005, pp:68-80 [Conf]
  42. Jian Xu, Xuemin Lin, Xiaofang Zhou
    Space Efficient Quantile Summary for Constrained Sliding Windows on a Data Stream. [Citation Graph (0, 0)][DBLP]
    WAIM, 2004, pp:34-44 [Conf]
  43. Qing Zhang, Xuemin Lin
    On Linear-Spline Based Histograms. [Citation Graph (0, 0)][DBLP]
    WAIM, 2002, pp:354-366 [Conf]
  44. Chengfei Liu, Xuemin Lin, Xiaofang Zhou, Maria E. Orlowska
    Building a Repository for Workflow Systems. [Citation Graph (0, 0)][DBLP]
    TOOLS (31), 1999, pp:348-357 [Conf]
  45. Xuemin Lin, Chengfei Liu, Yanchun Zhang, Xiaofang Zhou
    Efficiently Computing Frequent Tree-Like Topology Patterns in a Web Environment. [Citation Graph (0, 0)][DBLP]
    TOOLS (31), 1999, pp:440-447 [Conf]
  46. Peter Eades, Xuemin Lin, Nicholas C. Wormald
    Performance Guarantees for Motion Planning with Temporal Uncertainty. [Citation Graph (0, 0)][DBLP]
    Australian Computer Journal, 1993, v:25, n:1, pp:21-28 [Journal]
  47. Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi
    Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:1, pp:1-32 [Journal]
  48. Xuemin Lin
    Delay Optimization in Quorum Consensus. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:2, pp:397-413 [Journal]
  49. Xuemin Lin
    On the computational complexity of edge concentration. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:197-205 [Journal]
  50. Xuemin Lin, Xiaomei Zhou, Chengfei Liu
    Efficient computation of a proximity matching in spatial databases. [Citation Graph (0, 0)][DBLP]
    Data Knowl. Eng., 2000, v:33, n:1, pp:85-102 [Journal]
  51. Xuemin Lin, Qing Zhang, Yidong Yuan, Qing Liu
    Error minimization in approximate range aggregates. [Citation Graph (0, 0)][DBLP]
    Data Knowl. Eng., 2007, v:62, n:1, pp:156-176 [Journal]
  52. Xuemin Lin, Maria E. Orlowska
    An Efficient Processing of a Chain Join with the Minimum Communication Cost in Distributed Database Systems. [Citation Graph (0, 0)][DBLP]
    Distributed and Parallel Databases, 1995, v:3, n:1, pp:69-83 [Journal]
  53. Peter Eades, Tao Lin, Xuemin Lin
    Two Tree Drawing Conventions. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:2, pp:133-153 [Journal]
  54. Peter Eades, Xuemin Lin, Roberto Tamassia
    An Algorithm for Drawing a Hierarchical Graph. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:2, pp:145-156 [Journal]
  55. Xiaomei Zhou, Xuemin Lin, Chengfei Liu, Jiannong Cao
    Spatial Query Processing Using Generalized Filter. [Citation Graph (0, 0)][DBLP]
    Int. J. Cooperative Inf. Syst., 2000, v:9, n:1-2, pp:77-92 [Journal]
  56. Peter Eades, Xuemin Lin, W. F. Smyth
    A Fast and Effective Heuristic for the Feedback Arc Set Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:6, pp:319-323 [Journal]
  57. Xuemin Lin, Yijun Li, Chi Ping Tsang
    Applying On-line Bitmap Indexing to Reduce Counting Costs in Mining Association Rules. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1999, v:120, n:1-4, pp:197-208 [Journal]
  58. Xuemin Lin, Maria E. Orlowska
    An Integer Linear Programming Approach to Data Allocation with the Minimum Total Communication Cost in Distributed Database Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1995, v:85, n:1-3, pp:1-10 [Journal]
  59. Chengfei Liu, Xuemin Lin, Maria E. Orlowska, Xiaofang Zhou
    Confirmation: increasing resource availability for transactional workflows. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2003, v:153, n:, pp:37-53 [Journal]
  60. Zhihong Chong, Jeffrey Xu Yu, Zhengjie Zhang, Xuemin Lin, Wei Wang, Aoying Zhou
    Efficient Computation of k-Medians over Data Streams Under Memory Constraints. [Citation Graph (0, 0)][DBLP]
    J. Comput. Sci. Technol., 2006, v:21, n:2, pp:284-296 [Journal]
  61. Xuemin Lin, Maria E. Orlowska
    An Optimal Voting Scheme for Minimizing the Overall Communication Cost in Replicated Data Management. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:35, n:1, pp:97-103 [Journal]
  62. Ding-Zhu Du, Peter Eades, Xuemin Lin
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:2, pp:877- [Journal]
  63. Peter Eades, Xuemin Lin
    Spring algorithms and symmetry. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:240, n:2, pp:379-405 [Journal]
  64. Xuemin Lin
    A Fully Distributed Quorum Consensus Method with High Fault-Tolerance and Low Communication Overhead. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:185, n:2, pp:259-275 [Journal]
  65. Xuemin Lin, Peter Eades
    Towards area requirements for drawing hierarchically planar graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:3, pp:679-695 [Journal]
  66. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2006, v:18, n:5, pp:683-698 [Journal]
  67. Kai Xu, Xiaofang Zhou, Xuemin Lin, Heng Tao Shen, Ke Deng
    A Multiresolution Terrain Model for Efficient Visualization Query Processing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2006, v:18, n:10, pp:1382-1396 [Journal]
  68. Xuemin Lin, Qing Liu, Yidong Yuan, Xiaofang Zhou, Hongjun Lu
    Summarizing level-two topological relations in large spatial datasets. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2006, v:31, n:2, pp:584-630 [Journal]
  69. 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. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2006, v:31, n:4, pp:1335-1381 [Journal]
  70. Muhammad Aamir Cheema, Yidong Yuan, Xuemin Lin
    CircularTrip: An Effective Algorithm for Continuous k NN Queries. [Citation Graph (0, 0)][DBLP]
    DASFAA, 2007, pp:863-869 [Conf]
  71. Bin Wang, Xiaochun Yang, Guoren Wang, Lei Chen 0002, Sean X. Wang, Xuemin Lin, Ge Yu
    Answering Constrained k-NN Queries in Unstructured P2P Systems. [Citation Graph (0, 0)][DBLP]
    DBISP2P, 2006, pp:397-405 [Conf]
  72. Xuemin Lin, Yidong Yuan, Qing Zhang, Ying Zhang
    Selecting Stars: The k Most Representative Skyline Operator. [Citation Graph (0, 0)][DBLP]
    ICDE, 2007, pp:86-95 [Conf]
  73. Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Haixun Wang
    Computing Compressed Multidimensional Skyline Cubes Efficiently. [Citation Graph (0, 0)][DBLP]
    ICDE, 2007, pp:96-105 [Conf]
  74. Ying Zhang, Xuemin Lin, Yidong Yuan, Masaru Kitsuregawa, Xiaofang Zhou, Jeffrey Xu Yu
    Summarizing Order Statistics over Data Streams with Duplicates. [Citation Graph (0, 0)][DBLP]
    ICDE, 2007, pp:1329-1333 [Conf]
  75. Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao Zhang, Xuemin Lin
    Finding Top-k Min-Cost Connected Trees in Databases. [Citation Graph (0, 0)][DBLP]
    ICDE, 2007, pp:836-845 [Conf]
  76. Yi Luo, Xuemin Lin, Wei Wang, Xiaofang Zhou
    Spark: top-k keyword query in relational databases. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2007, pp:115-126 [Conf]
  77. Jian Pei, Bin Jiang, Xuemin Lin, Yidong Yuan
    Probabilistic Skylines on Uncertain Data. [Citation Graph (0, 0)][DBLP]
    VLDB, 2007, pp:15-26 [Conf]
  78. Ming Hua, Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Ho-fung Leung
    Efficiently Answering Top-k Typicality Queries on Large Databases. [Citation Graph (0, 0)][DBLP]
    VLDB, 2007, pp:890-901 [Conf]
  79. Ke Deng, Xiaofang Zhou, Heng Tao Shen, Qing Liu, Kai Xu, Xuemin Lin
    A multi-resolution surface distance model for k -NN query processing. [Citation Graph (0, 0)][DBLP]
    VLDB J., 2008, v:0, n:, pp:- [Journal]

  80. Continuously Maintaining Order Statistics over Data Streams. [Citation Graph (, )][DBLP]


  81. Aggregate Computation over Data Streams. [Citation Graph (, )][DBLP]


  82. A Space and Time Efficient Algorithm for SimRank Computation. [Citation Graph (, )][DBLP]


  83. On Processing Cycle Query's Strategy for Semistructure Data Model and Its Role in Design. [Citation Graph (, )][DBLP]


  84. Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries. [Citation Graph (, )][DBLP]


  85. NOVA: A Novel and Efficient Framework for Finding Subgraph Isomorphism Mappings in Large Graphs. [Citation Graph (, )][DBLP]


  86. Fast computing reachability labelings for large graphs with high compression rate. [Citation Graph (, )][DBLP]


  87. Probabilistic ranking over relations. [Citation Graph (, )][DBLP]


  88. SPARK: A Keyword Search Engine on Relational Databases. [Citation Graph (, )][DBLP]


  89. Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data. [Citation Graph (, )][DBLP]


  90. Probabilistic Skyline Operator over Sliding Windows. [Citation Graph (, )][DBLP]


  91. Distance-Based Representative Skyline. [Citation Graph (, )][DBLP]


  92. Top-k Set Similarity Joins. [Citation Graph (, )][DBLP]


  93. Uncertain Location Based Range Aggregates in a Multi-dimensional Space. [Citation Graph (, )][DBLP]


  94. Similarity search on supergraph containment. [Citation Graph (, )][DBLP]


  95. Multi-guarded safe zone: An effective technique to monitor moving circular range queries. [Citation Graph (, )][DBLP]


  96. Efficient rank based KNN query processing over uncertain data. [Citation Graph (, )][DBLP]


  97. Quantile-based KNN over multi-valued objects. [Citation Graph (, )][DBLP]


  98. Spotting Significant Changing Subgraphs in Evolving Graphs. [Citation Graph (, )][DBLP]


  99. Mining preferences from superior and inferior examples. [Citation Graph (, )][DBLP]


  100. Query answering techniques on uncertain and probabilistic data: tutorial summary. [Citation Graph (, )][DBLP]


  101. Ranking queries on uncertain data: a probabilistic threshold approach. [Citation Graph (, )][DBLP]


  102. Keyword search on structured and semi-structured data. [Citation Graph (, )][DBLP]


  103. Efficient approximate entity extraction with edit distance constraints. [Citation Graph (, )][DBLP]


  104. MapDupReducer: detecting near duplicates over massive datasets. [Citation Graph (, )][DBLP]


  105. Connected substructure similarity search. [Citation Graph (, )][DBLP]


  106. Efficient Construction of Safe Regions for Moving kNN Queries over Dynamic Datasets. [Citation Graph (, )][DBLP]


  107. PrefIndex: An Efficient Supergraph Containment Search Technique. [Citation Graph (, )][DBLP]


  108. Managing Uncertain Data: Probabilistic Approaches. [Citation Graph (, )][DBLP]


  109. Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data. [Citation Graph (, )][DBLP]


  110. Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs. [Citation Graph (, )][DBLP]


  111. Efficient similarity joins for near duplicate detection. [Citation Graph (, )][DBLP]


Search in 0.509secs, Finished in 0.512secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002