The min-dist location selection and facility replacement queries
暂无分享,去创建一个
Ge Yu | Lars Kulik | Rui Zhang | Jianzhong Qi | Yanqiu Wang | Andy Yuan Xue
[1] Elisa Bertino,et al. Continuous Intersection Joins Over Moving Objects , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[2] Christian S. Jensen,et al. Discovery of convoys in trajectory databases , 2008, Proc. VLDB Endow..
[3] Stefan Langerman,et al. Reverse facility location problems , 2005, CCCG.
[4] Hanan Samet,et al. Ranking in Spatial Databases , 1995, SSD.
[5] Nick Roussopoulos,et al. Nearest neighbor queries , 1995, SIGMOD '95.
[6] Kotagiri Ramamohanarao,et al. Optimized algorithms for predictive range and KNN queries on moving objects , 2010, Inf. Syst..
[7] Yang Du,et al. On Computing Top-t Most Influential Spatial Sites , 2005, VLDB.
[8] Feifei Li,et al. Optimal location queries in road network databases , 2011, 2011 IEEE 27th International Conference on Data Engineering.
[9] Yufei Tao,et al. Reverse nearest neighbors in large graphs , 2005, 21st International Conference on Data Engineering (ICDE'05).
[10] Yufei Tao,et al. Reverse kNN Search in Arbitrary Dimensionality , 2004, VLDB.
[11] Raymond Chi-Wing Wong,et al. A highly optimized algorithm for continuous intersection join queries over moving objects , 2011, The VLDB Journal.
[12] Rui Zhang,et al. Incremental Evaluation of Visible Nearest Neighbor Queries , 2010, IEEE Transactions on Knowledge and Data Engineering.
[13] Dan Lin,et al. The Min-dist Location Selection Query , 2012, 2012 IEEE 28th International Conference on Data Engineering.
[14] Hui Xiong,et al. High-dimensional kNN joins with incremental updates , 2010, GeoInformatica.
[15] Philip S. Yu,et al. Efficient Method for Maximizing Bichromatic Reverse Nearest Neighbor , 2009, Proc. VLDB Endow..
[16] Wei Wu,et al. Continuous Reverse k-Nearest-Neighbor Monitoring , 2008, The Ninth International Conference on Mobile Data Management (mdm 2008).
[17] Lars Kulik,et al. Analysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries , 2010, The VLDB Journal.
[18] Franz Aurenhammer,et al. Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.
[19] Kyriakos Mouratidis,et al. Medoid Queries in Large Spatial Databases , 2005, SSTD.
[20] Lars Kulik,et al. The V*-Diagram: a query-dependent approach to moving KNN queries , 2008, Proc. VLDB Endow..
[21] King-Ip Lin,et al. An index structure for efficient reverse nearest neighbor queries , 2001, Proceedings 17th International Conference on Data Engineering.
[22] S. Muthukrishnan,et al. Influence sets based on reverse nearest neighbor queries , 2000, SIGMOD '00.
[23] Tele Tan,et al. Design of a Web-Based LBS Framework Addressing Usability, Cost, and Implementation Constraints , 2010, World Wide Web.
[24] Yunjun Gao,et al. Optimal-Location-Selection Query Processing in Spatial Databases , 2009, IEEE Transactions on Knowledge and Data Engineering.
[25] Marios Hadjieleftheriou,et al. R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.
[26] Shazia Wasim Sadiq,et al. Processing Group Nearest Group Query , 2009, 2009 IEEE 25th International Conference on Data Engineering.
[27] Jin Huang,et al. Top-k most influential locations selection , 2011, CIKM '11.
[28] Yang Du,et al. The Optimal-Location Query , 2005, SSTD.
[29] Hans-Peter Kriegel,et al. Efficient processing of spatial joins using R-trees , 1993, SIGMOD Conference.
[30] Divyakant Agrawal,et al. Discovery of Influence Sets in Frequently Updated Databases , 2001, VLDB.
[31] Yufei Tao,et al. Progressive computation of the min-dist optimal-location query , 2006, VLDB.