메뉴 건너뛰기




Volumn 27, Issue 2, 1998, Pages 472-483

Memory management during run generation in external sorting

Author keywords

Last run optimization; Memory management; Merge sort; Replacement selection; Run formation; Sorting; Variable length records

Indexed keywords

ALGORITHMS; MERGING; SORTING; STORAGE ALLOCATION (COMPUTER);

EID: 0032091597     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/276305.276346     Document Type: Article
Times cited : (31)

References (11)
  • 1
    • 0026974993 scopus 로고
    • A Survey of Adaptive Sorting Algorithms
    • Vladimir Estivill-Castro, Derick Wood: A Survey of Adaptive Sorting Algorithms. Computing Surveys 24(4): 441-476 (1992)
    • (1992) Computing Surveys , vol.24 , Issue.4 , pp. 441-476
    • Estivill-Castro, V.1    Wood, D.2
  • 2
    • 0027608375 scopus 로고
    • Query Evaluation Techniques for Large Databases
    • Goetz Graefe, Query Evaluation Techniques for Large Databases. ACM Computing Surveys 25(2): 73-170 (1993).
    • (1993) ACM Computing Surveys , vol.25 , Issue.2 , pp. 73-170
    • Graefe, G.1
  • 3
    • 0028202001 scopus 로고
    • Sort-Merge-Join: An Idea whose Time Has(h) Passed?
    • Goetz Graefe, Sort-Merge-Join: An Idea whose Time Has(h) Passed? Proc. Data Engineering Conf. 1994: 406-417.
    • (1994) Proc. Data Engineering Conf. , pp. 406-417
    • Graefe, G.1
  • 4
    • 0006754799 scopus 로고
    • Hash-Partitioned Join Method Using Dynamic Destaging Strategy
    • Masaya Nakayama, Masaru Kitsuregawa, Hash-Partitioned Join Method Using Dynamic Destaging Strategy. Proc. VLDB Conf. 1988: 468-478
    • (1988) Proc. VLDB Conf. , pp. 468-478
    • Nakayama, M.1    Kitsuregawa, M.2
  • 8
    • 0026618434 scopus 로고
    • Prefetching with Multiple Disks for External Mergesort: Simulation and Analysis
    • Vinay S. Pai, Peter J. Varman: Prefetching with Multiple Disks for External Mergesort: Simulation and Analysis. Proc. Data Engineering Conf., 1992: 273-282
    • (1992) Proc. Data Engineering Conf. , pp. 273-282
    • Pai, V.S.1    Varman, P.J.2
  • 9
    • 0024940044 scopus 로고
    • Merging Sorted Runs Using Large Main Memory
    • Betty Salzberg: Merging Sorted Runs Using Large Main Memory. Acta Informatica, 27(3): 195-215 (1989)
    • (1989) Acta Informatica , vol.27 , Issue.3 , pp. 195-215
    • Salzberg, B.1
  • 10
    • 0003308071 scopus 로고
    • Dynamic Storage Allocation: A Survey and Critical Review
    • Kinross, Scotland, UK
    • Paul R. Wilson, Mark S. Johnstone, Michael Neely, and David Boles: Dynamic Storage Allocation: A Survey and Critical Review. In International Workshop on Memory Management, Kinross, Scotland, UK, 1995. Also http://www.cs.utexas.edu/users/oops/papers.html.
    • (1995) International Workshop on Memory Management
    • Wilson, P.R.1    Johnstone, M.S.2    Neely, M.3    Boles, D.4


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