Foundations of databases, 1995. ,
Preference-aware integration of temporal data, Proceedings of the VLDB Endowment, vol.8, issue.4, p.2014 ,
DOI : 10.14778/2735496.2735500
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.663.8469
World-Set Decompositions: Expressiveness and Efficient Algorithms, ICDT, 2007. ,
DOI : 10.1007/11965893_14
URL : http://arxiv.org/abs/0705.4442
PrefDB: Supporting Preferences as First-Class Citizens in Relational Databases, IEEE Transactions on Knowledge and Data Engineering, vol.26, issue.6, p.2014 ,
DOI : 10.1109/TKDE.2013.28
XML with incomplete information, J. ACM, vol.58, issue.1, 2010. ,
Abstract, The Journal of Symbolic Logic, vol.54, issue.01, 2009. ,
DOI : 10.1016/0304-3975(95)00083-6
Using powerdomains to generalize relational databases, Theoretical Computer Science, vol.91, issue.1, 1991. ,
DOI : 10.1016/0304-3975(91)90266-5
URL : http://doi.org/10.1016/0304-3975(91)90266-5
Time in database systems, Handbook of Temporal Reasoning in Artificial Intelligence, 2005. ,
Extending the database relational model to capture more meaning, TODS, vol.4, issue.4, 1979. ,
A query language for list-based complex objects, PODS, 1994. ,
Concepts for modeling and querying list-structured data, Information Processing & Management, vol.30, issue.5, 1994. ,
A decomposition theorem for partially ordered sets, Annals of Mathematics, 1950. ,
Rank aggregation methods for the Web, Proceedings of the tenth international conference on World Wide Web , WWW '01, 2001. ,
DOI : 10.1145/371920.372165
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.8702
Optimal aggregation algorithms for middleware, PODS, 2001. ,
DOI : 10.1016/s0022-0000(03)00026-6
URL : http://doi.org/10.1016/s0022-0000(03)00026-6
Determining the currency of data, TODS, vol.37, issue.4, p.2012 ,
intervalle en théorie des relations; ses genéralisations, filtre intervallaire et clôture d'une relation, p.99, 1984. ,
Note on Dilworth's decomposition theorem for partially ordered sets, Proc. Amer. Math. Soc, 1955. ,
DOI : 10.2307/2033375
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.226.652
Computers And Intractability. A Guide to the Theory of NP-completeness, 1979. ,
An algebra for pomsets, ICDT, 1995. ,
DOI : 10.1006/inco.1998.2777
URL : http://doi.org/10.1006/inco.1998.2777
Towards tractable algebras for bags, JCSS, vol.52, issue.3, 1996. ,
DOI : 10.1006/jcss.1996.0042
URL : http://doi.org/10.1006/jcss.1996.0042
An algebra for pomsets, Inf. Comput, vol.150, issue.2, 1999. ,
DOI : 10.1006/inco.1998.2777
URL : http://doi.org/10.1006/inco.1998.2777
Fundamentals of semigroup theory, 1995. ,
Incomplete information in relational databases, J. ACM, vol.31, issue.4, 1984. ,
Relational queries computable in polynomial time, Information and Control, vol.68, issue.1-3, 1986. ,
DOI : 10.1016/S0019-9958(86)80029-8
URL : http://doi.org/10.1016/s0019-9958(86)80029-8
A system for management and analysis of preference data, Proceedings of the VLDB Endowment, vol.7, issue.12, p.2014 ,
DOI : 10.14778/2732977.2732998