메뉴 건너뛰기




Volumn 6, Issue 8, 2013, Pages 541-552

Hybrid storage management for database systems

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER AMPLIFIERS; BUFFER STORAGE; DATABASE SYSTEMS; HARD DISK STORAGE; LAKES; VIRTUAL STORAGE;

EID: 84881116912     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2536354.2536355     Document Type: Article
Times cited : (35)

References (19)
  • 3
    • 85027199724 scopus 로고    scopus 로고
    • Proc. USENIX Symp. on Internet Technologies and Systems
    • P. Cao and S. Irani. Cost-aware www proxy caching algorithms. In Proc. USENIX Symp. on Internet Technologies and Systems, pages 193-206, 1997.
    • (1997) Cost-aware www proxy caching algorithms , pp. 193-206
    • Cao, P.1    Irani, S.2
  • 4
    • 79960029416 scopus 로고    scopus 로고
    • Flashstore: high throughput persistent key-value store
    • September
    • B. Debnath, S. Sengupta, and J. Li. Flashstore: high throughput persistent key-value store. Proc. VLDB Endow., 3:1414-1425, September 2010.
    • (2010) Proc. VLDB Endow. , vol.3 , pp. 1414-1425
    • Debnath, B.1    Sengupta, S.2    Li, J.3
  • 6
    • 84881101701 scopus 로고    scopus 로고
    • Facebook. Facebook: FlashCache
    • Facebook. Facebook: FlashCache, 2012. http://assets.en.oreilly.com/1/event/45/ Flashcache%20Presentation.pdf.
    • (2012)
  • 8
    • 72049102523 scopus 로고    scopus 로고
    • The five-minute rule 20 years later: and how ash memory changes the rules
    • July
    • G. Graefe. The five-minute rule 20 years later: and how ash memory changes the rules. Queue, 6:40-52, July 2008.
    • (2008) Queue , vol.6 , pp. 40-52
    • Graefe, G.1
  • 9
    • 67649641168 scopus 로고    scopus 로고
    • Flash disk opportunity for server applications
    • July
    • J. Gray and B. Fitzgerald. Flash disk opportunity for server applications. Queue, 6(4):18-23, July 2008.
    • (2008) Queue , vol.6 , Issue.4 , pp. 18-23
    • Gray, J.1    Fitzgerald, B.2
  • 10
    • 84873163834 scopus 로고    scopus 로고
    • Flash-based extended cache for higher throughput and faster recovery
    • July
    • W.-H. Kang, S.-W. Lee, and B. Moon. Flash-based extended cache for higher throughput and faster recovery. Proc. VLDB Endow., 5(11):1615-1626, July 2012.
    • (2012) Proc. VLDB Endow. , vol.5 , Issue.11 , pp. 1615-1626
    • Kang, W.-H.1    Lee, S.-W.2    Moon, B.3
  • 11
    • 70449694274 scopus 로고    scopus 로고
    • Flashing up the storage layer
    • August
    • I. Koltsidas and S. D. Viglas. Flashing up the storage layer. Proc. VLDB Endow., 1:514-525, August 2008.
    • (2008) Proc. VLDB Endow. , vol.1 , pp. 514-525
    • Koltsidas, I.1    Viglas, S.D.2
  • 12
    • 46249093074 scopus 로고    scopus 로고
    • Flash storage memory
    • July
    • A. Leventhal. Flash storage memory. Commun. ACM, 51:47-51, July 2008.
    • (2008) Commun. ACM , vol.51 , pp. 47-51
    • Leventhal, A.1
  • 13
    • 84873192273 scopus 로고    scopus 로고
    • hstorage-db: heterogeneity-aware data management to exploit the full capability of hybrid storage systems
    • June
    • T. Luo, R. Lee, M. Mesnier, F. Chen, and X. Zhang. hstorage-db: heterogeneity-aware data management to exploit the full capability of hybrid storage systems. Proc. VLDB Endow., 5(10):1076-1087, June 2012.
    • (2012) Proc. VLDB Endow. , vol.5 , Issue.10 , pp. 1076-1087
    • Luo, T.1    Lee, R.2    Mesnier, M.3    Chen, F.4    Zhang, X.5
  • 15
    • 38149046847 scopus 로고
    • Competitive algorithms for server problems
    • May
    • M. S. Manasse, L. A. McGeoch, and D. D. Sleator. Competitive algorithms for server problems. J. Algorithms, 11:208-230, May 1990.
    • (1990) J. Algorithms , vol.11 , pp. 208-230
    • Manasse, M.S.1    McGeoch, L.A.2    Sleator, D.D.3
  • 17
    • 84881087212 scopus 로고    scopus 로고
    • The TPC-C Benchmark
    • The TPC-C Benchmark. http://www.tpc.org/tpcc/.
  • 18
    • 85084160287 scopus 로고    scopus 로고
    • My cache or yours? making storage more exclusive
    • T. M. Wong and J. Wilkes. My cache or yours? making storage more exclusive. In Proc USENIX ATC, pages 161-175, 2002.
    • (2002) Proc USENIX ATC , pp. 161-175
    • Wong, T.M.1    Wilkes, J.2
  • 19
    • 0028457070 scopus 로고
    • The k-server dual and loose competitiveness for paging
    • N. Young. The k-server dual and loose competitiveness for paging. Algorithmica, 11:525-541, 1994.
    • (1994) Algorithmica , vol.11 , pp. 525-541
    • Young, N.1


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