ABSTRACT
Data streams might be preferable to data stored in memory in contexts where the data is too large or volatile, or a standard approach to data processing based on data parsing and/or storing is too time or space consuming. Emerging applications such as publish-subscribe systems, data monitoring in sensor networks [6], financial and traffic monitoring, and routing of MPEG-7 [7] call for querying data streams. In many such applications, XML streams are arguably more appropriate than flat data streams, for XML data is record-like, though not precluding multiple occurrences of fields with the same name. Evaluating selection queries against XML streams is especially challenging because XML data is structured (like records) and might have unbounded size.This paper proposes an efficient single-pass evaluator of XPath queries against XML data streams unbounded (possibly infinite) in size. The evaluator is based on networks of independent deterministic pushdown transducers and it is especially suitable for implementation on devices with low-memory and simple logic as used, e.g., in mobile computing.
- Mehmet Altinel and Michael J. Franklin, Efficient filtering of XML documents for selective dissemination of information, Proc. of VLDB, 2000. Google ScholarDigital Library
- Chee-Yong Chan, Pascal Felber, Minos Garofalakis, and Rajeev Rastogi, Efficient filtering of XML documents with XPath expressions, VLDB Journal (2002). Google ScholarDigital Library
- Tim Furche, Optimizing multiple queries against XML streams, Diploma thesis, Univ. of Munich, 2003.Google Scholar
- Georg Gottlob, Christoph Koch, and Reinhard Pichler, XPath processing in a nutshell, ACM SIGMOD Record 32 (2003). Google ScholarDigital Library
- Bertram Ludäscher, Pratik Mukhopadhyay, and Yannis Papakonstantinou, A transducer-based XML query processor, Proc. of VLDB, 2002. Google ScholarDigital Library
- Sam Madden and Michael J. Franklin, Fjording the stream: An architecture for queries over streaming sensor data, Proc. of ICDE, 2002. Google ScholarDigital Library
- José M. Martínez, MPEG-7 overview, Tech. Report N4980, ISO/IEC JTC1/SC29/WG11, 2002.Google Scholar
- Gerome Miklau, XMLData repository, Univ. of Washington, 2003.Google Scholar
- Dan Olteanu, Tim Furche, and François Bry, Evaluating complex queries against XML streams with polynomial combined complexity, Tech. Report PMS-FB-2003-15, Univ. of Munich, 2003, http://www.pms.informatik.unimuenchen.de/publikationen.Google Scholar
- Dan Olteanu, Holger Meuss, Tim Furche, and François Bry, XPath: Looking forward, Proc. of EDBT Workshop XMLDM, 2002, LNCS 2490. Google ScholarDigital Library
- Feng Peng and Sudarshan S. Chawathe, XPath queries on streaming data, Proc. of ACM SIGMOD, 2003. Google ScholarDigital Library
- Dominik Schwald, Approximate streamed evaluation of XPath under memory constraints, Project thesis, Univ. of Munich, 2003.Google Scholar
- An efficient single-pass query evaluator for XML data streams
Recommendations
Efficient evaluation of generalized tree-pattern queries on XML streams
The streaming evaluation is a popular way of evaluating queries on XML documents. Besides its many advantages, it is also the only option for a number of important XML applications. Unfortunately, existing algorithms focus almost exclusively on tree-...
A survey on XML streaming evaluation techniques
XML is currently the most popular format for exchanging and representing data on the web. It is used in various applications and for different types of data including structured, semistructured, and unstructured heterogeneous data types. During the ...
Twig pattern matching running on XML streams
APWeb'12: Proceedings of the 14th international conference on Web Technologies and ApplicationsTwig pattern matching plays an important role in XML query processing, holistic twig pattern matching algorithms have been proposed and are considered to be effective since they avoid producing large number of intermediate results. Meanwhile, automaton-...
Comments