Index Page Split Avoidance With Mass Insert Processing
作者： Randol K. Bright
DOI:
关键词:
摘要: A technique is disclosed that avoids index page splits when inserting large numbers of rows into a table relational database. Keys in pages are moved to successive make room insert keys on the original page. Where no available pages, new created hold keys. The result typically smaller chain with better locality than using conventional insertion splitting pages.
lens.org 参考文章(13)
Brian J. Tarbox, Brittain S. McKinley, So C. Chen, Adaptive media caching for video on demand ,(2009)
Shaibal Roy, Database system with improved methods for B-tree maintenance ,(1995)
Jonathan Keir Lawder, Method of storing and retrieving multi-dimensional data using the hilbert curve ,(2002)
Nagavamsi Ponnekanti, Hanuma Kodavalla, Database system with methods providing high-concurrency access in B-Tree structures ,(1998)
Brian D. Noble, Mark D. Corner, Method and system to maintain portable computer data secure and authentication token for use therein ,(2002)
Allen Reiter, Ian Charles Jose, Computer method and storage structure for storing and accessing multidimensional data ,(1994)
Mitsuhiro Ura, Takuji Ishii, Kazuhiko Saitou, Takashi Obata, Masaaki Mitani, Tomohiro Hayashi, Yutaka Sekine, Katsumi Hayashi, Hiroshi Ohsato, Data processing system for dynamically switching access control process and for performing recovery process ,(1994)
Balakrishna Raghavendra Iyer, Gary Howard Sockut, Methods for in-place online reorganization of a database ,(1998)
Ramiah Kwok-Fai Tin, Bernard Ng, Framework for retrieval and display of large result sets ,(2005)
Kelsey L. Bruso, James M. Plasek, Record-level locking and page-level recovery in a database management system ,(2008)