4616 search results - page 690 / 924 » Beyond relational databases |
162
click to vote
WWW
2001
ACM
16 years 7 months ago
2001
ACM
Integrity constraints are an essential part of a modern schema definition language. They are useful for semantic specification, update consistency control, query optimization, inf...
160
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
We study the mining of interesting patterns in the presence of numerical attributes. Instead of the usual discretization methods, we propose the use of rank based measures to scor...
161
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
159
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
170
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...