• DocumentCode
    3174275
  • Title

    XMCCTree: An algorithm for producing Mcctree in incompact structure

  • Author

    Sazaly, Ummu Sulaim ; Selamat, Mohd Hasan ; Baharom, Salmi ; Jabar, Marzanah Ab

  • Author_Institution
    Dept. of Inf. Syst., Univ. Putra Malaysia, Serdang, Malaysia
  • fYear
    2011
  • fDate
    13-14 Dec. 2011
  • Firstpage
    374
  • Lastpage
    378
  • Abstract
    Different notions and techniques have been proposed to support query in XML. This led to the generation of algorithms to provide more efficient and accurate query processing. This research proposes an efficient algorithm to support keyword query in XML document. The propose algorithm, namely XMCCTree, employs MCLCA notion with some modifications in order to provide more efficient algorithm.
  • Keywords
    XML; query processing; Mcctree; XMCCTree; XML document; incompact structure; keyword query; maximal compact lowest common ancestor; query processing; Algorithm design and analysis; Database languages; Generators; Indexes; Keyword search; Semantics; XML; XMCCTree; XML query; XML structure; efficient algorithm; keyword query;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Software Engineering (MySEC), 2011 5th Malaysian Conference in
  • Conference_Location
    Johor Bahru
  • Print_ISBN
    978-1-4577-1530-3
  • Type

    conf

  • DOI
    10.1109/MySEC.2011.6140700
  • Filename
    6140700
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3174275