Probe minimization by schedule optimization: Supporting top-K queries with expensive predicates

IEEE Transactions on Knowledge and Data Engineering

Volumn 19, Issue 5, 2007, Pages 646-662

  Hwang, Seung Won ^a   Chang, Kevin Chen Chuan ^b  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Database query processing; Database systems; Distributed information systems

Indexed keywords

DATABASE QUERY PROCESSING; DISTRIBUTED INFORMATION SYSTEMS; PROBE MINIMIZATION; SCHEDULING PROBLEMS;

BOOLEAN FUNCTIONS; DATABASE SYSTEMS; FUNCTIONS; INFORMATION RETRIEVAL SYSTEMS; MIDDLEWARE; OPTIMIZATION;

QUERY LANGUAGES;

EID: 33947612022     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2007.1007     Document Type: Article

References (23)

1. R. Agrawal and E. Wimmers, "A Framework for Expressing and Combining Preferences," Proc. ACM SIGMOD, 2000.
2. J.M. Hellerstein and M. Stonebraker, "Predicate Migration: Optimizing Queries with Expensive Predicates," Proc. ACM SIGMOD, 1993.
3. A. Kemper, G. Moerkotte, K. Peithner, and M. Steinbrunn, "Optimizing Disjunctive Queries with Expensive Predicates," Proc. ACM SIGMOD, 1994.
4. C. Li, K.C. Chang, I.F. Ilyas, and S. Song, "RankSQL: Query Algebra and Optimization for Relational Top-k Queries," Proc. ACM SIGMOD, 2005.
5. K.C. Chang and S.-W. Hwang, "Minimal Probing: Supporting Expensive Predicates for Top-k Queries," Proc. ACM SIGMOD, 2002.
6. R. Fagin, "Combining Fuzzy Information from Multiple Systems," Proc. ACM Symp. Principles of Database Systems, 1996.
7. L.A. Zadeh, "Fuzzy Sets," Information and Control, vol. 8, 1965.
8. G. Salton, Automatic Text Processing. Addison-Wesley, 1989.
9. S. Chaudhuri and L. Gravano, "Optimizing Queries over Multimedia Repositories," Proc. ACM SIGMOD, 1996.
10. N. Bruno, S. Chaudhuri, and L. Gravano, "Top-k Selection Queries over Relational Databases: Mapping Strategies and Performance Evaluation," ACM Trans. Database Systems, 2002.
11. V. Hristidis and Y. Papakonstantinou, "Algorithms and Applications for Answering Ranked Queries Using Ranked Vies," VLDB J., 2004.
12. S. Nepal and M.V. Ramakrishna, "Query Processing Issues in Image (Multimedia) Databases," Proc. Int'l Conf. Data Eng., 1999.
13. U. Guentzer, W. Balke, and W. Kiessling, "Optimizing Multi-Feature Queries in Image Databases," Proc. 26th Int'l Conf. Very Large Data Bases, 2000.
14. R. Fagin, A. Lotem, and M. Naor, "Optimal Aggregation Algorithms for Middleware," J. Computer and System Sciences, vol. 66, no. 4, 2003.
15. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press, 2001.
16. N. Bruno, L. Gravano, and A. Marian, "Evaluating Top-k Queries over Web-Accessible Databases," Proc. Int'l Conf. Data Eng., 2002.
17. A. Marian, N. Bruno, and L. Gravano, "Evaluating Top-k Queries over Web-Accessible Databases," ACM Trans. Database Systems, 2004.
18. E.L. Wimmers, L.M. Haas, M.T. Roth, and C. Braendli, "Using Fagin's Algorithm for Merging Ranked Results in Multimedia Middleware," Proc. Int'l Conf. Cooperative Information Systems, 1999.
19. S.-W. Hwang and K.C.-C. Chang, "Optimizing Access Cost for Top-k Queries over Web Sources: A Unified Cost-Based Approach," Proc. Int'l Conf. Data Eng., 2005.
20. A. Natsev, Y.-C. Chang, J.R. Smith, C.-S. Li, and J.S. Vitter, "Supporting Incremental Join Queries on Ranked Inputs," Proc. 27th Int'l Conf. Very Large Data Bases, 2001.
21. M. Theobald, G. Weikum, and R. Schenkel, "Top-k Query Evaluation with Probabilistic Guarantees," Proc. 30th Int'l Conf. Very Large Data Bases, 2004.
22. P. Cao and Z. Wang, "Efficient Top-k Query Calculation in Distributed Networks," Proc. 23rd Ann. ACM. SIGACT-SIGOPS Symp. Principles of Distributed Computing (PODC '04), 2004.
23. S.J. Russell and P. Norvig, Artificial Intelligence: A Modern Approach. Prentice Hall, 1994.