Multidimensional Preference Query Optimization on Infrastructure Monitoring Systems

Performance monitoring systems collect and analyze data, and provide insight on availability, performance, and capacity from various monitored targets. However, the analytics in online performance monitoring systems have often been limited due to the query performance of large-scale multidimensional data. The existing approaches for preference or ranking queries generally include approaches with and without pre-processing. The approaches without pre-processing work well with small data sets. For larger datasets, the preference query is usually slow or not time feasible. In this paper, we introduce and evaluate an optimized query approach for performance monitoring systems using the bit-sliced index (BSI). The objective is to enable users to perform fast interactive queries with various querying criteria on multiple dimensions. The experiments cover preference top-k queries on the proposed approach with BSI, an approach using bitmap indexing for top-k queries, and the sequential scan sort top-k selection algorithms. The evaluation covers the single attribute query, multiple attributes weighted sum query, and multidimensional grouping using a real-time performance monitoring system data with several hundred thousand records. Working with a single attribute top-k evaluation, the proposed bit-sliced approach on average outperforms the bitmap approach and the sequential scan approach by a factor of 2 and a factor of 100+ respectively. Similarly, with multiple attributes sum top-k evaluation, it is 5 times faster than the sequential scan approach as well.

[1]  Raghuraman Mudumbai,et al.  2016 Ieee International Conference on Big Data (big Data) Power Efficient Big Data Analytics Algorithms through Low-level Operations , 2022 .

[2]  Patrick E. O'Neil,et al.  Improved query performance with variant indexes , 1997, SIGMOD '97.

[3]  Guadalupe Canahuate,et al.  Slicing the Dimensionality: Top-k Query Processing for High-Dimensional Spaces , 2014, Trans. Large Scale Data Knowl. Centered Syst..

[4]  Peter Vojtás,et al.  UPRE: User Preference Based Search System , 2006, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06).

[5]  Patrick Valduriez,et al.  Best position algorithms for efficient top-k query processing , 2011, Inf. Syst..

[6]  Moni Naor,et al.  Optimal aggregation algorithms for middleware , 2001, PODS '01.

[7]  Wolf-Tilo Balke,et al.  Multi-objective Query Processing for Database Systems , 2004, VLDB.

[8]  Pankaj K. Agarwal,et al.  Top-k Preferences in High Dimensions , 2016, IEEE Trans. Knowl. Data Eng..

[9]  Arie Shoshani,et al.  Using bitmap index for interactive exploration of large datasets , 2003, 15th International Conference on Scientific and Statistical Database Management, 2003..

[10]  Gerhard Weikum,et al.  IO-Top-k: index-access optimized top-k query processing , 2006, VLDB.

[11]  Ihab F. Ilyas,et al.  A survey of top-k query processing techniques in relational database systems , 2008, CSUR.

[12]  Owen Kaser,et al.  Consistently faster and smaller compressed bitmaps with Roaring , 2016, Softw. Pract. Exp..

[13]  Seung-won Hwang,et al.  Minimal probing: supporting expensive predicates for top-k queries , 2002, SIGMOD '02.

[14]  Ronald Fagin,et al.  Comparing top k lists , 2003, SODA '03.

[15]  Luis Gravano,et al.  Evaluating top-k queries over web-accessible databases , 2004, TODS.

[16]  Jignesh M. Patel,et al.  Efficient and generic evaluation of ranked queries , 2011, SIGMOD '11.

[17]  Patrick E. O'Neil,et al.  Bit-sliced index arithmetic , 2001, SIGMOD '01.

[18]  Patrick Valduriez,et al.  Best Position Algorithms for Top-k Queries , 2007, VLDB.

[19]  Owen Kaser,et al.  Better bitmap performance with Roaring bitmaps , 2014, Softw. Pract. Exp..

[20]  Yinghua Qin,et al.  Systems and methods for integrated modeling of monitored virtual desktop infrastructure systems , 2015 .

[21]  Pankaj K. Agarwal,et al.  Top-k preferences in high dimensions , 2014, 2014 IEEE 30th International Conference on Data Engineering.

[22]  Owen Kaser,et al.  Sorting improves word-aligned bitmap indexes , 2010, Data Knowl. Eng..

[23]  Alejandro P. Buchmann,et al.  Encoded bitmap indexing for data warehouses , 1998, Proceedings 14th International Conference on Data Engineering.

[24]  Guadalupe Canahuate,et al.  On-demand aggregation of gridded data over user-specified spatio-temporal domains , 2016, SIGSPATIAL/GIS.