Sciweavers

423 search results - page 7 / 85
» Evaluating TOP-K Queries over Business Processes
Sort
View
ICDT
2009
ACM
109views Database» more  ICDT 2009»
14 years 8 months ago
TOP-K projection queries for probabilistic business processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specific...
Daniel Deutch, Tova Milo
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 7 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
WAIM
2004
Springer
14 years 1 months ago
Learning-Based Top-N Selection Query Evaluation over Relational Databases
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
Liang Zhu, Weiyi Meng
SIGMOD
2005
ACM
168views Database» more  SIGMOD 2005»
14 years 7 months ago
No pane, no gain: efficient evaluation of sliding-window aggregates over data streams
Window queries are proving essential to data-stream processing. In this paper, we present an approach for evaluating sliding-window aggregate queries that reduces both space and c...
Jin Li, David Maier, Kristin Tufte, Vassilis Papad...
ESWS
2007
Springer
14 years 1 months ago
Semantic Business Process Repository
Semantic Business Process Management (SBPM) utilizes semantic technologies to achieve more automation throughout the BPM lifecycle. An integral part of the SBPM infrastructure is a...
Zhilei Ma, Branimir Wetzstein, Darko Anicic, Stijn...