Sciweavers

357 search results - page 12 / 72
» An Algebraic Approach to the Complexity of Generalized Conju...
Sort
View
VLDB
2006
ACM
147views Database» more  VLDB 2006»
14 years 8 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
FOCS
2003
IEEE
14 years 1 months ago
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
Martin Grohe
SSDBM
2006
IEEE
153views Database» more  SSDBM 2006»
14 years 1 months ago
HDF5-FastQuery: Accelerating Complex Queries on HDF Datasets using Fast Bitmap Indices
Large scale scientific data is often stored in scientific data formats such as FITS, netCDF and HDF. These storage formats are of particular interest to the scientific user com...
Luke J. Gosink, John Shalf, Kurt Stockinger, Keshe...
GSN
2009
Springer
137views Sensor Networks» more  GSN 2009»
14 years 16 days ago
A Stimulus-Centric Algebraic Approach to Sensors and Observations
The understanding of complex environmental phenomena, such as deforestation and epidemics, requires observations at multiple scales. This scale dependency is not handled well by to...
Christoph Stasch, Krzysztof Janowicz, Arne Brö...
SIGMOD
2011
ACM
221views Database» more  SIGMOD 2011»
12 years 10 months ago
Scalable query rewriting: a graph-based approach
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
George Konstantinidis, José Luis Ambite