With the rapid development of the Internet, XML (eXtensible Markup Language) has become the standard data format for representation and exchange on the Internet. In many applications, XML files are transferred in a form of continuous streams. For example, in publishing- subscription systems, data is recorded in an XML format and the conditions of the user's subscription are expressed as queries. Thus, how to filter a continuous stream of XML documents against a large number of queries is an important issue. In this paper, we proposed an efficient filter called EFilter to support twig query patterns in XML streams. Users' queries are recorded in a compressed tree structure called Query Guide and a hash table called QLinkedList. Through a bottom-up search of Query Guide, the XML documents are processed only once as they arrive. Experimental results show that EFilter is more efficient than FiST (Kwon et al., 2005) and SFilter (Nizar, Babu and Kumar, 2009) in terms of filtering speed.
[1]
P. Sreenivasa Kumar,et al.
A Simple and Scalable Filter for XML Streams
,
2009,
COMAD.
[2]
Jun'ichi Tatemura,et al.
AFilter: adaptable XML filtering with prefix-caching suffix-clustering
,
2006,
VLDB.
[3]
Christos Makris,et al.
XFIS: an XML filtering system based on string representation and matching
,
2008,
Int. J. Web Eng. Technol..
[4]
Stefanie Scherzinger,et al.
Attribute grammars for scalable query processing on XML streams
,
2005,
The VLDB Journal.
[5]
Joonho Kwon,et al.
FiST: Scalable XML Document Filtering by Sequencing Twig Patterns
,
2005,
VLDB.
[6]
Yanlei Diao,et al.
High-Performance XML Filtering: An Overview of YFilter
,
2003,
IEEE Data Eng. Bull..
[7]
Michael J. Franklin,et al.
Efficient Filtering of XML Documents for Selective Dissemination of Information
,
2000,
VLDB.