메뉴 건너뛰기




Volumn 25, Issue 2, 1996, Pages 389-400

Towards Effective and Efficient Free Space Management

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; HEURISTIC PROGRAMMING; INPUT OUTPUT PROGRAMS; RESOURCE ALLOCATION; STORAGE ALLOCATION (COMPUTER);

EID: 0030157144     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/235968.233355     Document Type: Article
Times cited : (12)

References (14)
  • 7
    • 0037917021 scopus 로고
    • B-Trees with Inserts and Deletes: Why Free-at-Empty Is Better Than Merge-at-Half
    • T. Johnson and D. Shasha. B-Trees with Inserts and Deletes: Why Free-at-Empty Is Better Than Merge-at-Half. Journal of Computer and System Sciences, 47:45-76, 1993.
    • (1993) Journal of Computer and System Sciences , vol.47 , pp. 45-76
    • Johnson, T.1    Shasha, D.2
  • 10
    • 1842510770 scopus 로고
    • Method for Reserving Space Needed for "Rollback" Actions
    • November
    • Bruce G. Lindsay, C. Mohan, and M. Hamid Pirahesh. Method for Reserving Space Needed for "Rollback" Actions. IBM Technical Disclosure Bulletin, 29(6):2743-2746, November 1986.
    • (1986) IBM Technical Disclosure Bulletin , vol.29 , Issue.6 , pp. 2743-2746
    • Lindsay, B.G.1    Mohan, C.2    Hamid Pirahesh, M.3
  • 12
    • 85033756227 scopus 로고
    • October Private communication
    • C. Mohan, October 1995. Private communication.
    • (1995)
    • Mohan, C.1
  • 14
    • 1842510774 scopus 로고
    • NonStop SQL: A Distributed High Performance, High Availability Implementation of SQL
    • Spring Verlag
    • Tandem Database Group. NonStop SQL: A Distributed High Performance, High Availability Implementation of SQL. In High Performance Transaction Systems. Spring Verlag, 1987.
    • (1987) High Performance Transaction Systems


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