Algebraic optimization of relational queries with various kinds of preferences. (English) Zbl 1132.68366
Geffert, Viliam (ed.) et al., SOFSEM 2008: Theory and practice of computer science. 34th conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 19–25, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-77565-2/pbk). Lecture Notes in Computer Science 4910, 388-399 (2008).
Summary: Preferences can be used for information filtering and extraction to deliver the most relevant data to the user. Therefore the efficient integration of querying with preferences into standard database technology is an important issue. The paper resumes a logical framework for formulating preferences and their embedding into relational algebra through a single preference operator parameterized by a set of user preferences of sixteen various kinds and returning only the most preferred subsets of its argument relation. Most importantly, preferences between sets of elements can be expressed. To make a relational query language with the preference operator useful for practical applications, formal foundation for algebraic optimization, applying heuristics like push preference, has to be provided. Therefore abstract properties of the preference operator and a variety of algebraic laws describing its interaction with other relational algebra operators are presented.
For the entire collection see [Zbl 1131.68008].
For the entire collection see [Zbl 1131.68008].
MSC:
| 68P15 | Database theory |
References:
| [1] | Kießling, W.: Foundations of Preferences in Database Systems. In: Proceedings of the 28th VLDB Conference, Hong Kong, China, pp. 311-322 (2002) |
| [2] | Kießling, W., Hafenrichter, B.: Algebraic optimization of relational preference queries. Technical Report 2003-01, Institute of Computer Science, University of Augsburg (February 2003) |
| [3] | Chomicki, J., Preference Formulas in Relational Queries, ACM Trans. Database Syst., 28, 4, 427-466 (2003) · doi:10.1145/958942.958946 |
| [4] | Börzsönyi, S.; Kossmann, D.; Stocker, K., The skyline operator, Proceedings of the 17th International Conference on Data Engineering, 421-430 (2001), Washington, DC, USA: IEEE Computer Society, Washington, DC, USA · doi:10.1109/ICDE.2001.914855 |
| [5] | von Wright, G., The logic of preference (1963), Edinburgh: Edinburgh University Press, Edinburgh · Zbl 0252.02023 |
| [6] | Doyle, J.; Wellman, M. P., Representing preferences as ceteris paribus comparatives, Decision-Theoretic Planning: Papers from the 1994 Spring AAAI Symposium, 69-75 (1994), Menlo Park, California: AAAI Press, Menlo Park, California |
| [7] | Kaci, S., van der Torre, L.W.N.: Non-monotonic reasoning with various kinds of preferences. In: Brafman, R.I., Junker, U. (eds.) IJCAI 2005. Multidisciplinary Workshop on Advances in Preference Handling, pp. 112-117 (2005) |
| [8] | Lacroix, M.; Lavency, P.; Stocker, P. M.; Kent, W.; Hammersley, P., Preferences; Putting More Knowledge into Queries, VLDB, 217-225 (1987), San Francisco: Morgan Kaufmann, San Francisco |
| [9] | Govindarajan, K., Jayaraman, B., Mantha, S.: Preference datalog. Technical Report 95-50 (January 1995) · Zbl 0948.68105 |
| [10] | Hafenrichter, B.; Kießling, W., Optimization of relational preference queries, CRPIT ’39, 175-184 (2005), Australia: Australian Computer Society, Inc., Australia |
| [11] | Nedbal, R., Relational Databases with Ordered Relations, Logic Journal of the IGPL, 13, 5, 587-597 (2005) · Zbl 1083.68033 · doi:10.1093/jigpal/jzi043 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
