Escaping a Dominance Region at Minimum Cost
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Data clouds: summarizing keyword search results over structured data
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Promotion analysis in multi-dimensional space
Proceedings of the VLDB Endowment
Structured search result differentiation
Proceedings of the VLDB Endowment
Personalizing queries based on networks of composite preferences
ACM Transactions on Database Systems (TODS)
Constructing and exploring composite items
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Identifying the most influential data objects with reverse top-k queries
Proceedings of the VLDB Endowment
Facet discovery for structured web search: a query-log mining approach
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
A survey on representation, composition and application of preferences in database systems
ACM Transactions on Database Systems (TODS)
A parallel algorithm for computing borders
Proceedings of the 20th ACM international conference on Information and knowledge management
Differentiating search results on structured data
ACM Transactions on Database Systems (TODS)
Efficient influence-based processing of market research queries
Proceedings of the 21st ACM international conference on Information and knowledge management
Branch-and-bound algorithm for reverse top-k queries
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Interesting event detection through hall of fame rankings
Proceedings of the ACM SIGMOD Workshop on Databases and Social Networks
The essence of knowledge (bases) through entity rankings
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Discovering influential data objects over time
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Hi-index | 0.00 |
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in databases (e.g., buyers searching for products in a catalog). In this paper we focus on a novel and complementary problem: how to guide a seller in selecting the best attributes of a new tuple (e.g., new product) to highlight such that it stands out in the crowd of existing competitive products and is widely visible to the pool of potential buyers. We develop several interesting formulations of this problem. Although these problems are NP-complete, we can give several exact algorithms as well as approximation heuristics that work well in practice. Our exact algorithms are based on Integer Programming (IP) formulations of the problems, as well as on adaptations of maximal frequent itemset mining algorithms, while our approximation algorithms are based on greedy heuristics. We conduct a performance study illustrating the benefits of our methods on real as well as synthetic data.