Analysis and optimization for boolean expression indexing

DOI10.1145/2487259.2487260zbMATH Open1321.68257OpenAlexW2053495332MaRDI QIDQ2943530FDOQ2943530

Authors: Mohammad Sadoghi, H.-Arno Jacobsen 

Publication date: 3 September 2015

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2487259.2487260

Recommendations

• scientific article; zbMATH DE number 3843184
• scientific article; zbMATH DE number 1945905
• The DR-tree: A main memory data structure for complex multi-dimensional objects
• Enhancing the \(B^{+}\)-tree by dynamic node popularity caching
• Lazy Execution of Boolean Queries

zbMATH Keywords

data structurecomplex event processingBoolean expressionspublish/subscribe

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05)

This page was built for publication: Analysis and optimization for boolean expression indexing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943530)