1. Trie-join: a trie-based method for efficient string similarity joins

   • Jianhua Feng
   • Jiannan Wang
   • Guoliang Li

   Regular Paper 04 October 2011 Pages: 437 - 461

2. Windowed pq-grams for approximate joins of data-centric XML

   • Nikolaus Augsten
   • Michael Böhlen
   • Johann Gamper

   Regular Paper 22 September 2011 Pages: 463 - 488

3. Efficient subsequence matching over large video databases

   • Xiangmin Zhou
   • Xiaofang Zhou
   • Athman Bouguettaya

   Regular Paper 20 September 2011 Pages: 489 - 508

4. GRAIL: a scalable index for reachability queries in very large graphs

   • Hilmi Yıldırım
   • Vineet Chaoji
   • Mohammed J. Zaki

   Regular Paper 23 September 2011 Pages: 509 - 534

5. Efficient and effective similarity search over probabilistic data based on Earth Mover’s Distance

   • Jia Xu
   • Zhenjie Zhang
   • Ge Yu

   Regular Paper 11 November 2011 Pages: 535 - 559

6. A highly optimized algorithm for continuous intersection join queries over moving objects

   • Rui Zhang
   • Jianzhong Qi
   • Raymond Chi-Wing Wong

   Regular Paper 29 October 2011 Pages: 561 - 586