k-Bitmap Clustering Method for XML Data based on Relational DBMS


The KIPS Transactions:PartD, Vol. 16, No. 6, pp. 845-850, Dec. 2009
10.3745/KIPSTD.2009.16.6.845,   PDF Download:

Abstract

Use of XML data has been increased with growth of Web 2.0 environment. XML is recognized its advantages by using based technology of RSS or ATOM for transferring information from blogs and news feed. Bitmap clustering is a method to keep index in main memory based on Relational DBMS, and which performed better than the other XML indexing methods during the evaluation. Existing method generates too many clusters, and it causes deterioration of result of searching quality. This paper proposes k-Bitmap clustering method that can generate user defined k clusters to solve above-mentioned problem. The proposed method also keeps additional inverted index for searching excluded terms from representative bits of k-Bitmap. We performed evaluation and the result shows that the users can control the number of clusters. Also our method has high recall value in single term search, and it guarantees the searching result includes all related documents for its query with keeping two indices.


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]
B. S. Lee and B. Y. Hwang, "k-Bitmap Clustering Method for XML Data based on Relational DBMS," The KIPS Transactions:PartD, vol. 16, no. 6, pp. 845-850, 2009. DOI: 10.3745/KIPSTD.2009.16.6.845.

[ACM Style]
Bum Suk Lee and Byung Yeon Hwang. 2009. k-Bitmap Clustering Method for XML Data based on Relational DBMS. The KIPS Transactions:PartD, 16, 6, (2009), 845-850. DOI: 10.3745/KIPSTD.2009.16.6.845.