Efficient mapping schemes to bridge XML and relational databases
The thesis focuses on the development of an efficient mapping scheme that promises flawless mapping and supports both full-text and structural queries. Many existing mapping schemes support full-text queries which is the most simplest and straightforward query that only involve keyword(s) as the se...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 出版: |
2011
|
| 主題: | |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | The thesis focuses on the development of an efficient mapping scheme that promises flawless mapping and supports both full-text and structural queries. Many existing mapping schemes support full-text queries which is the most simplest and straightforward query that only involve keyword(s) as the search criteria. However, the support for structural query has been a dilemma for many mapping schemes because they failed to maintain the structural relationships among the XML node. In this thesis, we proposed a mapping technique namely s-XML + which was implemented using the persistent labeling scheme and conducted experiments to evaluate their efficiency. s-XML +was proposed to process queries with assorted combinations since it maintains the significant information in the tables and able process complex queries better than the existing approaches. |
|---|