K. C.-C. Chang and S.-W. Hwang. Minimal probing: Supporting expensive predicates for top-k queries. SIGMOD, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Maintenance of Materialized Top-k Views - Yi, Yu, Yang, Xia, Chen (2003) (Correct)
....performance with appropriate kmax values. We show how to choose kmax dynamically to adapt to the actual system workload and performance at runtime, without requiring accurate prior knowledge. 1 Introduction Top k queries have received much attention from the database community in recent years [5, 9, 10, 3, 6]. An effective way of improving the performance of expensive queries is to maintain their results as materialized views [13] However, incremental maintenance of materialized top k views has been a relatively unexplored problem in the view maintenance literature. The main difficulty of this ....
....the parameters of our cost model, and demonstrates the effectiveness of our algorithm in realistic scenarios. Section 7 proposes a procedure for choosing k max which adapts to the actual system workload and performance at runtime. 2 Related Work There is a large body of work on top k queries [4, 5, 9, 10, 3, 7, 6], most of which focuses on how to evaluate these queries efficiently in various contexts. Most related to this paper is the work by Hristidis et al. 15] wherein they propose using materialized top k views to speed up more complex preference queries. Their work focuses on selecting top k views to ....
K. C.-C. Chang and S.-W. Hwang. Minimal probing: Supporting expensive predicates for top-k queries. In Proc. of the 2002.
Optimizing Top-k Selection Queries Repositories - Chaudhuri, Gravano, Marian (2003) (Correct)
....pair to process at any given time based on the result of previous accesses. Bruno et al. also proposed TA EP, an optimization of TA that exploits existing techniques for processing selections with expensive predicates, and is thus related to the strategy in Section 3. Finally, Chang and Hwang [8] presented a top c processing algorithm for expensive predicates that relies on identifying necessary probes. An experimental comparison of our techniques with these strategies is subject of interesting future work. 7 Summary In this paper, we addressed the problem of cost based optimization ....
K. C.-C. Chang and S.-W. Hwang. Minimal probing: Supporting expensive predicates for top-k queries. In Proc. of the 2002.
Ranked Join Indices - Tsaparas, Palpanas, Kotidis, Koudas, .. (2003) (2 citations) (Correct)
....of rank attributes along with data entities leads to enhanced functionalityand query processing capabilities. Indeed a variety of recent works have addressed several aspects of the problem of enhancing query processing taking into account user preferences towards the values of rank attributes [12, 3, 4]. Of particular importance is query answering with the goal of optimizing functions that capture user preferences towards rank attribute values. For example in a database of rental houses, data entities (i.e. houses) can be ranked according to a variety of attributes such as, distance from a ....
....based on indexing. Instead, they are geared towards optimizing the number of tuples examined in order to identify the answer under various cost models of interest. Such optimizations include, minimization of tuples read sequentially from the input [12, 10, 6] or minimization of random disk access [3, 4]. Chang et al. 5] propose an indexing technique for answering top k selection queries. This technique does not provide guarantees for its performance and in the worst case, the entire data set has to be examined in order to identify the correct answer to a top k selection query. A significant ....
K. Chang andS.-W. Huang. Minimal Probing: SupportingExpensive Predicates for Top-k Queries. Proceedings of ACM SIGMOD, June 2002.
Supporting Ad-hoc Ranking Aggregates - Chengkai Li Kevin (2006) Self-citation (Chang) (Correct)
No context found.
K. C.-C. Chang and S. Hwang. Minimal probing: Supporting expensive predicates for top-k queries. In SIGMOD, pages 346--357, 2002.
Efficient Processing of Ad-Hoc Top-k Aggregate Queries in OLAP - Li, Chang, Ilyas (2005) Self-citation (Chang) (Correct)
No context found.
K. C.-C. Chang and S. Hwang. Minimal probing: Supporting expensive predicates for top-k queries. In SIGMOD, 2002.
RankSQL: Query Algebra and Optimization for Relational.. - Li, Chang, Ilyas, Song (2004) (1 citation) Self-citation (Chang) (Correct)
No context found.
K. C.-C. Chang and S. Hwang. Minimal probing: Supporting expensive predicates for top-k queries. In SIGMOD, pages 346--357, 2002.
RankSQL: Supporting Ranking Queries in Relational.. - Li, Soliman, Chang.. (2005) Self-citation (Chang) (Correct)
No context found.
K. C.-C. Chang and S. Hwang. Minimal probing: Supporting expensive predicates for top-k queries. In SIGMOD, pages 346--357, 2002.
RankSQL: Query Algebra and Optimization for Relational.. - Li, Chang, Ilyas, Song (2005) (1 citation) Self-citation (Chang) (Correct)
No context found.
K. C.-C. Chang and S. Hwang. Minimal probing: Supporting expensive predicates for top-k queries. In SIGMOD, pages 346--357, 2002.
A Probabilistic Approach to Metasearching with Adaptive Probing - Zhenyu Liu Chang (2004) (1 citation) Self-citation (Chang) (Correct)
No context found.
K. Chang and S.Hwang. Minimal Probing: Supporting Expensive Predicates for Top-k Queries. In Proc. of ACM SIGMOD '02, WI, 2002
Minimal Probing: Supporting Expensive Predicates for Top-k.. - Chang, Hwang (2002) (10 citations) Self-citation (Chang Hwang) (Correct)
....will scale sublinearly in database size. In addition, MPro can be immediately generalized for approximate processing. Since approximate answers are often acceptable in ranked queries (which are inherently imprecise ) we extend MPro to enable trading efficiency with accuracy which we report in [11]. Note that this paper concentrates on the algorithmic framework for supporting expensive predicates, and not on other related issues. In particular, a practical system must provide a friendly interface for users or application programmers to easily specify userdefined predicates. To study this ....
....based on which we develop Algorithm MPro. Section 5 then discusses several extensions of the basic algorithm. Section 6 reports our experimental evaluation. Due to space limitations, we leave some additional results (e.g. proof, approximation, and more experiments) to an extended report [11]. 2. RELATED WORK Expensive predicates have been studied for Boolean queries to support user defined functions. Several works (e.g. 2, 3] address processing expensive predicates efficiently. As Section 1 discussed, all current major DBMSs (e.g. Microsoft SQL Server, IBM DB2, Oracle, and ....
[Article contains additional citation context not shown here]
K. Chang and S. Hwang. Minimal probing: Supporting expensive predicates for top-k queries. Technical Report UIUCDCS-R-2001-2258, University of Illinois, December 2001.
Circumventing Data Quality Problems - Using Multiple Join (Correct)
No context found.
K. C.-C. Chang and S.-W. Hwang. Minimal probing: Supporting expensive predicates for top-k queries. SIGMOD, 2002.
Ranked Join Indices - Panayiotis Tsaparas Tsap (2003) (2 citations) (Correct)
No context found.
K. Chang andS.-W. Huang. Minimal Probing: SupportingExpensive Predicates for Top-k Queries. Proceedings of ACM SIGMOD, June 2002.
An Efficient and Versatile Query Engine for TopX Search - Theobald, Schenkel, Weikum (2005) (Correct)
No context found.
K.-C. Chang and S.-W. Hwang. Minimal probing: supporting expensive predicates for top-k queries. In SIGMOD 2002.
Best-k Queries on Database Systems - Tao Tao Chengxiang (Correct)
No context found.
K. C.-C. Chang and S. won Hwang. Minimal probing: supporting expensive predicates for top-k queries. In SIGMOD'02, pages 346--357, 2002.
Ranking Aggregates - Li, Yu, Agrawal, Abbadi (2004) (Correct)
No context found.
K. C. Chang and S. Hwang. Minimal probing: Supporting expensive predicates for top-k queries. In SIGMOD Conference, pages 346--357, 2002.
Parallel Probing of Web Databases for Top-k Query Processing - Marian, Gravano (2003) (Correct)
No context found.
K. C.-C. Chang and S.-W. Hwang. Minimal probing: Supporting expensive predicates for top-k queries. In Proc. of the 2002.
Ranked Join Indices - Tsaparas, Palpanas, Kotidis, Koudas, .. (2003) (2 citations) (Correct)
No context found.
K. Chang andS.-W. Huang. Minimal Probing: SupportingExpensive Predicates for Top-k Queries. Proceedings of ACM SIGMOD, June 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC