메뉴 건너뛰기




Volumn 44, Issue 5, 2001, Pages 384-397

Clustering non-uniform-sized spatial objects to reduce I/O cost for spatial-join processing

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPH THEORY; MATRIX ALGEBRA; QUERY LANGUAGES;

EID: 0035653162     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/44.5.384     Document Type: Article
Times cited : (11)

References (33)
  • 24
    • 0007436170 scopus 로고
    • Clustering a data array and the traveling-salesman problem
    • (1974) Op. Res. , vol.22 , pp. 413-414
    • Lenstra, J.K.1


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