S. Abiteboul, R. Hull, and V. Vianu, Foundations of databases, 1995.

M. Alexe, W. Roth, and . Tan, 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

L. Antova, C. Koch, and D. Olteanu, World-Set Decompositions: Expressiveness and Efficient Algorithms, ICDT, 2007.
DOI : 10.1007/11965893_14

URL : http://arxiv.org/abs/0705.4442

A. Arvanitis and G. Koutrika, 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

L. Barceló, A. Libkin, C. Poggi, and . Sirangelo, XML with incomplete information, J. ACM, vol.58, issue.1, 2010.

M. Benedikt and L. Segoufin, Abstract, The Journal of Symbolic Logic, vol.54, issue.01, 2009.
DOI : 10.1016/0304-3975(95)00083-6

A. Buneman, A. Jung, and . Ohori, 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

J. Chomicki and D. Toman, Time in database systems, Handbook of Temporal Reasoning in Artificial Intelligence, 2005.

F. Edgar and . Codd, Extending the database relational model to capture more meaning, TODS, vol.4, issue.4, 1979.

S. Latha, E. L. Colby, L. V. Robertson, D. Saxton, and . Van-gucht, A query language for list-based complex objects, PODS, 1994.

S. Latha, L. V. Colby, D. Saxton, and . Van-gucht, Concepts for modeling and querying list-structured data, Information Processing & Management, vol.30, issue.5, 1994.

P. Robert and . Dilworth, A decomposition theorem for partially ordered sets, Annals of Mathematics, 1950.

C. Dwork, R. Kumar, M. Naor, and D. Sivakumar, 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

R. Fagin, A. Lotem, and M. Naor, 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

W. Fan, F. Geerts, and J. Wijsen, Determining the currency of data, TODS, vol.37, issue.4, p.2012

R. L. Fraîssé, intervalle en théorie des relations; ses genéralisations, filtre intervallaire et clôture d'une relation, p.99, 1984.

R. Fulkerson, 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

R. Michael, D. S. Garey, and . Johnson, Computers And Intractability. A Guide to the Theory of NP-completeness, 1979.

S. Grumbach and T. Milo, An algebra for pomsets, ICDT, 1995.
DOI : 10.1006/inco.1998.2777

URL : http://doi.org/10.1006/inco.1998.2777

S. Grumbach and T. Milo, 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

S. Grumbach and T. Milo, 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

M. Howie, Fundamentals of semigroup theory, 1995.

T. Imieli?ski and W. Lipski, Incomplete information in relational databases, J. ACM, vol.31, issue.4, 1984.

N. Immerman, 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

M. Jacob, B. Kimelfeld, and J. Stoyanovich, 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