Equi-depth multidimensional histograms
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
An overview of data warehousing and OLAP technology
ACM SIGMOD Record
Improved query performance with variant indexes
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
On saying “Enough already!” in SQL
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
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
Bitmap index design and evaluation
SIGMOD '98 Proceedings of the 1998 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
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-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
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)
Accurate estimation of the number of tuples satisfying a condition
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Optimizing Queries on Compressed Bitmaps
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
RankSQL: query algebra and optimization for relational top-k queries
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Multi-dimensional regression analysis of time-series data streams
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
High-dimensional OLAP: a minimal cubing approach
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Progressive and selective merge: computing top-k with ad-hoc ranking functions
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Efficiently answering top-k typicality queries on large databases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
DataScope: viewing database contents in Google Maps' way
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
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
BibNetMiner: mining bibliographic information networks
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A Robust Sampling-Based Framework for Privacy Preserving OLAP
DaWaK '08 Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery
Multiple-Objective Compression of Data Cubes in Cooperative OLAP Environments
ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
Sliding-window top-k queries on uncertain streams
Proceedings of the VLDB Endowment
Top-k typicality queries and efficient query answering methods on large databases
The VLDB Journal — The International Journal on Very Large Data Bases
Secure kNN computation on encrypted databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Mining significant change patterns in multidimensional spaces
International Journal of Business Intelligence and Data Mining
Subspace Discovery for Promotion: A Cell Clustering Approach
DS '09 Proceedings of the 12th International Conference on Discovery Science
Processing top-N relational queries by learning
Journal of Intelligent Information Systems
Region-based online promotion analysis
Proceedings of the 13th International Conference on Extending Database Technology
Journal of Intelligent Information Systems
A secure multiparty computation privacy preserving OLAP framework over distributed XML data
Proceedings of the 2010 ACM Symposium on Applied Computing
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Sliding-window top-k queries on uncertain streams
The VLDB Journal — The International Journal on Very Large Data Bases
A framework for OLAP content personalization
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Design and analysis of a ranking approach to private location-based services
ACM Transactions on Database Systems (TODS)
Efficient approximate top-k query algorithm using cube index
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
Journal of Computer and System Sciences
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Mining top-K multidimensional gradients
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Being picky: processing top-k queries with set-defined selections
Proceedings of the 21st ACM international conference on Information and knowledge management
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
Hi-index | 0.00 |
Observed in many real applications, a top-k query often consists of two components to reflect a user's preference: a selection condition and a ranking function. A user may not only propose ad hoc ranking functions, but also use different interesting subsets of the data. In many cases, a user may want to have a thorough study of the data by initiating a multi-dimensional analysis of the top-k query results. Previous work on top-k query processing mainly focuses on optimizing data access according to the ranking function only. The problem of efficient answering top-k queries with multi-dimensional selections has not been well addressed yet.This paper proposes a new computational model, called ranking cube, for efficient answering top-k queries with multi-dimensional selections. We define a rank-aware measure for the cube, capturing our goal of responding to multi-dimensional ranking analysis. Based on the ranking cube, an efficient query algorithm is developed which progressively retrieves data blocks until the top-k results are found. The curse of dimensionality is a well-known challenge for the data cube and we cope with this difficulty by introducing a new technique of ranking fragments. Our experiments on Microsoft's SQL Server 2005 show that our proposed approaches have significant improvement over the previous methods.