Sciweavers

719 search results - page 26 / 144
» Normalizing Incomplete Databases
Sort
View
VLDB
1992
ACM
101views Database» more  VLDB 1992»
13 years 11 months ago
Proclamation-Based Model for Cooperating Transactions
We propose a transaction model that provides a framework for transactions to cooperate without sacrificing serializability as a notion of correctness. Cooperation does not depend ...
H. V. Jagadish, Oded Shmueli
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
14 years 7 months ago
When one Sample is not Enough: Improving Text Database Selection Using Shrinkage
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
Panagiotis G. Ipeirotis, Luis Gravano
ADC
2006
Springer
128views Database» more  ADC 2006»
14 years 1 months ago
Horn clauses and functional dependencies in complex-value databases
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
Sven Hartmann, Sebastian Link
ECAI
2008
Springer
13 years 9 months ago
Vivifying Propositional Clausal Formulae
Abstract. In this paper, we present a new way to preprocess Boolean formulae in Conjunctive Normal Form (CNF). In contrast to most of the current pre-processing techniques, our app...
Cédric Piette, Youssef Hamadi, Lakhdar Sais
IJBRA
2007
89views more  IJBRA 2007»
13 years 7 months ago
Conservative adjustment of permutation p-values when the number of permutations is limited
The permutation procedure is widely used to assess the significance level (p-value) of a test statistic. This approach is asymptotically consistent. In genomics and proteomics st...
Yinglei Lai