论文信息 - Evaluating Complex Queries Against XML Streams with Polynomial Combined Complexity

Evaluating Complex Queries Against XML Streams with Polynomial Combined Complexity

Querying XML streams is receiving much attention due to its growing range of applications from traffic monitoring to routing of media streams. Existing approaches to querying XML streams consider restricted query language fragments, in most cases with exponential worst-case complexity in the size of the query. This paper gives correctness and complexity results for a query evaluator against XML streams called SPEX [8]. Its combined complexity is shown to be polynomial in the size of the data and the query. Extensive experimental evaluation with a prototype confirms the theoretical complexity results.

[1] Jane Hunter,et al. The TV‐trawler project , 2003, Int. J. Imaging Syst. Technol..

[2] Michael J. Franklin,et al. Efficient Filtering of XML Documents for Selective Dissemination of Information , 2000, VLDB.

[3] Rajeev Rastogi,et al. Efficient filtering of XML documents with XPath expressions , 2002, The VLDB Journal.

[4] Georg Gottlob,et al. The complexity of XPath query evaluation , 2003, PODS.

[5] Tim Furche,et al. XPath: Looking Forward , 2002, EDBT Workshops.

[6] Dan Suciu,et al. Processing XML Streams with Deterministic Automata , 2003, ICDT.

[7] Hao Zhang,et al. Path sharing and predicate evaluation for high-performance XML filtering , 2003, TODS.

[8] Xmldm,et al. XML-Based Data Management and Multimedia Engineering — EDBT 2002 Workshops , 2002, Lecture Notes in Computer Science.

[9] Tim Furche,et al. An efficient single-pass query evaluator for XML data streams , 2004, SAC '04.

[10] Samuel Madden,et al. Fjording the stream: an architecture for queries over streaming sensor data , 2002, Proceedings 18th International Conference on Data Engineering.