메뉴 건너뛰기




Volumn 2476, Issue , 2002, Pages 254-270

Fully dynamic spatial approximation trees

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; FORESTRY; INFORMATION RETRIEVAL; QUERY PROCESSING; SET THEORY; TOPOLOGY;

EID: 84958753526     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45735-6_23     Document Type: Conference Paper
Times cited : (25)

References (7)
  • 1
    • 0038670812 scopus 로고    scopus 로고
    • Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases
    • September
    • C. Böhm, S. Berchtold, and D. Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys, 33(3):322–373, September 2001.
    • (2001) ACM Computing Surveys , vol.33 , Issue.3 , pp. 322-373
    • Böhm, C.1    Berchtold, S.2    Keim, D.3
  • 4
    • 0032083561 scopus 로고    scopus 로고
    • Multidimensional access methods
    • V. Gaede and O. Günther. Multidimensional access methods. ACM Computing Surveys, 30(2):170–231, 1998.
    • (1998) ACM Computing Surveys , vol.30 , Issue.2 , pp. 170-231
    • Gaede, V.1    Günther, O.2
  • 6
    • 0036706560 scopus 로고    scopus 로고
    • Searching in metric spaces by spatial approximation
    • To appear
    • G. Navarro. Searching in metric spaces by spatial approximation. The VLDB Journal, 2002. To appear.
    • (2002) The VLDB Journal
    • Navarro, G.1


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