43 search results - page 6 / 9 » The complexity of satisfying constraints on databases of tra... |
ICDM
2002
IEEE
14 years 13 days ago
2002
IEEE
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
AMW
2010
13 years 9 months ago
2010
Abstract. Consistent query answering (CQA) is about formally characterizing and computing semantically correct answers to queries posed to a database that may fail to satisfy certa...
SIGMOD
2001
ACM
14 years 7 months ago
2001
ACM
Managing multiple versions of XML documents represents an important problem, because of many applications ranging from traditional ones, such as software configuration control, to...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
PODS
1999
ACM
13 years 11 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...