{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T07:08:38Z","timestamp":1765609718844},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319440385"},{"type":"electronic","value":"9783319440392"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44039-2_4","type":"book-chapter","created":{"date-parts":[[2016,8,13]],"date-time":"2016-08-13T15:01:16Z","timestamp":1471100476000},"page":"46-59","source":"Crossref","is-referenced-by-count":16,"title":["Fair Knapsack Pricing for Data Marketplaces"],"prefix":"10.1007","author":[{"given":"Florian","family":"Stahl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gottfried","family":"Vossen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,14]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/978-3-642-41660-6_7","volume-title":"In Search of Elegance in the Theory and Practice of Computation","author":"M Balazinska","year":"2013","unstructured":"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\u2013173. Springer, Heidelberg (2013)"},{"issue":"12","key":"4_CR2","first-page":"1482","volume":"4","author":"M Balazinska","year":"2011","unstructured":"Balazinska, M., et al.: Data markets in the cloud: an opportunity for the database community. PVLDB 4(12), 1482\u20131485 (2011)","journal-title":"PVLDB"},{"key":"4_CR3","series-title":"Data-Centric Systems and Applications","volume-title":"Data Quality: Concepts, Methodologies and Techniques","author":"C Batini","year":"2006","unstructured":"Batini, C., et al.: Data Quality: Concepts, Methodologies and Techniques. Data-Centric Systems and Applications. Springer, Heidelberg (2006)"},{"issue":"1","key":"4_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0377-2217(87)90165-2","volume":"28","author":"K Dudzi\u0144ski","year":"1987","unstructured":"Dudzi\u0144ski, K., et al.: Exact methods for the knapsack problem and its generalizations. Eur. J. Oper. Res. 28(1), 3\u201321 (1987)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"4_CR5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-0427(84)90023-2","volume":"11","author":"M Dyer","year":"1984","unstructured":"Dyer, M., et al.: A branch and bound algorithm for solving the multiple-choice knapsack problem. J. Comput. Appl. Math. 11(2), 231\u2013249 (1984)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"4_CR6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0377-0427(93)E0264-M","volume":"58","author":"M Dyer","year":"1995","unstructured":"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\u201354 (1995)","journal-title":"J. Comput. Appl. Math."},{"key":"4_CR7","volume-title":"Database Systems: The Complete Book","author":"H Garcia-Molina","year":"2013","unstructured":"Garcia-Molina, H., et al.: Database Systems: The Complete Book. Pearson Education Limited, Upper Saddle River (2013)"},{"key":"4_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., et al.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"issue":"5","key":"4_CR9","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0020-0190(98)00115-X","volume":"67","author":"G Gens","year":"1998","unstructured":"Gens, G., et al.: An approximate binary search algorithm for the multiple-choice knapsack problem. Inf. Process. Lett. 67(5), 261\u2013265 (1998)","journal-title":"Inf. Process. Lett."},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.15807\/jorsj.21.59","volume":"21","author":"T Ibaraki","year":"1978","unstructured":"Ibaraki, T., et al.: The multiple choice knapsack problem. J. Oper. Res. Soc. Jpn. 21, 59\u201394 (1978)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"4_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., et al.: Knapsack Problems. Springer, Berlin (2004)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Koutris, P., et al.: Toward practical query pricing with QueryMarket. In: SIGMOD Conference, pp. 613\u2013624 (2013)","DOI":"10.1145\/2463676.2465335"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Lawler, E.L.: Fast approximation algorithmsfor knapsack problems. In: 18th Annual Symposium on Foundations of Computer Science, pp. 206\u2013213 (1977)","DOI":"10.1109\/SFCS.1977.11"},{"issue":"2","key":"4_CR14","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1145\/329.318580","volume":"9","author":"D Maier","year":"1984","unstructured":"Maier, D., et al.: On the foundations of the universal relation model. ACM TODS 9(2), 283\u2013308 (1984)","journal-title":"ACM TODS"},{"key":"4_CR15","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-642-39872-8_10","volume-title":"Enabling Real-Time Business Intelligence","author":"A Muschalle","year":"2013","unstructured":"Muschalle, A., Stahl, F., L\u00f6ser, A., Vossen, G.: Pricing approaches for data markets. In: Castellanos, M., Dayal, U., Rundensteiner, E.A. (eds.) BIRTE 2012. LNBIP, vol. 154, pp. 129\u2013144. Springer, Heidelberg (2013)"},{"issue":"2 & 3","key":"4_CR16","first-page":"231","volume":"30","author":"Y Narahari","year":"2005","unstructured":"Narahari, Y., et al.: Dynamic pricing models forelectronic business. Sadhana (Acad. Proc. Eng. Sci.) 30(2 & 3), 231\u2013256 (2005). Indian Academy of Sciences","journal-title":"Sadhana (Acad. Proc. Eng. Sci.)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45921-9","volume-title":"Quality-Driven Query Answering for Integrated Information Systems","author":"F Naumann","year":"2002","unstructured":"Naumann, F.: Quality-Driven Query Answering for Integrated Information Systems. LNCS, vol. 2261. Springer, Heidelberg (2002)"},{"key":"4_CR18","unstructured":"Pindyck, R.S., et al.: Mikro\u00f6konomie. 8. \u00fcberarbeitete Auflage. Pearson Deutschland GmbH, M\u00fcnchen (2013)"},{"issue":"2","key":"4_CR19","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/0377-2217(95)00015-I","volume":"83","author":"D Pisinger","year":"1995","unstructured":"Pisinger, D.: A minimal algorithm for the multiple-choice knapsack problem. Eur. J. Oper. Res. 83(2), 394\u2013410 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR20","volume-title":"Information Rules: A Strategic Guide to the Network Economy","author":"C Shapiro","year":"1999","unstructured":"Shapiro, C., et al.: Information Rules: A Strategic Guide to the Network Economy. Strategy\/Technology\/Harvard Business School Press, Boston (1999)"},{"key":"4_CR21","unstructured":"Stahl, F.: High-Quality Web Information Provisioning and Quality-Based Data Pricing. Ph.D. thesis. University of M\u00fcnster (2015)"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-3-662-49381-6_21","volume-title":"Intelligent Information and Database Systems","author":"F Stahl","year":"2016","unstructured":"Stahl, F., Vossen, G.: Data quality scores for pricing on data marketplaces. In: Nguyen, N.T., Trawin\u0144ki, B., Fujita, H., Hong, T.-P. (eds.) ACIIDS 2016. LNCS, vol. 9621, pp. 215\u2013224. Springer, Heidelberg (2016)"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/978-3-319-10073-9_3","volume-title":"Database and Expert Systems Applications","author":"R Tang","year":"2014","unstructured":"Tang, R., Amarilli, A., Senellart, P., Bressan, S.: Get a sample for a discount. In: Decker, H., Lhotsk\u00e1, L., Link, S., Spies, M., Wagner, R.R. (eds.) DEXA 2014, Part I. LNCS, vol. 8644, pp. 20\u201334. Springer, Heidelberg (2014)"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/978-3-642-40173-2_32","volume-title":"Database and Expert Systems Applications","author":"R Tang","year":"2013","unstructured":"Tang, R., Shao, D., Bressan, S., Valduriez, P.: What you pay for is what you get. In: Decker, H., Lhotsk\u00e1, L., Link, S., Basl, J., Tjoa, A.M. (eds.) DEXA 2013, Part II. LNCS, vol. 8056, pp. 395\u2013409. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases and Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44039-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T14:45:36Z","timestamp":1568299536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44039-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319440385","9783319440392"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44039-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}