Database Paper Browser

Back to papers

BE-Tree: An Index Structure to Efficiently Match Boolean Expressions over High-dimensional Discrete Space

Summary: BE-Tree: dynamic index for efficient Boolean-expr matching in high-dim discrete spaces. 2-phase space-cutting leverages discrete-domain properties; self-adjusting policies adapt to workloads; evaluation shows superiority over top Boolean indexes. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4419
Venue
SIGMOD
Year
2011
Pagerank
5.1402191e-05
Overall Rank
6,243 | 56.57%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers