personalized search and recomendations for movies in a relational database
T.Harish,K.Jaya Surya,P.Balamurugan
Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology
ISSN: 2321-3337 Impact Factor:1.521 Volume:4 Issue:3 Year: 01 April,2016 Pages:818-824
Abstract
We argue that preference-aware query processing needs to be pushed closer to the DBMS. We introduce a preference-aware relational data model that extends database tuples with preferences and an extended algebra that captures the essence of processing queries with references. Based on a set of algebraic properties and a cost model that we propose, we provide several query optimization strategies for extended query plans. Further, we describe a query execution algorithm that blends preference evaluation with query execution, while making effective use of the native query engine. We have implemented our framework and methods in a prototype system, PrefDB. PrefDB allows transparent and efficient evaluation of preferential queries on top of a relational DBMS. Our extensive experimental evaluation on two real-world data sets demonstrates the feasibility and advantages of our framework.
Kewords
Query processing,Relational data model, Query optimization, Prototype system, PrefDB
Reference
1.G. Adomavicius and A. Tuzhilin. Toward the next generation of recommender systems: A survey of the state of the art and possible extensions. TKDE, 17(6) 734,749, 2005. 2. R. Agrawal, R. Rantzau, and E. Terzi. Context sensitive ranking. In SIGMOD, pages 383, 394, 2006. 3.R. Agrawal and E. L. Wimmers. A framework for expressing and combining preferences. In SIGMOD, pages 297 306, 2000. 4. A. Arvanitis and G. Koutrika. PrefDB Bringing preferences closer to the DBMS. In SIGMOD, pages 665 668, 2012.
