{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T10:22:59Z","timestamp":1790763779934,"version":"4.1.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319074429","type":"print"},{"value":"9783319074436","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07443-6_10","type":"book-chapter","created":{"date-parts":[[2014,5,8]],"date-time":"2014-05-08T22:02:31Z","timestamp":1399586551000},"page":"130-145","source":"Crossref","is-referenced-by-count":7,"title":["Pay-as-you-go Approximate Join Top-k Processing for the Web of Data"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Wagner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Veli","family":"Bicer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thanh","family":"Tran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Rantzau, R., Terzi, E.: Context-sensitive ranking. In: SIGMOD (2006)","DOI":"10.1145\/1142473.1142517"},{"key":"10_CR2","unstructured":"Arai, B., Das, G., Gunopulos, D., Koudas, N.: Anytime measures for top-k algorithms. In: VLDB (2007)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Arai, B., Das, G., Gunopulos, D., Koudas, N.: Anytime measures for top-k algorithms on exact and fuzzy data sets. VLDB Journal (2009)","DOI":"10.1007\/s00778-008-0127-9"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Das, G., Hristidis, V., Weikum, G.: Probabilistic information retrieval approach for ranking of database query results. In: TODS (2006)","DOI":"10.1145\/1166074.1166085"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Finger, J., Polyzotis, N.: Robust and efficient algorithms for rank join evaluation. In: SIGMOD (2009)","DOI":"10.1145\/1559845.1559890"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Hoff, P.D.: A First Course in Bayesian Statistical Methods. Springer (2009)","DOI":"10.1007\/978-0-387-92407-6"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Supporting top-k join queries in relational databases. VLDB Journal (2004)","DOI":"10.1007\/s00778-004-0128-2"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. (2008)","DOI":"10.1145\/1391729.1391730"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-642-35176-1_22","volume-title":"The Semantic Web \u2013 ISWC 2012","author":"S. Magliacane","year":"2012","unstructured":"Magliacane, S., Bozzon, A., Della Valle, E.: Efficient execution of top-K SPARQL queries. In: Cudr\u00e9-Mauroux, P., Heflin, J., Sirin, E., Tudorache, T., Euzenat, J., Hauswirth, M., Parreira, J.X., Hendler, J., Schreiber, G., Bernstein, A., Blomqvist, E. (eds.) ISWC 2012, Part I. LNCS, vol.\u00a07649, pp. 344\u2013360. Springer, Heidelberg (2012)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Mamoulis, N., Yiu, M.L., Cheng, K.H., Cheung, D.W.: Efficient top-k aggregation of ranked inputs. In: TODS (2007)","DOI":"10.1145\/1272743.1272749"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Martinenghi, D., Tagliasacchi, M.: Cost-Aware Rank Join with Random and Sorted Access. In: TKDE (2012)","DOI":"10.1109\/TKDE.2011.161"},{"key":"10_CR12","unstructured":"Michel, S., Triantafillou, P., Weikum, G.: KLEE: a framework for distributed top-k query algorithms. In: VLDB (2005)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-642-25073-6_29","volume-title":"The Semantic Web \u2013 ISWC 2011","author":"M. Morsey","year":"2011","unstructured":"Morsey, M., Lehmann, J., Auer, S., Ngonga Ngomo, A.-C.: DBpedia SPARQL Benchmark \u2013 Performance Assessment with Real Queries on Real Data. In: Aroyo, L., Welty, C., Alani, H., Taylor, J., Bernstein, A., Kagal, L., Noy, N., Blomqvist, E. (eds.) ISWC 2011, Part I. LNCS, vol.\u00a07031, pp. 454\u2013469. Springer, Heidelberg (2011)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Neumann, T., Moerkotte, G.: Characteristic sets: Accurate cardinality estimation for RDF queries with multiple joins. In: ICDE (2011)","DOI":"10.1109\/ICDE.2011.5767868"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Neumann, T., Weikum, G.: Scalable join processing on very large RDF graphs. In: SIGMOD (2009)","DOI":"10.1145\/1559845.1559911"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Schmidt, M., Hornung, T., Lausen, G., Pinkel, C.: SP2Bench: A SPARQL Performance Benchmark. In: ICDE (2009)","DOI":"10.1007\/978-3-642-04329-1_16"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Schnaitter, K., Polyzotis, N.: Evaluating rank joins with optimal cost. In: PODS (2008)","DOI":"10.1145\/1376916.1376924"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Shmueli-Scheuer, M., Li, C., Mass, Y., Roitman, H., Schenkel, R., Weikum, G.: Best-Effort Top-k Query Processing Under Budgetary Constraints. In: ICDE (2009)","DOI":"10.1109\/ICDE.2009.109"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Telang, A., Li, C., Chakravarthy, S.: One Size Does Not Fit All: Toward User- and Query-Dependent Ranking for Web Databases. In: TKDE (2012)","DOI":"10.1109\/TKDE.2011.36"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Theobald, M., Weikum, G., Schenkel, R.: Top-k query evaluation with probabilistic guarantees. In: VLDB (2004)","DOI":"10.1016\/B978-012088469-8\/50058-9"},{"key":"10_CR21","unstructured":"Wagner, A., Bicer, V., Tran, D.T.: Pay-as-you-go Approximate Join Top-k Processing for the Web of Data (2013), http:\/\/www.aifb.kit.edu\/web\/Techreport3040"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-642-30284-8_11","volume-title":"The Semantic Web: Research and Applications","author":"A. Wagner","year":"2012","unstructured":"Wagner, A., Duc, T.T., Ladwig, G., Harth, A., Studer, R.: Top-k linked data query processing. In: Simperl, E., Cimiano, P., Polleres, A., Corcho, O., Presutti, V. (eds.) ESWC 2012. LNCS, vol.\u00a07295, pp. 56\u201371. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web: Trends and Challenges"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07443-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T05:19:52Z","timestamp":1565414392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07443-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319074429","9783319074436"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07443-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}