AD+Tree: A Compact Adaptation of Dynamic AD-Trees for Efficient Machine Learning on Large Data Sets

Abstract

This paper introduces the AD+tree, a data structure for quickly counting the number of records that match conjunctive queries in a data set. The structure is useful for machine learning on large data sets. The AD+tree is an adaptation of the Dynamic AD-tree data structure W-We analyze the performance of AD+trees, comparing them to static AD-trees and Dynamic AD-trees. We show AD+trees maintain a very compact cache that enables them to handle queries on massively large data sets very efficiently even under complex, unstructured query patterns. © Springer-Verlag 2003.