Sciweavers

1160 search results - page 38 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
14 years 11 months ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
14 years 2 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
RP
2010
Springer
163views Control Systems» more  RP 2010»
13 years 8 months ago
Efficient Graph Reachability Query Answering Using Tree Decomposition
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
Fang Wei
COOPIS
2003
IEEE
14 years 4 months ago
Ontology Based Query Processing in Database Management Systems
The use of semantic knowledge in its various forms has become an important aspect in managing data in database and information systems. In the form of integrity constraints, it ha...
Chokri Ben Necib, Johann Christoph Freytag
EDBT
2011
ACM
209views Database» more  EDBT 2011»
13 years 2 months ago
An optimal strategy for monitoring top-k queries in streaming windows
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
Di Yang, Avani Shastri, Elke A. Rundensteiner, Mat...