The Structure of Preference Orders
作者： Markus Endres
DOI: 10.1007/978-3-319-23135-8_3
关键词: Graph 、 Computer science 、 In real life 、 Preference query 、 Theoretical computer science 、 Efficient algorithm 、 Computation
摘要: Preferences are an important natural concept in real life and well-known the database artificial intelligence community. Modeling preferences as strict partial orders closely matches people’s intuition. There many algorithms for evaluation of these orders. In particular some rely on total order or lattice structure constructed by a preference query. This paper provides overview We present several measures different “better-than graphs” give deep insight into preferences. fact, careful analysis underlying graph” enables one to develop efficient computation.
springer.com
sci-hub.st 参考文章(16)
Markus Endres, Werner Kießling, High Parallel Skyline Computation over Low-Cardinality Domains advances in databases and information systems. pp. 97- 111 ,(2014) , 10.1007/978-3-319-10933-6_8
Werner Kießling, Preference Queries with SV-Semantics. conference on management of data. pp. 15- 26 ,(2005)
Markus Endres, Patrick Roocks, Werner Kießling, Scalagon: An Efficient Skyline Algorithm for All Seasons database systems for advanced applications. pp. 292- 308 ,(2015) , 10.1007/978-3-319-18123-3_18
Anastasios Arvanitis, Georgia Koutrika, Towards Preference-aware Relational Databases 2012 IEEE 28th International Conference on Data Engineering. pp. 426- 437 ,(2012) , 10.1109/ICDE.2012.31
Markus Endres, Patrick Roocks, Werner Kießling, Algebraic optimization of grouped preference queries international database engineering and applications symposium. pp. 247- 256 ,(2014) , 10.1145/2628194.2628256
Jan Chomicki, Preference formulas in relational queries ACM Transactions on Database Systems. ,vol. 28, pp. 427- 466 ,(2003) , 10.1145/958942.958946
Jongwuk Lee, Seung-won Hwang, BSkyTree Proceedings of the 13th International Conference on Extending Database Technology - EDBT '10. pp. 195- 206 ,(2010) , 10.1145/1739041.1739067
Peter C. Fishburn, Intransitive Indifference in Preference Theory: A Survey Operations Research. ,vol. 18, pp. 207- 228 ,(1970) , 10.1287/OPRE.18.2.207
Hyuck Han, Hyungsoo Jung, Hyeonsang Eom, H.Y. Yeom, An efficient skyline framework for matchmaking applications Journal of Network and Computer Applications. ,vol. 34, pp. 102- 115 ,(2011) , 10.1016/J.JNCA.2010.08.011
H. V. Jagadish, Jignesh M. Patel, Michael Morse, Efficient skyline computation over low-cardinality domains very large data bases. pp. 267- 278 ,(2007)