Skip Navigation

Logic Journal of IGPL 2005 13(5):587-597; doi:10.1093/jigpal/jzi043
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Nedbal, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2005. Published by Oxford University Press. All rights reserved.

Original Articles

Relational Databases with Ordered Relations

Radim Nedbal

Institute of Computer Science, Academy of Sciences of the Czech Republic, Pod Vodárenskou vezí 2, 182 07 Prague 8, Czech Republic. E-mail: radned{at}seznam.cz

The paper1 deals with expressing preferences in the framework of the relational data model. Preferences have usually a form of a partial ordering. Therefore the question arises how to provide the relational data model with such an ordering.

Key Words: relational database model, preference, partial ordering, relational algebra operation, aggregation function, arithmetic

Received 28 November 2004.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.