{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,16]],"date-time":"2025-05-16T12:07:40Z","timestamp":1747397260697},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,5,27]],"date-time":"2012-05-27T00:00:00Z","timestamp":1338076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10844-012-0208-5","type":"journal-article","created":{"date-parts":[[2012,5,26]],"date-time":"2012-05-26T08:36:26Z","timestamp":1338021386000},"page":"687-710","source":"Crossref","is-referenced-by-count":3,"title":["Efficient processing of top-k queries: selective NRA algorithms"],"prefix":"10.1007","volume":"39","author":[{"given":"Jing","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Guangzhong","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Defu","family":"Lian","sequence":"additional","affiliation":[]},{"given":"Guoliang","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,5,27]]},"reference":[{"key":"208_CR1","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, VLDB \u201907 (pp. 495\u2013506)."},{"key":"208_CR2","unstructured":"Balke, W., G\u00fcntzer, U., & Kie\u00dfling, W. (2010). On real-time top k querying for mobile services. On the Move to Meaningful Internet Systems 2002: CoopIS, DOA, and ODBASE pp. 125\u2013143"},{"key":"208_CR3","unstructured":"Bast, H., Majumdar, D., Schenkel, R., Theobald, M., & Weikum, G. (2006). IO-Top-k: Index-access optimized top-k query processing. In Proceedings of the 32nd international conference on very large data bases, VLDB Endowment, VLDB \u201906 (pp. 475\u2013486)."},{"key":"208_CR4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1006\/jcss.1998.1600","volume":"58","author":"R Fagin","year":"1999","unstructured":"Fagin, R. (1999). Combining fuzzy information from multiple systems. Journal of Computer and System Sciences, 58, 83\u201399.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"208_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/565117.565143","volume":"31","author":"R Fagin","year":"2002","unstructured":"Fagin, R. (2002). Combining fuzzy information: An overview. ACM SIGMOD Record, 31(2), 109\u2013118.","journal-title":"ACM SIGMOD Record"},{"key":"208_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. (2003). Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences, 66, 614\u2013656.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"208_CR7","first-page":"12","volume":"7","author":"L Getoor","year":"2005","unstructured":"Getoor, L., & Diehl, C. (2005). Link mining: A survey. ACM SIGKDD Explorations Newsletter, 7(2), 12.","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"208_CR8","unstructured":"G\u00fcntzer, U., Balke, W., & Kie, W. (2001). Towards efficient multi-feature queries in heterogeneous environments. In Proceedings of the IEEE international conference on information technology: Coding and computing (pp. 622\u2013628)."},{"key":"208_CR9","doi-asserted-by":"crossref","unstructured":"Gursk\u00fd, P., & Vojt\u00e1\u0161, P. (2008). Speeding up the nra algorithm. In Proceedings of the 2nd international conference on scalable uncertainty management, SUM \u201908 (pp. 243\u2013255).","DOI":"10.1007\/978-3-540-87993-0_20"},{"issue":"1","key":"208_CR10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1206049.1206054","volume":"32","author":"S Hwang","year":"2007","unstructured":"Hwang, S., & Chang, K. (2007). Optimizing top-k queries for middleware access: A unified cost-based approach. ACM Transactions on Database Systems (TODS), 32(1), 5.","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"208_CR11","doi-asserted-by":"crossref","unstructured":"Long, X., & Suel, T. (2005). Three-level caching for efficient query processing in large web search engines. In Proceedings of the 14th international conference on world wide web, WWW \u201905 (pp. 257\u2013266). New York, NY, USA.","DOI":"10.1145\/1060745.1060785"},{"key":"208_CR12","doi-asserted-by":"crossref","unstructured":"Luo, Y., Lin, X., Wang, W., & Zhou, X. (2007). Spark: Top-k keyword query in relational databases. In Proceedings of the 2007 ACM SIGMOD international conference on management of data (pp.\u00a0115\u2013126). ACM.","DOI":"10.1145\/1247480.1247495"},{"issue":"3","key":"208_CR13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1272743.1272749","volume":"32","author":"N Mamoulis","year":"2007","unstructured":"Mamoulis, N., Yiu, M., Cheng, K., & Cheung, D. (2007). Efficient top-k aggregation of ranked inputs. ACM Transactions on Database Systems (TODS), 32(3), 19.","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"208_CR14","doi-asserted-by":"crossref","unstructured":"Nepal, S., & Ramakrishna, M. (1999). Query processing issues in image (multimedia) databases. In Proceedings 15th international conference on data engineering (pp. 22\u201329).","DOI":"10.1109\/ICDE.1999.754894"},{"key":"208_CR15","unstructured":"Salton, G. (1989). Automatic text processing: The transformation, analysis, and retrieval of information by computer. Addison-Wesley."},{"key":"208_CR16","doi-asserted-by":"crossref","unstructured":"Shmueli-Scheuer, M., Li, C., Mass, Y., Roitman, H., Schenkel, R., & Weikum, G. (2009). Best-effort top-k query processing under budgetary constraints. In IEEE international conference on data engineering (pp. 928\u2013939). IEEE.","DOI":"10.1109\/ICDE.2009.109"},{"key":"208_CR17","doi-asserted-by":"crossref","unstructured":"Theobald, M., Weikum, G., & Schenkel, R. (2004). Top-k query evaluation with probabilistic guarantees. In Proceedings of the thirtieth international conference on very large data bases-volume 30, VLDB endowment (p. 659).","DOI":"10.1016\/B978-012088469-8.50058-9"},{"key":"208_CR18","doi-asserted-by":"crossref","unstructured":"Wimmers, E., Haas, L., Roth, M., & Braendli, C. (1999). Using Fagin\u2019s algorithm for merging ranked results in multimedia middleware. In Fourth IFCIS international conference on cooperative information systems, citeseer (pp.\u00a0267\u2013278).","DOI":"10.1109\/COOPIS.1999.792176"},{"key":"208_CR19","doi-asserted-by":"crossref","unstructured":"Xin, D., Han, J., & Chang, K. (2007). Progressive and selective merge: Computing top-k with ad-hoc ranking functions. In Proceedings of the 2007 ACM SIGMOD international conference on management of data (pp. 103\u2013114). ACM.","DOI":"10.1145\/1247480.1247494"},{"key":"208_CR20","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-3-642-00672-2_4","volume-title":"Proceedings of the joint international conferences on advances in data and web management, APWeb\/WAIM \u201909","author":"J Yuan","year":"2009","unstructured":"Yuan, J., Sun, G.\u00a0Z., Tian, Y., Chen, G., & Liu, Z. (2009). Selective-nra algorithms for top-k queries. In Proceedings of the joint international conferences on advances in data and web management, APWeb\/WAIM \u201909 (pp. 15\u201326). Berlin, Heidelberg: Springer-Verlag."},{"key":"208_CR21","doi-asserted-by":"crossref","unstructured":"Zhu, M., Shi, S., Li, M., & Wen, J.\u00a0R. (2007). Effective top-k computation in retrieving structured documents with term-proximity support. In Proceedings of the sixteenth ACM conference on conference on information and knowledge management, CIKM \u201907 (pp. 771\u2013780).","DOI":"10.1145\/1321440.1321547"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-012-0208-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-012-0208-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-012-0208-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,29]],"date-time":"2019-06-29T00:49:00Z","timestamp":1561769340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-012-0208-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,27]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["208"],"URL":"https:\/\/doi.org\/10.1007\/s10844-012-0208-5","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,27]]}}}