Sciweavers

281 search results - page 10 / 57
» Toward Practical Constraint Databases
Sort
View
EDBT
2009
ACM
175views Database» more  EDBT 2009»
14 years 2 months ago
Towards materialized view selection for distributed databases
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
Leonardo Weiss Ferreira Chaves, Erik Buchmann, Fab...
SAC
2010
ACM
14 years 20 days ago
Mining interesting sets and rules in relational databases
In this paper we propose a new and elegant approach toward the generalization of frequent itemset mining to the multirelational case. We define relational itemsets that contain i...
Bart Goethals, Wim Le Page, Michael Mampaey
CP
1999
Springer
13 years 11 months ago
The Goldilocks Problem
A lot of work in constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge...
Tudor Hulubei, Eugene C. Freuder
CINQ
2004
Springer
125views Database» more  CINQ 2004»
14 years 23 days ago
The Hows, Whys, and Whens of Constraints in Itemset and Rule Discovery
Many researchers in our community (this author included) regularly emphasize the role constraints play in improving performance of data-mining algorithms. This emphasis has led to ...
Roberto J. Bayardo
ER
1995
Springer
109views Database» more  ER 1995»
13 years 11 months ago
Reverse Engineering of Relational Database Applications
Abstract. This paper presents techniques for reverse engineering of relational database applications. The target of such an effort is the definition of a fully equipped object-orie...
Mark W. W. Vermeer, Peter M. G. Apers