{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T09:58:47Z","timestamp":1718877527017},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,2,14]],"date-time":"2009-02-14T00:00:00Z","timestamp":1234569600000},"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":[[2010,2]]},"DOI":"10.1007\/s10844-009-0078-7","type":"journal-article","created":{"date-parts":[[2009,2,16]],"date-time":"2009-02-16T10:05:24Z","timestamp":1234778724000},"page":"21-55","source":"Crossref","is-referenced-by-count":11,"title":["Processing top-N relational queries by learning"],"prefix":"10.1007","volume":"34","author":[{"given":"Liang","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiyi","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunnian","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenzhu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dazhong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,2,14]]},"reference":[{"key":"78_CR1","doi-asserted-by":"crossref","unstructured":"Balke, W., Nejdl, W., Siberski, W., & Thaden, U. (2005). Progressive distributed top-k retrieval in peer-to-peer networks. In Proceedings of the 21st international conference on data engineering (ICDE\u201905) (pp. 174\u2013185). Tokyo, Japan.","DOI":"10.1109\/ICDE.2005.115"},{"key":"78_CR2","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 29th international conference on very large data bases (VLDB\u201906) (pp. 475\u2013486). Seoul, Korea."},{"key":"78_CR3","volume-title":"Forecasting and time series: An applied approach","author":"B. L. Bowerman","year":"1993","unstructured":"Bowerman, B. L., & O\u2019Connell, R. T. (1993). Forecasting and time series: An applied approach (3rd ed.). Pacific Grove: Brooks\/Cole.","edition":"3"},{"key":"78_CR4","doi-asserted-by":"crossref","unstructured":"Bruno, N., Chaudhuri, S., & Gravano, L. (2001). STHoles: A multidimensional workload-aware histogram. In Proceedings ACM international conference on management of data (SIGMOD\u201901) (pp. 211\u2013222). Santa Barbara, California, USA.","DOI":"10.1145\/376284.375686"},{"issue":"2","key":"78_CR5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/568518.568519","volume":"27","author":"N. Bruno","year":"2002","unstructured":"Bruno, N., Chaudhuri, S., & Gravano, L. (2002). Top-k selection queries over relational databases: Mapping strategies and performance evaluation. ACM Transactions on Database Systems, 27(2), 153\u2013187. doi: 10.1145\/568518.568519 .","journal-title":"ACM Transactions on Database Systems"},{"key":"78_CR6","doi-asserted-by":"crossref","unstructured":"Carey, M., & Kossmann, D. (1997). On saying \u201cenough already!\u201d in SQL. In Proceedings ACM international conference on management of data (SIGMOD\u201997) (pp. 219\u2013230). Tucson, Arizona, USA.","DOI":"10.1145\/253260.253302"},{"key":"78_CR7","unstructured":"Carey, M., & Kossmann, D. (1998). Reducing the braking distance of an SQL query engine. In Proceedings of 24th international conference on very large data bases (VLDB\u201998) (pp. 158\u2013169). New York City, New York, USA."},{"key":"78_CR8","doi-asserted-by":"crossref","unstructured":"Chang, Y.-C., Bergman, L. D., Castelli, V., Li, C.-S., Lo, M.-L., & Smith, J. R. (2000). The onion technique: Indexing for linear optimization queries. In Proceedings ACM international conference on management of data (SIGMOD\u201900) (pp. 391\u2013402). Dallas, Texas, USA.","DOI":"10.1145\/342009.335433"},{"key":"78_CR9","unstructured":"Chaudhuri, S., & Gravano, L. (1999). Evaluating top-k selection queries. In Proceedings of 25th international conference on very large data bases (VLDB\u201999) (pp. 397\u2013410). Edinburgh, Scotland, UK."},{"issue":"8","key":"78_CR10","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1109\/TKDE.2004.30","volume":"16","author":"S. Chaudhuri","year":"2004","unstructured":"Chaudhuri, S., Gravano, L., & Marian, A. (2004). Optimizing top-k selection queries over multimedia repositories. IEEE Transactions on Knowledge and Data Engineering, 16(8), 992\u20131009. doi: 10.1109\/TKDE.2004.30 .","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"78_CR11","doi-asserted-by":"crossref","unstructured":"Chen, C., & Ling, Y. (2002). A sampling-based estimator for top-k selection query. In Proceedings of the 18th international conference on data engineering (ICDE\u201902) (pp. 617\u2013627). San Jose, California.","DOI":"10.1109\/ICDE.2002.994779"},{"key":"78_CR12","first-page":"458","volume-title":"International conference on web-age information management","author":"Y. Chen","year":"2003","unstructured":"Chen, Y., & Meng, W. (2003). Top-N query: Query language, distance function, and processing strategies. In International conference on web-age information management (pp. 458\u2013470). Chengdu, China: Springer."},{"key":"78_CR13","unstructured":"Das, G., Gunopulos, D., & Koudas, N. (2006). Answering top-k queries using views. In Proceedings of 29th international conference on very large data bases (VLDB\u201906) (pp. 451\u2013462). Seoul, Korea."},{"key":"78_CR14","unstructured":"Donjerkovic, D., & Ramakrishnan, R. (1999). Probabilistic optimization of top N queries. In Proceedings of 25th international conference on very large data bases (VLDB\u201999) (pp. 411\u2013422). Edinburgh, Scotland, UK."},{"key":"78_CR15","doi-asserted-by":"crossref","unstructured":"Fagin, R., Lotem, A., & Naor, M. (2001). Optimal aggregation algorithms for middleware. In Proceedings of the twentieth ACM symposium on principles of database systems (PODS\u201901) (pp. 102\u2013113). Santa Barbara, California, USA.","DOI":"10.1145\/375551.375567"},{"key":"78_CR16","volume-title":"Functions of several variables, Addison-Wesley, 1965","author":"W. Fleming","year":"1977","unstructured":"Fleming, W. (1977). Functions of several variables, Addison-Wesley, 1965 (2nd ed.). New York: Springer.","edition":"2"},{"key":"78_CR17","unstructured":"Habich, D., Lehner, W., & Hinneburg, A. (2005). Optimizing multiple top-K queries over joins. In Proceedings of the 17th international conference on scientific and statistical database management (pp. 195\u2013204). Santa Barbara, CA, USA."},{"key":"78_CR18","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Koudas, N., & Papakonstantinou, Y. (2001). PREFER: A system for the efficient execution of multi-parametric ranked queries. In Proceedings of the 2001 ACM international conference on management of data (SIGMOD\u201901) (pp. 259\u2013270). Santa Barbara, California, USA.","DOI":"10.1145\/375663.375690"},{"issue":"1","key":"78_CR19","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. The VLDB Journal, 13(1), 49\u201370. doi: 10.1007\/s00778-003-0099-8 .","journal-title":"The VLDB Journal"},{"issue":"5","key":"78_CR20","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1109\/TKDE.2007.1007","volume":"19","author":"S.-W. Hwang","year":"2007","unstructured":"Hwang, S.-W., & Chang, K. C.-C. (2007a). Probe minimization by schedule optimization: Supporting top-k queries with expensive predicates. IEEE Transactions on Knowledge and Data Engineering, 19(5), 646\u2013662. doi: 10.1109\/TKDE.2007.1007 .","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"78_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1206049.1206050","volume":"32","author":"S.-W. Hwang","year":"2007","unstructured":"Hwang, S.-W., & Chang, K. C.-C. (2007b). Optimizing top-k queries for middleware access: A unified cost-based approach. ACM Transactions on Database Systems, 32(1), 1\u201341. doi: 10.1145\/1206049.1206054 .","journal-title":"ACM Transactions on Database Systems"},{"key":"78_CR22","doi-asserted-by":"crossref","unstructured":"Ilyas, I., Aref, W., & Elmagarmid, A. (2002). Joining ranked inputs in practice. In Proceedings of 28th international conference on very large data bases (VLDB\u201902) (pp. 950\u2013961). Hong Kong, China.","DOI":"10.1016\/B978-155860869-6\/50094-9"},{"issue":"3","key":"78_CR23","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s00778-004-0128-2","volume":"13","author":"I. Ilyas","year":"2004","unstructured":"Ilyas, I., Aref, W., & Elmagarmid, A. (2004a). Supporting top-k join queries in relational databases. The VLDB Journal, 13(3), 207\u2013221. doi: 10.1007\/s00778-004-0128-2 .","journal-title":"The VLDB Journal"},{"key":"78_CR24","doi-asserted-by":"crossref","unstructured":"Ilyas, I., Shah, R., Aref, W., Vitter, J., & Elmagarmid, A. (2004b). Rank-aware query optimization. In Proceedings ACM international conference on management of data (SIGMOD\u201904) (pp. 203\u2013214). Paris, France.","DOI":"10.1145\/1007568.1007593"},{"key":"78_CR25","doi-asserted-by":"crossref","unstructured":"Lee, J., Kim, D., & Chung, C. (1999). Multi-dimensional selectivity estimation using compressed histogram information. In Proceedings ACM international conference on management of data (SIGMOD\u201999) (pp. 205\u2013214). Philadelphia, Pennsylvania, USA.","DOI":"10.1145\/304181.304200"},{"key":"78_CR26","unstructured":"Li, C., Chang, K., Ilyas, I., & Song, S. (2005). RankSQL, query algebra and optimization for relational top-k queries. In Proceedings ACM international conference on management of data (SIGMOD\u201905) (pp. 131\u2013142). Baltimore, Maryland, USA."},{"issue":"2","key":"78_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. (2004). Evaluating top-k queries over web-accessible databases. ACM Transactions on Database Systems, 29(2), 319\u2013362. doi: 10.1145\/1005566.1005569 .","journal-title":"ACM Transactions on Database Systems"},{"key":"78_CR28","unstructured":"Michel, S., Triantafillou, P., & Weikum, G. (2005). KLEE: A framework for distributed top-k query algorithms. In Proceedings of the 31st international conference on very large data bases (VLDB\u201905) (pp. 637\u2013648). Trondheim, Norway."},{"issue":"3","key":"78_CR29","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/45945.48027","volume":"6","author":"A. Motro","year":"1988","unstructured":"Motro, A. (1988). VAGUE: A user interface to relational databases that permits vague queries. ACM Transactions on Office Information Systems, 6(3), 187\u2013214. doi: 10.1145\/45945.48027 .","journal-title":"ACM Transactions on Office Information Systems"},{"key":"78_CR30","volume-title":"Database system concepts","author":"A. Silberschatz","year":"2002","unstructured":"Silberschatz, A., Korth, H. F., & Sudarshan, S. (2002). Database system concepts (4th ed.). New York: McGraw-Hill.","edition":"4"},{"key":"78_CR31","doi-asserted-by":"crossref","unstructured":"Soliman, M. A., Chang, K. C.-C., & Ilyas, I. F. (2007). Top-k query processing in uncertain databases. In Proceedings of the 2007 IEEE 23rd international conference on data engineering (ICDE\u201907) (pp. 896\u2013905). Istanbul, Turkey.","DOI":"10.1109\/ICDE.2007.367935"},{"key":"78_CR32","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 (VLDB\u201904) (pp. 648\u2013659). Toronto, Canada.","DOI":"10.1016\/B978-012088469-8.50058-9"},{"key":"78_CR33","doi-asserted-by":"crossref","unstructured":"Vlachou, A., Doulkeridis, C., N\u00f8rv\u00e5g, K., & Vazirgiannis, M. (2008). On efficient top-k query processing in highly distributed environments. In Proceedings ACM international conference on management of data (SIGMOD\u201908) (pp. 753\u2013764). Vancouver, BC, Canada.","DOI":"10.1145\/1376616.1376692"},{"key":"78_CR34","unstructured":"Xin, D., Han, J., Cheng, H., & Li, X. (2006). Answering top-k queries with multi-dimensional selections: The ranking cube approach. In Proceedings of 29th international conference on very large data bases (VLDB\u201906) (pp. 463\u2013474). Seoul, Korea."},{"key":"78_CR35","doi-asserted-by":"crossref","unstructured":"Xin, D., Han, J., & Chang, K. C.-C. (2007). Progressive and selective merge. computing top-k with ad-hoc ranking functions. In Proceedings ACM international conference on management of data (SIGMOD\u201907) (pp. 103\u2013114). Beijing, China.","DOI":"10.1145\/1247480.1247494"},{"key":"78_CR36","unstructured":"Yi, K., Yu, H., Yang, J., Xia, G., & Chen, Y. (2003). Efficient maintenance of materialized top-k views. In Proceedings of the 19th international conference on data engineering (ICDE\u201903) (pp. 189\u2013200). Bangalore, India."},{"key":"78_CR37","unstructured":"Yiu, M. L., & Mamoulis, N. (2007). Efficient processing of top-k dominating queries on multi-dimensional data. In Proceedings of 33rd international conference on very large data bases (VLDB\u201907) (pp. 483\u2013494). Vienna, Austria."},{"key":"78_CR38","doi-asserted-by":"crossref","unstructured":"Yu, C., Philip, G., & Meng, W. (2003). Distributed top-N query processing with possibly uncooperative local systems. In Proceedings of 29th international conference on very large data bases (VLDB\u201903) (pp. 117\u2013128). Berlin, Germany.","DOI":"10.1016\/B978-012722442-8\/50019-7"},{"key":"78_CR39","doi-asserted-by":"crossref","unstructured":"Yu, C., Sharma, P., Meng, W., & Qin, Y. (2001). Database selection for processing k nearest neighbors queries in distributed environments. In ACM\/IEEE joint conference on digital libraries (JCDL\u201901) (pp. 215\u2013222). Roanoke, Virginia, USA.","DOI":"10.1145\/379437.379504"},{"issue":"2","key":"78_CR40","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.datak.2007.03.012","volume":"63","author":"K. Zhao","year":"2007","unstructured":"Zhao, K., Tao, Y., & Zhou, S. (2007). Efficient top-k processing in large-scaled distributed environments. Data & Knowledge Engineering, 63(2), 315\u2013335. doi: 10.1016\/j.datak.2007.03.012 .","journal-title":"Data & Knowledge Engineering"},{"key":"78_CR41","doi-asserted-by":"crossref","unstructured":"Zhu, L., & Meng, W. (2004). Learning-based top-N selection query evaluation over relational databases. In Advances in web-age information management: 5th international conference (WAIM\u201904) (pp. 197\u2013207). Dalian, China.","DOI":"10.1007\/978-3-540-27772-9_21"},{"issue":"2","key":"78_CR42","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/j.datak.2007.09.004","volume":"64","author":"L. Zhu","year":"2008","unstructured":"Zhu, L., Meng, W., Yang, W., & Liu, C. (2008). Region clustering based evaluation of multiple top-N selection queries. Data & Knowledge Engineering, 64(2), 439\u2013461. doi: 10.1016\/j.datak.2007.09.004 .","journal-title":"Data & Knowledge Engineering"},{"issue":"4","key":"78_CR43","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1109\/TKDE.2005.65","volume":"17","author":"M. Zhu","year":"2005","unstructured":"Zhu, M., Papadias, D., Zhang, J., & Lee, D. (2005). Top-k spatial joins. IEEE Transactions on Knowledge and Data Engineering, 17(4), 567\u2013579. doi: 10.1109\/TKDE.2005.65 .","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-009-0078-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-009-0078-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-009-0078-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:10:47Z","timestamp":1559268647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-009-0078-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,14]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["78"],"URL":"https:\/\/doi.org\/10.1007\/s10844-009-0078-7","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,14]]}}}