777 search results - page 19 / 156 » Optimization of Relational Preference Queries |
126
Voted
SIGMOD
2002
ACM
15 years 1 months ago
2002
ACM
A variety of developments combine to highlight the need for respecting order when manipulating relations. For example, new functionality is being added to SQL to support OLAP-styl...
110
click to vote
LOGCOM
2007
15 years 1 months ago
2007
We consider the problem of incorporating arbitrary preferences in planning systems. A preference may be seen as a goal or constraint that is desirable, but not necessary, to satis...
91
Voted
VLDB
1999
ACM
15 years 6 months ago
1999
ACM
The problem of nding the best answers to a query quickly, rather than nding all answers, is of increasing importance as relational databases are applied in multimedia and decision...
121
click to vote
ICIP
2003
IEEE
16 years 3 months ago
2003
IEEE
With recent advances in temporal and spatiotemporal databases, user demands are becoming more complex. As a result, simple queries are replaced by complex multitemporal query scen...
181
Voted
SIGMOD
2005
ACM
16 years 2 months ago
2005
ACM
Relational DBMS typically execute concurrent queries independently by invoking a set of operator instances for each query. To exploit common data retrievals and computation in con...