Sciweavers

144 search results - page 15 / 29
» Complexity Results for Modal Dependence Logic
Sort
View
PODS
1998
ACM
116views Database» more  PODS 1998»
13 years 11 months ago
Complexity of Answering Queries Using Materialized Views
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
Serge Abiteboul, Oliver M. Duschka
ARCS
2010
Springer
14 years 9 days ago
Complexity-Effective Rename Table Design for Rapid Speculation Recovery
Register renaming is a widely used technique to remove false data dependencies in contemporary superscalar microprocessors. The register rename logic includes a mapping table that ...
Görkem Asilioglu, Emine Merve Kaya, Oguz Ergi...
IEEEPACT
2002
IEEE
14 years 12 days ago
Cost Effective Memory Dependence Prediction using Speculation Levels and Color Sets
Memory dependence prediction allows out-of-order issue processors to achieve high degrees of instruction level parallelism by issuing load instructions at the earliest time withou...
Soner Önder
ICDT
2009
ACM
135views Database» more  ICDT 2009»
14 years 2 months ago
Repair checking in inconsistent databases: algorithms and complexity
Managing inconsistency in databases has long been recognized as an important problem. One of the most promising approaches to coping with inconsistency in databases is the framewo...
Foto N. Afrati, Phokion G. Kolaitis
KR
2010
Springer
14 years 8 days ago
Decomposing Description Logic Ontologies
Recent years have seen the advent of large and complex ontologies, most notably in the medical domain. As a consequence, structuring mechanisms for ontologies are nowadays viewed ...
Boris Konev, Carsten Lutz, Denis Ponomaryov, Frank...