Sciweavers

423 search results - page 6 / 85
» Evaluating TOP-K Queries over Business Processes
Sort
View
VLDB
2002
ACM
98views Database» more  VLDB 2002»
13 years 7 months ago
Processing Star Queries on Hierarchically-Clustered Fact Tables
Star queries are the most prevalent kind of queries in data warehousing, OLAP and business intelligence applications. Thus, there is an imperative need for efficiently processing ...
Nikos Karayannidis, Aris Tsois, Timos K. Sellis, R...
IS
2011
13 years 2 months ago
Similarity of business process models: Metrics and evaluation
—It is common for large and complex organizations to maintain repositories of business process models in order to document and to continuously improve their operations. Given suc...
Remco M. Dijkman, Marlon Dumas, Boudewijn F. van D...
ICDE
2006
IEEE
179views Database» more  ICDE 2006»
14 years 9 months ago
Distributed Evaluation of Continuous Equi-join Queries over Large Structured Overlay Networks
We study the problem of continuous relational query processing in Internet-scale overlay networks realized by distributed hash tables. We concentrate on the case of continuous two...
Stratos Idreos, Christos Tryfonopoulos, Manolis Ko...
EDBT
2010
ACM
185views Database» more  EDBT 2010»
13 years 9 months ago
BP-Ex: a uniform query engine for business process execution traces
Many enterprises nowadays use business processes, based on the BPEL standard, to achieve their goals. Analyzing the execution of such processes is critical for enforcing business ...
Eran Balan, Tova Milo, Tal Sterenzy
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
14 years 9 months ago
The Space Complexity of Processing XML Twig Queries Over Indexed Documents
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
Mirit Shalem, Ziv Bar-Yossef