A comparison of p-dispersion heuristics
Computers and Operations Research
A framework for expressing and combining preferences
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimizing search engines using clickthrough data
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Keyword Searching and Browsing in Databases using BANKS
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Preference formulas in relational queries
ACM Transactions on Database Systems (TODS)
Personalized Queries under a Generalized Preference Model
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Improving recommendation lists through topic diversification
WWW '05 Proceedings of the 14th international conference on World Wide Web
RankSQL: query algebra and optimization for relational top-k queries
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Bidirectional expansion for keyword search on graph databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Effective keyword search in relational databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Probabilistic information retrieval approach for ranking of database query results
ACM Transactions on Database Systems (TODS)
Spark: top-k keyword query in relational databases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
BLINKS: ranked keyword searches on graphs
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Foundations of preferences in database systems
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Discover: keyword search in relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient IR-style keyword search over relational databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Objectrank: authority-based keyword search in databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Multi-objective query processing for database systems
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Précis: from unstructured keywords as queries to structured databases as answers
The VLDB Journal — The International Journal on Very Large Data Bases
Fast contextual preference scoring of database tuples
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
CARD: a decision-guidance framework and application for recommending composite alternatives
Proceedings of the 2008 ACM conference on Recommender systems
It takes variety to make a world: diversification in recommender systems
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficient Computation of Diverse Query Results
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Efficient Rewriting Algorithms for Preference Queries
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Journal of Artificial Intelligence Research
Structured search result differentiation
Proceedings of the VLDB Endowment
ACM SIGMOD Record
Introducing contexts into personalized web applications
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
A survey on representation, composition and application of preferences in database systems
ACM Transactions on Database Systems (TODS)
Querying graphs with preferences
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Answering Top-k Keyword Queries on Relational Databases
International Journal of Information Retrieval Research
On the complexity of query result diversification
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Keyword-based search in relational databases allows users to discover relevant information without knowing the database schema or using complicated queries. However, such searches may return an overwhelming number of results, often loosely related to the user intent. In this paper, we propose personalizing keyword database search by utilizing user preferences. Query results are ranked based on both their relevance to the query and their preference degree for the user. To further increase the quality of results, we consider two new metrics that evaluate the goodness of the result as a set, namely coverage of many user interests and content diversity. We present an algorithm for processing preference queries that uses the preferential order between keywords to direct the joining of relevant tuples from multiple relations. We then show how to reduce the complexity of this algorithm by sharing computational steps. Finally, we report evaluation results of the efficiency and effectiveness of our approach.