Sciweavers

6 search results - page 1 / 2
» ConQuer: Efficient Management of Inconsistent Databases
Sort
View
SIGMOD
2005
ACM
228views Database» more  SIGMOD 2005»
14 years 5 months ago
ConQuer: Efficient Management of Inconsistent Databases
Although integrity constraints have long been used to maintain data consistency, there are situations in which they may not be enforced or satisfied. In this paper, we present Con...
Ariel Fuxman, Elham Fazli, Renée J. Miller
ICDE
2006
IEEE
141views Database» more  ICDE 2006»
14 years 6 months ago
Clean Answers over Dirty Databases: A Probabilistic Approach
The detection of duplicate tuples, corresponding to the same real-world entity, is an important task in data integration and cleaning. While many techniques exist to identify such...
Ariel Fuxman, Periklis Andritsos, Renée J. ...
BTW
2009
Springer
114views Database» more  BTW 2009»
13 years 8 months ago
Efficient Verification of B-tree Integrity
: The integrity of B-tree structures can become compromised for many reasons. Since these inconsistencies manifest themselves in unpredictable ways, all commercial database managem...
Goetz Graefe, R. Stonecipher
BTW
2007
Springer
189views Database» more  BTW 2007»
13 years 11 months ago
Reconsidering Consistency Management in Shared Data Spaces for Emergency and Rescue Applications
: Efficient information sharing is very important for emergency and rescue operations. These operations often have to be performed in environments where no communication infrastruc...
Thomas Plagemann, Ellen Munthe-Kaas, Vera Goebel
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 5 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes