메뉴 건너뛰기




Volumn 2005-January, Issue January, 2005, Pages 83-88

Utilizing indexes for approximate and on-line nearest neighbor queries

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; DECISION TREES; ECONOMIC AND SOCIAL EFFECTS; SOCIAL NETWORKING (ONLINE);

EID: 84937134652     PISSN: 10988068     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IDEAS.2005.54     Document Type: Conference Paper
Times cited : (8)

References (8)
  • 1
    • 0038670812 scopus 로고    scopus 로고
    • Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases
    • Bohm, C., S. Berchtold, and D.A. Keim, Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys, 2001. 33(3): p. 322-373.
    • (2001) ACM Computing Surveys , vol.33 , Issue.3 , pp. 322-373
    • Bohm, C.1    Berchtold, S.2    Keim, D.A.3
  • 2
    • 0033906160 scopus 로고    scopus 로고
    • PAC nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spaces
    • San Diego, California, USA
    • Ciaccia, P. and M. Patella. PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces. In The 16th International Conference on Data Engineering. 2000. San Diego, California, USA.
    • (2000) The 16th International Conference on Data Engineering
    • Ciaccia, P.1    Patella, M.2
  • 4
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • Boston, MA
    • Guttman, A. R-trees: A dynamic index structure for spatial searching. in ACM-SIGMOD Conference on Management of Data. 1984: Boston, MA.
    • (1984) ACM-SIGMOD Conference on Management of Data
    • Guttman, A.1


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