2853 search results - page 60 / 571 » On the Efficiency of Provenance Queries |
170
click to vote
ICDT
2009
ACM
16 years 18 days ago
2009
ACM
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
214
click to vote
STOC
2003
ACM
16 years 5 days ago
2003
ACM
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
134
click to vote
ESWS
2009
Springer
14 years 9 months ago
2009
Springer
Many applications operate on time-sensitive data. Some of these data are only valid for certain intervals (e.g., job-assignments, versions of software code), others describe tempor...
ECCC
2010
14 years 6 months ago
2010
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
SIGIR
2008
ACM
14 years 11 months ago
2008
ACM
Online communities have become popular for publishing and searching content, as well as for finding and connecting to other users. User-generated content includes, for example, pe...