Skip to main content

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 117))

  • 1147 Accesses

Abstract

Database object placement strategy is evenly distributed the data to disk, which is not simply put the data into the disk, but on balancing VO access, to avoid the I/ 0 bottlenecks. Disperse the visit into different disk, so that the user data will across multiple devices as soon as possible. Multiple I/ 0 operation can avoid the I/O competition, and to overcome the access bottleneck. The random access and continuous access data will be placed separately. Put the system database 1/0 and application database I/O on Separately disk. Put the system audit tables and temporary tables on the non-busy disk. Put the transaction log on a separate disk to reduce disk I/0 spending. I is also beneficial to the recover from obstacles, and improves the system’s security. Put the frequently visited “active” table on different disks; place the frequently used table, frequently joined operation tables into different disk, even place frequently visited into different disk. Separate the visit into different disk will avoid I/O contention.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Poess, M., Potapov, D.: Data compression in oracle. In: Freytag, J.C., Lockemann, P. (eds.) Proc. of the 29th Int’! Conf. on Very Lage Data Bases, pp. 937–940. Morgan Kaufann Publishers, Inc., Mumbai (2003)

    Google Scholar 

  2. O’Connell, S.J., Winterbottom, N.: Perfrming joins without decompression in a compressed daaase system. ACM SIGMOD Record 32(1), 55–67 (2003)

    Google Scholar 

  3. Wan, W., Li, J., Zhang, D.: A Efficient Algorithm for Mining Approximate Frequent Item Over Data Stream. Journal of Sofware 18(4), 884–892 (2007), http://www.os.org.cn/I000-9825/18/884.html

    Google Scholar 

  4. Lin, T.Y.: Data Mining and machine oriented modeling: a granular computing approach. Applied Intelligence, 113–124 (2000)

    Google Scholar 

  5. Qing, J., Zhong, W.: Researching the Information Security Infrastructure of PM I-based for ERP System. Computer System & Applications 11, 36–40 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wang Zhong-zhuang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media Dordrecht

About this paper

Cite this paper

Zhong-zhuang, W., Lun-dan, D., Yun-ting, W., Zhi-wen, H. (2012). The Optimization of Large Information Management Database Bottlenecks. In: Wu, Y. (eds) Advanced Technology in Teaching - Proceedings of the 2009 3rd International Conference on Teaching and Computational Science (WTCS 2009). Advances in Intelligent and Soft Computing, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25437-6_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25437-6_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25436-9

  • Online ISBN: 978-3-642-25437-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics