A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem [2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18] . One important challenge is that the number of path queries is huge. It is necessary to take an efficient data structure representing path queries. Another challenge is that these path queries usually vary with time. The maintenance of path queries determines the flexibility and capacity of a filtering system. In this paper, wedoi:10.1109/icde.2005.26 dblp:conf/icde/GongYQZ05 fatcat:maj4cu7tdvgdjgkz5gkqbjzvba