Browse > Article

A Lattice Structure for Efficiently Maintaining Homomorphism Information Among XPath Patterns  

Yoo, Sang-Hyun (한국과학기술원 전산학과)
Son, Jin-Hlrun (한양대학교 컴퓨터공학과)
Kim, Myoung-Ho (한국과학기술원 전산학과)
Publication Information
Journal of KIISE:Databases / v.32, no.3, 2005 , pp. 326-333 More about this Journal
Abstract
Many XML applications use XPath Patterns as a query language for XML documents. Two XPath patterns may have containment relationship, and the containment problem between two XPath patterns is a problem that determines whether one XPath pattern contains another XPath Pattern. Although the containment problem occurs in many applications, it is known as a co-NP complete. A homomorphism problem, which is a sufficient condition for the containment problem, is solved in polynomial time. We first discuss applications that replace the containment problem with the homomorphism problem, and maintaining homomorphism information among XPath patterns will benefit those applications. Then, we propose a lattice structure, called POX (Partially Ordered Set of XPath Patterns), and develop algorithms for maintaining it. As our analyses show, the algorithms can efficiently maintain POX in polynomial time.
Keywords
XML; XPath pattern; Containment; Homomorphism;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. A. Dossey, A. D. Otto, L. E. Spence, and C. V. Eynden, Discrete Mathematics, Scott, Foresman and Company, 1987
2 C.-Y. Chan, P. Felber, M. Garofalakis, and R. Rastogi, Efficient Filtering of XML Documents with XPath Expressions, The VLDB Journal, Vol. 11, No. 4, pages 354-379, 2002   DOI
3 Y. Diao, M. Altinel, M. J. Franklin, H. Zhang, and P. Fischer, Yfilter: Efficient and Scalable Filtering of XML Documents, In Proceedings of International Conference of Data Engineering, pages 341-342, 2002   DOI
4 S. Yoo, J. H. Son, and M. H. Kim, Maintaining Homomorphism Information of XPath Patterns, Korea Advanced Institute of Science and Technology (KAIST) Technical Report (CS-TR-2004-209), 2004. http://cs.kaist.ac.kr/research/technical/Archive/CS-TR-2004-209.pdf
5 C.-Y. Chan, W. Fan, P. Felber, M. Garofalakis, and R. Rastogi, Tree Pattern Aggregation for Scalable XML Data Dissemination, In Proceedings of the 28th VLDB Conference, pages 826-837, 2002
6 A. Carzaniga, D. S. Rosenblum, and A. L. Wolf, Design and Evaluation of a Wide-Area Event Notification Service, ACM Transactions on Computer Systems, Vol. 19, No. 3, pages 332-383, 2001   DOI   ScienceOn
7 M. Altinel and M. J. Franklin, Efficient Filtering of XML Documents for Selective Dissemination of Information, In Proceedings of the 26th VLDB Conference, pages 53-64, 2000
8 World Wide Web Consortium, XML Pointer Language (XPointer), http://www.w3.org/TR/xptr, W3C Working Draft, August 2002
9 G. Miklau, D. Suciu, Containment and Equivalence for an Xpath Fragment, In Proceedings of the 21st Symposium on Principles of Database Systems, Pages 65-76, 2002   DOI
10 World Wide Web Consortium, XML Path Language (XPath) Version 1.0, http://www.w3.org/TR/xpath, W3C Recommendation, November, 1999
11 World Wide Web Consortium, XSL Transformations (XSLT) Version 1.0, http://www.w3.org/TR/xslt, W3C Recommendation, November 1999