A-Tree: A Dynamic Data Structure for Efficiently Indexing Arbitrary Boolean Expressions

Summary: Proposes A-Tree, a dynamic, multirooted index for arbitrary Boolean expressions that shares predicates and subexpressions to avoid exponential expansion. Self-adjusting, with event-matching optimizations, it outperforms existing arbitrary- and conjunctive-expression matchers in memory, time, and index construction. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 6219
Venue: SIGMOD
Year: 2021
Pagerank: 5.409313e-05
Overall Rank: 8,577 | 41.16%
DOI: 10.1145/3448016.3457266

Incoming Non-self Citations Over Time

Authors

1. Shuping Ji (Institute of Software, Chinese Academy of Sciences)
2. Hans-Arno Jacobsen (University of Toronto)

BibTeX Citation

@inproceedings{ji_sigmod21,
        title = {{A-Tree: A Dynamic Data Structure for Efficiently Indexing Arbitrary Boolean Expressions}},
        author = {Ji, Shuping and Jacobsen, Hans-Arno},
        series = {{SIGMOD} '21},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3448016.3457266},
        url = {https://dl.acm.org/doi/10.1145/3448016.3457266},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,893	Optimizing Disjunctive Queries with Tagged Execution	2024	SIGMOD	5.3504579e-05
10,520	Efficient Temporal Subgraph Management: A New Interval Index	2026	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 18 of 18 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
229	High-Performance Complex Event Processing over Streams	2006	SIGMOD	0.00023927582
362	Storing and Querying Ordered XML Using a Relational Database System	2002	SIGMOD	0.00020125068
441	Filtering Algorithms and Implementation for Very Fast Publish/Subscribe Systems	2001	SIGMOD	0.00018407547
719	ORDPATHs: Insert-Friendly XML Node Labels	2004	SIGMOD	0.00014637695
1,005	ZStream: A Cost-based Query Processor for Adaptively Detecting Composite Events	2009	SIGMOD	0.000126998
1,362	Execution Strategies for SQL Subqueries	2007	SIGMOD	0.00011032204
2,314	SASE: Complex Event Processing over Streams	2007	CIDR	8.7619735e-05
2,495	A Predicate Matching Algorithm for Database Rule Systems	1990	SIGMOD	8.5034389e-05
2,739	Indexing Boolean Expressions	2009	VLDB	8.1872509e-05
2,867	Cayuga: A High-Performance Event Processing Engine	2007	SIGMOD	8.016634e-05
3,352	Scalable Pattern Sharing on Event Streams	2016	SIGMOD	7.4932699e-05
3,528	Practical Applications of Triggers and Constraints: Successes and Lingering Issues	2000	VLDB	7.3411417e-05
4,942	Active Complex Event Processing over Event Streams	2011	VLDB	6.4333059e-05
5,199	Efficiently Evaluating Complex Boolean Expressions	2010	SIGMOD	6.3216824e-05
5,517	Scalable Ranked Publish/Subscribe	2008	VLDB	6.1889819e-05
6,016	BE-Tree: An Index Structure to Efficiently Match Boolean Expressions over High-dimensional Discrete Space	2011	SIGMOD	6.0082425e-05
6,861	An Efficient Publish/Subscribe Index for E-Commerce Databases	2014	VLDB	5.7517379e-05
9,400	PS-Tree-Based Efficient Boolean Expression Matching for High-Dimensional and Dense Workloads	2019	VLDB	5.2755515e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	10,093	AB-tree: Index for Concurrent Random Sampling and Updates	2022	VLDB
2	6,832	A Scalable Index for Top-k Subtree Similarity Queries	2019	SIGMOD
3	7,524	Efficient Indexing and Querying over Syntactically Annotated Trees	2012	VLDB
4	1,778	The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation	2000	VLDB
5	5,298	Efficient Processing of XML Twig Queries with OR-Predicates	2004	SIGMOD
6	5,199	Efficiently Evaluating Complex Boolean Expressions	2010	SIGMOD
7	3,742	RE-Tree: An Efficient Index Structure for Regular Expressions	2002	VLDB
8	2,739	Indexing Boolean Expressions	2009	VLDB
9	9,400	PS-Tree-Based Efficient Boolean Expression Matching for High-Dimensional and Dense Workloads	2019	VLDB
10	6,016	BE-Tree: An Index Structure to Efficiently Match Boolean Expressions over High-dimensional Discrete Space	2011	SIGMOD