Back to the main page

Coordinator: Hua Lu (luhua@cs.aau.dk)

• Tanvir Ahmed
• Asif Iqbal Baba
• Sari Haj Hussein
• Benjamin B. Krogh
• Dalia Kaulakiene
• Saulius Samuliavicius
• Shima Shahbazi (sit-in ?)

From the provided paper list below, each participant is supposed to select two papers to present during the entire study group period. The two presentations by a same participant will be done in two different sessions (see the sessions below). Each presentation lasts for ~30 minutes, followed by 15 minutes for question and discussion. Each paricipant is also supposed to read all other papers in the list that she/he does not present, and participate the discussion actively.

SESSION 1: April 19, Thursday, 12.30-14.15, SLV 0.2.15

• Opening remarks by Hua presentation
• Paper presentation by Saulius on paper [3]
• Paper presentation by Sari on paper [13]

SESSION 2: April 26, Thursday, 12.30-14.15, SLV 0.2.15

• Paper presentation by Tanvir on paper [16]
• Paper presentation by Dalia on paper [4]

SESSION 3: May 2, Wednesday, 12.30-14.15, SLV 3.2.16

• Paper presentation by Asif on paper [10]
• Paper presentation by Benjamin on paper [1]

SESSION 4: May 16, Wednesday, 12.30-14.15, SLV 0.2.15

• Paper presentation by Dalia on paper [7]
• Paper presentation by Sari on paper [8]

SESSION 5: May 30, Wednesday, 12.30-14.15, SLV 3.2.16

• Paper presentation by Saulius on paper [14]
• Paper presentation by Benjamin on paper [12]

SESSION 6: June 13, Wednesday, 12.30-14.15, SLV 3.2.16

• Paper presentation by Asif on paper [11]
• Paper presentation by Tanvir on paper [15]
• Closing remarks by Xike

1. A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In Proc. SIGMOD, pages 47–57, 1984.
2. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The r*-tree: An efficient and robust access method for points and rectangles. In Proc. SIGMOD, pages 322–331, 1990.
3. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In Proc. SIGMOD, pages 71–79, 1995.
4. G. R. Hjaltason and H. Samet. Distance browsing in spatial databases. ACM TODS, 24(2):265–318, 1999.
5. S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez. Indexing the Positions of Continuously Moving Objects. In Proc. SIGMOD, pages 331–342, 2000.
6. M. Pelanis, S. Saltenis, and C. S. Jensen. Indexing the Past, Present, and Anticipated Future Positions of Moving Objects. ACM TODS, 31(1):255–298, 2006.
7. M. Zhang, S. Chen, C. S. Jensen, B. C. Ooi, Zhenjie Zhang: Effectively Indexing Uncertain Moving Objects for Predictive Queries. PVLDB 2(1): 1198-1209, 2009.
8. S. Chen, B. C. Ooi, Z. Zhang: An Adaptive Updating Protocol for Reducing Moving Object Databases Workload. PVLDB 3(1): 735-746, 2010.
9. V. P. Chakka, A. Everspaugh, and J. M. Patel. Indexing large trajectory data sets with SETI. In Proc. CIDR, 2003.
10. P. Cudré-Mauroux, E. Wu, and S. Madden. Trajstore: An adaptive storage system for very large trajectory data sets. In Proc. ICDE, pages 109–120, 2010.
11. M. R. Vieira, P. Bakalov, and V. J. Tsotras. Querying trajectories using flexible patterns. In Proc. EDBT, pages 406–417, 2010.
12. M. Hadjieleftheriou, G. Kollios, P. Bakalov, and V. J. Tsotras. Complex spatio-temporal pattern queries. In Proc. VLDB, pages 877–888, 2005.
13. C. S. Jensen, D. Lin, B. C. Ooi, R. Zhang: Effective Density Queries on ContinuouslyMoving Objects. In Proc. ICDE, 2006.
14. G. Gidófalvi, T. B. Pedersen: Mining Long, Sharable Patterns in Trajectories of Moving Objects. GeoInformatica 13(1): 27-55, 2009.
15. H. Gonzalez, J. Han, H. Cheng, X. Li, D. Klabjan, T. Wu: Modeling Massive RFID Data Sets: A Gateway-Based Movement Graph Approach. IEEE TKDE 22(1): 90-104, 2010.
16. X. Li, Z. Li, J. Han, J.-G. Lee: Temporal Outlier Detection in Vehicle Traffic Data. In Proc. ICDE, pages 1319-1322, 2009. (short paper)