Incremental Reverse Nearest Neighbor Ranking
暂无分享,去创建一个
Hans-Peter Kriegel | Peer Kröger | Andreas Züfle | Matthias Renz | Alexander Katzdobler | H. Kriegel | M. Renz | Andreas Züfle | Peer Kröger | Alexander Katzdobler
[1] King-Ip Lin,et al. An index structure for efficient reverse nearest neighbor queries , 2001, Proceedings 17th International Conference on Data Engineering.
[2] Elke Achtert,et al. Efficient reverse k-nearest neighbor search in arbitrary metric spaces , 2006, SIGMOD Conference.
[3] Hans-Peter Kriegel,et al. The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.
[4] S. Muthukrishnan,et al. Influence sets based on reverse nearest neighbor queries , 2000, SIGMOD '00.
[5] Panos Kalnis,et al. Efficient OLAP Operations in Spatial Data Warehouses , 2001, SSTD.
[6] Yufei Tao,et al. Reverse Nearest Neighbor Search in Metric Spaces , 2006, IEEE Transactions on Knowledge and Data Engineering.
[7] Hans-Peter Kriegel,et al. The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.
[8] Amit Singh,et al. High dimensional reverse nearest neighbor queries , 2003, CIKM '03.
[9] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[10] Ken C. K. Lee,et al. Ranked Reverse Nearest Neighbor Search , 2008, IEEE Transactions on Knowledge and Data Engineering.
[11] Hanan Samet,et al. Ranking in Spatial Databases , 1995, SSD.
[12] Yufei Tao,et al. Reverse kNN Search in Arbitrary Dimensionality , 2004, VLDB.
[13] Divyakant Agrawal,et al. Reverse Nearest Neighbor Queries for Dynamic Databases , 2000, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.
[14] Sharad Mehrotra,et al. Progressive approximate aggregate queries with a multi-resolution tree structure , 2001, SIGMOD '01.