Parallel Data Access for Multiway Rank Joins

  • Adnan Abid
  • Marco Tagliasacchi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6757)

Abstract

Rank join operators perform a relational join among two or more relations, assign numeric scores to the join results based on the given scoring function and return K join results with the highest scores. The top-K join results are obtained by accessing a subset of data from the input relations. This paper addresses the problem of getting top-K join results from two or more search services which can be accessed in parallel, and are characterized by non negligible response times. The objectives are: i) minimize the time to get top-K join results. ii) avoid the access to the data that does not contribute to the top-K join results.

This paper proposes a multi-way rank join operator that achieves the above mentioned objectives by using a score guided data pulling strategy. This strategy minimizes the time to get top-K join results by extracting data in parallel from all Web services, while it also avoids accessing the data that is not useful to compute top-K join results, by pausing and resuming the data access from different Web services adaptively, based on the observed score values of the retrieved tuples. An extensive experimental study evaluates the performance of the proposed approach and shows that it minimizes the time to get top-K join results, while incurring few extra data accesses, as compared to the state of the art rank join operators.

Keywords

rank joins rank queries score guided data pulling top-K queries 

References

  1. 1.
    Nastev, A., Chang, Y., Smith, J.R., Li, C., Vittor, J.S.: Supporting incremental join queries on ranked inputs. In: VLDB ConferenceGoogle Scholar
  2. 2.
    Brockwell, P.J.: Encyclopedia of Quantitative Finance (2010)Google Scholar
  3. 3.
    Ceri, S., Brambilla, M. (eds.): Search Computing II. LNCS, vol. 6585. Springer, Heidelberg (2011)Google Scholar
  4. 4.
    Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences 66(4), 614–656 (2003)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Finger, J., Polyzotis, N.: Robust and efficient algorithms for rank join evaluation. In: SIGMOD Conference, pp. 415–428 (2009)Google Scholar
  6. 6.
    Guntzer, U., Balke, W., Kiessling, W.: Towards efficient multi-feature queries in heterogeneous environments. In: International Conference on Information Technology: Coding and Computing, Proceedings, pp. 622–628 (2001)Google Scholar
  7. 7.
    Ilyas, I., Aref, W., Elmagarmid, A.: Supporting top-k join queries in relational databases. The VLDB Journal 13(3), 207–221 (2004)CrossRefGoogle Scholar
  8. 8.
    Ilyas, I., Beskales, G., Soliman, M.: A survey of top-k query processing techniques in relational database systems. ACM Computing Surveys 40(4), 1 (2008)CrossRefGoogle Scholar
  9. 9.
    Mamoulis, N., Theodoridis, Y., Papadias, D.: Spatial joins: Algorithms, cost models and optimization techniques. In: Spatial Databases, pp. 155–184 (2005)Google Scholar
  10. 10.
    Marian, A., Bruno, N., Gravano, L.: Evaluating top- queries over web-accessible databases. ACM Trans. Database Syst. 29(2), 319–362 (2004)CrossRefGoogle Scholar
  11. 11.
    Martinenghi, D., Tagliasacchi, M.: Proximity rank join. In: PVLDB, vol. 3(1), pp. 352–363 (2010)Google Scholar
  12. 12.
    Schnaitter, K., Polyzotis, N.: Optimal algorithms for evaluating rank joins in database systems. ACM Trans. Database Syst. 35(1) (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Adnan Abid
    • 1
  • Marco Tagliasacchi
    • 1
  1. 1.Dipartimento di Elettronica e InformazionePolitecnico di MilanoMilanoItaly

Personalised recommendations