A-Tree: A Dynamic Data Structure for Efficiently Indexing Arbitrary Boolean Expressions.
Shuping JiHans-Arno JacobsenPublished in: SIGMOD Conference (2021)
Keyphrases
- boolean expressions
- data structure
- insertions and deletions
- tree structure
- binary valued
- indexing structure
- index structure
- inverted lists
- normal form
- suffix tree
- inverted index
- information retrieval
- conjunctive queries
- query evaluation
- r tree
- quadtree
- indexing scheme
- database
- frequent patterns
- data management
- information retrieval systems
- indexing method
- mining frequent
- internal nodes
- object oriented
- query processing
- databases