메뉴 건너뛰기




Volumn 5644 LNCS, Issue , 2009, Pages 265-282

Incremental reverse nearest neighbor ranking in vector spaces

Author keywords

[No Author keywords available]

Indexed keywords

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

EID: 70350389135     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02982-0_18     Document Type: Conference Paper
Times cited : (10)

References (15)
  • 1
    • 0034818850 scopus 로고    scopus 로고
    • Progressive approximate aggregate queries with a multi-resolution tree structure
    • Lazaridis, I., Mehrotra, S.: Progressive approximate aggregate queries with a multi-resolution tree structure. In: Proc. SIGMOD (2001)
    • (2001) Proc. SIGMOD
    • Lazaridis, I.1    Mehrotra, S.2
  • 2
    • 84944047281 scopus 로고    scopus 로고
    • Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: Efficient OLAP operations in spatial data warehouses. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, 2121, p. 443. Springer, Heidelberg (2001)
    • Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: Efficient OLAP operations in spatial data warehouses. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, p. 443. Springer, Heidelberg (2001)
  • 3
    • 0039845446 scopus 로고    scopus 로고
    • Influenced sets based on reverse nearest neighbor queries
    • Korn, F., Muthukrishnan, S.: Influenced sets based on reverse nearest neighbor queries. In: Proc. SIGMOD (2000)
    • (2000) Proc. SIGMOD
    • Korn, F.1    Muthukrishnan, S.2
  • 4
    • 0034996301 scopus 로고    scopus 로고
    • An index structure for efficient reverse nearest neighbor queries
    • Yang, C., Lin, K.I.: An index structure for efficient reverse nearest neighbor queries. In: Proc. ICDE (2001)
    • (2001) Proc. ICDE
    • Yang, C.1    Lin, K.I.2
  • 5
    • 0242263908 scopus 로고    scopus 로고
    • Reverse nearest neighbor queries for dynamic databases
    • Stanoi, I., Agrawal, D., Abbadi, A.E.: Reverse nearest neighbor queries for dynamic databases. In: Proc. DMKD (2000)
    • (2000) Proc. DMKD
    • Stanoi, I.1    Agrawal, D.2    Abbadi, A.E.3
  • 7
    • 85028132868 scopus 로고    scopus 로고
    • Reverse kNN search in arbitrary dimensionality
    • Tao, Y., Papadias, D., Lian, X.: Reverse kNN search in arbitrary dimensionality. In: Proc. VLDB (2004)
    • (2004) Proc. VLDB
    • Tao, Y.1    Papadias, D.2    Lian, X.3
  • 8
    • 44649200433 scopus 로고    scopus 로고
    • Ranked reverse nearest neighbor search
    • Lee, K.C.K., Zheng, B., Lee, W.C.: Ranked reverse nearest neighbor search. IEEE TKDE 20(7), 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
    • 33746874869 scopus 로고    scopus 로고
    • Reverse nearest neighbor search in metric spaces
    • Tao, Y., Yiu, M.L., Mamoulis, N.: Reverse nearest neighbor search in metric spaces. IEEE TKDE 18(9), 1239-1252 (2006)
    • (2006) IEEE TKDE , vol.18 , Issue.9 , pp. 1239-1252
    • Tao, Y.1    Yiu, M.L.2    Mamoulis, N.3
  • 12
    • 0021615874 scopus 로고
    • R-Trees: A dynamic index structure for spatial searching
    • Guttman, A.: R-Trees: A dynamic index structure for spatial searching. In: Proc. SIGMOD, pp. 47-57 (1984)
    • (1984) Proc. SIGMOD , pp. 47-57
    • Guttman, A.1
  • 14
    • 0001802606 scopus 로고    scopus 로고
    • The X-Tree: An index structure for high-dimensional data
    • Berchtold, S., Keim, D.A., Kriegel, H.P.: 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가 분석하여 추출한 것입니다.