Efficient Rewriting Algorithms for Preference Queries

@article{Georgiadis2008EfficientRA,
  title={Efficient Rewriting Algorithms for Preference Queries},
  author={Periklis Georgiadis and Ioannis Kapantaidakis and Vassilis Christophides and Elhadji Mamadou Nguer and Nicolas Spyratos},
  journal={2008 IEEE 24th International Conference on Data Engineering},
  year={2008},
  pages={1101-1110}
}
Preference queries are crucial for various applications (e.g. digital libraries) as they allow users to discover and order data of interest in a personalized way. In this paper, we define preferences as preorders over relational attributes and their respective domains. Then, we rely on appropriate linearizations to provide a natural semantics for the block sequence answering a preference query. Moreover, we introduce two novel rewriting algorithms (called LBA and TBA) which exploit the… CONTINUE READING
25 Citations
9 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 25 extracted citations

Similar Papers

Loading similar papers…