Advertisement

Efficient Data Structure for the Top-k Variation of Sports Auction

  • Biswajit SanyalEmail author
  • Subhashis Majumder
  • Priya Ranjan Sinha Mahapatra
Conference paper
  • 15 Downloads
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1119)

Abstract

In any sports auction, bidders may have fund constraints and purchasing the best team may not be possible for all. So, reporting k best teams in non-increasing order of total expenses might be helpful to them. Now, they have multiple options in their hands from which they can choose the best available team according to their fund constraints. In this paper, we deal with the top-k variation of sports auction, where we report k best teams (top-k teams) of fixed size in non-increasing order of total cost, which might help franchises to make decisions on buying players as per available budget. Teams are formed by choosing a predefined number of players from various categories where each player has his own cost. We initially present a basic technique where we construct a metadata structure G even before costs of players of various categories and k are known, so that we can later use G to report the top-k purchases efficiently when costs are available. We then extend our work by generating the required portions of G on the fly, so that no preprocessing is needed, which in turn improves the space complexity of the algorithm remarkably.

Keywords

One shift Metadata structure DAG Top-k query Cost array Max heap 

References

  1. 1.
    Afshani, P., Brodal, G.S., Zeh, N.: Ordered and unordered top-\(k\) range reporting in large data sets. In: ACM-SIAM SODA, pp. 390–400 (2011)Google Scholar
  2. 2.
    Agarwal, S., Chaudhuri, S., Das, G., Gionis, A.: Automated ranking of database query results. In: Biennial Conference on Innovative Data Systems Research, pp. 1–12 (2003)Google Scholar
  3. 3.
    Buckley, C., Salton, G., Allan, J.: The effect of adding relevance information in a relevance feedback environment. In: ACM SIGIR, pp. 292–300 (1994)Google Scholar
  4. 4.
    Chaudhuri, S., Gravano, L., Marian, A.: Optimizing top-\(k\) selection queries over multimedia repositories. IEEE TKDE 16(8), 992–1009 (2004)Google Scholar
  5. 5.
    Karpinski, M., Nekrich, Y.: Top-\(k\) color queries for document retrieval. In: ACM-SIAM SODA, pp. 401–411 (2011)Google Scholar
  6. 6.
    Marian, A., Bruno, N., Gravano, L.: Evaluating \(top\)-\(k\) queries over web-accessible databases. ACM Trans. Database Syst. 29(2), 319–362 (2004)CrossRefGoogle Scholar
  7. 7.
    Majumder, S., Sanyal, B., Gupta, P., Sinha, S., Pande, S., Hon, W.K.: Top-\(K\) query retrieval of combinations with sum-of-subsets ranking. In: COCOA, pp. 490–505 (2014)Google Scholar
  8. 8.
    Rahul, S., Gupta, P., Janardan, R., Rajan, K.S.: Efficient top-\(k\) queries for orthogonal ranges. In: WALCOM, pp. 110–121 (2011)Google Scholar
  9. 9.
    Sanyal, B., Majumder, S., Hon, W.K.: Efficient generation of top-k procurements in a multi-item auction In: WALCOM, pp. 181–193 (2014)Google Scholar
  10. 10.
    Suzuki, T., Takasu, A., Adachi, J.: Top-\(k\) query processing for combinatorial objects using Euclidean distance. In: IDEAS, pp. 209–213 (2011)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  • Biswajit Sanyal
    • 1
    Email author
  • Subhashis Majumder
    • 2
  • Priya Ranjan Sinha Mahapatra
    • 3
  1. 1.Department of Information TechnologyGovernment College of Engineering and Textile TechnologySeramporeIndia
  2. 2.Department of Computer Science and EngineeringHeritage Institute of TechnologyKolkataIndia
  3. 3.Department of Computer ScienceUniversity of KalyaniKalyaniIndia

Personalised recommendations