Management of User Preferences in Data Intensive Applications.

摘要: The management of user preferences is becoming a fundamental ingredient modern Web-based data-intensive applications, in which information filtering crucial to reduce the volume data presented user. However, though deriving and modeling has been largely studied recent years, there still need for practical methods efficiently incorporate actual systems. In this paper we consider qualitative approach binary preference relation defined among objects special operator (called Best) used extract relevant according relation. framework, propose study index structure, called β-tree, can be rapid evaluation Best operator. We then present number algorithms efficient maintenance β-trees front database updates discuss some implementation issues.