Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Paolo Biondi

dblp:32/9582 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Query processing and optimization · 70% Data mining · 23% Data models and query languages · 7%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization
preference query
0.222011
myOLAP: An Approach to Express and Evaluate OLAP Preferences · IEEE Trans. Knowl. Data Eng. 2011
Preference-based datacube analysis with MYOLAP · ICDE 2011
Data mining › multidimensional data analysis
data cube analysis
0.112011
Preference-based datacube analysis with MYOLAP · ICDE 2011
Query processing and optimization
OLAP
0.112011
Preference-based datacube analysis with MYOLAP · ICDE 2011
Data models and query languages
multidimensional database
0.012011
myOLAP: An Approach to Express and Evaluate OLAP Preferences · IEEE Trans. Knowl. Data Eng. 2011

Methods — techniques the papers use, named apart from their topics

preference algebra · 0.2graph-based domination · 0.1
YearPublicationVenuePosition
2013 Wind - Solar Hybrid Systems in Tunisia: An Optimization Protocol
Karemt Boubaker, Andrea Colantoni, Leonardo Longo, Simone Di Giacinto, Giuseppina Menghini, Paolo Biondi
ICCSA (2)6
2013 Mathematical Analysis of Gasification Process Using Boubaker Polynomials Expansion Scheme
Andrea Colantoni, Elena Allegrini, Fabio Recanatesi, Manuela Romagnoli, Paolo Biondi, Karemt Boubaker
ICCSA (2)5
2011 Preference-based datacube analysis with MYOLAP
abstract
In this demonstration we present MYOLAP, a Java-based tool that allows OLAP analyses to be personalized and enhanced by expressing “soft” query constraints in the form of user preferences. MYOLAP is based on a novel preference algebra and a preference evaluation algorithm specifically devised for the OLAP domain. Preferences are formulated either visually or through an extension of the MDX language, and user interaction with the results is mediated by a visual graph-like structure that shows better-than relationships between different sets of data. The demonstration will show how analysis sessions can benefit from coupling ad-hoc preference constructors with the classical OLAP operators, and in particular how MYOLAP supports users in expressing preference queries, analyzing their results, and navigating datacubes.
Paolo Biondi, Matteo Golfarelli, Stefano Rizzi
ICDE1
2011 myOLAP: An Approach to Express and Evaluate OLAP Preferences
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.
Matteo Golfarelli, Stefano Rizzi, Paolo Biondi
IEEE Trans. Knowl. Data Eng.3