Abstract
Joins represent the basic functional operations of complex query plans in a Search Computing system, as discussed in the previous chapter. In this chapter we provide further insight on this matter, by focusing on algorithms that deal with joining ranked results produced by search services. We cast this problem as a generalization of the traditional rank aggregation problem, i.e., combining several ranked lists of objects to produce a single consensus ranking. Rank-join algorithms, also called top-k join algorithms, aim at determining the best overall results without accessing all the objects. The rank-join problem has been dealt with in the literature by extending rank aggregation algorithms to the case of join in the setting of relational databases. However, previous approaches to top-k queries did not consider some of the distinctive features of search engines on the Web. Indeed, as pointed out in the previous chapter, joins in this context differ from the traditional relational setting for a number of aspects: services can be accessed according to limited patterns, i.e. some inputs need to be provided; accessing services is costly, since they are typically remote; the output is returned in pages of results and typically according to some ranking criterion; multiple search services can be used to answer the same query; users can interact with the system in order to refine their search criteria. This chapter analyzes the challenges that need to be tackled in the design of rank-join algorithms within the context of Search Computing.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bruno, N., Chaudhuri, S., Gravano, L.: Top-k selection queries over relational databases: Mapping strategies and performance evaluation. ACM Transactions on Database Systems 27(2), 153–187 (2002)
Bruno, N., Gravano, L., Marian, A.: Evaluating Top-k Queries over Web-Accessible Databases. In: Proceedings of ICDE 2002, pp. 369–378 (2002)
Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. Journal of Computer and System Science 1(1), 614–656 (2001)
Hristidis, V., Koudas, N., Papakonstantinou, Y.: PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries. In: Proceedings of ACM SIGMOD 2001, pp. 259–270 (2001)
Hristidis, V., Papakonstantinou, Y.: Algorithms and applications for answering ranked queries using ranked views. VLDB Journal 13(1), 49–70 (2004)
Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting top-k join queries in relational databases. VLDB Journal 13(3), 207–221 (2004)
Ilyas, I.F., Aref, W.G., Elmagarmid, A.K., Elmongui, H.G., Shah, R., Vitter, J.S.: Adaptive rank-aware query optimization in relational databases. ACM Transactions on Database Systems 31(4), 1257–1304 (2006)
Ilyas, I.F., Shah, R., Aref, W.G., Vitter, J.S., Elmagarmid, A.K.: Rank-aware query optimization. In: Proceedings of ACM SIGMOD 2004, pp. 203–214 (2004)
Li, C., Chang, K.C.-C., Ilyas, I.F., Song, S.: RankSQL: query algebra and optimization for relational top-k queries. In: Proceedings of ACM SIGMOD 2005, pp. 131–142 (2005)
Marian, A., Bruno, N., Gravano, L.: Evaluating top-k queries over web-accessible databases. ACM Transactions on Database Systems 29(2), 319–362 (2004)
Natsev, A., Chang, Y.-C., Smith, J.R., Li, C.-S., Vitter, J.S.: Supporting Incremental Join Queries on Ranked Inputs. In: Proceedings of VLDB 2001, pp. 281–290 (2001)
Schnaitter, K., Polyzotis, N.: Evaluating rank joins with optimal cost. In: Proceedings of PODS 2008, pp. 43–52 (2008)
Tsaparas, P., Palpanas, T., Kotidis, Y., Koudas, N., Srivastava, D.: Ranked Join Indices. In: Proceedings of ICDE 2003, pp. 277–286 (2003)
Schnaitter, K., Spiegel, J., Polyzotis, N.: Depth estimation for ranking query optimization. In: Proceedings of VLDB 2007, pp. 902–913 (2007)
Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-query processing techniques in relational database systems. ACM Comput. Surv. 40(4) (2008)
Fagin, R.: Combining Fuzzy Information from Multiple Systems. J. Comput. Syst. Sci. 58(1), 83–99 (1999)
Clough, P., Sanderson, M., Abouammoh, M., Navarro, S., Lestari Paramita, M.: Multiple approaches to analysing query diversity. In: Proceedings of ACM SIGIR 2009, pp. 734–735 (2009)
Gollapudi, S., Sharma, A.: An axiomatic approach for result diversification. In: Proceedings of WWW 2009, pp. 381–390 (2009)
Agrawal, R., Gollapudi, S., Halverson, A., Ieong, S.: Diversifying search results. In: Proceedings of WSDM 2009, pp. 5–14 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ilyas, I.F., Martinenghi, D., Tagliasacchi, M. (2010). Chapter 11: Rank-Join Algorithms for Search Computing. In: Ceri, S., Brambilla, M. (eds) Search Computing. Lecture Notes in Computer Science, vol 5950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12310-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-12310-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12309-2
Online ISBN: 978-3-642-12310-8
eBook Packages: Computer ScienceComputer Science (R0)