{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:50:10Z","timestamp":1760597410619},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,12,8]],"date-time":"2009-12-08T00:00:00Z","timestamp":1260230400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s00778-009-0174-x","type":"journal-article","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T18:57:39Z","timestamp":1260212259000},"page":"437-456","source":"Crossref","is-referenced-by-count":24,"title":["Efficient processing of exact top-k queries over disk-resident sorted lists"],"prefix":"10.1007","volume":"19","author":[{"given":"HweeHwa","family":"Pang","sequence":"first","affiliation":[]},{"given":"Xuhua","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,8]]},"reference":[{"issue":"6","key":"174_CR1","first-page":"734","volume":"17","author":"G. Adomavicius","year":"2005","unstructured":"Adomavicius G., Tuzhilin A.: Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE TKDE 17(6), 734\u2013749 (2005)","journal-title":"IEEE TKDE"},{"key":"174_CR2","unstructured":"Akbarinia, R., Pacitti, E., Valduriez, P.: Best position algorithms for top-k queries. In: VLDB, pp. 495\u2013506 (2007)"},{"issue":"2","key":"174_CR3","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s00778-008-0127-9","volume":"18","author":"B. Arai","year":"2009","unstructured":"Arai B., Das G., Gunopulos D., Koudas N.: Anytime measures for top-k algorithms on exact and fuzzy data sets. VLDB J. 18(2), 407\u2013427 (2009)","journal-title":"VLDB J."},{"key":"174_CR4","volume-title":"Modern Information Retrieval","author":"R. Baeza-Yates","year":"1999","unstructured":"Baeza-Yates R., Neto B.R.: Modern Information Retrieval. Addison-Wesley, Reading (1999)"},{"key":"174_CR5","unstructured":"Bast, H., Majumdar, D., Schenkel, R., Theobald, M., Weikum, G.: IO-top-k: index-access optimized top-k query processing. In: VLDB, pp. 475\u2013486 (2006)"},{"issue":"7","key":"174_CR6","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B. Bloom","year":"1970","unstructured":"Bloom B.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"1\u20137","key":"174_CR7","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S. Brin","year":"1998","unstructured":"Brin S., Page L.: The anatomy of a large-scale hypertextual web search engine. Comput. Netw. ISDN Syst. 30(1\u20137), 107\u2013117 (1998)","journal-title":"Comput. Netw. ISDN Syst."},{"issue":"4","key":"174_CR8","first-page":"523","volume":"19","author":"N. Bruno","year":"2007","unstructured":"Bruno N., Wang H.W.: The threshold algorithm: from middleware systems to the relational engine. IEEE TKDE 19(4), 523\u2013537 (2007)","journal-title":"IEEE TKDE"},{"key":"174_CR9","doi-asserted-by":"crossref","unstructured":"Chang, K.C.C., Hwang, S.: Minimal probing: supporting expensive predicates for top-k queries. In: ACM SIGMOD, pp. 346\u2013357 (2002)","DOI":"10.1145\/564728.564731"},{"issue":"8","key":"174_CR10","first-page":"992","volume":"16","author":"S. Chaudhuri","year":"2004","unstructured":"Chaudhuri S., Gravano L., Marian A.: Optimizing top-k selection queries over multimedia repositories. IEEE TKDE 16(8), 992\u20131009 (2004)","journal-title":"IEEE TKDE"},{"key":"174_CR11","doi-asserted-by":"crossref","unstructured":"Deshpande, P.M., Deepak, P., Kummamuru, K.: Efficient online top-k retrieval with arbitrary similarity measures. In: EDBT, pp. 356\u2013367 (2008)","DOI":"10.1145\/1353343.1353388"},{"key":"174_CR12","doi-asserted-by":"crossref","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: PODS, pp. 102\u2013113 (2001)","DOI":"10.1145\/375551.375567"},{"issue":"4","key":"174_CR13","first-page":"614","volume":"66","author":"R. Fagin","year":"2003","unstructured":"Fagin R., Lotem A., Naor M.: Optimal aggregation algorithms for middleware. JCSS 66(4), 614\u2013656 (2003)","journal-title":"JCSS"},{"key":"174_CR14","doi-asserted-by":"crossref","unstructured":"Finger, J., Polyzotis, N.: Robust and efficient algorithms for rank join evaluation. In: ACM SIGMOD, pp. 415\u2013428 (2009)","DOI":"10.1145\/1559845.1559890"},{"key":"174_CR15","unstructured":"G\u00fcntzer, U., Balke, W.T., Kiessling, W.: Optimizing multi-feature queries for image databases. In: VLDB, pp. 419\u2013428 (2000)"},{"key":"174_CR16","unstructured":"Hua, M., Pei, J., Fu, A.W.C., Lin, X., Leung, H.F.: Efficiently answering top-k typicality queries on large databases. In: VLDB, pp. 890\u2013901 (2007)"},{"issue":"3","key":"174_CR17","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1007\/s00778-008-0128-8","volume":"18","author":"M. Hua","year":"2009","unstructured":"Hua M., Pei J., Fu A.W.C., Lin X., Leung H.F.: Top-k typicality queries and efficient query answering methods on large databases. VLDB J. 18(3), 809\u2013835 (2009)","journal-title":"VLDB J."},{"issue":"10","key":"174_CR18","first-page":"1404","volume":"19","author":"H.P. Hung","year":"2007","unstructured":"Hung H.P., Chuang K.T., Chen M.S.: Efficient process of top-k range-sum queries over multiple streams with minimized global error. IEEE TKDE 19(10), 1404\u20131419 (2007)","journal-title":"IEEE TKDE"},{"issue":"1","key":"174_CR19","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1206049.1206054","volume":"32","author":"S. Hwang","year":"2007","unstructured":"Hwang S., Chang K.C.C.: Optimizing top-k queries for middleware access: a unified cost-based approach. ACM TODS 32(1), 5 (2007)","journal-title":"ACM TODS"},{"key":"174_CR20","doi-asserted-by":"crossref","unstructured":"Ilyas, I.F., Aref, W.G., Elmagarmid, A.K.: Joining ranked inputs in practice. In: VLDB, pp. 950\u2013961 (2002)","DOI":"10.1016\/B978-155860869-6\/50094-9"},{"key":"174_CR21","doi-asserted-by":"crossref","unstructured":"Jin, C., Yi, K., Chen, L., Yu, J.X., Lin, X.: Sliding-window top-k queries on uncertain streams. In: VLDB, pp. 301\u2013312 (2008)","DOI":"10.14778\/1453856.1453892"},{"issue":"1","key":"174_CR22","first-page":"96","volume":"13","author":"F. Korn","year":"2001","unstructured":"Korn F., Pagel B.U., Faloutsos C.: On the \u2018Dimensionality Curse\u2019 and the \u2018Self-Similarity Blessing\u2019. IEEE TKDE 13(1), 96\u2013111 (2001)","journal-title":"IEEE TKDE"},{"key":"174_CR23","first-page":"361","volume":"5","author":"D.D. Lewis","year":"2004","unstructured":"Lewis D.D., Yang Y., Rose T.G., Li F.: RCV1: a new benchmark collection for text categorization research. J. Mach. Learn. Res. 5, 361\u2013397 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"174_CR24","doi-asserted-by":"crossref","unstructured":"Lian, X., Chen, L.: Top-k dominating queries in uncertain databases. In: EDBT, pp. 660\u2013671 (2009)","DOI":"10.1145\/1516360.1516437"},{"key":"174_CR25","doi-asserted-by":"crossref","unstructured":"Mamoulis, N., Cheng, K.H., Yiu, M.L., Cheung, D.W.: Efficient aggregation of ranked inputs. In: IEEE ICDE, p. 72 (2006)","DOI":"10.1109\/ICDE.2006.54"},{"issue":"3","key":"174_CR26","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1272743.1272749","volume":"32","author":"N. Mamoulis","year":"2007","unstructured":"Mamoulis N., Yiu M.L., Cheng K.H., Cheung D.W.: Efficient top-k aggregation of ranked inputs. ACM TODS 32(3), 19 (2007)","journal-title":"ACM TODS"},{"issue":"2","key":"174_CR27","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/1005566.1005569","volume":"29","author":"A. Marian","year":"2004","unstructured":"Marian A., Bruno N., Gravano L.: Evaluating top-k queries over web-accessible databases. ACM TODS 29(2), 319\u2013362 (2004)","journal-title":"ACM TODS"},{"key":"174_CR28","unstructured":"Michel, S., Neumann, T.: Search for the best but expect the worst\u2014distributed top-k queries over decreasing aggregated scores. In: WebDB (2007)"},{"key":"174_CR29","unstructured":"Michel, S., Triantafillou, P., Weikum, G.: KLEE: a framework for distributed top-k query algorithms. In: VLDB, pp. 637\u2013648 (2005)"},{"key":"174_CR30","doi-asserted-by":"crossref","unstructured":"Mouratidis, K., Bakiras, S., Papadias, D.: Continuous monitoring of top-k queries over sliding windows. In: ACM SIGMOD, pp. 635\u2013646 (2006)","DOI":"10.1145\/1142473.1142544"},{"key":"174_CR31","doi-asserted-by":"crossref","unstructured":"Ntoulas, A., Cho, J.: Pruning policies for two-tiered inverted index with correctness guarantee. In: ACM SIGIR, pp. 191\u2013198 (2007)","DOI":"10.1145\/1277741.1277776"},{"key":"174_CR32","unstructured":"Qi, Y., Candan, K.S., Sapino, M.L.: Sum-max monotonic ranked joins for evaluating top-k twig queries on weighted data graphs. In: VLDB, pp. 507\u2013518 (2007)"},{"key":"174_CR33","unstructured":"Schnaitter, K., Spiegel, J., Polyzotis, N.: Depth estimation for ranking query optimization. In: VLDB, pp. 902\u2013913 (2007)"},{"key":"174_CR34","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: IEEE ICDE, pp. 928\u2013939 (2009)","DOI":"10.1109\/ICDE.2009.109"},{"key":"174_CR35","volume-title":"Operating System Concepts","author":"A. Silberschatz","year":"2006","unstructured":"Silberschatz A., Galvin P.B., Gagne G.: Operating System Concepts, 7th edn. Wiley, New York (2006)","edition":"7"},{"issue":"3","key":"174_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1386118.1386119","volume":"33","author":"M.A. Soliman","year":"2008","unstructured":"Soliman M.A., Ilyas I.F., Chang K.C.C.: Probabilistic top-k and ranking-aggregate queries. ACM TODS 33(3), 1\u201354 (2008)","journal-title":"ACM TODS"},{"issue":"3","key":"174_CR37","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1002\/1097-4571(2000)9999:9999<::AID-ASI1591>3.0.CO;2-R","volume":"52","author":"A. Spink","year":"2001","unstructured":"Spink A., Wolfram D., Jansen M.B.J., Saracevic T.: Searching the web: the public and their queries. J. Am. Soc. Inform. Sci. Technol. 52(3), 226\u2013234 (2001)","journal-title":"J. Am. Soc. Inform. Sci. Technol."},{"issue":"8","key":"174_CR38","first-page":"1072","volume":"19","author":"Y. Tao","year":"2007","unstructured":"Tao Y., Xiao X., Pei J.: Efficient skyline and top-k retrieval in subspaces. IEEE TKDE 19(8), 1072\u20131088 (2007)","journal-title":"IEEE TKDE"},{"issue":"1","key":"174_CR39","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s00778-007-0072-z","volume":"17","author":"M. Theobald","year":"2008","unstructured":"Theobald M., Bast H., Majumdar D., Schenkel R., Weikum G.: TopX: efficient and versatile top-k query processing for semistructured data. VLDB J. 17(1), 81\u2013115 (2008)","journal-title":"VLDB J."},{"key":"174_CR40","doi-asserted-by":"crossref","unstructured":"Theobald, M., Weikum, G., Schenkel, R.: Top-k query evaluation with probabilistic guarantees. In: VLDB, pp. 648\u2013659 (2004)","DOI":"10.1016\/B978-012088469-8.50058-9"},{"key":"174_CR41","unstructured":"TREC: Text REtrieval Conference. http:\/\/trec.nist.gov\/"},{"key":"174_CR42","doi-asserted-by":"crossref","unstructured":"Vlachou, A., Doulkeridis, C., Norv\u00e5g, K., Vazirgiannis, M.: On efficient top-k query processing in highly distributed environments. In: ACM SIGMOD, pp. 753\u2013764 (2008)","DOI":"10.1145\/1376616.1376692"},{"key":"174_CR43","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Shang, H.: Top-k set similarity joins. In: IEEE ICDE, pp. 916\u2013927 (2009)","DOI":"10.1109\/ICDE.2009.111"},{"key":"174_CR44","doi-asserted-by":"crossref","unstructured":"Xin, D., Han, J., Chang, K.C.C.: Progressive and selective merge: computing top-k with ad-hoc ranking functions. In: ACM SIGMOD, pp. 103\u2013114 (2007)","DOI":"10.1145\/1247480.1247494"},{"issue":"12","key":"174_CR45","first-page":"1669","volume":"20","author":"K. Yi","year":"2008","unstructured":"Yi K., Li F., Kollios G., Srivastava D.: Efficient processing of top-k queries in uncertain databases with x-relations. IEEE TKDE 20(12), 1669\u20131682 (2008)","journal-title":"IEEE TKDE"},{"key":"174_CR46","unstructured":"Yiu, M.L., Mamoulis, N.: Efficient processing of top-k dominating queries on multi-dimensional data. In: VLDB, pp. 483\u2013494 (2007)"},{"issue":"3","key":"174_CR47","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1007\/s00778-008-0117-y","volume":"18","author":"M.L. Yiu","year":"2009","unstructured":"Yiu M.L., Mamoulis N.: Multi-dimensional top-k dominating queries. VLDB J. 18(3), 695\u2013718 (2009)","journal-title":"VLDB J."},{"key":"174_CR48","doi-asserted-by":"crossref","unstructured":"Yiu, M.L., Mamoulis, N., Vaitis, M.: Top-k spatial preference queries. In: IEEE ICDE, pp. 1076\u20131085 (2007)","DOI":"10.1109\/ICDE.2007.368966"},{"issue":"2","key":"174_CR49","first-page":"224","volume":"20","author":"L. Zhu","year":"2002","unstructured":"Zhu L., Rao A., Zhang A.: Theory of keyblock-based image retrieval. ACM TODS 20(2), 224\u2013257 (2002)","journal-title":"ACM TODS"},{"key":"174_CR50","doi-asserted-by":"crossref","unstructured":"Zobel, J., Moffat, A.: Inverted files for text search engine. ACM Comput. Surv. 38(2), Article No. 6 (2006)","DOI":"10.1145\/1132956.1132959"},{"key":"174_CR51","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L.: Dominant graph: an efficient indexing structure to answer top-k queries. In: ICDE, pp. 536\u2013545 (2008)","DOI":"10.1109\/ICDE.2008.4497462"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-009-0174-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-009-0174-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-009-0174-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T15:05:06Z","timestamp":1559142306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-009-0174-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,8]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["174"],"URL":"https:\/\/doi.org\/10.1007\/s00778-009-0174-x","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,8]]}}}