Sciweavers

1114 search results - page 147 / 223
» Optimizing XML Compression
Sort
View
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
14 years 11 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
14 years 10 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy
ICEIS
2006
IEEE
14 years 4 months ago
Filtering Unsatisfiable XPATH Queries
The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submis...
Jinghua Groppe, Sven Groppe
VLDB
2005
ACM
85views Database» more  VLDB 2005»
14 years 3 months ago
Pattern Tree Algebras: Sets or Sequences?
XML and XQuery semantics are very sensitive to the order of the produced output. Although pattern-tree based algebraic approaches are becoming more and more popular for evaluating...
Stelios Paparizos, H. V. Jagadish
EDBT
2009
ACM
144views Database» more  EDBT 2009»
14 years 2 months ago
Efficient maintenance techniques for views over active documents
Many Web applications are based on dynamic interactions between Web components exchanging flows of information. Such a situation arises for instance in mashup systems or when moni...
Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu