423 search results - page 20 / 85 » Evaluating TOP-K Queries over Business Processes |
SIGMOD
2006
ACM
14 years 10 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
DOLAP
2003
ACM
14 years 3 months ago
2003
ACM
Multidimensional aggregation queries constitute the single most important class of queries for data warehousing applications and decision support systems. The bottleneck in the ev...
CISIS
2009
IEEE
13 years 7 months ago
2009
IEEE
The volume of stream data delivered from different information sources is increasing. There are a variety of demands to utilize such stream data for applications. Stream processin...
SIGMOD
2007
ACM
14 years 10 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
ENTCS
2002
13 years 10 months ago
2002
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...