Sciweavers

71 search results - page 1 / 15
» Evaluating partial tree-pattern queries on XML streams
Sort
View
DASFAA
2009
IEEE
101views Database» more  DASFAA 2009»
15 years 4 months ago
Eager Evaluation of Partial Tree-Pattern Queries on XML Streams
Current streaming applications have stringent requirements on query response time and memory consumption because of the large (possibly unbounded) size of data they handle. Further...
Dimitri Theodoratos, Xiaoying Wu
CIKM
2008
Springer
14 years 11 months ago
Evaluating partial tree-pattern queries on XML streams
The streaming evaluation is a popular way of evaluating queries on XML documents. Besides its many advantages, it is also the only option for a number of important XML application...
Xiaoying Wu, Dimitri Theodoratos
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
15 years 9 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
EDBT
2002
ACM
129views Database» more  EDBT 2002»
15 years 9 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
ICDE
2007
IEEE
170views Database» more  ICDE 2007»
15 years 10 months ago
Tree-Pattern Similarity Estimation for Scalable Content-based Routing
With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important...
Raphaël Chand, Pascal Felber, Minos N. Garofa...