Sciweavers

578 search results - page 109 / 116
» The Minimum-Entropy Set Cover Problem
Sort
View
SIGMOD
2006
ACM
89views Database» more  SIGMOD 2006»
14 years 7 months ago
Testing database applications
Testing of database applications is crucial for ensuring high software quality as undetected faults can result in unrecoverable data corruption. The problem of database applicatio...
Carsten Binnig, Donald Kossmann, Eric Lo
PLDI
2005
ACM
14 years 1 months ago
Jungloid mining: helping to navigate the API jungle
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We obser...
David Mandelin, Lin Xu, Rastislav Bodík, Do...
EDOC
2002
IEEE
14 years 14 days ago
Business Modelling for Component Systems with UML
The EC funded COMBINE Project has the objective of dramatically improving software development productivity by providing a holistic approach to component-based development of Ente...
Sandy Tyndale-Biscoe, Oliver Sims, Bryan Wood, Chr...
EDBT
2009
ACM
106views Database» more  EDBT 2009»
13 years 11 months ago
AlphaSum: size-constrained table summarization using value lattices
Consider a scientist who wants to explore multiple data sets to select the relevant ones for further analysis. Since the visualization real estate may put a stringent constraint o...
K. Selçuk Candan, Huiping Cao, Yan Qi 0002,...
CIKM
2009
Springer
14 years 4 days ago
Space-economical partial gram indices for exact substring matching
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
Nan Tang, Lefteris Sidirourgos, Peter A. Boncz