Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{175740,
        author = {Sangeetham Lokesh and T. Lavanya},
        title = {A Hybrid Approach to Boolean Keyword Search: Combining B+ Tree Indexing with Distributed Query Processing},
        journal = {International Journal of Innovative Research in Technology},
        year = {2025},
        volume = {11},
        number = {11},
        pages = {4119-4122},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=175740},
        abstract = {Cloud data warehouses (CDWs) offer scalable storage and computational efficiency, but ensuring secure keyword searchability remains a challenge. This project proposes a Boolean keyword searchable encryption (BKSE) framework incorporating Partial Homomorphic Encryption (PHE), B+Tree indexing, and blockchain verification to enhance security, accuracy, and performance. The system facilitates Boolean search queries on encrypted data, ensuring secure, verifiable, and efficient keyword retrieval. Extension concepts introduce HMAC authentication to secure network packets and a multi-VM routing mechanism for faster query responses. These enhancements significantly improve security, integrity, and query processing efficiency in cloud-based data warehousing systems.},
        keywords = {Searchable Encryption, Boolean Keyword Search, Cloud Data Warehouse, Data Security},
        month = {April},
        }