157 search results - page 15 / 32 » Incremental Evaluation of Datalog Queries |
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...
CIDR
2009
13 years 9 months ago
2009
Workloads that comb through vast amounts of data are gaining importance in the sciences. These workloads consist of "needle in a haystack" queries that are long running ...
ICDT
2007
ACM
14 years 2 months ago
2007
ACM
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
PVLDB
2010
13 years 7 months ago
2010
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
ECOOP
1999
Springer
14 years 28 days ago
1999
Springer
Program errors are hard to find because of the cause-effect gap between the time when an error occurs and the time when the error becomes apparent to the programmer. Although debu...