Abstract | ||
---|---|---|
Recently proposed Hole-Filler model is promising for transmitting and evaluating streamed XML fragments. However, by simply matching filler IDs with hole IDs, associating all the correlated fragments to complete the query path would result in blocking. Taking advantage of region-based coding scheme, this paper models the query expression into query tree and proposes a set of techniques to optimize the query plan. It then proposes XFPR (XML Fragment Processor with Region code) to speed up query processing by skipping correlating adjacent fragments. We illustrate the effectiveness of the techniques developed with a detailed set of experiments. |
Year | DOI | Venue |
---|---|---|
2006 | 10.1007/11912873_50 | WISE |
Keywords | Field | DocType |
filler ids,xml fragment processor,query tree,hole ids,query path,query expression,query plan,region-based coding,detailed set,query processing,xml fragment | Query optimization,Web search query,Data mining,Query expansion,XML,Computer science,Path expression,Sargable,Database,Speedup,Query plan | Conference |
Volume | ISSN | ISBN |
4255 | 0302-9743 | 3-540-48105-2 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Xiaoyun Hui | 1 | 16 | 2.36 |
Guoren Wang | 2 | 1366 | 159.46 |
Huan Huo | 3 | 35 | 10.00 |
Chuan Xiao | 4 | 679 | 36.82 |
Rui Zhou | 5 | 394 | 34.50 |