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)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,611 | SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window | 2016 | VLDB | 6.0438331e-05 |
| 6,995 | An Efficient Publish/Subscribe Index for E-Commerce Databases | 2014 | VLDB | 4.8633927e-05 |
| 7,124 | Location-Aware Pub/Sub System: When Continuous Moving Queries Meet Dynamic Event Streams | 2015 | SIGMOD | 4.8193745e-05 |
| 8,583 | A-Tree: A Dynamic Data Structure for Efficiently Indexing Arbitrary Boolean Expressions | 2021 | SIGMOD | 4.4859208e-05 |
| 9,261 | PS-Tree-Based Efficient Boolean Expression Matching for High-Dimensional and Dense Workloads | 2019 | VLDB | 4.3648789e-05 |
| 10,232 | Efficient Temporal Subgraph Management: A New Interval Index | 2026 | VLDB | 4.1905499e-05 |
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
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,206 | Similarity Evaluation on Tree-structured Data | 2005 | SIGMOD | 7.3855924e-05 |
| 6,473 | Efficient Search of Multidimensional B-Trees | 1995 | VLDB | 5.0427056e-05 |
| 1,909 | BF-Tree: Approximate Tree Indexing | 2014 | VLDB | 0.00010123661 |
| 2,387 | Bed-Tree: An All-Purpose Index Structure for String Similarity Search Based on Edit Distance | 2010 | SIGMOD | 8.9075095e-05 |
| 4,669 | A General Solution of the n-dimensional B-tree Problem | 1995 | SIGMOD | 6.0039237e-05 |
| 3,530 | RE-Tree: An Efficient Index Structure for Regular Expressions | 2002 | VLDB | 7.0008977e-05 |
| 8,089 | Towards Designing and Learning Piecewise Space-Filling Curves | 2023 | VLDB | 4.5855593e-05 |
| 2,951 | Indexing Boolean Expressions | 2009 | VLDB | 7.8248136e-05 |
| 9,261 | PS-Tree-Based Efficient Boolean Expression Matching for High-Dimensional and Dense Workloads | 2019 | VLDB | 4.3648789e-05 |
| 8,583 | A-Tree: A Dynamic Data Structure for Efficiently Indexing Arbitrary Boolean Expressions | 2021 | SIGMOD | 4.4859208e-05 |