The power of geometric duality
BIT - Ellis Horwood series in artificial intelligence
Reporting points in halfspaces
Computational Geometry: Theory and Applications
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The onion technique: indexing for linear optimization queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Efficient searching with linear constraints
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
PREFER: a system for the efficient execution of multi-parametric ranked queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Lectures on Discrete Geometry
Proceedings of the 17th International Conference on Data Engineering
Practical methods for shape fitting and kinetic data structures using core sets
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Approximating extent measures of points
Journal of the ACM (JACM)
Robust shape fitting via peeling and grating coresets
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the database/network interface in large-scale publish/subscribe systems
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Continuous monitoring of top-k queries over sliding windows
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Answering top-k queries using views
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Ad-hoc top-k query answering for data streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Optimal halfspace range reporting in three dimensions
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Sharing work in keyword search over databases
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Ranking with uncertain scoring functions: semantics and sensitivity measures
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Three problems about dynamic convex hulls
Proceedings of the twenty-seventh annual symposium on Computational geometry
Monochromatic and Bichromatic Reverse Top-k Queries
IEEE Transactions on Knowledge and Data Engineering
Subspace top-k query processing using the hybrid-layer index with a tight bound
Data & Knowledge Engineering
Efficient top-k query answering using cached views
Proceedings of the 16th International Conference on Extending Database Technology
Branch-and-bound algorithm for reverse top-k queries
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
GeoRank: an efficient location-aware news feed ranking system
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Discovering influential data objects over time
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
IPS: an interactive package configuration system for trip planning
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Given a set of objects, each with multiple numeric attributes, a (preference) top-k query retrieves the k objects with the highest scores according to a user preference, defined as a linear combination of attribute values. We consider the problem of processing a large number of continuous top-k queries, each with its own preference. When objects or user preferences change, the query results must be updated. We present a dynamic index that supports the reverse top k query, which is of independent interest. Combining this index with another one for top-k queries, we develop a scalable solution for processing many continuous top-k queries that exploits the clusteredness in user preferences. We also define an approximate version of the problem and present a solution significantly more efficient than the exact one with little loss in accuracy.