The Community for Technology Leaders
Green Image
Issue No. 02 - Feb. (2016 vol. 28)
ISSN: 1041-4347
pp: 510-523
Mingjie Tang , Department of Computer Science, Purdue University, Indiana, IN
Ruby Y. Tahboub , Department of Computer Science, Purdue University, Indiana, IN
Walid G. Aref , Department of Computer Science, Purdue University, Indiana, IN
Mikhail J. Atallah , Department of Computer Science, Purdue University, Indiana, IN
Qutaibah M. Malluhi , KINDI Center for Computing Research, Qatar University, Doha-Qatar
Mourad Ouzzani , , Qatar Computing Research Institute, Doha-Qatar
Yasin N. Silva , School of Mathematical and Natural Science, Arizona State University, Tempe, AZ
The SQL group-by operator plays an important role in summarizing and aggregating large datasets in a data analytics stack. While the standard group-by operator, which is based on equality, is useful in several applications, allowing similarity aware grouping provides a more realistic view on real-world data that could lead to better insights. The Similarity SQL-based Group-By operator (SGB, for short) extends the semantics of the standard SQL Group-by by grouping data with similar but not necessarily equal values. While existing similarity-based grouping operators efficiently realize these approximate semantics, they primarily focus on one-dimensional attributes and treat multi-dimensional attributes independently. However, correlated attributes, such as in spatial data, are processed independently, and hence, groups in the multi-dimensional space are not detected properly. To address this problem, we introduce two new SGB operators for multi-dimensional data. The first operator is the clique (or distance-to-all) SGB, where all the tuples in a group are within some distance from each other. The second operator is the distance-to-any SGB, where a tuple belongs to a group if the tuple is within some distance from any other tuple in the group. Since a tuple may satisfy the membership criterion of multiple groups, we introduce three different semantics to deal with such a case: (i) eliminate the tuple, (ii) put the tuple in any one group, and (iii) create a new group for this tuple. We implement and test the new SGB operators and their algorithms inside PostgreSQL. The overhead introduced by these operators proves to be minimal and the execution times are comparable to those of the standard Group-by. The experimental study, based on TPC-H and a social check-in data, demonstrates that the proposed algorithms can achieve up to three orders of magnitude enhancement in performance over baseline methods developed to solve the same problem.
Semantics, Mobile handsets, Mobile ad hoc networks, Clustering algorithms, Logic gates, Indexes, Query processing

M. Tang et al., "Similarity Group-by Operators for Multi-Dimensional Relational Data," in IEEE Transactions on Knowledge & Data Engineering, vol. 28, no. 2, pp. 510-523, 2016.
629 ms
(Ver 3.3 (11022016))