메뉴 건너뛰기




Volumn , Issue , 2001, Pages 231-240

Similarity search for adaptive ellipsoid queries using spatial transformation

Author keywords

[No Author keywords available]

Indexed keywords

NUMBER THEORY;

EID: 23044443931     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (11)

References (16)
  • 3
    • 0025447750 scopus 로고
    • The R∗-tree: An efficient and robust access method for points and rectangles
    • Atlantic City, NJ, May
    • Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, and Bernhard Seeger: "The R∗-tree: An Efficient and Robust Access Method for Points and Rectangles", in Proc. ACM SIGMOD Conf., pp. 322-331, Atlantic City, NJ, May 1990.
    • (1990) Proc ACM SIGMOD Conf. , pp. 322-331
    • Beckmann, N.1    Kriegel, H.2    Schneider, R.3    Seeger, B.4
  • 7
    • 0346614548 scopus 로고    scopus 로고
    • The five-minute rule ten years later and other computer storage rules of thumb
    • December
    • Jim Gray and Goetz Graefe: "The Five-Minute Rule Ten Years Later and Other Computer Storage Rules of Thumb", SIGMOD Record, Vol. 26, No. 4, pp. 63-68, December 1997.
    • (1997) SIGMOD Record , vol.26 , Issue.4 , pp. 63-68
    • Gray, J.1    Graefe, G.2
  • 8
    • 0032083561 scopus 로고    scopus 로고
    • Multidimensional access methods
    • June
    • Volker Gaede and Oliver Guïnther: "Multidimensional Access Methods", ACM Computing Surveys, Vol. 30, No. 2, pp. 170-231, June 1998.
    • (1998) ACM Computing Surveys , vol.30 , Issue.2 , pp. 170-231
    • Gaede, V.1    Guïnther, O.2


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