Abstract
Analyzing the characteristics of data access in DOM standards, two methods are proposed for clustering XML data, which are based on the parent-child and sibling relationship separately. Then the probabilities of I/O occurrence of the two clustering methods are analyzed with respect to two typical operations of traversing over a tree, and two corresponding path expression algorithms to traverse over DOM tree are given, namely depth-first and breadth-first algorithms. A performance evaluation based on XMark and XMach is carried out as testing references.
| Original language | English |
|---|---|
| Pages (from-to) | 538-541 |
| Number of pages | 4 |
| Journal | Dongbei Daxue Xuebao/Journal of Northeastern University |
| Volume | 26 |
| Issue number | 6 |
| Publication status | Published - Jun 2005 |
| Externally published | Yes |
Keywords
- Clustering storage
- DOM tree
- Path expressions
- Performance evaluation
- Traversal queries
- XML
Fingerprint
Dive into the research topics of 'Study on techniques of clustering XML data'. Together they form a unique fingerprint.Cite this
Qiao, B. Y., Wang, G. R., Han, D. H., & Zhao, X. G. (2005). Study on techniques of clustering XML data. Dongbei Daxue Xuebao/Journal of Northeastern University, 26(6), 538-541.