메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1560-1567

Incremental reverse nearest neighbor ranking

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC ENVIRONMENTS; FEATURE DATABASE; INDEX STRUCTURE; NOVEL CONCEPT; PRE-PROCESSING STEP; RANKING PROBLEMS; REVERSE NEAREST NEIGHBORS;

EID: 67649643412     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.144     Document Type: Conference Paper
Times cited : (13)

References (15)
  • 2
    • 0034818850 scopus 로고    scopus 로고
    • Progressive approximate aggregate queries with a multi-resolution tree structure
    • I. Lazaridis and S. Mehrotra, "Progressive approximate aggregate queries with a multi-resolution tree structure," in Proc. SIGMOD, 2001.
    • (2001) Proc. SIGMOD
    • Lazaridis, I.1    Mehrotra, S.2
  • 3
    • 5444258405 scopus 로고    scopus 로고
    • Efficient olap operations in spatial data warehouses
    • D. Papadias, P. Kalnis, J. Zhang, and Y. Tao, "Efficient olap operations in spatial data warehouses," in Proc. SSTD, 2001.
    • (2001) Proc. SSTD
    • Papadias, D.1    Kalnis, P.2    Zhang, J.3    Tao, Y.4
  • 4
    • 0039845446 scopus 로고    scopus 로고
    • Influenced sets based on reverse nearest neighbor queries
    • F. Korn and S. Muthukrishnan, "Influenced sets based on reverse nearest neighbor queries," in Proc. SIGMOD, 2000.
    • (2000) Proc. SIGMOD
    • Korn, F.1    Muthukrishnan, S.2
  • 5
    • 0034996301 scopus 로고    scopus 로고
    • An index structure for efficient reverse nearest neighbor queries
    • C. Yang and K.-I. Lin, "An index structure for efficient reverse nearest neighbor queries," in Proc. ICDE, 2001.
    • (2001) Proc. ICDE
    • Yang, C.1    Lin, K.-I.2
  • 6
    • 0242263908 scopus 로고    scopus 로고
    • Reverse nearest neighbor queries for dynamic databases
    • I. Stanoi, D. Agrawal, and A. E. Abbadi, "Reverse nearest neighbor queries for dynamic databases," in Proc. DMKD, 2000.
    • (2000) Proc. DMKD
    • Stanoi, I.1    Agrawal, D.2    Abbadi, A.E.3
  • 8
    • 85028132868 scopus 로고    scopus 로고
    • Reverse kNN search in arbitrary dimensionality
    • Y. Tao, D. Papadias, and X. Lian, "Reverse kNN search in arbitrary dimensionality," in Proc. VLDB, 2004.
    • (2004) Proc. VLDB
    • Tao, Y.1    Papadias, D.2    Lian, X.3
  • 9
    • 44649200433 scopus 로고    scopus 로고
    • Ranked reverse nearest neighbor search
    • K. C. K. Lee, B. Zheng, and W.-C. Lee, "Ranked reverse nearest neighbor search," IEEE TKDE, vol. 20, no. 7, pp. 894-910, 2008.
    • (2008) IEEE TKDE , vol.20 , Issue.7 , pp. 894-910
    • Lee, K.C.K.1    Zheng, B.2    Lee, W.-C.3
  • 11
    • 67649661545 scopus 로고    scopus 로고
    • Approximate reverse k-nearest neighbor search in general metric spaces
    • -, "Approximate reverse k-nearest neighbor search in general metric spaces," in Proc. CIKM, 2006.
    • (2006) Proc. CIKM
  • 12
    • 33746874869 scopus 로고    scopus 로고
    • Reverse nearest neighbor search in metric spaces
    • Y. Tao, M. L. Yiu, and N. Mamoulis, "Reverse nearest neighbor search in metric spaces," IEEE TKDE, vol. 18, no. 9, pp. 1239-1252, 2006.
    • (2006) IEEE TKDE , vol.18 , Issue.9 , pp. 1239-1252
    • Tao, Y.1    Yiu, M.L.2    Mamoulis, N.3
  • 13
    • 0021615874 scopus 로고
    • R-Trees: A dynamic index structure for spatial searching
    • A. Guttman, "R-Trees: A dynamic index structure for spatial searching," in Proc. SIGMOD, 1984, pp. 47-57.
    • (1984) Proc. SIGMOD , pp. 47-57
    • Guttman, A.1
  • 14
    • 0025447750 scopus 로고
    • The R*- Tree: An efficient and robust access method for points and rectangles
    • N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, "The R*- Tree: An efficient and robust access method for points and rectangles," in Proc. SIGMOD, 1990, pp. 322-331.
    • (1990) Proc. SIGMOD , pp. 322-331
    • Beckmann, N.1    Kriegel, H.-P.2    Schneider, R.3    Seeger, B.4
  • 15
    • 0001802606 scopus 로고    scopus 로고
    • The X-Tree: An index structure for high-dimensional data
    • S. Berchtold, D. A. Keim, and H.-P. Kriegel, "The X-Tree: An index structure for high-dimensional data," in Proc. VLDB, 1996.
    • (1996) Proc. VLDB
    • Berchtold, S.1    Keim, D.A.2    Kriegel, H.-P.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.