Skip to main content
SpringerLink
Log in
Book cover

East European Conference on Advances in Databases and Information Systems

ADBIS 2016: Advances in Databases and Information Systems pp 46–59Cite as

Fair Knapsack Pricing for Data Marketplaces

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9809))

Abstract

Data has become an important economic good. This has led to the development of data marketplaces which facilitate trading by bringing data vendors and data consumers together on one platform. Despite the existence of such infrastructures, data vendors struggle to determine the value their offerings have to customers. This paper explores a novel pricing scheme that allows for price discrimination of customers by selling custom-tailored variants of a data product at a price suggested by a customer. To this end, data quality is adjusted to meet a customer’s willingness to pay. To balance customer preferences and vendor interest, a model is developed, translating fair pricing into a Multiple-Choice Knapsack Problem and making it amenable to an algorithmic solution.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    \({m_l}_i\) is used to indicate that depending on whether \(q_i \in \mathsf {V}\) or \(q_i \in \mathsf {G}\), \({m_l}^{\mathsf {G}}\) or \({m_l}^{\mathsf {V}}\) has to be substituted.

References

  1. Balazinska, M., Howe, B., Koutris, P., Suciu, D., Upadhyaya, P.: A discussion on pricing relational data. In: Tannen, V., Wong, L., Libkin, L., Fan, W., Tan, W.-C., Fourman, M. (eds.) Buneman festschrift 2013. LNCS, vol. 8000, pp. 167–173. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  2. Balazinska, M., et al.: Data markets in the cloud: an opportunity for the database community. PVLDB 4(12), 1482–1485 (2011)

    Google Scholar 

  3. Batini, C., et al.: Data Quality: Concepts, Methodologies and Techniques. Data-Centric Systems and Applications. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  4. Dudziński, K., et al.: Exact methods for the knapsack problem and its generalizations. Eur. J. Oper. Res. 28(1), 3–21 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dyer, M., et al.: A branch and bound algorithm for solving the multiple-choice knapsack problem. J. Comput. Appl. Math. 11(2), 231–249 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dyer, M., et al.: A hybrid dynamic programming/branch-and-bound algorithm for the multiple-choice knapsack problem. J. Comput. Appl. Math. 58(1), 43–54 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  7. Garcia-Molina, H., et al.: Database Systems: The Complete Book. Pearson Education Limited, Upper Saddle River (2013)

    Google Scholar 

  8. Garey, M.R., et al.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)

    MATH  Google Scholar 

  9. Gens, G., et al.: An approximate binary search algorithm for the multiple-choice knapsack problem. Inf. Process. Lett. 67(5), 261–265 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Ibaraki, T., et al.: The multiple choice knapsack problem. J. Oper. Res. Soc. Jpn. 21, 59–94 (1978)

    MATH  MathSciNet  Google Scholar 

  11. Kellerer, H., et al.: Knapsack Problems. Springer, Berlin (2004)

    Book  MATH  Google Scholar 

  12. Koutris, P., et al.: Toward practical query pricing with QueryMarket. In: SIGMOD Conference, pp. 613–624 (2013)

    Google Scholar 

  13. Lawler, E.L.: Fast approximation algorithmsfor knapsack problems. In: 18th Annual Symposium on Foundations of Computer Science, pp. 206–213 (1977)

    Google Scholar 

  14. Maier, D., et al.: On the foundations of the universal relation model. ACM TODS 9(2), 283–308 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  15. Muschalle, A., Stahl, F., Löser, A., Vossen, G.: Pricing approaches for data markets. In: Castellanos, M., Dayal, U., Rundensteiner, E.A. (eds.) BIRTE 2012. LNBIP, vol. 154, pp. 129–144. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  16. Narahari, Y., et al.: Dynamic pricing models forelectronic business. Sadhana (Acad. Proc. Eng. Sci.) 30(2 & 3), 231–256 (2005). Indian Academy of Sciences

    MATH  MathSciNet  Google Scholar 

  17. Naumann, F.: Quality-Driven Query Answering for Integrated Information Systems. LNCS, vol. 2261. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  18. Pindyck, R.S., et al.: Mikroökonomie. 8. überarbeitete Auflage. Pearson Deutschland GmbH, München (2013)

    Google Scholar 

  19. Pisinger, D.: A minimal algorithm for the multiple-choice knapsack problem. Eur. J. Oper. Res. 83(2), 394–410 (1995)

    Article  MATH  Google Scholar 

  20. Shapiro, C., et al.: Information Rules: A Strategic Guide to the Network Economy. Strategy/Technology/Harvard Business School Press, Boston (1999)

    Google Scholar 

  21. Stahl, F.: High-Quality Web Information Provisioning and Quality-Based Data Pricing. Ph.D. thesis. University of Münster (2015)

    Google Scholar 

  22. Stahl, F., Vossen, G.: Data quality scores for pricing on data marketplaces. In: Nguyen, N.T., Trawinńki, B., Fujita, H., Hong, T.-P. (eds.) ACIIDS 2016. LNCS, vol. 9621, pp. 215–224. Springer, Heidelberg (2016)

    Chapter  Google Scholar 

  23. Tang, R., Amarilli, A., Senellart, P., Bressan, S.: Get a sample for a discount. In: Decker, H., Lhotská, L., Link, S., Spies, M., Wagner, R.R. (eds.) DEXA 2014, Part I. LNCS, vol. 8644, pp. 20–34. Springer, Heidelberg (2014)

    Google Scholar 

  24. Tang, R., Shao, D., Bressan, S., Valduriez, P.: What you pay for is what you get. In: Decker, H., Lhotská, L., Link, S., Basl, J., Tjoa, A.M. (eds.) DEXA 2013, Part II. LNCS, vol. 8056, pp. 395–409. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ERCIS, WWU Münster, Münster, Germany

    Florian Stahl & Gottfried Vossen

  2. Waikato Management School, The University of Waikato, Hamilton, New Zealand

    Florian Stahl & Gottfried Vossen

Authors
  1. Florian Stahl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gottfried Vossen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Florian Stahl .

Editor information

Editors and Affiliations

  1. MFF, Charles University MFF, Prague, Czech Republic

    Jaroslav Pokorný

  2. Faculty of Sciences, University of Novi Sad Faculty of Sciences, Novi Sad, Serbia

    Mirjana Ivanović

  3. Christian-Albrechts-Universität Kiel , Kiel, Germany

    Bernhard Thalheim

  4. VSB-Technical University Ostrava , Ostrava, Czech Republic

    Petr Šaloun

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Stahl, F., Vossen, G. (2016). Fair Knapsack Pricing for Data Marketplaces. In: Pokorný, J., Ivanović, M., Thalheim, B., Šaloun, P. (eds) Advances in Databases and Information Systems. ADBIS 2016. Lecture Notes in Computer Science(), vol 9809. Springer, Cham. https://doi.org/10.1007/978-3-319-44039-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44039-2_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44038-5

  • Online ISBN: 978-3-319-44039-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation