Sciweavers

35 search results - page 1 / 7
» Minimization of tree pattern queries with constraints
Sort
View
102
Voted
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
15 years 8 days ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan
VLDB
2002
ACM
133views Database» more  VLDB 2002»
16 years 18 days ago
Tree pattern query minimization
: Purpose ? Tree pattern is at the core of XML queries. The tree patterns in XML queries typically contain redundancies, especially when broad integrity constraints (ICs) are prese...
Sihem Amer-Yahia, SungRan Cho, Laks V. S. Lakshman...
73
Voted
SIGMOD
2002
ACM
126views Database» more  SIGMOD 2002»
16 years 15 days ago
Efficient algorithms for minimizing tree pattern queries
Prakash Ramanan
CIKM
2009
Springer
15 years 5 months ago
Minimal common container of tree patterns
Tree patterns represent important fragments of XPath. In this paper, we show that some classes of tree patterns exhibit such a property that, given a finite number of tree patter...
Junhu Wang, Jeffrey Xu Yu, Chaoyi Pang, Chengfei L...