Name
Abstract | ||
|---|---|---|
With the proliferation of XML data on the internet, there is a large demand for efficient techniques in XML structural matching. We propose a novel filtering method, which is based on two auxiliary bitmaps named suffix bitmap and prefix bitmap, to accelerate XML structural matching. For each node in the XML document, the suffix bitmap captures in a compact format the tag name list of suffix subtree, and the prefix bitmap captures the tag name list of prefix path respectively. During the structural matching, most of unmatched node candidates can be filtered efficiently by comparing the respective bitmaps. We integrate the bitmap filtering into two categories of structural matching algorithms which are navigation-based algorithms and join-based algorithms. The experimental results demonstrate that the bitmap filtering can improve significantly the performance of XML structural matching. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/SNPD.2007.376 | SNPD (3) |
Keywords | Field | DocType |
xml structural matching algorithm,xml document,xml,structural matching.,bitmap filtering,efficient speedup method,tree data structures,structural matching,suffix bitmap,xml structural matching,pattern matching,suffix bitmap capture,tree data structure,prefix bitmap,internet,xml data,structural matching algorithm,prefix path,tag name list,navigation-based algorithm | Data mining,XML framework,Efficient XML Interchange,Streaming XML,XML,Computer science,XML database,Bitmap,Simple API for XML,XML Signature | Conference |
Volume | ISBN | Citations |
3 | 978-0-7695-2909-7 | 1 |
PageRank | References | Authors |
0.38 | 6 | 5 |