{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:35Z","timestamp":1750307615777,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,9,22]],"date-time":"2008-09-22T00:00:00Z","timestamp":1222041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,9,22]]},"DOI":"10.1145\/1456536.1456545","type":"proceedings-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T13:49:50Z","timestamp":1225979390000},"page":"33-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A user-friendly interface for evaluating preference queries over tabular data"],"prefix":"10.1145","author":[{"given":"E. M.","family":"Nguer","sequence":"first","affiliation":[{"name":"Laboratoire de Recherche en Informatique, Orsay, France"}]},{"given":"N.","family":"Spyratos","sequence":"additional","affiliation":[{"name":"Laboratoire de Recherche en Informatique, Orsay, France"}]}],"member":"320","published-online":{"date-parts":[[2008,9,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335423"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646748.701675"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656550"},{"key":"e_1_3_2_1_4_1","first-page":"71","volume-title":"UAI-99","author":"Boutilier C.","year":"1999","unstructured":"Boutilier , C. , Brafman , R. , Hoos , H. , and Poole , D . Reasoning with conditional ceteris paribus preference statements . In UAI-99 , pages 71 -- 80 , 1999 . Boutilier, C., Brafman, R., Hoos, H., and Poole, D. Reasoning with conditional ceteris paribus preference statements. In UAI-99, pages 71--80, 1999."},{"key":"e_1_3_2_1_5_1","first-page":"279","article-title":"Evaluating Top-k Queries over Web-Accessible Databases","volume":"369","author":"Bruno N.","year":"2002","unstructured":"Bruno , N. , Gravano , L. , and Marian , A . Evaluating Top-k Queries over Web-Accessible Databases . ICDE , 2002 , 369 -- 279 . Bruno, N., Gravano, L., and Marian, A. Evaluating Top-k Queries over Web-Accessible Databases. ICDE, 2002, 369--279.","journal-title":"ICDE"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11663881_5"},{"key":"e_1_3_2_1_7_1","first-page":"51","article-title":"Querying with Intrinsic Preferences. In Proceedings of the 8th International Conference on EDBT, Prague","volume":"34","author":"Chomicki J","year":"2002","unstructured":"Chomicki , J . Querying with Intrinsic Preferences. In Proceedings of the 8th International Conference on EDBT, Prague , Czech Rep. , 2002 , 34 -- 51 . Chomicki, J. Querying with Intrinsic Preferences. In Proceedings of the 8th International Conference on EDBT, Prague, Czech Rep., 2002, 34--51.","journal-title":"Czech Rep."},{"key":"e_1_3_2_1_8_1","volume-title":"1st Int. Sym. on Appl. of Constraint Databases","author":"Chomicki J.","year":"2004","unstructured":"Chomicki , J. Semantic optimization of preference queries . In 1st Int. Sym. on Appl. of Constraint Databases , Springer (LNCS 3074), 2004 . Chomicki, J. Semantic optimization of preference queries. In 1st Int. Sym. on Appl. of Constraint Databases, Springer (LNCS 3074), 2004."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/05063088X"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055568"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/644108.644113"},{"key":"e_1_3_2_1_12_1","volume-title":"Experiences. In Proceedings of 28th International Conference on Very Large Data Bases","author":"Kie\u00dfling W.","year":"2002","unstructured":"Kie\u00dfling , W. , and K\u00f6stler , G . Preference SQL Design, Implementation , Experiences. In Proceedings of 28th International Conference on Very Large Data Bases , Hong Kong, China , 2002 , 990--1001. Kie\u00dfling, W., and K\u00f6stler, G. Preference SQL Design, Implementation, Experiences. In Proceedings of 28th International Conference on Very Large Data Bases, Hong Kong, China, 2002, 990--1001."},{"key":"e_1_3_2_1_13_1","volume-title":"revised","author":"Manzini Paola","year":"2004","unstructured":"Manzini Paola & Mariotti Marco, 2003. \" How vague can one be? Rational preferences without completeness or transitivity,\" Game Theory and Information 0312006, Econ WPA , revised 16 Jul 2004 . Manzini Paola & Mariotti Marco, 2003. \"How vague can one be? Rational preferences without completeness or transitivity,\" Game Theory and Information 0312006, EconWPA, revised 16 Jul 2004."},{"key":"e_1_3_2_1_14_1","volume-title":"Knowledge Media Science Workshop, October 2--5, 2006","author":"Spyratos V.","year":"2007","unstructured":"N. Spyratos , V. Christophides , P. Georgiadis , M. Nguer , Semantics and Pragmatics of Preference Queries in Digital Libraries , Knowledge Media Science Workshop, October 2--5, 2006 , Meiningen Castle, Germany (Also : LRI Research Report No. 1478, November 2007 N. Spyratos, V. Christophides, P. Georgiadis, M. Nguer, Semantics and Pragmatics of Preference Queries in Digital Libraries, Knowledge Media Science Workshop, October 2--5, 2006, Meiningen Castle, Germany (Also: LRI Research Report No. 1478, November 2007"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00993315"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204007"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/362814.362819"},{"key":"e_1_3_2_1_18_1","first-page":"57","volume-title":"Jiaxin Wang A new way to enumerate cycles in graph Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW","author":"Hongbo Liu","year":"2006","unstructured":"Hongbo Liu , Jiaxin Wang A new way to enumerate cycles in graph Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW 2006 ). 19--25 Feb. 2006 Page(s): 57 -- 57 Hongbo Liu, Jiaxin Wang A new way to enumerate cycles in graph Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW 2006). 19--25 Feb. 2006 Page(s): 57 -- 57"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205007"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497519"}],"event":{"name":"SIGDOC '08: The 26th ACM International Conference on Design of Communication","sponsor":["SIGDOC ACM Special Interest Group for Design of Communications"],"location":"Lisbon Portugal","acronym":"SIGDOC '08"},"container-title":["Proceedings of the 26th annual ACM international conference on Design of communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1456536.1456545","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1456536.1456545","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:44Z","timestamp":1750250744000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1456536.1456545"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,22]]},"references-count":20,"alternative-id":["10.1145\/1456536.1456545","10.1145\/1456536"],"URL":"https:\/\/doi.org\/10.1145\/1456536.1456545","relation":{},"subject":[],"published":{"date-parts":[[2008,9,22]]},"assertion":[{"value":"2008-09-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}