XMCCTree: an algorithm for producing Mcctree in incompact structure
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 XMCCTre...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
IEEE
2011
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/48082/ http://psasir.upm.edu.my/id/eprint/48082/1/XMCCTree%20an%20algorithm%20for%20producing%20Mcctree%20in%20incompact%20structure.pdf |
| _version_ | 1848850983906443264 |
|---|---|
| author | Sazaly, Ummu Sulaim Selamat, Mohd Hasan Baharom, Salmi A. Jabar, Marzanah |
| author_facet | Sazaly, Ummu Sulaim Selamat, Mohd Hasan Baharom, Salmi A. Jabar, Marzanah |
| author_sort | Sazaly, Ummu Sulaim |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T10:14:58Z |
| format | Conference or Workshop Item |
| id | upm-48082 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T10:14:58Z |
| publishDate | 2011 |
| publisher | IEEE |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-480822016-08-03T07:54:39Z http://psasir.upm.edu.my/id/eprint/48082/ XMCCTree: an algorithm for producing Mcctree in incompact structure Sazaly, Ummu Sulaim Selamat, Mohd Hasan Baharom, Salmi A. Jabar, Marzanah 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. IEEE 2011 Conference or Workshop Item PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/48082/1/XMCCTree%20an%20algorithm%20for%20producing%20Mcctree%20in%20incompact%20structure.pdf Sazaly, Ummu Sulaim and Selamat, Mohd Hasan and Baharom, Salmi and A. Jabar, Marzanah (2011) XMCCTree: an algorithm for producing Mcctree in incompact structure. In: 5th Malaysian Conference in Software Engineering (MySEC 2011), 13-14 Dec. 2011, Johor Bahru, Malaysia. (pp. 374-378). 10.1109/MySEC.2011.6140700 |
| spellingShingle | Sazaly, Ummu Sulaim Selamat, Mohd Hasan Baharom, Salmi A. Jabar, Marzanah XMCCTree: an algorithm for producing Mcctree in incompact structure |
| title | XMCCTree: an algorithm for producing Mcctree in incompact structure |
| title_full | XMCCTree: an algorithm for producing Mcctree in incompact structure |
| title_fullStr | XMCCTree: an algorithm for producing Mcctree in incompact structure |
| title_full_unstemmed | XMCCTree: an algorithm for producing Mcctree in incompact structure |
| title_short | XMCCTree: an algorithm for producing Mcctree in incompact structure |
| title_sort | xmcctree: an algorithm for producing mcctree in incompact structure |
| url | http://psasir.upm.edu.my/id/eprint/48082/ http://psasir.upm.edu.my/id/eprint/48082/ http://psasir.upm.edu.my/id/eprint/48082/1/XMCCTree%20an%20algorithm%20for%20producing%20Mcctree%20in%20incompact%20structure.pdf |