PS-Tree-Based Efficient Boolean Expression Matching for High-Dimensional and Dense Workloads
Summary: PS-Tree enables 1D subscription indexing via disjoint predicate spaces. PSTBloom/PSTHash prune non-matches in high-dim workloads, delivering up to 84% faster matching, 78% faster index construction, 94% memory savings, and 92% gains for dense workloads. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Shuping Ji
- 2. Hans-Arno Jacobsen
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,587 | A-Tree: A Dynamic Data Structure for Efficiently Indexing Arbitrary Boolean Expressions | 2021 | SIGMOD | 4.4902253e-05 |
| 10,232 | Efficient Temporal Subgraph Management: A New Interval Index | 2026 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0032169493 |
| 129 | The X-tree: An Index Structure for High-Dimensional Data | 1996 | VLDB | 0.0004429571 |
| 500 | Filtering Algorithms and Implementation for Very Fast Publish/Subscribe Systems | 2001 | SIGMOD | 0.00021637423 |
| 2,949 | Indexing Boolean Expressions | 2009 | VLDB | 7.8340452e-05 |
| 3,224 | Practical Applications of Triggers and Constraints: Successes and Lingering Issues | 2000 | VLDB | 7.3496543e-05 |
| 5,391 | Scalable Ranked Publish/Subscribe | 2008 | VLDB | 5.533552e-05 |
| 5,582 | Efficiently Evaluating Complex Boolean Expressions | 2010 | SIGMOD | 5.4241353e-05 |
| 5,824 | End-to-End Support for Joins in Large-Scale Publish/Subscribe Systems | 2008 | VLDB | 5.3128962e-05 |
| 6,243 | BE-Tree: An Index Structure to Efficiently Match Boolean Expressions over High-dimensional Discrete Space | 2011 | SIGMOD | 5.1402191e-05 |
| 6,992 | An Efficient Publish/Subscribe Index for E-Commerce Databases | 2014 | VLDB | 4.8701339e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,332 | Persistent Bloom Filter: Membership Testing for the Entire History | 2018 | SIGMOD | 5.5662513e-05 |
| 8,178 | A Shifting Bloom Filter Framework for Set Queries | 2016 | VLDB | 4.5672537e-05 |
| 2,171 | Selectivity Estimation For Boolean Queries | 2000 | PODS | 9.3807165e-05 |
| 6,351 | SigMatch: Fast and Scalable Multi-Pattern Matching | 2010 | VLDB | 5.1005697e-05 |
| 651 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018648572 |
| 1,913 | BF-Tree: Approximate Tree Indexing | 2014 | VLDB | 0.00010113937 |
| 6,992 | An Efficient Publish/Subscribe Index for E-Commerce Databases | 2014 | VLDB | 4.8701339e-05 |
| 2,949 | Indexing Boolean Expressions | 2009 | VLDB | 7.8340452e-05 |
| 6,243 | BE-Tree: An Index Structure to Efficiently Match Boolean Expressions over High-dimensional Discrete Space | 2011 | SIGMOD | 5.1402191e-05 |
| 8,587 | A-Tree: A Dynamic Data Structure for Efficiently Indexing Arbitrary Boolean Expressions | 2021 | SIGMOD | 4.4902253e-05 |