6846 search results - page 9 / 1370 » Querying a summary of database |
BNCOD
2003
13 years 8 months ago
2003
In this paper we describe a query paradigm based on ontologies, aggregate table-driven querying and expansion of QBE. It has two novel features: visually specifying aggregate table...
EDBT
2006
ACM
14 years 6 months ago
2006
ACM
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
WEBDB
2004
Springer
14 years 1 days ago
2004
Springer
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
WWW
2006
ACM
14 years 7 months ago
2006
ACM
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
ICDE
2001
IEEE
14 years 8 months ago
2001
IEEE
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...