11397 search results - page 99 / 2280 » A Relational Abstraction for Functions |
NETWORKS
2006
13 years 10 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
DLOG
2011
13 years 1 months ago
2011
Abstract. We consider the problem of characterising relational constraints under which TBox reasoning in EL is tractable. We obtain P vs. coNP-hardness dichotomies for tabular cons...
ER
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We discuss the existence of matrix representations for generalised and minimum participation constraints which are frequently used in database design and conceptual model...
DAWAK
2007
Springer
14 years 4 months ago
2007
Springer
In this paper, we deal with the problem of performing what-if analysis for changes that occur in the schema/structure of the data warehouse We abstract software modules, queries, r...
ESOP
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Cost analysis of Java bytecode is complicated by its unstructured control flow, the use of an operand stack and its object-oriented programming features (like dynamic di...