Data Management Bin Yao (Assistant Professor) Department of computer science and engineering Shanghai Jiao Tong University

Staff Introduction Bio: ◦ Ph.D, Florida State University, ◦ Research interests:  Database, data management, cloud computing Contact ◦ ◦ Website: ◦ Office number: TA ：陈舒 （ ）

Not to learn:

To Learn ： Spatial Data Spatial data ： GPS, location based service

To Learn ： Text Data Text data ： online search, ecommerce, relation query

To Learn ： Distributed Data Distributed data ： network disk ， distributed database ， cloud based application

To Learn ： Social Data Graph data ： facebook ， flickr ， Wiki, Foursquare, weibo

Schedule ◦ Time: (Week 1-8)  Tuesday : class 3,4 ； Thursday : class 9,10. ◦ Place:  Room 105, Dong Shang Yuan ( 东上院 105). ◦ Lab hours:  Any time out of class

Textbook and reference Textbook ◦ No Reference ◦ A lot Some materials distribution before class.

Evaluation Policy Individual assignments: 20% Project assignments: 70% Class participation: 10% Exam: no

Individual assignment ◦ A summary report on a chosen paper in the reference list (10%)  1 page, in English  Using Latex, ◦ Presentation for the paper (10%)  5 minutes  1-5 minutes Q&A section ◦ Time schedule:  Report submitted by March 15th, 23:59:59  Presentation time: in classes from March 19th

Paper list (each for 4 students) (1) A. Guttman. "R-Trees: A Dynamic Index Structure for Spatial Searching", SIGMOD84 (2) Beckmann, etc. "The R*-tree: an efficient and robust access method for points and rectangles”, SIGMOD90 (3) T. Sellis, etc. ”The R+-Tree: A dynamic index for multi- dimensional objects”, VLDB87 (4) I. Kamel and C. Faloutsos, “On Packing R-trees”, CIKM93 (5) Arge, L., etc. "The Priority R-tree“, SIGMOD04 (6) Berchtold, S., etc. "The X-Tree: An Index Structure for High- Dimensional Data“, VLDB96 (7) N. Roussopoulos, etc. “Nearest Neighbor Queries”, SIGMOD95 (8) Scott T. Leutenegger, etc, “STR: A Simple and Efficient Algorithm for R-Tree Packing”, technical report, 1997 (9) B. Becker, etc. “An asymptotically optimal multiversion B-tree”,VLDBJ96