Author:
Dehghani Mahdieh,Kamandi Ali,Moeini Ali
Publisher
Springer International Publishing
Reference23 articles.
1. Ester, M., Kriegel, H.P., Sander, J., Xu, X., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, vol. 96, pp. 226–231 (1996)
2. Guttman, A.: R-trees: a dynamic index structure for spatial searching, vol. 14. ACM (1984)
3. Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: ACM SIGMOD Record, vol. 19, pp. 322–331. ACM (1990)
4. White, D.A., Jain, R.: Similarity indexing with the SS-tree. In: ICDE, p. 516. IEEE (1996)
5. Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp. 604–613. ACM (1998)