4113 search results - page 639 / 823 » Watermarking Relational Databases |
226
Voted
SIGMOD
2008
ACM
16 years 4 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
230
Voted
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
254
Voted
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
Data stream applications have made use of statistical summaries to reason about the data using nonparametric tools such as histograms, heavy hitters, and join sizes. However, rela...
131
Voted
SIGMOD
2002
ACM
16 years 4 months ago
2002
ACM
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
146
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...