Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Combining fuzzy information from multiple systems (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Answering recursive queries using views
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
Rewriting aggregate queries using views
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query rewriting for semistructured data
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
A framework for expressing and combining preferences
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
The onion technique: indexing for linear optimization queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Incorporating User Preferences in Multimedia Queries
ICDT '97 Proceedings of the 6th International Conference on Database Theory
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Answering Queries with Aggregation Using Views
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Minimal probing: supporting expensive predicates for top-k queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Top-k selection queries over relational databases: Mapping strategies and performance evaluation
ACM Transactions on Database Systems (TODS)
Searching in metric spaces with user-defined and approximate distances
ACM Transactions on Database Systems (TODS)
Querying with Intrinsic Preferences
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Indexing for progressive skyline computation
Data & Knowledge Engineering
Querying structured text in an XML database
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
An optimal and progressive algorithm for skyline queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Preference formulas in relational queries
ACM Transactions on Database Systems (TODS)
Algorithms and applications for answering ranked queries using ranked views
The VLDB Journal — The International Journal on Very Large Data Bases
Personalization of Queries in Database Systems
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Preserving privacy when preference searching in e-commerce
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Evaluating top-k queries over web-accessible databases
ACM Transactions on Database Systems (TODS)
FleXPath: flexible structure and full-text querying for XML
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Rewriting Rules To Permeate Complex Similarity and Fuzzy Queries within a Relational Database System
IEEE Transactions on Knowledge and Data Engineering
Adaptive Processing of Top-k Queries in XML
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
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
Stratified computation of skylines with partially-ordered domains
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
SVM selective sampling for ranking with application to data retrieval
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Optimization of relational preference queries
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
Efficient computation of the skyline cube
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Ordering the attributes of query results
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Refreshing the sky: the compressed skycube with efficient support for frequent updates
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
Efficient detection of empty-result queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Branch-and-bound processing of ranked queries
Information Systems
Enabling soft queries for data retrieval
Information Systems
Supporting ranking and clustering as generalized order-by and group-by
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficient top-k processing in large-scaled distributed environments
Data & Knowledge Engineering
Sideway value algebra for object-relational databases
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Foundations of preferences in database systems
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Preference SQL: design, implementation, experiences
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Distributed top-N query processing with possibly uncooperative local systems
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient approximation of optimization queries under parametric aggregation constraints
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Efficient IR-style keyword search over relational databases
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
Efficient processing of top-k dominating queries on multi-dimensional data
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
Fast contextual preference scoring of database tuples
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Probabilistic ranked queries in uncertain databases
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Answering preference queries with bit-sliced index arithmetic
Proceedings of the 2008 C3S2E conference
On efficient top-k query processing in highly distributed environments
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Probabilistic top-k and ranking-aggregate queries
ACM Transactions on Database Systems (TODS)
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Computing Relaxed Answers on RDF Databases
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
Efficient top-k processing over query-dependent functions
Proceedings of the VLDB Endowment
Anytime measures for top-k algorithms on exact and fuzzy data sets
The VLDB Journal — The International Journal on Very Large Data Bases
CPref-SQL: a query language supporting conditional preferences
Proceedings of the 2009 ACM symposium on Applied Computing
Probabilistic Inverse Ranking Queries over Uncertain Data
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Multi-dimensional top-k dominating queries
The VLDB Journal — The International Journal on Very Large Data Bases
Answering linear optimization queries with an approximate stream index
Knowledge and Information Systems
PDA: A Flexible and Efficient Personal Decision Assistant
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Toward context and preference-aware location-based services
Proceedings of the Eighth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Workload-Driven Compressed Skycube Queries in Wireless Applications
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Semantic-Based Top-k Retrieval for Competence Management
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Mining significant change patterns in multidimensional spaces
International Journal of Business Intelligence and Data Mining
View usability and safety for the answering of top-k queries via materialized views
Proceedings of the ACM twelfth international workshop on Data warehousing and OLAP
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
Processing top-N relational queries by learning
Journal of Intelligent Information Systems
Maintenance of top-k materialized views
Distributed and Parallel Databases
Personalizing queries based on networks of composite preferences
ACM Transactions on Database Systems (TODS)
Towards efficient ranked query processing in peer-to-peer networks
Proceedings of the 2005 joint Chinese-German conference on Cognitive systems
Aggregate computation over data streams
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
A generic framework for handling uncertain data with local correlations
Proceedings of the VLDB Endowment
Regret-minimizing representative databases
Proceedings of the VLDB Endowment
Selective sampling techniques for feedback-based data retrieval
Data Mining and Knowledge Discovery
Probabilistic inverse ranking queries in uncertain databases
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient top-k retrieval for user preference queries
Proceedings of the 2011 ACM Symposium on Applied Computing
Efficient distributed top-k query processing with caching
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Efficient early top-k query processing in overloaded P2P systems
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Relaxing queries based on XML structure and content preferences
WISS'10 Proceedings of the 2010 international conference on Web information systems engineering
Selecting and ranking business processes with preferences: an approach based on fuzzy sets
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part I
Answering top-k queries over a mixture of attractive and repulsive dimensions
Proceedings of the VLDB Endowment
Top-k skyline: a unified approach
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems
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
Querying with preferences in a digital library
Proceedings of the 2005 international conference on Federation over the Web
Multi-attribute optimization in service selection
World Wide Web
Approximating query answering on RDF databases
World Wide Web
Efficient monitoring of personalized hot news over Web 2.0 streams
Computer Science - Research and Development
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
Processing preference queries in standard database systems
ADVIS'06 Proceedings of the 4th international conference on Advances in Information Systems
Incrementally computing ordered answers of acyclic conjunctive queries
NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems
Chapter 11: rank-join algorithms for search computing
Search Computing
Online subspace skyline query processing using the compressed skycube
ACM Transactions on Database Systems (TODS)
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
Distributed top-k query processing by exploiting skyline summaries
Distributed and Parallel Databases
On saying "enough already!" in MapReduce
Proceedings of the 1st International Workshop on Cloud Intelligence
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
Ranking RDF with provenance via preference aggregation
EKAW'12 Proceedings of the 18th international conference on Knowledge Engineering and Knowledge Management
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
As-Soon-As-Possible top-k query processing in p2p systems
Transactions on Large-Scale Data- and Knowledge-centered systems IX
Range query estimation with data skewness for top-k retrieval
Decision Support Systems
Hi-index | 0.00 |
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operations' research and applied mathematics as well as everyday life; e.g., a buyer may select a home as a weighted function of a number of attributes like its distance from office, its price, its area, etc.We capture such queries in our definition of preference queries that use a weight function over a relation's attributes to derive a score for each tuple. Database systems cannot efficiently produce the top results of a preference query because they need to evaluate the weight function over all tuples of the relation. PREFER answers preference queries efficiently by using materialized views that have been pre-processed and stored.We first show how the result of a preference query can be produced in a pipelined fashion using a materialized view. Then we show that excellent performance can be delivered given a reasonable number of materialized views and we provide an algorithm that selects a number of views to precompute and materialize given space constraints.We have implemented the algorithms proposed in this paper in a prototype system called PREFER, which operates on top of a commercial database management system. We present the results of a performance comparison, comparing our algorithms with prior approaches using synthetic datasets. Our results indicate that the proposed algorithms are superior in performance compared to other approaches, both in preprocessing (preparation of materialized views) as well as execution time.