Database Paper Browser

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
5893
Venue
SIGMOD
Year
2020
Pagerank
4.1945683e-05
Overall Rank
11,589 | 19.38%
DOI
10.1145/3318464.3386133

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
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