# Efficient Computation of Subspace Skyline over Categorical Domains

## TL;DR

This paper introduces new efficient algorithms for computing the skyline over categorical datasets, including large real-world data, significantly outperforming existing methods in speed and scalability.

## Contribution

The paper presents novel algorithms, ST-S, ST-P, and TA-SKY, for skyline discovery over categorical attributes, addressing limitations of prior small-attribute algorithms and leveraging sorted lists.

## Key findings

- Algorithms outperform existing methods by orders of magnitude.
- TA-SKY is optimized for interactive applications.
- Extensive experiments validate the algorithms' practicality.

## Abstract

Platforms such as AirBnB, Zillow, Yelp, and related sites have transformed the way we search for accommodation, restaurants, etc. The underlying datasets in such applications have numerous attributes that are mostly Boolean or Categorical. Discovering the skyline of such datasets over a subset of attributes would identify entries that stand out while enabling numerous applications. There are only a few algorithms designed to compute the skyline over categorical attributes, yet are applicable only when the number of attributes is small. In this paper, we place the problem of skyline discovery over categorical attributes into perspective and design efficient algorithms for two cases. (i) In the absence of indices, we propose two algorithms, ST-S and ST-P, that exploits the categorical characteristics of the datasets, organizing tuples in a tree data structure, supporting efficient dominance tests over the candidate set. (ii) We then consider the existence of widely used precomputed sorted lists. After discussing several approaches, and studying their limitations, we propose TA-SKY, a novel threshold style algorithm that utilizes sorted lists. Moreover, we further optimize TA-SKY and explore its progressive nature, making it suitable for applications with strict interactive requirements. In addition to the extensive theoretical analysis of the proposed algorithms, we conduct a comprehensive experimental evaluation of the combination of real (including the entire AirBnB data collection) and synthetic datasets to study the practicality of the proposed algorithms. The results showcase the superior performance of our techniques, outperforming applicable approaches by orders of magnitude.