{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:42:28Z","timestamp":1740109348846,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Basic Research (973) Program of China","award":["2012CB316200"],"award-info":[{"award-number":["2012CB316200"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61402130, 61272046","61190115, 61173022","61033015"],"award-info":[{"award-number":["61402130, 61272046","61190115, 61173022","61033015"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Shandong Provincial Natural Science Foundation","doi-asserted-by":"crossref","award":["ZR2013FQ028"],"award-info":[{"award-number":["ZR2013FQ028"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Scientific Research Innovation Foundation in HIT","award":["HIT.NSRIF.2014136, HIT(WH)201308"],"award-info":[{"award-number":["HIT.NSRIF.2014136, HIT(WH)201308"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10115-015-0836-5","type":"journal-article","created":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T08:52:16Z","timestamp":1430383936000},"page":"301-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["TKAP: Efficiently processing top-k query on massive data by adaptive pruning"],"prefix":"10.1007","volume":"47","author":[{"given":"Xixian","family":"Han","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianmin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianzhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,1]]},"reference":[{"unstructured":"Akbarinia R, Pacitti E, Valduriez P (2007) Best position algorithms for top-k queries. In: Proceedings of the 33rd International Conference on Very Large Data Bases, pp 495\u2013506","key":"836_CR1"},{"doi-asserted-by":"crossref","unstructured":"Chang YC, Bergman L, Castelli V et al (2000) The onion technique: indexing for linear optimization queries. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pp 391\u2013402","key":"836_CR2","DOI":"10.1145\/342009.335433"},{"unstructured":"Das G, Gunopulos D, Koudas N, Tsirogiannis D (2006) Answering top-k queries using views. In: Proceedings of the 32nd International Conference on Very Large Data Bases, pp 451\u2013462","key":"836_CR3"},{"doi-asserted-by":"crossref","unstructured":"Fagin R, Kumar R, Sivakumar D (2003a) Efficient similarity search and classification via rank aggregation. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp 301\u2013312","key":"836_CR4","DOI":"10.1145\/872757.872795"},{"doi-asserted-by":"crossref","unstructured":"Fagin R, Lotem A, and Naor M (2001) Optimal aggregation algorithms for middleware. In: Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp 102\u2013113","key":"836_CR5","DOI":"10.1145\/375551.375567"},{"issue":"4","key":"836_CR6","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","volume":"66","author":"R Fagin","year":"2003","unstructured":"Fagin R, Lotem A, Naor M (2003b) Optimal aggregation algorithms for middleware. J Comput Syst Sci 66(4):614\u2013656","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"836_CR7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10115-008-0145-3","volume":"19","author":"H Fan","year":"2009","unstructured":"Fan H, Za\u00efane O, Foss A, Wu J (2009) Resolution-based outlier factor: detecting the top-n most outlying data points in engineering data. Knowl Inf Syst 19(1):31\u201351","journal-title":"Knowl Inf Syst"},{"issue":"5","key":"836_CR8","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1109\/TKDE.2012.34","volume":"25","author":"S Ge","year":"2013","unstructured":"Ge S, Hou LU, Mamoulis N, Cheung DW (2013) Efficient all top-k computation\u2014a unified solution for all top-k, reverse top-k and top-m influential queries. IEEE Trans Knowl Data Eng 25(5):1015\u20131027","journal-title":"IEEE Trans Knowl Data Eng"},{"unstructured":"G\u00fcntzer U, Balke WT, Kie\u00dfling W (2000) Optimizing multi-feature queries for image databases. In: Proceedings of the 26th International Conference on Very Large Data Bases, pp 419\u2013428","key":"836_CR9"},{"doi-asserted-by":"crossref","unstructured":"G\u00fcntzer U, Balke WT, Kie\u00dfling W (2001) Towards efficient multi-feature queries in heterogeneous environments. In: Proceedings of the International Conference on Information Technology: Coding and Computing, pp 622\u2013628","key":"836_CR10","DOI":"10.1109\/ITCC.2001.918866"},{"issue":"11","key":"836_CR11","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1016\/j.ipl.2011.03.003","volume":"111","author":"X Han","year":"2011","unstructured":"Han X, Li J, Yang D (2011) Supporting early pruning in top-k query processing on massive data. Inf Process Lett 111(11):524\u2013532","journal-title":"Inf Process Lett"},{"issue":"3","key":"836_CR12","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s10115-011-0429-x","volume":"32","author":"X Han","year":"2012","unstructured":"Han X, Li J, Yang D (2012) Pi-join: efficiently processing join queries on massive data. Knowl Inf Syst 32(3):527\u2013557","journal-title":"Knowl Inf Syst"},{"key":"836_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.datak.2012.07.001","volume":"83","author":"JS Heo","year":"2013","unstructured":"Heo JS, Cho J, Whang KY (2013) Subspace top-k query processing using the hybrid-layer index with a tight bound. Data Knowl Eng 83:1\u201319","journal-title":"Data Knowl Eng"},{"issue":"1","key":"836_CR14","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s00778-003-0099-8","volume":"13","author":"V Hristidis","year":"2004","unstructured":"Hristidis V, Papakonstantinou Y (2004) Algorithms and applications for answering ranked queries using ranked views. VLDB J 13(1):49\u201370","journal-title":"VLDB J"},{"issue":"4","key":"836_CR15","doi-asserted-by":"crossref","first-page":"11:1","DOI":"10.1145\/1391729.1391730","volume":"40","author":"I Ilyas","year":"2008","unstructured":"Ilyas I, Beskales G, Soliman M (2008) A survey of top-k query processing techniques in relational database systems. ACM Comput Surv 40(4):11:1\u201311:58","journal-title":"ACM Comput Surv"},{"doi-asserted-by":"crossref","unstructured":"Lee J, Cho H, Hwang SW (2012) Efficient dual-resolution layer indexing for top-k queries. In: Proceedings of the 2012 IEEE 28th International Conference on Data Engineering, pp 1084\u20131095","key":"836_CR16","DOI":"10.1109\/ICDE.2012.73"},{"issue":"3","key":"836_CR17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1272743.1272749","volume":"32","author":"N Mamoulis","year":"2007","unstructured":"Mamoulis N, Yiu ML, Cheng KH, Cheung DW (2007) Efficient top-k aggregation of ranked inputs. ACM Trans Database Syst 32(3):19","journal-title":"ACM Trans Database Syst"},{"issue":"3","key":"836_CR18","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/s00778-009-0174-x","volume":"19","author":"H Pang","year":"2010","unstructured":"Pang H, Ding X, Zheng B (2010) Efficient processing of exact top-k queries over disk-resident sorted lists. VLDB J 19(3):437\u2013456","journal-title":"VLDB J"},{"issue":"1","key":"836_CR19","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10115-010-0363-3","volume":"30","author":"A Salam","year":"2012","unstructured":"Salam A, Khayal M (2012) Mining top-k frequent patterns without minimum support threshold. Knowl Inf Syst 30(1):57\u201386","journal-title":"Knowl Inf Syst"},{"doi-asserted-by":"crossref","unstructured":"Xie M, Lakshmanan L, Wood P (2013) Efficient top-k query answering using cached views. In: Proceedings of the 16th International Conference on Extending Database Technology, pp 489\u2013500","key":"836_CR20","DOI":"10.1145\/2452376.2452433"},{"unstructured":"Xin D, Chen C, Han J (2006) Towards robust indexing for ranked queries. In: Proceedings of the 32nd International Conference on Very Large Data Bases, pp 235\u2013246","key":"836_CR21"},{"issue":"2","key":"836_CR22","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10115-009-0211-5","volume":"23","author":"B Yang","year":"2010","unstructured":"Yang B, Huang H (2010) Topsil-miner: an efficient algorithm for mining top-k significant itemsets over data streams. Knowl Inf Syst 23(2):225\u2013242","journal-title":"Knowl Inf Syst"},{"issue":"5","key":"836_CR23","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1109\/TKDE.2010.240","volume":"23","author":"L Zou","year":"2011","unstructured":"Zou L, Chen L (2011) Pareto-based dominant graph: an efficient indexing structure to answer top-k queries. IEEE Trans Knowl Data Eng 23(5):727\u2013741","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0836-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0836-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0836-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:11:17Z","timestamp":1559110277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0836-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,1]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["836"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0836-5","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2015,5,1]]}}}