Sciweavers

244 search results - page 5 / 49
» Efficient Approximation Algorithms for Repairing Inconsisten...
Sort
View
DBPL
2005
Springer
130views Database» more  DBPL 2005»
14 years 1 months ago
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 9 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
ICDE
2008
IEEE
152views Database» more  ICDE 2008»
14 years 9 months ago
Efficient Merging and Filtering Algorithms for Approximate String Searches
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
Chen Li, Jiaheng Lu, Yiming Lu
ICDE
2009
IEEE
129views Database» more  ICDE 2009»
14 years 10 months ago
Computing Distance Histograms Efficiently in Scientific Databases
Abstract-- Particle simulation has become an important research tool in many scientific and engineering fields. Data generated by such simulations impose great challenges to databa...
Yi-Cheng Tu, Shaoping Chen, Sagar Pandit
BTW
2009
Springer
114views Database» more  BTW 2009»
13 years 11 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