486 search results - page 11 / 98 » Evaluating Top-k Queries over Web-Accessible Databases |
131
click to vote
PODS
2002
ACM
16 years 1 months ago
2002
ACM
We consider conjunctive queries with arithmetic comparisons over multiple continuous data streams. We specify an algorithm for determining whether or not a query can be evaluated ...
102
click to vote
SIGMOD
1995
ACM
15 years 5 months ago
1995
ACM
When querying a temporal database, a user often makes certain semantic assumptions on stored temporal data. This paper formalizes and studies two types of semantic assumptions: po...
181
click to vote
SIGMOD
2009
ACM
16 years 1 months ago
2009
ACM
Enabling keyword queries over relational databases (KQDB) benefits a large population of users who have difficulty in understanding the database schema or using SQLs. However, sin...
116
click to vote
SIGIR
2010
ACM
14 years 11 months ago
2010
ACM
Keyword queries over structured databases are notoriously ambiguous. No single interpretation of a keyword query can satisfy all users, and multiple interpretations may yield over...
109
click to vote
CDB
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...