192 search results - page 30 / 39 » Using SAT-Solvers to Compute Inference-Proof Database Instan... |
196
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
The vast majority of work on skyline queries considers totally ordered domains, whereas in many applications some attributes are partially ordered, as for instance, domains of set ...
176
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
Skyline query processing has been investigated extensively in recent years, mostly for only one query reference point. An example of a single-source skyline query is to find hotel...
102
click to vote
SIGMOD
2004
ACM
15 years 11 months ago
2004
ACM
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
118
click to vote
PODS
2001
ACM
15 years 11 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
101
click to vote
DOLAP
2005
ACM
15 years 1 months ago
2005
ACM
OLAP users heavily rely on visualization of query answers for their interactive analysis of massive amounts of data. Very often, these answers cannot be visualized entirely and th...