Sciweavers

1004 search results - page 96 / 201
» Safe Constraint Queries
Sort
View
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 9 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
VLDB
2002
ACM
157views Database» more  VLDB 2002»
14 years 9 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu
DAWAK
2001
Springer
14 years 1 months ago
Shared Index Scans for Data Warehouses
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
Yannis Kotidis, Yannis Sismanis, Nick Roussopoulos
RR
2010
Springer
13 years 7 months ago
KWilt: A Semantic Patchwork for Flexible Access to Heterogeneous Knowledge
Semantic wikis and other modern knowledge management systems deviate from traditional knowledge bases in that information ranges from unstructured (wiki pages) over semi-formal (ta...
Klara A. Weiand, Steffen Hausmann, Tim Furche, Fra...
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 9 months ago
RDFViewS: A Storage Tuning Wizard for RDF Applications
In recent years, the significant growth of RDF data used in numerous applications has made its efficient and scalable manipulation an important issue. In this paper, we present RD...
François Goasdoué, Konstantinos Kara...