메뉴 건너뛰기




Volumn 3, Issue 1, 2010, Pages 1195-1206

Tree indexing on solid state drives

Author keywords

[No Author keywords available]

Indexed keywords

ENERGY UTILIZATION; FINITE DIFFERENCE METHOD; FLASH-BASED SSDS; INDEXING (OF INFORMATION);

EID: 78651273358     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920990     Document Type: Article
Times cited : (141)

References (28)
  • 1
    • 84859389785 scopus 로고    scopus 로고
    • Lazy-adaptive tree: An optimized index structure for flash devices
    • D. Agrawal, D. Ganesan, R. Sitaraman, Y. Diao, and S. Singh. Lazy-adaptive tree: An optimized index structure for flash devices. PVLDB, 2(1):361-372, 2009.
    • (2009) PVLDB , vol.2 , Issue.1 , pp. 361-372
    • Agrawal, D.1    Ganesan, D.2    Sitaraman, R.3    Diao, Y.4    Singh, S.5
  • 2
    • 0000049612 scopus 로고
    • The buffer tree: A new technique for optimal i/o-algorithms
    • L. Arge. The buffer tree: A new technique for optimal i/o-algorithms. In WADS, 1995.
    • (1995) WADS
    • Arge, L.1
  • 3
    • 0018480594 scopus 로고
    • Decomposable searching problems
    • J. L. Bentley. Decomposable searching problems. Inf. Process. Lett., 8(5), 1979.
    • (1979) Inf. Process. Lett. , vol.8 , Issue.5
    • Bentley, J.L.1
  • 5
    • 0023010037 scopus 로고
    • Fractional cascading: I. a data structuring technique
    • B. Chazelle and L. J. Guibas. Fractional cascading: I. a data structuring technique. Algorithmica, 1(2), 1986.
    • (1986) Algorithmica , vol.1 , Issue.2
    • Chazelle, B.1    Guibas, L.J.2
  • 6
    • 70449652585 scopus 로고    scopus 로고
    • Understanding intrinsic characteristics and system implications of flash memory based solid state drives
    • F. Chen, D. Koufaty, and X. Zhang. Understanding intrinsic characteristics and system implications of flash memory based solid state drives. In SIGMETRICS, 2009.
    • (2009) SIGMETRICS
    • Chen, F.1    Koufaty, D.2    Zhang, X.3
  • 8
    • 84976862194 scopus 로고
    • The ubiquitous b-tree
    • D. Comer. The ubiquitous b-tree. ACM Comput. Surv., 11(2), 1979.
    • (1979) ACM Comput. Surv. , vol.11 , Issue.2
    • Comer, D.1
  • 9
    • 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., 37(2), 2005.
    • (2005) ACM Comput. Surv. , vol.37 , Issue.2
    • Gal, E.1    Toledo, S.2
  • 10
    • 85063173612 scopus 로고    scopus 로고
    • Write-optimized b-trees
    • G. Graefe. Write-optimized b-trees. In VLDB, 2004.
    • (2004) In VLDB
    • Graefe, G.1
  • 11
    • 72049102523 scopus 로고    scopus 로고
    • The five-minute rule 20 years later: and how flash memory changes the rules
    • G. Graefe. The five-minute rule 20 years later: and how flash memory changes the rules. ACM Queue, 6(4):40-52, 2008.
    • (2008) ACM Queue , vol.6 , Issue.4 , pp. 40-52
    • Graefe, G.1
  • 12
    • 67649641168 scopus 로고    scopus 로고
    • Flash disk opportunity for server applications
    • J. Gray and B. Fitzgerald. Flash disk opportunity for server applications. ACM Queue, 6(4):18-23, 2008.
    • (2008) ACM Queue , vol.6 , Issue.4 , pp. 18-23
    • Gray, J.1    Fitzgerald, B.2
  • 15
    • 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.
    • (1999) VLDB
    • Jermaine, C.1    Datta, A.2    Omiecinski, E.3
  • 19
    • 67649663882 scopus 로고    scopus 로고
    • Tree indexing on flash disks
    • Y. Li, B. He, Q. Luo, and K. Yi. Tree indexing on flash disks. In ICDE, 2009.
    • (2009) ICDE
    • Li, Y.1    He, B.2    Luo, Q.3    Yi, K.4
  • 21
    • 0001756258 scopus 로고    scopus 로고
    • Design, implementation, and performance of the lham log-structured history data access method
    • P. Muth, P. E. O'Neil, A. Pick, and G. Weikum. Design, implementation, and performance of the lham log-structured history data access method. In VLDB, 1998.
    • (1998) VLDB
    • Muth, P.1    O'Neil, P.E.2    Pick, A.3    Weikum, G.4
  • 22
    • 70350144165 scopus 로고    scopus 로고
    • On the use of nand flash memory in high-performance relational databases
    • D. Myers. On the use of nand flash memory in high-performance relational databases. MIT Msc Thesis, 2008.
    • (2008) MIT Msc Thesis
    • Myers, D.1
  • 23
    • 35348838502 scopus 로고    scopus 로고
    • Flashdb: dynamic self-tuning database for nand flash
    • S. Nath and A. Kansal. Flashdb: dynamic self-tuning database for nand flash. In IPSN, 2007.
    • (2007) IPSN
    • Nath, S.1    Kansal, A.2
  • 25
    • 0026812659 scopus 로고
    • The design and implementation of a log-structured file system
    • M. Rosenblum and J. K. Ousterhout. The design and implementation of a log-structured file system. ACM Trans. Comput. Syst., 10(1), 1992.
    • (1992) ACM Trans. Comput. Syst. , vol.10 , Issue.1
    • Rosenblum, M.1    Ousterhout, J.K.2
  • 28
    • 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.
    • (2003) RTCSA
    • Wu, C.-H.1    Kuo, T.-W.2    Chang, L.P.3


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