Approximate indexing in road network databases
暂无分享,去创建一个
Jae Soo Yoo | Sang-Chul Lee | Sang-Wook Kim | Junghoon Lee | Jaesoo Yoo | Sang-Wook Kim | Junghoon Lee | Sang-Chul Lee
[1] Cyrus Shahabi,et al. Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases , 2004, VLDB.
[2] Yufei Tao,et al. Query Processing in Spatial Network Databases , 2003, VLDB.
[3] Wesley W. Chu,et al. An index-based approach for similarity search supporting time warping in large sequence databases , 2001, Proceedings 17th International Conference on Data Engineering.
[4] Gio Wiederhold,et al. Dynamic maintenance of data distribution for selectivity estimation , 2005, The VLDB Journal.
[5] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[6] Christos Faloutsos,et al. FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets , 1995, SIGMOD '95.
[7] Petra Perner,et al. Data Mining - Concepts and Techniques , 2002, Künstliche Intell..
[8] Kaizhong Zhang,et al. Evaluating a class of distance-mapping algorithms for data mining and clustering , 1999, KDD '99.
[9] Christos Faloutsos,et al. Efficient retrieval of similar time sequences under time warping , 1998, Proceedings 14th International Conference on Data Engineering.
[10] Hanan Samet,et al. Distance browsing in spatial databases , 1999, TODS.
[11] Ronald Fagin,et al. Comparing top k lists , 2003, SODA '03.
[12] Pavel Zezula,et al. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.
[13] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.