Journal ArticleDOI
myOLAP: An Approach to Express and Evaluate OLAP Preferences
Reads0
Chats0
TLDR
This paper presents myOLAP, an approach for expressing and evaluating OLAP preferences, devised by taking into account the three peculiarities of the OLAP domain, and proposes an algorithm called WeSt that relies on a novel graph representation where two types of domination between sets of facts may be expressed.Abstract:
Multidimensional databases are the core of business intelligence systems. Their users express complex OLAP queries, often returning large volumes of facts, sometimes providing little or no information. Thus, expressing preferences could be highly valuable in this domain. The OLAP domain is representative of an unexplored class of preference queries, characterized by three peculiarities: preferences can be expressed on both numerical and categorical domains; they can also be expressed on the aggregation level of facts; the space on which preferences are expressed includes both elemental and aggregated facts. In this paper, we present myOLAP, an approach for expressing and evaluating OLAP preferences, devised by taking into account the three peculiarities above. We first propose a preference algebra where users are enabled to express their preferences, besides on attributes and measures, also on the aggregation level of facts, for instance, by stating that monthly data are preferred to yearly and daily data. Then, with respect to preference evaluation, we propose an algorithm called WeSt that relies on a novel graph representation where two types of domination between sets of facts may be expressed, which considerably improves efficiency. The approach is extensively tested for efficiency and effectiveness on real data, and compared against two other approaches in the literature.read more
Citations
More filters
Journal ArticleDOI
A survey on representation, composition and application of preferences in database systems
TL;DR: The purpose of this survey is to provide a framework for placing existing works in perspective and highlight critical open challenges to serve as a springboard for researchers in database systems.
Journal ArticleDOI
Search Query Recommendations using Hybrid User Profile with Query Logs
R. Umagandhi,A. Senthil Kumar +1 more
TL;DR: The Query Recommendation technique provides alternative queries to the user to frame a meaningful and relevant query in the future and rapidly satisfies their information needs.
Journal ArticleDOI
Similarity measures for OLAP sessions
TL;DR: A set of similarity criteria derived from a user study conducted with a set of OLAP practitioners and researchers is proposed and a function for estimating the similarity between OLAP queries based on three components: the query group-by set, its selection predicate, and the measures required in output is proposed.
Journal ArticleDOI
A collaborative filtering approach for recommending OLAP sessions
TL;DR: It is claimed that the whole sequence of queries belonging to an OLAP session is valuable because it gives the user a compound and synergic view of data; for this reason, the goal is not to recommend single OLAP queries but OLAP sessions.
Patent
Multi-dimensional query expansion employing semantics and usage statistics
TL;DR: In this paper, the authors propose a system and methods employing personalized query expansion to suggest measures and dimensions allowing iterative building of consistent queries over a data warehouse, which leverage semantics defined in multi-dimensional domain models, user profiles defining preferences, and collaborative usage statistics derived from existing repositories of Business Intelligence (BI) documents.
References
More filters
Proceedings ArticleDOI
The Skyline operator
TL;DR: This work shows how SSL can be extended to pose Skyline queries, present and evaluate alternative algorithms to implement the Skyline operation, and shows how this operation can be combined with other database operations, e.g., join.
Book ChapterDOI
Shooting stars in the sky: an online algorithm for skyline queries
TL;DR: In this paper, a new online algorithm that computes the Skyline is presented, which returns the first results immediately, produces more and more results continuously, and allows the user to give preferences during the running time of the algorithm so that the user can control what kind of results are produced next (e.g., rather cheap or rather near restaurants).
Proceedings ArticleDOI
Skyline with presorting
TL;DR: A skyline algorithm, SFS, based on presorting that is general, for use with any skyline query, efficient, and well behaved in a relational setting is proposed.
Book ChapterDOI
Foundations of preferences in database systems
TL;DR: This work proposes a strict partial order semantics for preferences, which closely matches people's intuition, and shows how to inductively construct complex preferences by means of various preference constructors.