메뉴 건너뛰기




Volumn 5566 LNCS, Issue , 2009, Pages 444-460

Reverse k-nearest neighbor search based on aggregate point access methods

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS METHODS; EUCLIDEAN SPACES; EXISTING METHOD; FEATURE SPACE; INDEX STRUCTURE; K NEAREST NEIGHBOR SEARCH; K-NEAREST NEIGHBORS; MULTI-RESOLUTIONS; QUERY EXECUTION; SEARCH PROBLEM;

EID: 69049105732     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02279-1_32     Document Type: Conference Paper
Times cited : (5)

References (14)
  • 1
    • 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
  • 2
    • 0034818850 scopus 로고    scopus 로고
    • Progressive approximate aggregate queries with amulti-resolution tree structure
    • Lazaridis, I.,Mehrotra, S.: Progressive approximate aggregate queries with amulti-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
    • Papadias, D., Kalnis, P., Zhang, J., Tao, Y.: 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
    • 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
  • 5
    • 0025447750 scopus 로고
    • The R*-Tree: An efficient and robust access method for points and rectangles
    • Beckmann, N., Kriegel, H.P., Schneider, R., Seeger, B.: The R*-Tree: An efficient and robust access method for points and rectangles. In: Proc. SIGMOD, pp. 322-331 (1990)
    • (1990) Proc. SIGMOD , pp. 322-331
    • Beckmann, N.1    Kriegel, H.P.2    Schneider, R.3    Seeger, B.4
  • 9
    • 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
  • 10
    • 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
  • 11
    • 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
  • 13
    • 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
  • 14
    • 0001802606 scopus 로고    scopus 로고
    • The X-Tree: An index structure for highdimensional data
    • Berchtold, S., Keim, D.A., Kriegel, H.P.: The X-Tree: An index structure for highdimensional data. In: Proc. VLDB (1996)
    • (1996) Proc. VLDB
    • Berchtold, S.1    Keim, D.A.2    Kriegel, H.P.3


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