DBScholar

Back to papers

Making Search Engines Faster by Lowering the Cost of Querying Business Rules Through FPGAs

Summary: Transforms BRMS rules into a non-deterministic finite automaton and maps it to FPGA to speed up MCT in airline search. Shows orders-of-magnitude speedups and potential 40% fewer machines, with on-prem and cloud validation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5955
Venue
SIGMOD
Year
2020
Pagerank
5.2528121e-05
Overall Rank
9,568 | 34.36%
DOI
10.1145/3318464.3386133

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{maschi_sigmod20,
        title = {{Making Search Engines Faster by Lowering the Cost of Querying Business Rules Through FPGAs}},
        author = {Maschi, Fabio and Owaida, Muhsen and Alonso, Gustavo and Casalino, Matteo and Hock-Koon, Anthony},
        series = {{SIGMOD} '20},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3318464.3386133},
        url = {https://dl.acm.org/doi/10.1145/3318464.3386133},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
10,223 Discovery of Denial Constraints with Hardware Acceleration 2026 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers