2014
DOI: 10.1007/s10796-014-9517-2
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of generic progressive queries based on dependency analysis and materialized views

Abstract: Progressive queries (PQ) are a new type of queries emerging from numerous contemporary database applications such as e-commerce, social network, business intelligence, and decision support. Such a PQ is formulated on the fly in several steps via a set of inter-related step-queries (SQ). In our previous work, we presented a framework to process a restricted type of PQs. However, how to process generic PQs remains an open problem. In this paper, we develop a novel technique to efficiently process generic PQs bas… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 31 publications
0
1
0
Order By: Relevance
“…92 (3) View materialization for progressive queries consists to address the challenge of how to optimize the generic progressive queries using MV. Zhu et al 160,161 used multiple query dependency graph (MQDG) to capture data source dependency relationships. They estimated the potential benefit based on the established MQDG and then selected results are kept as MVs.…”
Section: Web and Semantic Webmentioning
confidence: 99%
“…92 (3) View materialization for progressive queries consists to address the challenge of how to optimize the generic progressive queries using MV. Zhu et al 160,161 used multiple query dependency graph (MQDG) to capture data source dependency relationships. They estimated the potential benefit based on the established MQDG and then selected results are kept as MVs.…”
Section: Web and Semantic Webmentioning
confidence: 99%