Article

Stream processing of XPath queries with predicates

Authors:

Ashish Kumar Gupta,

Dan SuciuAuthors Info & Claims

SIGMOD '03: Proceedings of the 2003 ACM SIGMOD international conference on Management of data

Pages 419 - 430

https://doi.org/10.1145/872757.872809

Published: 09 June 2003 Publication History

Abstract

We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents. The solution we propose is to lazily construct a single deterministic pushdown automata, called the XPush Machine from the given XPath fllters. We describe a number of optimization techniques to make the lazy XPush machine more efficient, both in terms of space and time. The combination of these optimizations results in high, sustained throughput. For example, if the total number of atomic predicates in the filters is up to 200000, then the throughput is at least 0.5 MB/sec: it increases to 4.5 MB/sec when each fllter contains a single predicate.

References

[1]

A. Aho and M. Corasick. Efficient string matching: an aid to bibliographic search. Communications of the ACM, 18:333--340, 1975.

Digital Library

[2]

M. Altinel and M. Franklin. Efficient filtering of XML documents for selective dissemination. In Proceedings of VLDB, 2000.

Digital Library

[3]

J. Cai, R. Paige, and R. Tarjan. More efficient bottom-up multi-pattern matching in trees. TCS, 106(1):21--60, 1992.

Digital Library

[4]

C. Chan, P. Felber, M. Garofalakis, and R. Rastogi. Efficient flltering of XML documents with XPath expressions. In Proceedings of ICDE, 2002.

Digital Library

[5]

A. Chandra, D. Kozen, and L. Stockmeyer. Alternation. In Journal of the ACM, pages 115--133, January 1981.

Digital Library

[6]

C. Chauve. Tree pattern matching for linear static terms. In Proceedings of the International Symposium on String Processing and Information Retrieval, volume 2476 of Lecture Notes in Computer Science, pages 160--169. Springer, 2002.

Digital Library

[7]

J. Chen, D. DeWitt, F. Tian, and Y. Wang. NiagaraCQ: a scalable continuous query system for internet databases. In Proceedings of SIGMOD, 2000.

Digital Library

[8]

J. Chen, D. J. DeWitt, and J. F. Naughton. Design and evaluation of alternative selection placement strategies in optimizing continuous queries. In Proceedings of ICDE, 2002.

Digital Library

[9]

J. Clark. XML path language (XPath), 1999. http://www.w3.org/TR/xpath.

[10]

R. Cole, R. Hariharan, and P. Indyk. Tree pattern matching and subset matching in deterministic O(n log3 n)-time. In SODA, pages 245--254, 1999.

Digital Library

[11]

Y. Diao, P. Fischer, M. Franklin, and R. To. Yfilter: Efficient and scalable filtering of XML documents. In Proceedings of ICDE, 2002.

Digital Library

[12]

G. Gottlob, C. Koch, and R. Pichler. Efficient algorithm for processing XPath queries. In Proceedings of VLDB, 2002.

Digital Library

[13]

T. J. Green, G. Miklau, M. Onizuka, and D. Suciu. Processing XML streams with deterministic automata. In Proceedings of ICDT, 2003.

Digital Library

[14]

C. M. Hoffmann and M. J. O'Donnell. Pattern matching in trees. JACM, 29(1):68--95, 1982.

Digital Library

[15]

J. Hopcroft and J. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley, 1979.

Digital Library

[16]

P. Kilpelainen and H. Mannila. Ordered and unordered tree inclusion. SIAM Journal of Computing, 24(2):340--356, 1995.

Digital Library

[17]

B. Nguyen, S. Abiteboul, G. Cobena, and M. Preda. Monitoring XML data on the web. In Proceedings of SIGMOD, 2001.

Digital Library

[18]

D. Olteanu, T. Kiesling, and F. Bry. An evaluation of regular path expressions with qualifiers against XML streams. In Proceedings of ICDE, 2003.

[19]

G. Rozenberg and A. Salomaa. Handbook of Formal Languages. Springer Verlag, 1997.

Digital Library

[20]

A. Snoeren, K. Conley, and D. Gifford. Mesh-based content routing using XML. In Proceedings of the 18th Symposium on Operating Systems Principles, 2001.

Digital Library

[21]

M. Thorup. Efficient preprocessing of simple binary pattern forests. Journal of Algorithms, 20(3):602--612, 1996.

Digital Library

Cited By

Barloy CMurlak FPaperman CLibkin LPichler RGuagliardo P(2021)Stackless Processing of Streamed TreesProceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3452021.3458320(109-125)Online publication date: 20-Jun-2021
https://dl.acm.org/doi/10.1145/3452021.3458320
Jin XLiao H(2019)ExPDT: An Extended Pushdown Transducer for XML Stream Processing2019 6th International Conference on Information Science and Control Engineering (ICISCE)10.1109/ICISCE48695.2019.00211(1048-1052)Online publication date: Dec-2019
https://doi.org/10.1109/ICISCE48695.2019.00211
Diao YFranklin M(2018)XML Publish/SubscribeEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_785(4774-4780)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_785
Show More Cited By

Index Terms

Stream processing of XPath queries with predicates

Recommendations

Filtering unsatisfiable XPath queries

The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submission and the computation of unsatisfiable queries. Thus, applying the ...
Reformulating XPath queries and XSLT queries on XSLT views

Applications using XML for data representation very often use different XML formats and thus require the transformation of XML data. The common approach transforms entire XML documents from one format into another, e.g. by using an XSLT stylesheet. ...
Efficient processing of XML twig queries with OR-predicates
SIGMOD '04: Proceedings of the 2004 ACM SIGMOD international conference on Management of data

An XML twig query, represented as a labeled tree, is essentially a complex selection predicate on both structure and content of an XML document. Twig query matching has been identified as a core operation in querying tree-structured XML data. A number of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMOD '03: Proceedings of the 2003 ACM SIGMOD international conference on Management of data

June 2003

702 pages

ISBN:158113634X

DOI:10.1145/872757

Conference Chair:
Zachary Ives
University of Pennsylvania
,
General Chair:
Yannis Papakonstantinou
University of California, San Diego
,
Program Chair:
Alon Halevy
University of Washington

Copyright © 2003 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 June 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS03

Sponsor:

SIGMOD

SIGMOD/PODS03: International Conference on Management of Data and Symposium on Principles Database and Systems

June 9 - 12, 2003

California, San Diego

Acceptance Rates

SIGMOD '03 Paper Acceptance Rate 53 of 342 submissions, 15%;

Overall Acceptance Rate 785 of 4,003 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

178
Total Citations
View Citations
1,415
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)2

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Barloy CMurlak FPaperman CLibkin LPichler RGuagliardo P(2021)Stackless Processing of Streamed TreesProceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3452021.3458320(109-125)Online publication date: 20-Jun-2021
https://dl.acm.org/doi/10.1145/3452021.3458320
Jin XLiao H(2019)ExPDT: An Extended Pushdown Transducer for XML Stream Processing2019 6th International Conference on Information Science and Control Engineering (ICISCE)10.1109/ICISCE48695.2019.00211(1048-1052)Online publication date: Dec-2019
https://doi.org/10.1109/ICISCE48695.2019.00211
Diao YFranklin M(2018)XML Publish/SubscribeEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_785(4774-4780)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_785
Wang TWang YHan CCao YTao XHussain AZhang ZGu NLi SLu TLi L(2017)A real-time Novel Distributed Cooperative Processing Strategy for Isomerism Networks in Internet of ThingsProceedings of the 12th Chinese Conference on Computer Supported Cooperative Work and Social Computing10.1145/3127404.3127417(122-128)Online publication date: 22-Sep-2017
https://dl.acm.org/doi/10.1145/3127404.3127417
Kim SLee KLee Y(2017)Multi-query processing of XML data streams on multicoreThe Journal of Supercomputing10.1007/s11227-016-1919-073:6(2339-2368)Online publication date: 1-Jun-2017
https://dl.acm.org/doi/10.1007/s11227-016-1919-0
Diao YFranklin M(2017)XML Publish/SubscribeEncyclopedia of Database Systems10.1007/978-1-4899-7993-3_785-2(1-7)Online publication date: 12-Jan-2017
https://doi.org/10.1007/978-1-4899-7993-3_785-2
Chen PEvans TPlale B(2016)Analysis of Memory Constrained Live ProvenanceProceedings of the 6th International Workshop on Provenance and Annotation of Data and Processes - Volume 967210.5555/3090188.3090193(42-54)Online publication date: 7-Jun-2016
https://dl.acm.org/doi/10.5555/3090188.3090193
Wang TTao XZhou YLi PZhao C(2016)A distributed semantic filtering model based on approximate automata for heterogeneous multi-sensor networksInternational Journal of Sensor Networks10.1504/IJSNET.2016.07427920:1(46-53)Online publication date: 1-Jan-2016
https://dl.acm.org/doi/10.1504/IJSNET.2016.074279
Ning BWang YDeng ALi YZheng Y(2016)Filtering Uncertain XML Documents by Threshold XPEsWeb-Age Information Management10.1007/978-3-319-47121-1_25(292-302)Online publication date: 15-Oct-2016
https://doi.org/10.1007/978-3-319-47121-1_25
Chen PEvans TPlale B(2016)Analysis of Memory Constrained Live ProvenanceProvenance and Annotation of Data and Processes10.1007/978-3-319-40593-3_4(42-54)Online publication date: 4-Jun-2016
https://doi.org/10.1007/978-3-319-40593-3_4
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents