Sciweavers

1091 search results - page 40 / 219
» Approximation in Databases
Sort
View
EDBT
2010
ACM
110views Database» more  EDBT 2010»
14 years 3 months ago
The hardness and approximation algorithms for l-diversity
The existing solutions to privacy preserving publication can be classified into the theoretical and heuristic categories. The former guarantees provably low information loss, whe...
Xiaokui Xiao, Ke Yi, Yufei Tao
DASFAA
2003
IEEE
115views Database» more  DASFAA 2003»
14 years 1 months ago
The BofS Solution to Limitations of Approximate Summaries
Data warehouses are of crucial importance to decision-making in competitive organizations. The fact that they store enormous quantities of data is a challenge in what concerns per...
Pedro Furtado, João Pedro Costa
VLDB
2004
ACM
120views Database» more  VLDB 2004»
14 years 1 months ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...
DEXAW
2005
IEEE
156views Database» more  DEXAW 2005»
14 years 2 months ago
Fixing Inconsistent Databases by Updating Numerical Attributes
For several reasons a database may not satisfy certain integrity constraints (ICs). However, most likely most of the information in it is still consistent with the ICs; and could ...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
14 years 3 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...