613 search results - page 27 / 123 » Query Evaluation on a Database Given by a Random Graph |
129
click to vote
SSDBM
2008
IEEE
15 years 8 months ago
2008
IEEE
Increasingly, many data sources appear as online databases, hidden behind query forms, thus forming what is referred to as the deep web. It is desirable to have systems that can pr...
111
Voted
DASFAA
2004
IEEE
15 years 5 months ago
2004
IEEE
Users of database applications, especially in the e-commerce domain, often resort to exploratory "trial-and-error" queries since the underlying data space is huge and unf...
122
click to vote
RSA
2008
15 years 1 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
210
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
Aggregate measures summarizing subsets of data are valuable in exploratory analysis and decision support, especially when dependent aggregations can be easily specified and compute...
140
click to vote
SSD
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example ...