메뉴 건너뛰기




Volumn 27, Issue 2, 1998, Pages 142-153

The pyramid-technique: Towards breaking the curse of dimensionality

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; DATA STRUCTURES; INFORMATION MANAGEMENT; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; QUERY LANGUAGES;

EID: 0032094513     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/276305.276318     Document Type: Article
Times cited : (366)

References (23)
  • 1
    • 0015489880 scopus 로고
    • Organization and Maintenance of Large Ordered Indices
    • Bayer R., McCreight E.M.: 'Organization and Maintenance of Large Ordered Indices', Acta Informatica 1(3), 1977, pp. 173-189.
    • (1977) Acta Informatica , vol.1 , Issue.3 , pp. 173-189
    • Bayer, R.1    McCreight, E.M.2
  • 3
    • 0012975570 scopus 로고    scopus 로고
    • Improving the Query Performance of High-Dimensional Index Structures Using Bulk-Load Operations
    • Valencia, Spain
    • Berchtold S., Böhm C., Kriegel H.-P.: 'Improving the Query Performance of High-Dimensional Index Structures Using Bulk-Load Operations', 6th. Int. Conf. on Extending Database Technology, Valencia, Spain, 1998.
    • (1998) 6th. Int. Conf. on Extending Database Technology
    • Berchtold, S.1    Böhm, C.2    Kriegel, H.-P.3
  • 10
    • 0018480749 scopus 로고
    • The Ubiquitous B-tree
    • Comer D.: 'The Ubiquitous B-tree', ACM Computing Surveys 11(2), 1979, pp. 121-138
    • (1979) ACM Computing Surveys , vol.11 , Issue.2 , pp. 121-138
    • Comer, D.1
  • 14
    • 84945709355 scopus 로고
    • An Algorithm for Finding Best Matches in Logarithmic Expected Time
    • September
    • Friedman J. H., Bentley J. L., Finkel R. A.: 'An Algorithm for Finding Best Matches in Logarithmic Expected Time', ACM Transactions on Mathematical Software, Vol. 3, No. 3, September 1977, pp. 209-226.
    • (1977) ACM Transactions on Mathematical Software , vol.3 , Issue.3 , pp. 209-226
    • Friedman, J.H.1    Bentley, J.L.2    Finkel, R.A.3
  • 18
    • 0031162081 scopus 로고    scopus 로고
    • The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries
    • Katayama N., Satoh S.: 'The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries', Proc. ACM SIGMOD Int. Conf. on Management of Data, 1997, pp. 369-380.
    • (1997) Proc. ACM SIGMOD Int. Conf. on Management of Data , pp. 369-380
    • Katayama, N.1    Satoh, S.2
  • 19
    • 34249762939 scopus 로고
    • The TV-Tree: An Index Structure for High-Dimensional Data
    • Lin K., Jagadish H. V., Faloutsos C.: 'The TV-Tree: An Index Structure for High-Dimensional Data', VLDB Journal, Vol. 3, pp. 517-542, 1995.
    • (1995) VLDB Journal , vol.3 , pp. 517-542
    • Lin, K.1    Jagadish, H.V.2    Faloutsos, C.3
  • 21
    • 85010847034 scopus 로고
    • The K-D-B-tree: A Search Structure for Large Multidimensional Dynamic Indexes
    • Robinson J. T.: 'The K-D-B-tree: A Search Structure for Large Multidimensional Dynamic Indexes', Proc. ACM SIGMOD Int. Conf. on Management of Data, 1981, pp. 10-18.
    • (1981) Proc. ACM SIGMOD Int. Conf. on Management of Data , pp. 10-18
    • Robinson, J.T.1


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