Name
Abstract | ||
|---|---|---|
Recently XML fragments processing prevails over the Web due to its flexibility and manageability. In this paper, we propose two techniques for document fragmentation considering the query statistics over XML data: path frequency tree (PFT) and Markov tables. Both techniques work by merging the nodes of low inquiring frequency to enhance fragment utilization, or by merging the nodes of high inquiring frequency to enhance fragment cohesion. Performance study shows that our algorithms perform well on query cost and other metrics. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11912873_36 | WISE |
Keywords | Field | DocType |
path frequency tree,xml fragments processing,xml stream,fragment utilization,fragment cohesion,markov table,xml data,performance study,document fragmentation,query cost,query statistic | Information system,Data mining,Markov process,Streaming XML,XML,Computer science,XML validation,Markov chain,Fragmentation (computing),Statistics,Database,The Internet | Conference |
Volume | ISSN | ISBN |
4255 | 0302-9743 | 3-540-48105-2 |
Citations | PageRank | References |
1 | 0.36 | 6 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huan Huo | 1 | 35 | 10.00 |
| Guoren Wang | 2 | 1366 | 159.46 |
| Xiaoyun Hui | 3 | 16 | 2.36 |
| Chuan Xiao | 4 | 679 | 36.82 |
| Rui Zhou | 5 | 394 | 34.50 |