메뉴 건너뛰기




Volumn , Issue , 2004, Pages 744-755

Reverse NN Search in Arbitrary Dimensionality

Author keywords

[No Author keywords available]

Indexed keywords


EID: 85028132868     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-012088469-8.50066-8     Document Type: Chapter
Times cited : (262)

References (20)
  • 1
    • 84948772383 scopus 로고    scopus 로고
    • Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
    • R. Benetis, C. Jensen, G. Karciauskas and S. Saltenis (2002) Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects. IDEAS
    • (2002) IDEAS
    • Benetis, R.1    Jensen, C.2    Karciauskas, G.3    Saltenis, S.4
  • 2
    • 0001802606 scopus 로고    scopus 로고
    • The X-tree: An Index Structure for High-Dimensional Data
    • S. Berchtold, D. Keim and H. Kriegel (1996) The X-tree: An Index Structure for High-Dimensional Data. VLDB
    • (1996) VLDB
    • Berchtold, S.1    Keim, D.2    Kriegel, H.3
  • 3
    • 0003772933 scopus 로고    scopus 로고
    • Computational Geometry: Algorithms and Applications
    • Springer, 3-540-65620-0
    • M. Berg, M. Kreveld, M. Overmars and O. Schwarzkopf (1997) Computational Geometry: Algorithms and Applications. Springer 3-540-65620-0
    • (1997)
    • Berg, M.1    Kreveld, M.2    Overmars, M.3    Schwarzkopf, O.4
  • 4
    • 0025447750 scopus 로고
    • *-tree: An Efficient and Robust Access Method for Points and Rectangles
    • N. Beckmann, H.P. Kriegel, R. Schneider and B. Seeger (1990) The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. SIGMOD
    • (1990) SIGMOD
    • Beckmann, N.1    Kriegel, H.P.2    Schneider, R.3    Seeger, B.4
  • 5
    • 0003042108 scopus 로고    scopus 로고
    • Enhanced Nearest Neighbour Search on the R-tree
    • K. Cheung and A. Fu (1998) Enhanced Nearest Neighbour Search on the R-tree. SIGMOD Record 27(3), 16-21.
    • (1998) SIGMOD Record , vol.27 , Issue.3 , pp. 16-21
    • Cheung, K.1    Fu, A.2
  • 7
    • 0021615874 scopus 로고
    • R-trees: A Dynamic Index Structure for Spatial Searching
    • A. Guttman (1984) R-trees: A Dynamic Index Structure for Spatial Searching. SIGMOD
    • (1984) SIGMOD
    • Guttman, A.1
  • 9
    • 0012922766 scopus 로고
    • A Distance Scan Algorithm for Spatial Access Structures
    • A Henrich (1994) A Distance Scan Algorithm for Spatial Access Structures. ACM GIS
    • (1994) ACM GIS
    • Henrich, A1
  • 10
    • 0000701994 scopus 로고    scopus 로고
    • Distance Browsing in Spatial Databases
    • G. Hjaltason and H. Samet (1999) Distance Browsing in Spatial Databases. TODS 24(2), 265-318.
    • (1999) TODS , vol.24 , Issue.2 , pp. 265-318
    • Hjaltason, G.1    Samet, H.2
  • 11
    • 85134753094 scopus 로고    scopus 로고
    • Influence Sets Based on Reverse Nearest Neighbor Queries
    • F. Korn and S. Muthukrishnan (2000) Influence Sets Based on Reverse Nearest Neighbor Queries. SIGMOD
    • (2000) SIGMOD
    • Korn, F.1    Muthukrishnan, S.2
  • 12
    • 4243127522 scopus 로고    scopus 로고
    • Reverse Nearest Neighbor Aggregates Over Data Streams
    • F. Korn, S. Muthukrishnan and D. Srivastava (2002) Reverse Nearest Neighbor Aggregates Over Data Streams. VLDB
    • (2002) VLDB
    • Korn, F.1    Muthukrishnan, S.2    Srivastava, D.3
  • 13
    • 33745626332 scopus 로고    scopus 로고
    • Applying Bulk Insertion Techniques for Dynamic Reverse Nearest Neighbor Problems
    • K. Lin, M. Nolen and C. Yang (2003) Applying Bulk Insertion Techniques for Dynamic Reverse Nearest Neighbor Problems. IDEAS
    • (2003) IDEAS
    • Lin, K.1    Nolen, M.2    Yang, C.3
  • 17
    • 18744363040 scopus 로고    scopus 로고
    • High Dimensional Reverse Nearest Neighbor Queries
    • S. A. Singh, H. Ferhatosmanoglu and A. Tosun (2003) High Dimensional Reverse Nearest Neighbor Queries. CIKM
    • (2003) CIKM
    • A., S.1    Ferhatosmanoglu, H.2    Tosun, A.3
  • 18
    • 26444614367 scopus 로고    scopus 로고
    • Discovery of Influence Sets in Frequently Updated Databases
    • I. Stanoi, M. Riedewald, D. Agrawal and A. Abbadi (2001) Discovery of Influence Sets in Frequently Updated Databases. VLDB
    • (2001) VLDB
    • Stanoi, I.1    Riedewald, M.2    Agrawal, D.3    Abbadi, A.4
  • 19
    • 0029706786 scopus 로고    scopus 로고
    • A Model for the Prediction of R-tree Performance
    • Y. Theodoridis and T. Sellis (1996) A Model for the Prediction of R-tree Performance. PODS
    • (1996) PODS
    • Theodoridis, Y.1    Sellis, T.2
  • 20
    • 0034996301 scopus 로고    scopus 로고
    • An Index Structure for Efficient Reverse Nearest Neighbor Queries
    • C. Yang and K. Lin (2001) An Index Structure for Efficient Reverse Nearest Neighbor Queries. ICDE
    • (2001) ICDE
    • Yang, C.1    Lin, K.2


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