Sciweavers

1031 search results - page 123 / 207
» Managing the operator ordering problem in parallel databases
Sort
View
109
Voted
ICDCS
1999
IEEE
15 years 8 months ago
Beyond the Black Box: Event-based Inter-Process Communication in Process Support Systems
Existing workflow management systems encapsulate the data and behavior of a process within its execution scope, preventing other processes from accessing this information until th...
Claus Hagen, Gustavo Alonso
140
Voted
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
15 years 9 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
141
Voted
SAC
2004
ACM
15 years 9 months ago
A new algorithm for gap constrained sequence mining
The sequence mining problem consists in finding frequent sequential patterns in a database of time-stamped events. Several application domains require limiting the maximum tempor...
Salvatore Orlando, Raffaele Perego, Claudio Silves...
128
Voted
ICPP
1999
IEEE
15 years 8 months ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward
233
Voted
ICDE
2003
IEEE
138views Database» more  ICDE 2003»
16 years 5 months ago
Using State Modules for Adaptive Query Processing
We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed ...
Vijayshankar Raman, Amol Deshpande, Joseph M. Hell...