Abstract
High-frequency trading (HFT) systems generate and process vast volumes of financial data in real time, demanding scalable and efficient algorithms for data analysis. This study presents a comparative investigation of classical indexing techniques and modern stream processing algorithms for HFT data analysis
References
1. Stonebraker, M., & Çetintemel, U. (2005). "One Size Fits All": An Idea Whose Time Has Come and Gone. Proceedings of the 21st International Conference on Data Engineering, 2–11. https://doi.org/10.1109/ICDE.2005.1
2. PostgreSQL Documentation. (2025). Index Types. https://www.postgresql.org/docs/current/indexes-types.html
3. Dean, J., & Ghemawat, S. (2008). MapReduce: Simplified Data Processing on Large Clusters. Communications of the ACM, 51(1), 107–113.
4. Carbone, P., Katsifodimos, A., Ewen, S., Markl, V., Haridi, S., & Tzoumas, K. (2015). Apache Flink™: Stream and Batch Processing in a Single Engine. IEEE Data Engineering Bulletin, 38(4), 28–38.
5. Zaharia, M., Das, T., Li, H., Shenker, S., & Stoica, I. (2013). Discretized Streams: Fault-Tolerant Streaming Computation at Scale. Proceedings of the 24th ACM Symposium on Operating Systems Principles, 423–438.
6. LOBSTER Database. (2025). Order Book Data for Academic Research. https://lobsterdata.com/
7. Kreps, J., Narkhede, N., & Rao, J. (2011). Kafka: A Distributed Messaging System for Log Processing. Proceedings of the NetDB, 1–7.
8. PostgreSQL Documentation. (2025). Index Types. https://www.postgresql.org/docs/current/indexes-types.html
9. Pandas Development Team. (2025). pandas: Python Data Analysis Library. https://pandas.pydata.org/
10. Cormode, G., & Muthukrishnan, S. (2005). An Improved Data Stream Summary: The Count-Min Sketch and its Applications. Journal of Algorithms, 55(1), 58–75.
