메뉴 건너뛰기




Volumn 13, Issue 4, 2002, Pages 413-431

Permutation-based range-join algorithms on N-dimensional meshes

Author keywords

Analysis of algorithms; Data permutation; N dimensional meshes; Parallel processing; Performance; Range join operations; Relational databases

Indexed keywords

DATA PERMUTATION; N-DIMENSIONAL MESHES; RANGE-JOIN OPERATIONS;

EID: 0036529776     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.995821     Document Type: Article
Times cited : (3)

References (19)
  • 2
    • 4244173493 scopus 로고
    • Efficient parallel permutation-based range-join algorithms on mesh-connected computers
    • Technical Report CIT-94-19, CIT, Griffith Univ., Australia, Aug.
    • (1994)
    • Chen, S.D.1    Shen, H.2    Topor, R.W.3
  • 6
    • 0026870271 scopus 로고
    • Parallel database systems: The future of high performance database systems
    • (1992) Comm. ACM , vol.35 , Issue.6 , pp. 85-98
    • DeWitt, D.J.1    Gray, J.2
  • 12
  • 14
    • 0029195571 scopus 로고
    • Efficient parallel k-set chain range-join in hypercubes
    • (1995) Computer J. , vol.38 , Issue.3 , pp. 217-225
    • Shen, H.1
  • 15
    • 0029251674 scopus 로고
    • An efficient permutation-based parallel algorithm for range-join in hypercubes
    • (1995) Parallel Computing , vol.21 , pp. 303-313
    • Shen, H.1


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