Computational geometry: an introduction
Computational geometry: an introduction
Linear programming and convex hulls made easy
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Linear optimization and extensions: theory and algorithms
Linear optimization and extensions: theory and algorithms
Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
Processing queries by linear constraints
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fuzzy queries in multimedia database systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Efficient searching with linear constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The pyramid-technique: towards breaking the curse of dimensionality
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
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
Determining the Convex Hull in Large Multidimensional Databases
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
On Real-Time Top k Querying for Mobile Services
On the Move to Meaningful Internet Systems, 2002 - DOA/CoopIS/ODBASE 2002 Confederated International Conferences DOA, CoopIS and ODBASE 2002
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Algorithms and applications for answering ranked queries using ranked views
The VLDB Journal — The International Journal on Very Large Data Bases
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
RankSQL: query algebra and optimization for relational top-k queries
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Aggregate nearest neighbor queries in spatial databases
ACM Transactions on Database Systems (TODS)
Scalable ranking for preference queries
Proceedings of the 14th ACM international conference on Information and knowledge management
Database support for matching: limitations and opportunities
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
Towards robust indexing for ranked queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Answering top-k queries using views
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Answering top-k queries with multi-dimensional selections: the ranking cube approach
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Epi-SPIRE: a system for environmental and public health activity monitoring
ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 2
Branch-and-bound processing of ranked queries
Information Systems
Efficient Skyline and Top-k Retrieval in Subspaces
IEEE Transactions on Knowledge and Data Engineering
Efficient top-k aggregation of ranked inputs
ACM Transactions on Database Systems (TODS)
Efficient top-k processing in large-scaled distributed environments
Data & Knowledge Engineering
Efficient approximation of optimization queries under parametric aggregation constraints
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Ad-hoc top-k query answering for data streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Anytime measures for top-k algorithms
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A general framework for modeling and processing optimization queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Region clustering based evaluation of multiple top-N selection queries
Data & Knowledge Engineering
Probabilistic ranked queries in uncertain databases
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Anytime measures for top-k algorithms on exact and fuzzy data sets
The VLDB Journal — The International Journal on Very Large Data Bases
Probabilistic Inverse Ranking Queries over Uncertain Data
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Answering linear optimization queries with an approximate stream index
Knowledge and Information Systems
Information Sciences: an International Journal
Mining significant change patterns in multidimensional spaces
International Journal of Business Intelligence and Data Mining
Location-aware privacy and more: a systems approach using context-aware database management systems
Proceedings of the 2nd SIGSPATIAL ACM GIS 2009 International Workshop on Security and Privacy in GIS and LBS
A fair assignment algorithm for multiple preference queries
Proceedings of the VLDB Endowment
Continuous Processing of Preference Queries in Data Streams
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Processing top-N relational queries by learning
Journal of Intelligent Information Systems
Aggregate computation over data streams
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Regret-minimizing representative databases
Proceedings of the VLDB Endowment
Probabilistic inverse ranking queries in uncertain databases
The VLDB Journal — The International Journal on Very Large Data Bases
An optimal strategy for monitoring top-k queries in streaming windows
Proceedings of the 14th International Conference on Extending Database Technology
FIFO indexes for decomposable problems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient and generic evaluation of ranked queries
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
Indexing for vector projections
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
MTopS: scalable processing of continuous top-k multi-query workloads
Proceedings of the 20th ACM international conference on Information and knowledge management
Answering top-k queries over a mixture of attractive and repulsive dimensions
Proceedings of the VLDB Endowment
Efficient processing of ranked queries with sweeping selection
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Multi-attribute optimization in service selection
World Wide Web
Processing ranked queries with the minimum space
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
An i/o optimal and scalable skyline query algorithm
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
Interactive regret minimization
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Processing a large number of continuous preference top-k queries
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Efficient approximation of the maximal preference scores by lightweight cubic views
Proceedings of the 15th International Conference on Extending Database Technology
A probabilistic convex hull query tool
Proceedings of the 15th International Conference on Extending Database Technology
Distributed top-k query processing by exploiting skyline summaries
Distributed and Parallel Databases
Mining top-K multidimensional gradients
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Personalized query evaluation in ring-based P2P networks
Information Sciences: an International Journal
Subspace top-k query processing using the hybrid-layer index with a tight bound
Data & Knowledge Engineering
Computing immutable regions for subspace top-k queries
Proceedings of the VLDB Endowment
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
Shortlisting top-K assignments
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Range query estimation with data skewness for top-k retrieval
Decision Support Systems
Hi-index | 0.00 |
This paper describes the Onion technique, a special indexing structure for linear optimization queries. Linear optimization queries ask for top-N records subject to the maximization or minimization of linearly weighted sum of record attribute values. Such query appears in many applications employing linear models and is an effective way to summarize representative cases, such as the top-50 ranked colleges. The Onion indexing is based on a geometric property of convex hull, which guarantees that the optimal value can always be found at one or more of its vertices. The Onion indexing makes use of this property to construct convex hulls in layers with outer layers enclosing inner layers geometrically. A data record is indexed by its layer number or equivalently its depth in the layered convex hull. Queries with linear weightings issued at run time are evaluated from the outmost layer inwards. We show experimentally that the Onion indexing achieves orders of magnitude speedup against sequential linear scan when N is small compared to the cardinality of the set. The Onion technique also enables progressive retrieval, which processes and returns ranked results in a progressive manner. Furthermore, the proposed indexing can be extended into a hierarchical organization of data to accommodate both global and local queries.