메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1303-1306

Tree indexing on flash disks

Author keywords

[No Author keywords available]

Indexed keywords

B+-TREE; FLASH DISKS; FRACTIONAL CASCADING; LOGARITHMIC METHODS; LOW ENERGY CONSUMPTION; MAGNETIC HARD DISKS; READ PERFORMANCE; SEARCH PERFORMANCE; SPEED-UP; WRITE SPEED;

EID: 67649663882     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.226     Document Type: Conference Paper
Times cited : (72)

References (14)
  • 1
    • 67649641168 scopus 로고    scopus 로고
    • Flash disk opportunity for server applications
    • J. Gray and B. Fitzgerald, "Flash disk opportunity for server applications," ACM Queue, vol. 6, no. 4, pp. 18-23, 2008.
    • (2008) ACM Queue , vol.6 , Issue.4 , pp. 18-23
    • Gray, J.1    Fitzgerald, B.2
  • 2
    • 35448992171 scopus 로고    scopus 로고
    • Design of flash-based dbms: An in-page logging approach
    • S.-W. Lee and B. Moon, "Design of flash-based dbms: an in-page logging approach," in SIGMOD Conference, 2007, pp. 55-66.
    • (2007) SIGMOD Conference , pp. 55-66
    • Lee, S.-W.1    Moon, B.2
  • 3
    • 57149126659 scopus 로고    scopus 로고
    • A case for flash memory ssd in enterprise database applications
    • S.-W. Lee, B. Moon, C. Park, J.-M. Kim, and S.-W. Kim, "A case for flash memory ssd in enterprise database applications," in SIGMOD Conference, 2008, pp. 1075-1086.
    • (2008) SIGMOD Conference , pp. 1075-1086
    • Lee, S.-W.1    Moon, B.2    Park, C.3    Kim, J.-M.4    Kim, S.-W.5
  • 4
    • 27344441029 scopus 로고    scopus 로고
    • Algorithms and data structures for flash memories
    • E. Gal and S. Toledo, "Algorithms and data structures for flash memories," ACM Comput. Surv., vol. 37, no. 2, pp. 138-163, 2005.
    • (2005) ACM Comput. Surv , vol.37 , Issue.2 , pp. 138-163
    • Gal, E.1    Toledo, S.2
  • 6
    • 0030544249 scopus 로고    scopus 로고
    • The logstructured merge-tree (lsm-tree)
    • P. E. O'Neil, E. Cheng, D. Gawlick, and E. J. O'Neil, "The logstructured merge-tree (lsm-tree)," Acta Inf., vol. 33, no. 4, pp. 351-385, 1996.
    • (1996) Acta Inf , vol.33 , Issue.4 , pp. 351-385
    • O'Neil, P.E.1    Cheng, E.2    Gawlick, D.3    O'Neil, E.J.4
  • 8
    • 0347800246 scopus 로고    scopus 로고
    • A novel index supporting high volume data warehouse insertion
    • C. Jermaine, A. Datta, and E. Omiecinski, "A novel index supporting high volume data warehouse insertion," in VLDB, 1999, pp. 235-246.
    • (1999) VLDB , pp. 235-246
    • Jermaine, C.1    Datta, A.2    Omiecinski, E.3
  • 9
    • 85063173612 scopus 로고    scopus 로고
    • Write-optimized b-trees
    • G. Graefe, "Write-optimized b-trees," in VLDB, 2004, pp. 672-683.
    • (2004) VLDB , pp. 672-683
    • Graefe, G.1
  • 10
    • 0018480594 scopus 로고
    • Decomposable searching problems
    • J. L. Bentley, "Decomposable searching problems," Inf. Process. Lett., vol. 8, no. 5, pp. 244-251, 1979.
    • (1979) Inf. Process. Lett , vol.8 , Issue.5 , pp. 244-251
    • Bentley, J.L.1
  • 11
    • 0023010037 scopus 로고
    • Fractional cascading: I. a data structuring technique
    • B. Chazelle and L. J. Guibas, "Fractional cascading: I. a data structuring technique," Algorithmica, vol. 1, no. 2, pp. 133-162, 1986.
    • (1986) Algorithmica , vol.1 , Issue.2 , pp. 133-162
    • Chazelle, B.1    Guibas, L.J.2
  • 12
    • 0018480749 scopus 로고
    • The ubiquitous b-tree
    • D. Comer, "The ubiquitous b-tree," ACM Comput. Surv., vol. 11, no. 2, pp. 121-137, 1979.
    • (1979) ACM Comput. Surv , vol.11 , Issue.2 , pp. 121-137
    • Comer, D.1
  • 14
    • 27344436698 scopus 로고    scopus 로고
    • An efficient b-tree layer implementation for flash-memory storage systems
    • C.-H. Wu, T.-W. Kuo, and L. P. Chang, "An efficient b-tree layer implementation for flash-memory storage systems," in RTCSA, 2003, pp. 409-430.
    • (2003) RTCSA , pp. 409-430
    • Wu, C.-H.1    Kuo, T.-W.2    Chang, L.P.3


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