The View Selection Problem for XML Content Based Routing

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn 22, Issue , 2003, Pages 68-77

  Kumar Gupta, Ashish ^a   Suciu, Dan ^a   Halevy, Alon Y ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GREEDY APPROXIMATION ALGORITHM; INTEGER COVER PROBLEM; XML CONTENT BASED ROUTING;

ALGORITHMS; APPROXIMATION THEORY; BINARY CODES; COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS; PACKET NETWORKS; PROBLEM SOLVING; QUERY LANGUAGES; RELATIONAL DATABASE SYSTEMS; XML;

ELECTRONIC DOCUMENT EXCHANGE;

EID: 1142287641     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. M. Altinel and M. J. Franklin. Efficient filtering of XML documents for selective dissemination of information. In Proceedings of 26th International Conference on Very Large Data Bases, pages 53-64, 2000.
2. I. Avila-Campillo, T. J. Green, A. Gupta, M. Onizuka, D. Raven, and D. Suciu. XMLTK: An XML toolkit for scalable XML stream processing. In Proceedings of PLANX, October 2002.
3. A. Carzaniga and A. L. Wolf. Content-based networking: A new communication infrastructure. In NSF Workshop on an Infrastructure for Mobile and Wireless Systems, 2001.
4. C. Chan, P. Felber, M. Garofalakis, and R. Rastogi. Efficient filtering of XML documents with XPath expressions. In Proceedings of the 18th International Conference on Data Engineering, 2002.
5. J. Clark. XP - an XML parser in java. available from http://www.jclark.com/xml/xp/index.html.
6. Y. Diao, P. Fischer, M. Franklin, and R. To. Yfilter: Efficient and scalable filtering of XML documents. In Proceedings of the International Conference on Data Engineering, San Jose, California, February 2002.
7. G. Dobson. Worst-case analysis of greedy heuristics for integer programming with non-negative data. Mathematics of Operational Research, 7(4):515-531, 1982.
8. P. W. Foltz and S. T. Dumais. Personalized information delivery: an analysis of information filtering methods. Communications of the ACM, 35(12):51-60, 1992.
9. T. Fujito. Approximation algorithm for submodular set cover with applications. IEICE Trans. Inf. & Syst., E83-D(3):480-487, March 2000.
10. T. J. Green, G. Miklau, M. Onizuka, and D. Suciu. Processing XML streams with deterministic automata. In Proceedings of ICDT, 2003.
11. M. Gudgin, M. Hadley, J. Moreau, and H. Nielsen. SOAP version 1.2 part 1: Messaging framework, 2001. available from the W3C, http://www.w3.org/2000/xp/Group/.
12. M. Gudgin, M. Hadley, J. Moreau, and H. Nielsen. SOAP version 1.2 part 2: Adjuncts, 2001. available from the W3C, http://www.w3.org/2000/xp/Group/.
13. A. Gupta, A. Halevy, and D. Suciu. View selection for XML stream processing. In WebDB, 2002.
14. A. Gupta and D. Suciu. Stream processing of XPath queries with predicates. In Proceeding of ACM SIGMOD Conference on Management of Data, 2003. To appear.
15. D. S. Hochbaum. Approximation Algorithm for NP-hard Problems. PWS Publishing Company, 1997.
16. S. G. Kolliopoulos and N. E. Young. Tight approximation results for general covering integer programs. In IEEE Symposium on Foundations of Computer Science, pages 522-528, 2001.
17. A. Snoeren, K. Conley, and D. Gifford. Mesh-based content routing using XML. In Proceedings of the 18th Symposium on Operating Systems Principles, pages 160-173, 2001.
18. T. W. Yan and H. Garca-Molina. Index structures for selective dissemination of information under the boolean model. ACM Transactions on Database Systems (TODS), 19(2):332-364, 1994.
19. T. W. Yan and H. Garcia-Molina. The sift information dissemination system. ACM Transactions on Database Systems (TODS), 24(4):529-565, 1999.