4616 search results - page 741 / 924 » Beyond relational databases |
275
click to vote
SIGMOD
2006
ACM
16 years 6 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 ...
299
click to vote
SIGMOD
2006
ACM
16 years 6 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...
160
click to vote
SIGMOD
2002
ACM
16 years 6 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...
174
click to vote
PODS
2006
ACM
16 years 6 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...
179
click to vote
PODS
2007
ACM
16 years 6 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...