Advances in Indexing Techniques for Database Systems a Systematic Literature Review
References
- Bayer, R., & McCreight, E. (1972). Organization and maintenance of large ordered indexes. Acta Informatica, 1(3), 173–189.
- Chang, F., Dean, J., Ghemawat, S., et al. (2008). Bigtable: A distributed storage system for structured data. ACM Transactions on Computer Systems, 26(2), Article 4.
- Comer, D. (1979). Ubiquitous B-tree. ACM Computing Surveys, 11(2), 121–137.
- Date, C. J. (2003). An Introduction to Database Systems (8th ed.). Addison-Wesley.
- Ding, J., Minhas, U. F., Yu, J., et al. (2020). ALEX: An updatable adaptive learned index. Proc. ACM SIGMOD, 969–984.
- Elmasri, R., & Navathe, S. B. (2010). Fundamentals of Database Systems (6th ed.). Addison-Wesley.
- Fagin, R., Nievergelt, J., Pippenger, N., & Strong, H. R. (1979). Extendible hashing. ACM TODS, 4(3), 315–344.
- Ferragina, P., & Vinciguerra, G. (2020). The PGM-index: A fully-dynamic compressed learned index. PVLDB, 13(8), 1162–1175.
- Graefe, G. (2011). Modern B-tree techniques. Foundations and Trends in Databases, 3(4), 203–402.
- Hellerstein, J. M., Stonebraker, M., & Hamilton, J. (2007). Architecture of a database system. Foundations and Trends in Databases, 1(2), 141–259.
- Idreos, S., Dayan, N., Qin, W., et al. (2019). Learning data structure alchemy. IEEE TCDE Bulletin, 42(2), 4–14.
- Knuth, D. E. (1998). The Art of Computer Programming, Vol. 3 (2nd ed.). Addison-Wesley.
- Kraska, T., Beutel, A., Chi, E. H., Dean, J., & Polyzotis, N. (2018). The case for learned index structures. Proc. ACM SIGMOD, 489–504.
- Litwin, W. (1980). Linear hashing: A new tool for file and table addressing. Proc. 6th VLDB, 212–223.
- Manning, C. D., Raghavan, P., & Schütze, H. (2008). Introduction to Information Retrieval. Cambridge University Press.
- Marcus, R., Negi, P., Mao, H., et al. (2021). Bao: Making learned query optimization practical. Proc. ACM SIGMOD, 1275–1288.
- Melnik, S., Gubarev, A., Long, J. J., et al. (2010). Dremel: Interactive analysis of web-scale datasets. PVLDB, 3(1–2), 330–339.
- O’Neil, P., & Quass, D. (1997). Improved query performance with variant indexes. Proc. ACM SIGMOD, 38–49.
- O’Neil, P., Cheng, E., Gawlick, D., & O’Neil, E. (1996). The log-structured merge-tree (LSM-tree). Acta Informatica, 33(4), 351–385.
- Ramakrishnan, R., & Gehrke, J. (2003). Database Management Systems (3rd ed.). McGraw-Hill.
- Sadalage, P. J., & Fowler, M. (2012). NoSQL Distilled. Addison-Wesley.
Language: English
Page range: 51 - 54
Published on: Mar 3, 2026
Published by: Valahia University of Targoviste
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year
Keywords:
Related subjects:
© 2026 Ionut-Adrian Tudoroiu, published by Valahia University of Targoviste
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.