메뉴 건너뛰기




Volumn 29, Issue 2, 2000, Pages 343-354

Adaptive multi-stage distance join processing

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0040438346     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/335191.335428     Document Type: Article
Times cited : (64)

References (22)
  • 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 Proceedings of the 1990 ACM-SIGMOD Conference, pages 322-331, Atlantic City, NJ, May 1990.
    • (1990) Proceedings of the 1990 ACM-SIGMOD Conference , pp. 322-331
    • Beckmann, N.1    Kriegel, H.-P.2    Schneider, R.3    Seeger, B.4
  • 9
    • 0001906076 scopus 로고    scopus 로고
    • Reducing the braking distance of an SQL query engine
    • New York, NY, August
    • Michael J. Carey and Donald Kossmann. Reducing the braking distance of an SQL query engine. In Proceedings of the 24th VLDB Conference, pages 158-169, New York, NY, August 1998.
    • (1998) Proceedings of the 24th VLDB Conference , pp. 158-169
    • Carey, M.J.1    Kossmann, D.2
  • 11
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • Boston, MA, June
    • Antonin Guttman. R-Trees: A dynamic index structure for spatial searching. In Proceedings of the 1984 ACM-SIGMOD Conference, pages 47-57, Boston, MA, June 1984.
    • (1984) Proceedings of the 1984 ACM-SIGMOD Conference , pp. 47-57
    • Guttman, A.1
  • 13
    • 0032089982 scopus 로고    scopus 로고
    • Incremental distance join algorithms for spatial databases
    • Seattle, WA, June
    • Gisli R. Hjaltason and Hanan Samet. Incremental distance join algorithms for spatial databases. In Proceedings of the 1998 ACM-SIGMOD Conference, pages 237-248, Seattle, WA, June 1998.
    • (1998) Proceedings of the 1998 ACM-SIGMOD Conference , pp. 237-248
    • Hjaltason, G.R.1    Samet, H.2
  • 18
    • 0025446367 scopus 로고
    • A comparison of spatial query processing techniques for native and parameter spaces
    • Atlantic City, New Jersey, May
    • Jack A. Orenstein. A comparison of spatial query processing techniques for native and parameter spaces. In Proceedings of the 1990 ACM-SIGMOD Conference, pages 343-352, Atlantic City, New Jersey, May 1990.
    • (1990) Proceedings of the 1990 ACM-SIGMOD Conference , pp. 343-352
    • Orenstein, J.A.1
  • 22
    • 0032094249 scopus 로고    scopus 로고
    • Optimal multi-step k-nearest neighbor search
    • Seattle, Washington, June
    • Thomas Seidl and Hans-Peter Kriegel. Optimal multi-step k-nearest neighbor search. In Proceedings of the 1998 ACM-SIGMOD Conference, pages 154-165, Seattle, Washington, June 1998.
    • (1998) Proceedings of the 1998 ACM-SIGMOD Conference , pp. 154-165
    • Seidl, T.1    Kriegel, H.-P.2


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