{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T15:47:15Z","timestamp":1783784835167,"version":"3.55.0"},"reference-count":69,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2008,10,1]],"date-time":"2008-10-01T00:00:00Z","timestamp":1222819200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["311671-05"],"award-info":[{"award-number":["311671-05"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2008,10]]},"abstract":"<jats:p>\n            Efficient processing of top-\n            <jats:italic>k<\/jats:italic>\n            queries is a crucial requirement in many interactive environments that involve massive amounts of data. In particular, efficient top-\n            <jats:italic>k<\/jats:italic>\n            processing in domains such as the Web, multimedia search, and distributed systems has shown a great impact on performance. In this survey, we describe and classify top-\n            <jats:italic>k<\/jats:italic>\n            processing techniques in relational databases. We discuss different design dimensions in the current techniques including query models, data access methods, implementation levels, data and query certainty, and supported scoring functions. We show the implications of each dimension on the design of the underlying techniques. We also discuss top-\n            <jats:italic>k<\/jats:italic>\n            queries in XML domain, and show their connections to relational approaches.\n          <\/jats:p>","DOI":"10.1145\/1391729.1391730","type":"journal-article","created":{"date-parts":[[2008,10,14]],"date-time":"2008-10-14T13:15:19Z","timestamp":1223990119000},"page":"1-58","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":632,"title":["A survey of top-\n            <i>k<\/i>\n            query processing techniques in relational database systems"],"prefix":"10.1145","volume":"40","author":[{"given":"Ihab F.","family":"Ilyas","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"George","family":"Beskales","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohamed A.","family":"Soliman","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,10,15]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335450"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/763693.763696"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the 31st International Conference on Very Large Data Bases. 361--372","author":"Amer-Yahia S.","unstructured":"Amer-Yahia , S. , Koudas , N. , Marian , A. , Srivastava , D. , and Toman , D . 2005. Structure and content scoring for xml . In Proceedings of the 31st International Conference on Very Large Data Bases. 361--372 . Amer-Yahia, S., Koudas, N., Marian, A., Srivastava, D., and Toman, D. 2005. Structure and content scoring for xml. In Proceedings of the 31st International Conference on Very Large Data Bases. 361--372."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00530-003-0129-9"},{"key":"e_1_2_1_5_1","volume-title":"Social Choice and Individual Values","author":"Arrow K.","unstructured":"Arrow , K. 1951. Social Choice and Individual Values . Wiley , New York, NY . Arrow, K. 1951. Social Choice and Individual Values. Wiley, New York, NY."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872822"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.166990"},{"key":"e_1_2_1_8_1","volume-title":"The Theory of Committees and Elections","author":"Black D.","unstructured":"Black , D. 1958. The Theory of Committees and Elections . Cambridge University Press , London, U.K. Black, D. 1958. The Theory of Committees and Elections. Cambridge University Press, London, U.K."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the 17th International Conference on Data Engineering. 421","author":"B\u00f6rzs\u00f6nyi S.","unstructured":"B\u00f6rzs\u00f6nyi , S. , Kossmann , D. , and Stocker , K . 2001. The skyline operator . In Proceedings of the 17th International Conference on Data Engineering. 421 . B\u00f6rzs\u00f6nyi, S., Kossmann, D., and Stocker, K. 2001. The skyline operator. In Proceedings of the 17th International Conference on Data Engineering. 421."},{"key":"e_1_2_1_10_1","unstructured":"Brams S. J. and Fishburn P. C. 1983. Approval Voting. Birkhauser Boston MA.  Brams S. J. and Fishburn P. C. 1983. Approval Voting. Birkhauser Boston MA."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/568518.568519"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 18th International Conference on Data Engineering. 369","author":"Bruno N.","unstructured":"Bruno , N. , Gravano , L. , and Marian , A . 2002b. Evaluating top-k queries over Web-accessible databases . In Proceedings of the 18th International Conference on Data Engineering. 369 . Bruno, N., Gravano, L., and Marian, A. 2002b. Evaluating top-k queries over Web-accessible databases. In Proceedings of the 18th International Conference on Data Engineering. 369."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/767141.767147"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564731"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335433"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 17th International Conference on Data Engineering. 534--542","author":"Chaudhuri S.","unstructured":"Chaudhuri , S. , Das , G. , Datar , M. , Motwani , R. , and Narasayya , V. R . 2001a. Overcoming limitations of sampling for aggregation queries . In Proceedings of the 17th International Conference on Data Engineering. 534--542 . Chaudhuri, S., Das, G., Datar, M., Motwani, R., and Narasayya, V. R. 2001a. Overcoming limitations of sampling for aggregation queries. In Proceedings of the 17th International Conference on Data Engineering. 534--542."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375694"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276343"},{"key":"e_1_2_1_19_1","volume-title":"A reasonable social welfare function. Mimeo","author":"Copeland A. H.","unstructured":"Copeland , A. H. 1951. A reasonable social welfare function. Mimeo . University of Michigan , Ann Arbor, MI . Copeland, A. H. 1951. A reasonable social welfare function. Mimeo. University of Michigan, Ann Arbor, MI."},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 32nd International Conference on Very Large Data Bases. 451--462","author":"Das G.","unstructured":"Das , G. , Gunopulos , D. , Koudas , N. , and Tsirogiannis , D . 2006. Answering top-k queries using views . In Proceedings of the 32nd International Conference on Very Large Data Bases. 451--462 . Das, G., Gunopulos, D., Koudas, N., and Tsirogiannis, D. 2006. Answering top-k queries using views. In Proceedings of the 32nd International Conference on Very Large Data Bases. 451--462."},{"key":"e_1_2_1_22_1","volume-title":"Group Representation in Probability and Statistics","author":"Diaconis P.","unstructured":"Diaconis , P. 1998. Group Representation in Probability and Statistics . Institute of Mathematical Statistics. Web site : www.imstat.org. Diaconis, P. 1998. Group Representation in Probability and Statistics. Institute of Mathematical Statistics. Web site: www.imstat.org."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1977.tb01624.x"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 25th International Conference on Very Large Data Bases. 411--422","author":"Donjerkovic D.","unstructured":"Donjerkovic , D. and Ramakrishnan , R . 1999. Probabilistic optimization of top N queries . In Proceedings of the 25th International Conference on Very Large Data Bases. 411--422 . Donjerkovic, D. and Ramakrishnan, R. 1999. Probabilistic optimization of top N queries. In Proceedings of the 25th International Conference on Very Large Data Bases. 411--422."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372165"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055568"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. 28--36","author":"Fagin R.","unstructured":"Fagin , R. , Kumar , R. , and Sivakumar , D . 2003. Comparing top k lists . In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. 28--36 . Fagin, R., Kumar, R., and Sivakumar, D. 2003. Comparing top k lists. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. 28--36."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/645916.671964"},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the 26th International Conference on Very Large Data Bases. 176--187","author":"Ganti V.","unstructured":"Ganti , V. , Lee , M. , and Ramakrishnan , R . 2000. ICICLES: Self-tuning samples for approximate query answering . In Proceedings of the 26th International Conference on Very Large Data Bases. 176--187 . Ganti, V., Lee, M., and Ramakrishnan, R. 2000. ICICLES: Self-tuning samples for approximate query answering. In Proceedings of the 26th International Conference on Very Large Data Bases. 176--187."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1117454.1117456"},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the 26th International Conference on Very Large Data Bases. 419--428","author":"G\u00fcntzer U.","unstructured":"G\u00fcntzer , U. , Balke , W. , and Kie\u00dfling , W . 2000. Optimizing multi-feature queries for image databases . In Proceedings of the 26th International Conference on Very Large Data Bases. 419--428 . G\u00fcntzer, U., Balke, W., and Kie\u00dfling, W. 2000. Optimizing multi-feature queries for image databases. In Proceedings of the 26th International Conference on Very Large Data Bases. 419--428."},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the International Conference on Information Technology: Coding and Computing. 622","author":"G\u00fcntzer U.","unstructured":"G\u00fcntzer , U. , Balke , W. , and Kie\u00dfling , W . 2001. Towards efficient multi-feature queries in heterogeneous environments . In Proceedings of the International Conference on Information Technology: Coding and Computing. 622 . G\u00fcntzer, U., Balke, W., and Kie\u00dfling, W. 2001. Towards efficient multi-feature queries in heterogeneous environments. In Proceedings of the International Conference on Information Technology: Coding and Computing. 622."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872762"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253291"},{"key":"e_1_2_1_36_1","volume-title":"Probability inequalities for sums of bounded random variables","author":"Hoeffding W.","unstructured":"Hoeffding , W. 1963. Probability inequalities for sums of bounded random variables . American Statistical Association Journal , 13--30. Hoeffding, W. 1963. Probability inequalities for sums of bounded random variables. American Statistical Association Journal, 13--30."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375690"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0099-8"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1206049.1206054"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1007"},{"key":"e_1_2_1_41_1","volume-title":"Proceedings of the 28th International Conference on Very Large Data Bases. 950--961","author":"Ilyas I. F.","unstructured":"Ilyas , I. F. , Aref , W. G. , and Elmagarmid , A. K . 2002. Joining ranked inputs in practice . In Proceedings of the 28th International Conference on Very Large Data Bases. 950--961 . Ilyas, I. F., Aref, W. G., and Elmagarmid, A. K. 2002. Joining ranked inputs in practice. In Proceedings of the 28th International Conference on Very Large Data Bases. 950--961."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-004-0128-2"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1189769.1189772"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007593"},{"key":"e_1_2_1_45_1","volume-title":"Proceedings of the 29th International Conference on Very Large Databases. 754--765","author":"Ilyas F. I.","unstructured":"Ilyas , F. I. , Walid , G. A. , and Elmagarmid , A. K . 2003. Supporting top-k join queries in relational databases . In Proceedings of the 29th International Conference on Very Large Databases. 754--765 . Ilyas, F. I., Walid, G. A., and Elmagarmid, A. K. 2003. Supporting top-k join queries in relational databases. In Proceedings of the 29th International Conference on Very Large Databases. 754--765."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1634.1886"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/33.3.239"},{"key":"e_1_2_1_48_1","first-page":"1","article-title":"A comparison of the dodgson method and the copeland rule","volume":"4","author":"Klamler C.","year":"2003","unstructured":"Klamler , C. 2003 . A comparison of the dodgson method and the copeland rule . Econ. Bull. 4 , 8, 1 -- 7 . Klamler, C. 2003. A comparison of the dodgson method and the copeland rule. Econ. Bull. 4, 8, 1--7.","journal-title":"Econ. Bull."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142481"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066173"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.54"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005566.1005569"},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the 31st International Conference on Very Large Data Bases. 637--648","author":"Michel S.","unstructured":"Michel , S. , Triantafillou , P. , and Weikum , G . 2005. KLEE: A framework for distributed top-k query algorithms . In Proceedings of the 31st International Conference on Very Large Data Bases. 637--648 . Michel, S., Triantafillou, P., and Weikum, G. 2005. KLEE: A framework for distributed top-k query algorithms. In Proceedings of the 31st International Conference on Very Large Data Bases. 637--648."},{"key":"e_1_2_1_54_1","volume-title":"Proceedings of the 27th International Conference on Very Large Data Bases. 281--290","author":"Natsev A.","unstructured":"Natsev , A. , Chang , Y. , Smith , J. R. , Li , C. , and Vitter , J. S . 2001. Supporting incremental join queries on ranked inputs . In Proceedings of the 27th International Conference on Very Large Data Bases. 281--290 . Natsev, A., Chang, Y., Smith, J. R., Li, C., and Vitter, J. S. 2001. Supporting incremental join queries on ranked inputs. In Proceedings of the 27th International Conference on Very Large Data Bases. 281--290."},{"key":"e_1_2_1_55_1","volume-title":"Comparing Voting Systems","author":"Nurmi H.","unstructured":"Nurmi , H. 1987. Comparing Voting Systems . D. Reidel Publishing Company, Dordrecht , Germany . Nurmi, H. 1987. Comparing Voting Systems. D. Reidel Publishing Company, Dordrecht, Germany."},{"key":"e_1_2_1_56_1","volume-title":"Proceedings of the 23rd International Conference on Data Engineering. 886--895","author":"R\u00e9 C.","unstructured":"R\u00e9 , C. , Dalvi , N. N. , and Suciu , D . 2007. Efficient top-k query evaluation on probabilistic data . In Proceedings of the 23rd International Conference on Data Engineering. 886--895 . R\u00e9, C., Dalvi, N. N., and Suciu, D. 2007. Efficient top-k query evaluation on probabilistic data. In Proceedings of the 23rd International Conference on Data Engineering. 886--895."},{"key":"e_1_2_1_57_1","volume-title":"Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 232--241","author":"Robertson S. E.","unstructured":"Robertson , S. E. and Walker , S . 1994. Some simple effective approximations to the 2-Poisson model for probabilistic weighted retrieval . In Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 232--241 . Robertson, S. E. and Walker, S. 1994. Some simple effective approximations to the 2-Poisson model for probabilistic weighted retrieval. In Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 232--241."},{"key":"e_1_2_1_58_1","volume-title":"Introduction to Modern IR","author":"Salton G.","unstructured":"Salton , G. and McGill , M. J. 1983. Introduction to Modern IR . McGraw-Hill , New York, NY . Salton, G. and McGill, M. J. 1983. Introduction to Modern IR. McGraw-Hill, New York, NY."},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.10"},{"key":"e_1_2_1_60_1","volume-title":"Proceedings of the 23rd International Conference on Data Engineering. 896--905","author":"Soliman M. A.","unstructured":"Soliman , M. A. , Ilyas , I. F. , and Chang , K. C . -C. 2007. Top-k query processing in uncertain databases . In Proceedings of the 23rd International Conference on Data Engineering. 896--905 . Soliman, M. A., Ilyas, I. F., and Chang, K. C.-C. 2007. Top-k query processing in uncertain databases. In Proceedings of the 23rd International Conference on Data Engineering. 896--905."},{"key":"e_1_2_1_61_1","volume-title":"Proceedings of the 31st International Conference on Very Large Data Bases. 625--636","author":"Theobald M.","unstructured":"Theobald , M. , Schenkel , R. , and Weikum , G . 2005. An efficient and versatile query engine for TopX search . In Proceedings of the 31st International Conference on Very Large Data Bases. 625--636 . Theobald, M., Schenkel, R., and Weikum, G. 2005. An efficient and versatile query engine for TopX search. In Proceedings of the 31st International Conference on Very Large Data Bases. 625--636."},{"key":"e_1_2_1_62_1","volume-title":"Proceedings of the 30th International Conference on Very Large Data Bases. 648--659","author":"Theobald M.","unstructured":"Theobald , M. , Weikum , G. , and Schenkel , R . 2004. Top-k query evaluation with probabilistic guarantees . In Proceedings of the 30th International Conference on Very Large Data Bases. 648--659 . Theobald, M., Weikum, G., and Schenkel, R. 2004. Top-k query evaluation with probabilistic guarantees. In Proceedings of the 30th International Conference on Very Large Data Bases. 648--659."},{"key":"e_1_2_1_63_1","first-page":"98","article-title":"An extension of the Condorcet criterion and Kemeny orders","author":"Truchon M.","year":"1998","unstructured":"Truchon , M. 1998 . An extension of the Condorcet criterion and Kemeny orders . Cahier 98 - 15 . Centre de Recherche en Economie et Finance Appliquees, Universit\u00e9 Laval, Qu\u00e9bec, Canada. Truchon, M. 1998. An extension of the Condorcet criterion and Kemeny orders. Cahier 98-15. Centre de Recherche en Economie et Finance Appliquees, Universit\u00e9 Laval, Qu\u00e9bec, Canada.","journal-title":"Cahier"},{"key":"e_1_2_1_64_1","volume-title":"Proceedings of the 19th International Conference on Data Engineering. 277","author":"Tsaparas P.","unstructured":"Tsaparas , P. , Palpanas , T. , Kotidis , Y. , Koudas , N. , and Srivastava , D . 2003. Ranked join indices . In Proceedings of the 19th International Conference on Data Engineering. 277 . Tsaparas, P., Palpanas, T., Kotidis, Y., Koudas, N., and Srivastava, D. 2003. Ranked join indices. In Proceedings of the 19th International Conference on Data Engineering. 277."},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.250091"},{"key":"e_1_2_1_66_1","volume-title":"Proceedings of the 32nd International Conference on Very Large Data Bases. 235--246","author":"Xin D.","unstructured":"Xin , D. , Chen , C. , and Han , J . 2006. Towards robust indexing for ranked queries . In Proceedings of the 32nd International Conference on Very Large Data Bases. 235--246 . Xin, D., Chen, C., and Han, J. 2006. Towards robust indexing for ranked queries. In Proceedings of the 32nd International Conference on Very Large Data Bases. 235--246."},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247494"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1137\/0135023"},{"key":"e_1_2_1_69_1","volume-title":"Proceedings of the 31st International Conference on Very Large Data Bases. 241--252","author":"Yuan Y.","unstructured":"Yuan , Y. , Lin , X. , Liu , Q. , Wang , W. , Yu , J. X. , and Zhang , Q . 2005. Efficient computation of the skyline cube . In Proceedings of the 31st International Conference on Very Large Data Bases. 241--252 . Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J. X., and Zhang, Q. 2005. Efficient computation of the skyline cube. In Proceedings of the 31st International Conference on Very Large Data Bases. 241--252."},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142515"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1391729.1391730","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1391729.1391730","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:13Z","timestamp":1750258033000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1391729.1391730"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10]]},"references-count":69,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["10.1145\/1391729.1391730"],"URL":"https:\/\/doi.org\/10.1145\/1391729.1391730","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10]]},"assertion":[{"value":"2007-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2007-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-10-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}