Before revision:  In this paper, we propose the Stellar tree, a topological data structure for performing efficient topological queries on simplicial and non-simplicial complexes . We prove that a Stellar tree provides a scalable, compact and flexible data structure to represent these complexes, using a fraction of the memory required by a corresponding topological data structure on the global complex .
After revision:  In this paper, we propose the Stellar tree, a topological data structure for performing efficient topological queries on simplicial and non-manifold simplicial complexes. As a proxy for larger applications, we describe how Stellar trees can be used to generate existing state-of-the-art topological data structures. In addition to faster generation times, the reduced memory requirements of a Stellar tree enable generating these data structures over large and high-dimensional complexes even on machines with limited resources .