1425 search results - page 120 / 285 » Beyond Dependency Graphs |
122
click to vote
VLDB
1994
ACM
15 years 7 months ago
1994
ACM
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
122
click to vote
PODS
2006
ACM
16 years 3 months ago
2006
ACM
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
152
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
133
click to vote
PEPM
2007
ACM
15 years 9 months ago
2007
ACM
Functional Reactive Programming (frp) extends traditional functional programming with dataflow evaluation, making it possible to write interactive programs in a declarative style...
108
click to vote
VLDB
1995
ACM
15 years 6 months ago
1995
ACM
: This paper defines a framework for explaining redo recovery after a system crash. In this framework, an installation graph explains the order in which operations must be install...