301 search results - page 46 / 61 » Efficient Sketches for the Set Query Problem |
197
click to vote
ICDE
2006
IEEE
16 years 10 days ago
2006
IEEE
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...
EDBT
2008
ACM
15 years 11 months ago
2008
ACM
We address the problem of generating a mediated schema from a set of relational data source schemas and conjunctive queries that specify where those schemas overlap. Unlike past a...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Very large databases are required to store massive amounts of data that are continuously inserted and queried. Analyzing huge data sets and extracting valuable pattern in many appl...
IJCSA
2008
14 years 11 months ago
2008
: Skyline Queries have recently received a lot of attention due to their intuitive query capabilities. Following the concept of Pareto optimality all `best' database objects a...
86
Voted
CIKM
2010
Springer
14 years 9 months ago
2010
Springer
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...