BE-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space

Mohammad Sadoghi, Hans-Arno Jacobsen. BE-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space. In Timos K. Sellis, Renée J. Miller, Anastasios Kementsietsidis, Yannis Velegrakis, editors, Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2011, Athens, Greece, June 12-16, 2011. pages 637-648, ACM, 2011. [doi]

Authors

Mohammad Sadoghi

This author has not been identified. Look up 'Mohammad Sadoghi' in Google

Hans-Arno Jacobsen

This author has not been identified. Look up 'Hans-Arno Jacobsen' in Google