43 search results - page 1 / 9 » The complexity of satisfying constraints on databases of tra... |
ACTA
2007
14 years 10 months ago
2007
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
PODS
2004
ACM
15 years 10 months ago
2004
ACM
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...
82
Voted
IDEAS
1998
IEEE
15 years 2 months ago
1998
IEEE
Complex applications consist of a large set of transactions which are interrelated. There are different kinds of dependencies among transactions of a complex application, e.g. ter...
103
Voted
EUROMICRO
1998
IEEE
15 years 2 months ago
1998
IEEE
A real-time active database system (RTADBS) has to provide capabilities for timely trigger of timeconstrained transactions and at the same time to process them, concurrently with ...
89
Voted
DBPL
2005
Springer
2005
Springer
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
15 years 3 months ago
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...