• DocumentCode
    555182
  • Title

    Research about the index mechanism base on embedded database system

  • Author

    Qiu Xiu-qin ; Jiang Guo-song

  • Author_Institution
    Sch. of Comput. Sci. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan, China
  • Volume
    1
  • fYear
    2011
  • fDate
    20-22 Aug. 2011
  • Firstpage
    478
  • Lastpage
    481
  • Abstract
    Indexing mechanism is an important part of the database system, it provide fast query and operation mechanism for a large number of complex data. This paper introduces the main index of the existing database system mechanism, and then elaborated on the design of the unbalance T tree index structure proposed in this paper, including the definition of unbalance T tree and the main algorithm, the last of the T trees, unbalanced B-tree And unbalances T tree performance analysis and comparison, and concluded that the unbalance T tree is very suit for embedded database system.
  • Keywords
    database indexing; tree data structures; embedded database system; index mechanism; indexing mechanism; unbalance T tree index structure; unbalances T tree performance analysis; Binary trees; Complexity theory; Educational institutions; Indexing; Vegetation; B-tree; T tree; Unbalance T tree;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Technology and Artificial Intelligence Conference (ITAIC), 2011 6th IEEE Joint International
  • Conference_Location
    Chongqing
  • Print_ISBN
    978-1-4244-8622-9
  • Type

    conf

  • DOI
    10.1109/ITAIC.2011.6030251
  • Filename
    6030251