Sciweavers

707 search results - page 71 / 142
» Processing queries on tree-structured data efficiently
Sort
View
CIKM
2006
Springer
14 years 14 days ago
Maximizing the sustained throughput of distributed continuous queries
Monitoring systems today often involve continuous queries over streaming data, in a distributed collaborative system. The distribution of query operators over a network of process...
Ioana Stanoi, George A. Mihaila, Themis Palpanas, ...
CIKM
2008
Springer
13 years 10 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...
ICDE
2006
IEEE
153views Database» more  ICDE 2006»
14 years 10 months ago
ConQueSt: a Constraint-based Querying System for Exploratory Pattern Discovery
ConQueSt is a constraint-based querying system devised with the aim of supporting the intrinsically exploratory nature of pattern discovery. It provides users with an expressive c...
Francesco Bonchi, Fosca Giannotti, Claudio Lucches...
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
14 years 9 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
KDD
1998
ACM
99views Data Mining» more  KDD 1998»
14 years 29 days ago
On the Efficient Gathering of Sufficient Statistics for Classification from Large SQL Databases
For a wide variety of classification algorithms, scalability to large databases can be achieved by observing that most algorithms are driven by a set of sufficient statistics that...
Goetz Graefe, Usama M. Fayyad, Surajit Chaudhuri