1756 search results - page 132 / 352 » Mining Query Logs |
132
click to vote
BALT
2006
15 years 4 months ago
2006
In many application domains (e.g., WWW mining, molecular biology), large string datasets are available and yet under-exploited. The inductive database framework assumes that both s...
83
Voted
WALCOM
2010
IEEE
15 years 7 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
181
click to vote
ICALP
2011
Springer
14 years 4 months ago
2011
Springer
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
94
Voted
DAWAK
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. Many SQL queries with aggregated subqueries exhibit redundancy (overlap in FROM and WHERE clauses). We propose a method, called the for-loop, to optimize such queries by ...
SODA
2010
ACM
15 years 10 months ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...