Name
Abstract | ||
|---|---|---|
With the rapidly increasing popularity of XML as a data format, there is a large demand for efficient techniques in structural matching of XML data. We propose a novel filtering technique to speed up the structural matching of XML data, which is based on an auxiliary data structure called suffix bitmap. The suffix bitmap captures in a packed format the suffix tag name list of the nodes in an XML document. By comparing the respective suffix bitmaps, most of the unmatched subtrees of a document can be skipped efficiently in the course of structural matching process. Using the suffix bitmap filtering, we extend two state-of-the-art structural matching algorithms: namely the traversal matchingalgorithmand the structural join matching algorithm. The experimental results show that the extended algorithms considerably outperform the original ones. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-72584-8_33 | International Conference on Computational Science (1) |
Keywords | Field | DocType |
respective suffix bitmaps,suffix bitmap,suffix bitmaps,auxiliary data structure,suffix bitmap capture,suffix tag name list,xml data,accelerating xml structural matching,xml document,structural matching process,state-of-the-art structural matching algorithm,structural matching,xml,data structure,matched filter,filtering | Data mining,Data structure,Tree traversal,XML,Suffix,Computer science,XML database,Bitmap,Compressed suffix array,Blossom algorithm | Conference |
Volume | ISSN | Citations |
4487 | 0302-9743 | 1 |
PageRank | References | Authors |
0.37 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Feng Shao | 1 | 7 | 1.67 |
| Gang Chen | 2 | 712 | 75.60 |
| Jinxiang Dong | 3 | 311 | 65.36 |