Design and Implementation of XML Indexing and Query Scheme Based on Database Concept Structure


The KIPS Transactions:PartD, Vol. 13, No. 3, pp. 317-324, Jun. 2006
10.3745/KIPSTD.2006.13.3.317,   PDF Download:

Abstract

In this paper, we propose a new indexing technique to solve various queries which have a strong good point not only database indexing schema take advantage of converting from semi-structured data to structured data but also performance is more faster than before. We represent structure information of XML document between nodes of tree that additional numbering information which can be bit-stream without modified structure of XML tree. And, We add in indexing schema searching incidental structure information in the process. In Querying schema, we recover ancestor nodes through give information of node using indexing schema in complete path query expression as well as relative path query expression. Therefore, it takes advantage of making derivative query expression with given query. In this process, we recognize that indexing and querying schema can get searched result set faster and more accurate. Because response time is become shorter by bit operating, when query occur and it just needs information of record set earch node in database.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. N. Choo and Y. S. Woo, "Design and Implementation of XML Indexing and Query Scheme Based on Database Concept Structure," The KIPS Transactions:PartD, vol. 13, no. 3, pp. 317-324, 2006. DOI: 10.3745/KIPSTD.2006.13.3.317.

[ACM Style]
Kyo Nam Choo and Yo Seob Woo. 2006. Design and Implementation of XML Indexing and Query Scheme Based on Database Concept Structure. The KIPS Transactions:PartD, 13, 3, (2006), 317-324. DOI: 10.3745/KIPSTD.2006.13.3.317.