A user-friendly interface for evaluating preference queries over tabular data

ABSTRACT

We present a user friendly interface for querying tabular data (such as electronic catalogues), taking into account user preferences. The answer set is partitioned by the interface and presented to the user in the form of a sequence of blocks. The blocks are presented in decreasing order with respect to the preferences, under the control of the user.

REFERENCES

• 1: Rakesh Agrawal , Edward L. Wimmers, A framework for expressing and combining preferences, Proceedings of the 2000 ACM SIGMOD international conference on Management of data, p.297-306, May 15-18, 2000, Dallas, Texas, United States
• 2: Wolf-Tilo Balke , Ulrich Güntzer , Werner Kießling, On Real-Time Top k Querying for Mobile Services, On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002, p.125-143, October 30-November 01, 2002
• 3: Stephan Börzsönyi , Donald Kossmann , Konrad Stocker, The Skyline Operator, Proceedings of the 17th International Conference on Data Engineering, p.421-430, April 02-06, 2001
• 4: Boutilier, C., Brafman, R., Hoos, H., and Poole, D. Reasoning with conditional ceteris paribus preference statements. In UAI-99, pages 71--80, 1999.
• 5: Amelie Marian, Evaluating Top-k Queries over Web-Accessible Databases, Proceedings of the 18th International Conference on Data Engineering, p.369, February 26-March 01, 2002
• 6: Chomicki J, Iterative Modification and Incremental Evaluation of Preference Queries. FoIKS 2006: 63--82
• 7: Jan Chomicki, Querying with Intrinsic Preferences, Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology, p.34-51, March 25-27, 2002
• 8: Chomicki, J. Semantic optimization of preference queries. In 1st Int. Sym. on Appl. of Constraint Databases, Springer (LNCS 3074), 2004.
• 9: Ronald Fagin , Ravi Kumar , Mohammad Mahdian , D. Sivakumar , Erik Vee, Comparing Partial Rankings, SIAM Journal on Discrete Mathematics, v.20 n.3, p.628-648, 2006 [doi>10.1137/05063088X]
• 10: Ronald Fagin , Ravi Kumar , Mohammad Mahdian , D. Sivakumar , Erik Vee, Comparing and aggregating rankings with ties, Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, June 14-16, 2004, Paris, France [doi>10.1145/1055558.1055568]
• 11: Ronald Fagin , Ravi Kumar , D. Sivakumar, Comparing top k lists, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, January 12-14, 2003, Baltimore, Maryland
• 12: Werner Kießling , Gerhard Köstler, Preference SQL: design, implementation, experiences, Proceedings of the 28th international conference on Very Large Data Bases, p.990-1001, August 20-23, 2002, Hong Kong, China
• 13: 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.
• 14: 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
• 15: Tatiana Orenstein , Zvi Kohavi , Irith Pomeranz, An optimal algorithm for cycle breaking in directed graphs, Journal of Electronic Testing: Theory and Applications, v.7 n.1-2, p.71-81, Aug./Oct. 1995 [doi>10.1007/BF00993315]
• 16: D. B. Johnson. Find all the elementary circuits of a directed graph. J. SIAM, 4:77--84, 1975
• 17: James C. Tiernan, An efficient search algorithm to find the elementary circuits of a graph, Communications of the ACM, v.13 n.12, p.722-726, Dec. 1970 [doi>10.1145/362814.362819]
• 18: Hongbo Liu , Jiaxin Wang, A new way to enumerate cycles in graph, Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services, p.57, February 19-25, 2006
• 19: P. Mateti and N. Deo. On algorithms for enumerating all circuits of a graph. SIAM J. Comput., 5:90--99, 1976
• 20: P. Georgiadis, I. Kapantaidakis, M. Nguer, N. Spyratos, V. Christophides, Efficient Rewriting Algorithms for Preference Queries, 24th International Conference on Data Engineering (ICDE'08), April 7--12, 2008, Cancun, Mexico

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.4 Systems

Additional Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.3 Information Search and Retrieval
      H.3.7 Digital Libraries
  H.5 INFORMATION INTERFACES AND PRESENTATION (I.7)
      H.5.2 User Interfaces (D.2.2, H.1.2, I.3.6)