Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 17th International Conference on Data Engineering
Continuous monitoring of top-k queries over sliding windows
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Consistent Top-k Queries over Time
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Standing Out in a Crowd: Selecting Attributes for Maximum Visibility
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Promotion analysis in multi-dimensional space
Proceedings of the VLDB Endowment
Region-based online promotion analysis
Proceedings of the 13th International Conference on Extending Database Technology
Durable top-k search in document archives
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Top-k queries on temporal data
The VLDB Journal — The International Journal on Very Large Data Bases
Identifying the most influential data objects with reverse top-k queries
Proceedings of the VLDB Endowment
Monitoring reverse top-k queries over mobile devices
Proceedings of the 10th ACM International Workshop on Data Engineering for Wireless and Mobile Access
Monochromatic and Bichromatic Reverse Top-k Queries
IEEE Transactions on Knowledge and Data Engineering
Inverse queries for multidimensional spaces
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Continuous Top-k Dominating Queries
IEEE Transactions on Knowledge and Data Engineering
Processing a large number of continuous preference top-k queries
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Proceedings of the VLDB Endowment
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
IEEE Transactions on Knowledge and Data Engineering
Hi-index | 0.00 |
In applications such as market analysis, it is of great interest to product manufacturers to have their products ranked as highly as possible for a significant number of customers. However, customer preferences change over time, and product manufacturers are interested in monitoring the evolution of the popularity of their products, in order to discover those products that are consistently highly ranked. To take into account the temporal dimension, we define the continuous influential query and present algorithms for efficient processing and retrieval of continuous influential data objects. Furthermore, our algorithms support incremental retrieval of the next continuous influential data object in a natural way. To evaluate the performance of our algorithms, we conduct a detailed experimental study for various setups.