Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-26T20:52:36.032Z Has data issue: false hasContentIssue false

References

Published online by Cambridge University Press:  21 November 2024

Xiaodong Zhang  and
Rubao Lee
Xiaodong Zhang
Affiliation:
The Ohio State University
Rubao Lee
Affiliation:
The Ohio State University
Get access
Type
Chapter
Information
Data Management
Interactions with Computer Architecture and Systems
 , pp. 270 - 278
Publisher: Cambridge University Press
Print publication year: 2024

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Abadi, Daniel, Boncz, Peter, Amiato, Stavros Harizopoulos, Idreos, Stratos, and Madden, Samuel. The Design and Implementation of Modern Column-Oriented Database Systems. Now, 2013.Google Scholar
Abadi, Daniel J., Myers, Daniel S., DeWitt, David J., and Madden, Samuel R.. Materialization strategies in a column-oriented DBMS. In 2007 IEEE 23rd International Conference on Data Engineering, pages 466–475. IEEE, 2007.CrossRefGoogle Scholar
Acharya, Trilok and Ladlow, Meggie. Cache replacement algorithms in hardware. Technical report, Swarthmore College, 2008.Google Scholar
Aho, Alfred V., Denning, Peter J., and Ullman, Jeffrey D.. Principles of optimal page replacement. Journal of the ACM (JACM), 18(1):80–93, 1971.CrossRefGoogle Scholar
Ailamaki, Anastassia, DeWitt, David J., Hill, Mark D., and Skounakis, Marios. Weaving relations for cache performance. In VLDB, volume 1, pages 169–180, 2001.Google Scholar
Ambrosia, John D’ and Nowell, Mark. IEEE P802.3df 200 Gb/s, 400 Gb/s, 800 Gb/s, and 1.6 Tb/s Ethernet Task Force, 2022. www.ieee802.org/3/df/index.html.Google Scholar
Astrachan, Owen. Bubble sort: An archaeological algorithmic analysis. ACM Sigcse Bulletin, 35(1):1–5, 2003.CrossRefGoogle Scholar
Athanassoulis, Manos, Kester, Michael S., Maas, Lukas M., et al. Designing access methods: The RUM conjecture. In EDBT, volume 2016, pages 461–466, 2016.Google Scholar
Baibich, M. N., Broto, J. M., Fert, A., et al. Giant magnetoresistance of (001)Fe/(001)Cr magnetic superlattices. Physical Review Letters, 61:2472–2475, Nov. 1988. https://doi.org/10.1103/PhysRevLett.61.2472.CrossRefGoogle Scholar
Balkesen, Cagri, Alonso, Gustavo, Teubner, Jens, and Özsu, M. Tamer. Multi-core, main-memory joins: Sort vs. hash revisited. Proceedings of the VLDB Endowment, 7(1): 85–96, 2013.CrossRefGoogle Scholar
Barroso, Luiz André, Clidaras, Jimmy, and Hölzle, Urs. The Datacentre as a Computer: An Introduction to the Design of Warehouse-Scale Machines, 2nd ed. Synthesis Lectures on Computer Architecture. Morgan & Claypool Publishers, 2013.CrossRefGoogle Scholar
Batcher, Kenneth E.. Sorting networks and their applications. In Proceedings of the April 30–May 2, 1968, Spring Joint Computer Conference, pages 307–314, 1968.CrossRefGoogle Scholar
Bayer, Rudolf. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica, 1(4):290–306, 1972.CrossRefGoogle Scholar
Bayer, Rudolf and McCreight, Edward. Organization and maintenance of large ordered indexes. In Software Pioneers, pages 245–262. Springer, 2002.CrossRefGoogle Scholar
Beckmann, Norbert, Kriegel, Hans-Peter, Schneider, Ralf, and Seeger, Bernhard. The R*-tree: An efficient and robust access method for points and rectangles. In Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, pages 322–331, 1990.CrossRefGoogle Scholar
Belady, Laszlo A.. A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal, 5(2):78–101, 1966.CrossRefGoogle Scholar
Bershad, Brian N., Lee, Dennis, Romer, Theodore H., and Chen, J. Bradley. Avoiding conflict misses dynamically in large direct-mapped caches. In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems, pages 158–170, 1994.CrossRefGoogle Scholar
Beyls, Kristof and D’Hollander, Erik. Reuse distance as a metric for cache behavior. In Proceedings of the IASTED Conference on Parallel and Distributed Computing and Systems, volume 14, pages 350–360. Citeseer, 2001.Google Scholar
Birrell, Andrew D. and Nelson, Bruce Jay. Implementing remote procedure calls. ACM Transactions on Computer Systems (TOCS), 2(1):39–59, 1984.CrossRefGoogle Scholar
Blacher, Mark, Giesen, Joachim, Laue, Sören, Klaus, Julien, and Leis, Viktor. Machine learning, linear algebra, and more: Is SQL all you need? CIDR. www.cidrdb.org, pages 1–6, 2022.CrossRefGoogle Scholar
Blake, Geoffrey, Dreslinski, Ronald G., and Mudge, Trevor. A survey of multicore processors. IEEE Signal Processing Magazine, 26(6):26–37, 2009.CrossRefGoogle Scholar
Boncz, Peter A., Manegold, Stefan, and Kersten, Martin L.. Database architecture optimized for the new bottleneck: Memory access. In Proceedings of the 25th International Conference on Very Large Data Bases, pages 54–65, 1999.Google Scholar
Brock, David C. and Moore, Gordon E.. Understanding Moore’s Law: Four Decades of Innovation. Chemical Heritage Foundation, 2006.Google Scholar
Burks, Alice R. and Burks, Arthur Walter. The First Electronic Computer: The Atanasoff Story. University of Michigan Press, 1989.Google Scholar
Burks, Arthur W. and Burks, Alice R.. Atanasoff–Berry computer. In Encyclopedia of Computer Science, pages 108–109, 2003.Google Scholar
Burstein, Idan. Nvidia data center processing unit (DPU) architecture. In 2021 IEEE Hot Chips 33 Symposium (HCS), pages 1–20. IEEE, 2021.Google Scholar
Butt, Ali R., Gniady, Chris, and Hu, Y. Charlie. The performance impact of kernel prefetching on buffer cache replacement algorithms. In Proceedings of the 2005 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pages 157–168, 2005.CrossRefGoogle Scholar
Caen, Francois and Negus, Christopher. BSD Unix® Toolbox: 1000+ Commands for FreeBSD®, OpenBSD, and NetBSD®. John Wiley & Sons, 2008.Google Scholar
Cartas, Cosmin. Rust – the programming language for every industry. Academy of Economic Studies. Economy Informatics, 19(1):45–51, 2019.Google Scholar
Cederman, Daniel and Tsigas, Philippas. GPU-quicksort: A practical quicksort algorithm for graphics processors. Journal of Experimental Algorithmics (JEA), 14:1–4, 2010.Google Scholar
Ceruzzi, Paul E.. The early computers of Konrad Zuse, 1935 to 1945. Annals of the History of Computing, 3(3):241–262, 1981.CrossRefGoogle Scholar
Chang, Fay, Dean, Jeffrey, Ghemawat, Sanjay, et al. BigTable: A distributed storage system for structured data. ACM Transactions on Computer Systems (TOCS), 26(2): 1–26, 2008.CrossRefGoogle Scholar
Chen, Feng, Koufaty, David A., and Zhang, Xiaodong. Hystor: Making the best use of solid state drives in high performance storage systems. In Proceedings of the International Conference on Supercomputing, pages 22–32, 2011.CrossRefGoogle Scholar
Chen, Feng, Lee, Rubao, and Zhang, Xiaodong. Essential roles of exploiting internal parallelism of flash memory based solid state drives in high-speed data processing. In 2011 IEEE 17th International Symposium on High Performance Computer Architecture, pages 266–277. IEEE, 2011.CrossRefGoogle Scholar
Chu, Ching-Hsiang, Potluri, Sreeram, Goswami, Anshuman, et al. Designing high-performance in-memory key–value operations with persistent gpu kernels and openshmem. In Workshop on OpenSHMEM and Related Technologies, pages 148–164. Springer, 2018.Google Scholar
Codish, Michael, Cruz-Filipe, Luís, Ehlers, Thorsten, Müller, Mike, and Schneider-Kamp, Peter. Sorting networks: To the end and back again. Journal of Computer and System Sciences, 104:184–201, 2019.CrossRefGoogle Scholar
Comer, Douglas. Ubiquitous B-tree. ACM Computing Surveys (CSUR), 11(2):121–137, 1979.CrossRefGoogle Scholar
Cooper, Lee A. D., Kong, Jun, Gutman, David A., et al. Integrated morphologic analysis for the identification and characterization of disease subtypes. Journal of the American Medical Informatics Association, 19(2):317–323, 2012.CrossRefGoogle Scholar
Copeland, George P. and Khoshafian, Setrag N.. A decomposition storage model. ACM Sigmod Record, 14(4):268–279, 1985.CrossRefGoogle Scholar
Corbato, Fernando J.. A paging experiment with the Multics system. Technical report, Massachusetts Institute of Technology, Cambridge, Project MAC, 1968.Google Scholar
Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C.. Introduction to Algorithms, 2nd ed. The MIT Press, 2001.Google Scholar
Dan, Asit and Towsley, Don. An approximate analysis of the LRU and FIFO buffer replacement schemes. In Proceedings of the 1990 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 143–152, 1990.CrossRefGoogle Scholar
Dennard, Robert H.. How we made DRAM. Nature Electronics, 1(6):372–372, 2018.CrossRefGoogle Scholar
Denning, Peter J.. The working set model for program behavior. Communications of the ACM, 11(5): 323–333, 1968.CrossRefGoogle Scholar
Denning, Peter J.. The locality principle. Communications of the ACM, 48(7): 19–24, 2005.CrossRefGoogle Scholar
Ding, Chen and Zhong, Yutao. Predicting whole-program locality through reuse distance analysis. In Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation, pages 245–257, 2003.CrossRefGoogle Scholar
Ding, Xiaoning, Jiang, Song, Chen, Feng, Davis, Kei, and Zhang, Xiaodong. Diskseen: Exploiting disk layout and access history to enhance I/O prefetch. In USENIX Annual Technical Conference, volume 7, pages 261–274, 2007.Google Scholar
Dragojević, Aleksandar, Narayanan, Dushyanth, Castro, Miguel, and Hodson, Orion. Farm: Fast remote memory. In 11th USENIX Symposium on Networked Systems Design and Implementation (NSDI 14), pages 401–414, 2014.Google Scholar
Dragoni, Nicola, Giallorenzo, Saverio, Lafuente, Alberto Lluch, et al. Microservices: yesterday, today, and tomorrow. Present and Ulterior Software Engineering, pages 195–216, 2017.CrossRefGoogle Scholar
Einziger, Gil, Friedman, Roy, and Manes, Ben. TinyLFU: A highly efficient cache admission policy. ACM Transactions on Storage (ToS), 13(4):1–31, 2017.CrossRefGoogle Scholar
Ester, Martin, Kriegel, Hans-Peter, Sander, Jörg, and Xu, Xiaowei. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, KDD’96, page 226–231. AAAI Press, 1996.Google Scholar
Floratos, Sofoklis, Xiao, Mengbai, Wang, Hao, et al. NestGPU: Nested query processing on GPU. In 2021 IEEE 37th International Conference on Data Engineering (ICDE), pages 1008–1019. IEEE, 2021.CrossRefGoogle Scholar
Giovinazzo, William A.. Object-Oriented Data Warehouse Design: Building a Star Schema. Prentice Hall PTR, 2000.Google Scholar
GitHub. RDMA core userspace libraries and daemons, 2022. https://github.com/linux-rdma/rdma-core.Google Scholar
Google. Introducing GRPC, a new open source http/2 RPC framework, 2015. https://developers.googleblog.com/2015/02/introducing-grpc-new-open-source-http2.html.Google Scholar
Graefe, Goetz. Sort-merge-join: An idea whose time has (h) passed? In Proceedings of 1994 IEEE 10th International Conference on Data Engineering, pages 406–417. IEEE, 1994.CrossRefGoogle Scholar
Gray, Jim and Putzolu, Franco. The 5 minute rule for trading memory for disc accesses and the 10 byte rule for trading memory for CPU time. ACM SIGMOD Record, 16(3), 1987. https://doi.org/10.1145/38714.38755.CrossRefGoogle Scholar
Green, Oded, McColl, Robert, and Bader, David A.. GPU merge path: A GPU merging algorithm. In Proceedings of the 26th ACM International Conference on Supercomputing, pages 331–340, 2012.CrossRefGoogle Scholar
Habermann, A. Nico. Parallel Neighbor-Sort (or the Glory of the Induction Principle). Defense Technical Information Center, 1972.Google Scholar
Hankins, Richard A. and Patel, Jignesh M.. Data morphing: An adaptive, cache-conscious storage technique. In Proceedings of the 2003 VLDB Conference, pages 417–428. Elsevier, 2003.CrossRefGoogle Scholar
Harris, Tim J.. A survey of PRAM simulation techniques. ACM Computing Surveys (CSUR), 26(2):187–206, 1994.CrossRefGoogle Scholar
He, Yongqiang, Lee, Rubao, Huai, Yin, et al. RCFile: A fast and space-efficient data placement structure in MapReduce-based warehouse systems. In 2011 IEEE 27th International Conference on Data Engineering, pages 1199–1208. IEEE, 2011.CrossRefGoogle Scholar
Henneberg, Justus and Schuhknecht, Felix. RTIndeX: Exploiting hardware-accelerated GPU raytracing for database indexing. Proceedings of the VLDB Endowment, 16(13): 4268–4281, Sept. 2023. https://doi.org/10.14778/3625054.3625063.CrossRefGoogle Scholar
Hennessy, John L. and Patterson, David A.. Computer Architecture: A Quantitative Approach. Elsevier, 2011.Google Scholar
Herlihy, Maurice, Shavit, Nir, and Tzafrir, Moran. Hopscotch hashing. In Distributed Computing: 22nd International Symposium, DISC 2008, Arcachon, France, September 22–24, 2008. Proceedings 22, pages 350–364. Springer, 2008.CrossRefGoogle Scholar
Hill, Mark D.. A case for direct-mapped caches. Computer, 21(12):25–40, 1988.CrossRefGoogle Scholar
Hill, Mark D. and Smith, Alan Jay. Evaluating associativity in CPU caches. IEEE Transactions on Computers, 38(12):1612–1630, 1989.CrossRefGoogle Scholar
Horadam, A. F.. A generalized Fibonacci sequence. The American Mathematical Monthly, 68(5):455–459, 1961.CrossRefGoogle Scholar
Huai, Yin, Ma, Siyuan, Lee, Rubao, O’Malley, Owen, and Zhang, Xiaodong. Understanding insights into the basic structure and essential issues of table placement methods in clusters. Proceedings of the VLDB Endowment, 6(14):1750–1761, 2013.CrossRefGoogle Scholar
Jacob, Bruce, Wang, David, and Ng, Spencer. Memory Systems: Cache, DRAM, Disk. Morgan Kaufmann, 2010.Google Scholar
Jagadish, H. V., Narayan, P. P. S., Seshadri, Sridhar, Sudarshan, S., and Kanneganti, Rama. Incremental organization for data recording and warehousing. In VLDB, volume 97, pages 16–25. Citeseer, 1997.Google Scholar
Jaleel, Aamer, Theobald, Kevin B., Steely, Simon C. Jr., and Emer, Joel. High performance cache replacement using re-reference interval prediction (RRIP). ACM SIGARCH Computer Architecture News, 38(3):60–71, 2010.CrossRefGoogle Scholar
Jiang, Song and Zhang, Xiaodong. LIRS: An efficient low inter-reference recency set replacement policy to improve buffer cache performance. ACM SIGMETRICS Performance Evaluation Review, 30(1):31–42, 2002.CrossRefGoogle Scholar
Jiang, Song, Chen, Feng, and Zhang, Xiaodong. Clock-pro: An effective improvement of the clock replacement. In USENIX Annual Technical Conference, General Track, pages 323–336, 2005.Google Scholar
Jiang, Song, Ding, Xiaoning, Chen, Feng, Tan, Enhua, and Zhang, Xiaodong. DULO: an effective buffer cache management scheme to exploit both temporal and spatial locality. In Proceedings of the 4th Conference on USENIX Conference on File and Storage Technologies, volume 4, page 8, 2005.Google Scholar
Johnson, Theodore, Shasha, Dennis, et al. 2Q: A low overhead high performance buffer management replacement algorithm. In Proceedings of the 20th International Conference on Very Large Data Bases, pages 439–450. Citeseer, 1994.Google Scholar
Jouppi, Norman P., Young, Cliff, Patil, Nishant, et al. In-datacenter performance analysis of a tensor processing unit. In Proceedings of the 44th Annual International Symposium on Computer Architecture, pages 1–12, 2017.Google Scholar
Kamel, Ibrahim and Faloutsos, Christos. Hilbert R-tree: An improved R-tree using fractals. In Proceedings of the 20th International Conference on Very Large Data Bases, pages 500–509, 1994.Google Scholar
Kanus, Urs, Wetekam, Gregor, Hirche, Johannes, and Meißner, Michael. VIZARD II: An FPGA-based interactive volume rendering system. In Field-Programmable Logic and Applications: Reconfigurable Computing Is Going Mainstream: 12th International Conference, FPL 2002 Montpellier, France, September 2–4, 2002 Proceedings 12, pages 1114–1117. Springer, 2002.Google Scholar
Kessler, Richard E. and Hill, Mark D.. Page placement algorithms for large real-indexed caches. ACM Transactions on Computer Systems (TOCS), 10(4):338–359, 1992.CrossRefGoogle Scholar
Kim, Changkyu, Kaldewey, Tim, Lee, Victor W., et al. Sort vs. hash revisited: Fast join implementation on modern multi-core CPUs. Proceedings of the VLDB Endowment, 2 (2):1378–1389, 2009.CrossRefGoogle Scholar
Kirk, David B. and Hwu, Wen-mei W.. Programming Massively Parallel Processors: A Hands-On Approach. Morgan Kaufmann, 2012.Google Scholar
LaMarca, Anthony and Ladner, Richard E.. The influence of caches on the performance of sorting. Journal of Algorithms, 31(1):66–104, 1999.CrossRefGoogle Scholar
Lattner, Chris and Adve, Vikram. LLVM: A compilation framework for lifelong program analysis & transformation. In International Symposium on Code Generation and Optimization, 2004, CGO 2004, pages 75–86. IEEE, 2004.CrossRefGoogle Scholar
Nguyen, Hubert. GPU Gems 3. Addison-Wesley Professional, 2007.Google Scholar
Lee, Donghee, Choi, Jongmoo, Kim, Jong-Hun, et al. On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies. In Proceedings of the 1999 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pages 134–143, 1999.CrossRefGoogle Scholar
Lee, Rubao, Ding, Xiaoning, Chen, Feng, Lu, Qingda, and Zhang, Xiaodong. MCC-DB: Minimizing cache conflicts in multi-core processors for databases. Proceedings of the VLDB Endowment, 2(1):373–384, 2009.CrossRefGoogle Scholar
Lee, Rubao, Zhou, Minghong, Li, Chi, et al. The art of balance: A RateupDB™ experience of building a CPU/GPU hybrid database product. Proceedings of the VLDB Endowment, 14(12):2999–3013, 2021.CrossRefGoogle Scholar
Leischner, Nikolaj, Osipov, Vitaly, and Sanders, Peter. GPU sample sort. In 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), pages 1–10. IEEE, 2010.Google Scholar
Leiserson, Charles E., Thompson, Neil C., Emer, Joel S., et al. There’s plenty of room at the Top: What will drive computer performance after Moore’s law? Science, 368(6495), 2020.CrossRefGoogle Scholar
Li, Bojie, Ruan, Zhenyuan, Xiao, Wencong, et al. KV-Direct: High-performance in-memory key-value store with programmable NIC. In Proceedings of the 26th Symposium on Operating Systems Principles, pages 137–152, 2017.CrossRefGoogle Scholar
Lin, Jiang, Lu, Qingda, Ding, Xiaoning, et al. Gaining insights into multicore cache partitioning: Bridging the gap between simulation and real systems. In 2008 IEEE 14th International Symposium on High Performance Computer Architecture, pages 367–378. IEEE, 2008.Google Scholar
Luna, Frank. Introduction to 3D Game Programming with DirectX 11. Mercury Learning and Information, 2012.CrossRefGoogle Scholar
Luo, Chen and Carey, Michael J.. LSM-based storage techniques: A survey. The VLDB Journal, 29(1):393–418, 2020.CrossRefGoogle Scholar
Mattson, Richard L., Gecsei, Jan, Slutz, Donald R., and Traiger, Irving L.. Evaluation techniques for storage hierarchies. IBM Systems Journal, 9(2):78–117, 1970.CrossRefGoogle Scholar
Mauerer, Wolfgang. Professional Linux Kernel Architecture. John Wiley & Sons, 2010.Google Scholar
McLuckie, Keith and Barber, Angus. Tournament sort. In Sorting Routines for Microcomputers, pages 68–86. Springer, 1986.CrossRefGoogle Scholar
Megiddo, Nimrod and Modha, Dharmendra S.. Arc: A self-tuning, low overhead replacement cache. In Fast, volume 3, pages 115–130, 2003.Google Scholar
Meyer, Ulrich, Sanders, Peter, and Sibeyn, Jop (eds.). Algorithms for Memory Hierarchies: Advanced Lectures, volume 2625. Springer Science & Business Media, 2003.Google Scholar
Munshi, Aaftab. The OpenCL specification. In 2009 IEEE Hot Chips 21 Symposium (HCS), pages 1–314. IEEE, 2009.Google Scholar
Nagarajan, Vani and Kulkarni, Milind. RT-DBSCAN: Accelerating DBSCAN using ray tracing hardware. In Proceedings of 2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS’23), pages 963–973. IEEE, 2023.Google Scholar
Nickolls, John and Dally, William J.. The GPU computing era. IEEE Micro, 30(2):56–69, 2010.CrossRefGoogle Scholar
Nishimura, Hitoshi, Ohno, Hiroshi, Kawata, Toru, Shirakawa, Isao, and Omura, Koichi. LINKS-1 – a parallel pipelined multimicrocomputer system for image creation. ACM SIGARCH Computer Architecture News, 11(3):387–394, 1983.CrossRefGoogle Scholar
Nvidia. CUDA toolkit documentation. 2018.Google Scholar
Nvidia. Nvidia Turing GPU architecture. 2018.Google Scholar
Nvidia. Nvidia Ampere ga102 GPU architecture. 2021.Google Scholar
Nvidia. Nvidia Ada GPU architecture. 2022.Google Scholar
Nvidia. Nvidia Optix 8.0 programming guide. 2023.Google Scholar
O’Neil, Elizabeth J., O’Neil, Patrick E., and Weikum, Gerhard. The LRU-K page replacement algorithm for database disk buffering. ACM Sigmod Record, 22(2): 297–306, 1993.CrossRefGoogle Scholar
O’Neil, Patrick, Cheng, Edward, Gawlick, Dieter, and O’Neil, Elizabeth. The log-structured merge-tree (LSM-tree). Acta Informatica, 33(4):351–385, 1996.CrossRefGoogle Scholar
Ousterhout, John, Gopalan, Arjun, Gupta, Ashish, et al. The RAMCloud storage system. ACM Transactions on Computer Systems, 33(3), 2015. https://doi.org/10.1145/2806887.CrossRefGoogle Scholar
Pagh, Rasmus and Rodler, Flemming Friche. Cuckoo hashing. Journal of Algorithms, 51 (2):122–144, 2004.CrossRefGoogle Scholar
Pilman, Markus, Bocksrocker, Kevin, Braun, Lucas, Marroquin, Renato, and Kossmann, Donald. Fast scans on key–value stores. Proceedings of the VLDB Endowment, 10 (11):1526–1537, 2017.CrossRefGoogle Scholar
Qin, An, Xiao, Mengbai, Ma, Jin, et al. Directload: A fast web-scale index system across large regional centers. In 2019 IEEE 35th International Conference on Data Engineering (ICDE), pages 1790–1801. IEEE, 2019.CrossRefGoogle Scholar
Rixner, Scott, Dally, William J., Kapasi, Ujval J., Mattson, Peter, and Owens, John D.. Memory access scheduling. ACM SIGARCH Computer Architecture News, 28 (2):128–138, 2000. https://doi.org/10.1145/342001.339668.CrossRefGoogle Scholar
Robinson, John T. and Devarakonda, Murthy V.. Data cache management using frequency-based replacement. In Proceedings of the 1990 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 134–142, 1990.CrossRefGoogle Scholar
Satish, Nadathur, Harris, Mark, and Garland, Michael. Designing efficient sorting algorithms for manycore GPUs. In 2009 IEEE International Symposium on Parallel & Distributed Processing, pages 1–10. IEEE, 2009.Google Scholar
Schindler, Jiri, Griffin, John Linwood, Lumb, Christopher R., and Ganger, Gregory R.. Track-aligned extents: Matching access patterns to disk drive characteristics. In FAST, volume 2, pages 259–274, 2002.Google Scholar
Sellers, Graham and Kessenich, John. Vulkan Programming Guide: The Official Guide to Learning Vulkan. Addison-Wesley Professional, 2016.Google Scholar
Shatdal, Ambuj, Kant, Chander, and Naughton, Jeffrey F.. Cache conscious algorithms for relational query processing. In Proceedings of the 20th International Conference on Very Large Data Bases, pages 510–521, 1994.Google Scholar
Shvachko, Konstantin, Kuang, Hairong, Radia, Sanjay, and Chansler, Robert. The Hadoop distributed file system. In 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST), pages 1–10. IEEE, 2010.Google Scholar
Smaragdakis, Yannis, Kaplan, Scott, and Wilson, Paul. EELRU: simple and effective adaptive page replacement. ACM SIGMETRICS Performance Evaluation Review, 27(1): 122–133, 1999.CrossRefGoogle Scholar
Sprugnoli, Renzo. Perfect hashing functions: A single probe retrieving method for static sets. Communications of the ACM, 20(11):841–850, 1977.CrossRefGoogle Scholar
Teng, Dejun, Guo, Lei, Lee, Rubao, et al. A low-cost disk solution enabling LSM-tree to achieve high performance for mixed read/write workloads. ACM Transactions on Storage (TOS), 14(2):1–26, 2018.CrossRefGoogle Scholar
van Riel, Rik. Towards an O (1) VM: Making Linux virtual memory management scale towards large amounts of physical memory. In Proceedings of the Linux Symposium, 2003.Google Scholar
Vandierendonck, Hans and Bosschere, Koenraad De. XOR-based hash functions. IEEE Transactions on Computers, 54(7):800–812, 2005.CrossRefGoogle Scholar
Neumann, John Von. First draft of a report on the EDVAC. IEEE Annals of the History of Computing, 15(4):27–75, 1993.CrossRefGoogle Scholar
Waldspurger, Carl, Saemundsson, Trausti, Ahmad, Irfan, and Park, Nohhyun. Cache modeling and optimization using miniature simulations. In 2017 USENIX Annual Technical Conference (USENIX ATC 17), pages 487–498, 2017.Google Scholar
Wang, Fusheng, Kong, Jun, Cooper, Lee, et al. A data model and database for high-resolution pathology analytical image informatics. Journal of Pathology Informatics, 2(1):32, 2011.CrossRefGoogle Scholar
Wang, Thomas. Integer hash function, 1997. https://web.archive.org/web/20071223173210/http://www.concentric.net/~Ttwang/tech/inthash.htmGoogle Scholar
Whaley, R. Clinton and Dongarra, Jack J.. Automatically tuned linear algebra software. In SC’98: Proceedings of the 1998 ACM/IEEE Conference on Supercomputing, page 38. IEEE, 1998.Google Scholar
Wiederhold, Gio. Database Design, volume 1077. McGraw-Hill, 1983.Google Scholar
Wilkes, Maurice V.. Slave memories and dynamic storage allocation. IEEE Transactions on Electronic Computers, 14(2):270–271, 1965.CrossRefGoogle Scholar
Wirth, Niklaus. Algorithms & Data Structures. Prentice-Hall, Inc., 1985.Google Scholar
Wong, Theodore M. and Wilkes, John. My cache or yours?: Making storage more exclusive. In USENIX Annual Technical Conference, General Track, pages 161–175, 2002.Google Scholar
Woop, Sven, Schmittler, Jörg, and Slusallek, Philipp. RPU: A programmable ray processing unit for realtime ray tracing. ACM Transactions on Graphics (TOG), 24(3): 434–444, 2005.CrossRefGoogle Scholar
Xiao, Li, Zhang, Xiaodong, and Kubricht, Stefan A. Improving memory performance of sorting algorithms. Journal of Experimental Algorithmics (JEA), 5:3–es, 2000.CrossRefGoogle Scholar
Yan, Yong and Zhang, Xiaodong. Cacheminer: A runtime approach to exploit cache locality on SMP. IEEE Transactions on Parallel and Distributed Systems, 11(4): 357–374, 2000.Google Scholar
Yuan, Yuan, Lee, Rubao, and Zhang, Xiaodong. The yin and yang of processing data warehousing queries on GPU devices. In PVLDB, pages 817–828, 2013.CrossRefGoogle Scholar
Zhang, Chenxi, Zhang, Xiaodong, and Yan, Yong. Two fast and high-associativity cache schemes. IEEE Micro, 17(5):40–49, 1997.CrossRefGoogle Scholar
Zhang, Kai, Wang, Kaibo, Yuan, Yuan, et al. Mega-KV: A case for GPUs to maximize the throughput of in-memory key-value stores. Proceedings of the VLDB Endowment, 8 (11):1226–1237, 2015.CrossRefGoogle Scholar
Zhang, Zhao, Zhu, Zhichun, and Zhang, Xiaodong. A permutation-based page interleaving scheme to reduce row-buffer conflicts and exploit data locality. In Proceedings of the 33rd Annual ACM/IEEE International Symposium on Microarchitecture, pages 32–41, 2000.CrossRefGoogle Scholar
Zhao, Kai, Zhao, Wenzhe, Sun, Hongbin, et al. LDPC-in-SSD: Making advanced error correction codes work effectively in solid state drives. In 11th USENIX Conference on File and Storage Technologies (FAST 13), pages 243–256, 2013.Google Scholar
Zhong, Chen, Zhao, Xingsheng, and Jiang, Song. LIRS2: an improved lirs replacement algorithm. In Proceedings of the 14th ACM International Conference on Systems and Storage, pages 1–12, 2021.CrossRefGoogle Scholar
Zhou, Yuanyuan, Philbin, James, and Li, Kai. The multi-queue replacement algorithm for second level buffer caches. In USENIX Annual Technical Conference, General Track, pages 91–104, 2001.Google Scholar
Zhu, Yuhao. RTNN: Accelerating neighbor search using hardware ray tracing. In Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP’22), pages 76–89, 2022.CrossRefGoogle Scholar
Zhu, Zhichun, Zhang, Zhao, and Zhang, Xiaodong. Fine-grain priority scheduling on multi-channel memory systems. In Proceedings of the Eighth International Symposium on High Performance Computer Architecture, pages 107–116. IEEE, 2002.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • References
  • Xiaodong Zhang, The Ohio State University, Rubao Lee, The Ohio State University
  • Book: Data Management
  • Online publication: 21 November 2024
  • Chapter DOI: https://doi.org/10.1017/9781009122115.012
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • References
  • Xiaodong Zhang, The Ohio State University, Rubao Lee, The Ohio State University
  • Book: Data Management
  • Online publication: 21 November 2024
  • Chapter DOI: https://doi.org/10.1017/9781009122115.012
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • References
  • Xiaodong Zhang, The Ohio State University, Rubao Lee, The Ohio State University
  • Book: Data Management
  • Online publication: 21 November 2024
  • Chapter DOI: https://doi.org/10.1017/9781009122115.012
Available formats
×