Sciweavers

348 search results - page 32 / 70
» An Efficient Index Lattice for XML Query Evaluation
Sort
View
ICDE
2003
IEEE
120views Database» more  ICDE 2003»
14 years 9 months ago
PBiTree Coding and Efficient Processing of Containment Joins
This paper addresses issues related to containment join processing in tree-structured data such as XML documents. A containment join takes two sets of XML node elements as input a...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
13 years 7 months 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
2007
ACM
95views Database» more  VLDB 2007»
14 years 8 months ago
Matching Twigs in Probabilistic XML
Evaluation of twig queries over probabilistic XML is investigated. Projection is allowed and, in particular, a query may be Boolean. It is shown that for a well-known model of pro...
Benny Kimelfeld, Yehoshua Sagiv
SIGMOD
2007
ACM
144views Database» more  SIGMOD 2007»
14 years 7 months ago
Efficient xml data dissemination with piggybacking
Content-based dissemination of XML data using the publishsubscribe paradigm is an effective means to deliver relevant data to interested data consumers. To meet the performance ch...
Chee Yong Chan, Yuan Ni
VLDB
2001
ACM
153views Database» more  VLDB 2001»
14 years 4 days ago
A Fast Index for Semistructured Data
Queries navigate semistructured data via path expressions, and can be accelerated using an index. Our solution encodes paths as strings, and inserts those strings into a special i...
Brian F. Cooper, Neal Sample, Michael J. Franklin,...