| Implementing a scalable XML publish/subscribe system using relational database systems |
| Full text |
Pdf
(131 KB)
|
| Source
|
International Conference on Management of Data
archive
Proceedings of the 2004 ACM SIGMOD international conference on Management of data
table of contents
Paris, France
SESSION: Research sessions: XML PubSub and indexing
table of contents
Pages: 479 - 490
Year of Publication: 2004
ISBN:1-58113-859-8
|
|
Authors
|
|
Feng Tian
|
University of Wisconsin, Madison, Madison, WI
|
|
Berthold Reinwald
|
IBM Almaden Research Center, San Jose, CA
|
|
Hamid Pirahesh
|
IBM Almaden Research Center, San Jose, CA
|
|
Tobias Mayr
|
IBM Almaden Research Center, San Jose, CA
|
|
Jussi Myllymaki
|
IBM Almaden Research Center, San Jose, CA
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 10, Downloads (12 Months): 102, Citation Count: 13
|
|
|
ABSTRACT
An XML publish/subscribe system needs to match many XPath queries (subscriptions) over published XML documents. The performance and scalability of the matching algorithm is essential for the system when the number of XPath subscriptions is large. Earlier solutions to this problem usually built large finite state automata for all the XPath subscriptions in memory. The scalability of this approach is limited by the amount of available physical memory. In this paper, we propose an implementation that uses a relational database as the matching engine. The heavy lifting part of evaluating a large number of subscriptions is done inside a relational database using indices and joins. We described several different implementation strategies and presented a performance evaluation. The system shows very good performance and scalability in our experiments, handling millions of subscriptions with moderate amount of physical memory.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
Marcos K. Aguilera , Robert E. Strom , Daniel C. Sturman , Mark Astley , Tushar D. Chandra, Matching events in a content-based subscription system, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, p.53-61, May 04-06, 1999, Atlanta, Georgia, United States
[doi> 10.1145/301308.301326]
|
 |
3
|
|
| |
4
|
|
 |
5
|
Jianjun Chen , David J. DeWitt , Feng Tian , Yuan Wang, NiagaraCQ: a scalable continuous query system for Internet databases, Proceedings of the 2000 ACM SIGMOD international conference on Management of data, p.379-390, May 15-18, 2000, Dallas, Texas, United States
|
| |
6
|
|
| |
7
|
|
| |
8
|
|
 |
9
|
|
| |
10
|
|
 |
11
|
|
 |
12
|
|
 |
13
|
|
 |
14
|
|
| |
15
|
P. Seshadri, Building Notification Services with Microsoft SQL Server. In Proceedings of SIGMOD 2003
|
| |
16
|
Sun Microsystem Inc. Java Message Service (JMS) specification. http://java.sun.com/products/jms
|
| |
17
|
Sun Microsystem Inc. Java 2 Enterprise Edition (J2EE) specification. http://java.sun.com/j2ee/1.4/docs/
|
| |
18
|
|
| |
19
|
A. Yalamanchi, J. Srinivasan, D. Gawlick. Managing Expressions as Data in Relational Database Systems. In Proceedings of CIDR 2003.
|
| |
20
|
XML Path Language (XPath) 1.0. http://www.w3.org/TR/xpath
|
| |
21
|
XQuery 1.0: An XML Query Language. http://www.w3.org/XML/XQuery
|
| |
22
|
H. Zeller. Non-Stop SQL/MX Publish/Subscribe: Continuous Data Streams in Transaction Processing. In Proceedings of SIGMOD 2003.
|
CITED BY 13
|
|
|
|
|
|
|
|
|
|
|
|
|
|
K. Selçuk Candan , Wang-Pin Hsiung , Songting Chen , Junichi Tatemura , Divyakant Agrawal, AFilter: adaptable XML filtering with prefix-caching suffix-clustering, Proceedings of the 32nd international conference on Very large data bases, September 12-15, 2006, Seoul, Korea
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|