• DocumentCode
    2118375
  • Title

    Research on Dynamic Index of Streamline Dynamic Successive Trees

  • Author

    Huo, Lin ; Tan, Yinglu

  • Author_Institution
    Dept. of Comput. & Electron. Inf., Guangxi Univ., Nanning, China
  • fYear
    2010
  • fDate
    24-26 Dec. 2010
  • Firstpage
    33
  • Lastpage
    38
  • Abstract
    Based on Streamline Dynamic Successive Trees, the paper proposes a dynamic index update method which update size is in character-level, The document-level index update algorithm and the character-level index update algorithm are based on SDST, and the performance of these 2 algorithms are compared, The efficiency of the character-level index update method is proved by experiment. The result shows that the performance of character-level update method is better than document-level.
  • Keywords
    document handling; indexing; trees (mathematics); SDST; character-level index update algorithm; document-level index update algorithm; streamline dynamic successive trees; Aerodynamics; Algorithm design and analysis; Complexity theory; Heuristic algorithms; Indexes; Libraries; Vegetation; character-level; dynamic index; update size;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Science and Engineering (ISISE), 2010 International Symposium on
  • Conference_Location
    Shanghai
  • ISSN
    2160-1283
  • Print_ISBN
    978-1-61284-428-2
  • Type

    conf

  • DOI
    10.1109/ISISE.2010.35
  • Filename
    5945045
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2118375