19130 search results - page 3681 / 3826 » Modelling multi-path problems |
292
click to vote
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
126
click to vote
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
Recently, the Web has been rapidly "deepened" by many searchable databases online, where data are hidden behind query forms. For modelling and integrating Web databases,...
127
Voted
SIGMOD
2004
ACM
16 years 2 months ago
2004
ACM
Dynamic plan migration is concerned with the on-the-fly transition from one continuous query plan to a semantically equivalent yet more efficient plan. Migration is important for ...
117
Voted
SIGMOD
2002
ACM
16 years 2 months ago
2002
ACM
Managing a combined store consisting of database data and file data in a robust and consistent manner is a challenge for database systems and content management systems. In such a...
128
click to vote
SIGMOD
2002
ACM
16 years 2 months ago
2002
ACM
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...