Efficient Query Processing in Crossbar Memory

被引:0
|
作者
Imani, Mohsen [1 ]
Gupta, Saransh [1 ]
Arredondo, Atl [1 ]
Rosing, Tajana [1 ]
机构
[1] Univ Calif San Diego, CSE Dept, La Jolla, CA 92093 USA
关键词
BIG DATA;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Today's computing systems use huge amount of energy and time to process basic queries in database. A large part of it is spent in data movement between the memory and processing cores, owing to the limited cache capacity and memory bandwidth of traditional computers. In this paper, we propose a non-volatile memory-based query accelerator, called NVQuery, which performs several basic query functions in memory including aggregation, prediction, bit-wise operations, as well as exact and nearest distance search queries. NVQuery is implemented on a content addressable memory (CAM) and exploits the analog characteristic of non-volatile memory in order to enable in-memory processing. To implement nearest distance search in memory, we introduce a novel bitline driving scheme to give weights to the indices of the bits during the search operation. Our experimental evaluation shows that, NVQuery can provide 49.3x performance speedup and 32.9x energy savings as compared to running the same query on traditional processor. In addition, compared to the state-of-the-art query accelerators, NVQuery can achieve 26.2x energy-delay product improvement while providing the similar accuracy.
引用
收藏
页数:6
相关论文
共 50 条
  • [41] Efficient query processing with reduced implicate tries
    Murray, Neil V.
    Rosenthal, Erik
    [J]. JOURNAL OF AUTOMATED REASONING, 2007, 38 (1-3) : 155 - 172
  • [42] Efficient parallel query processing by graph ranking
    Dereniowski, D
    Kubale, M
    [J]. FUNDAMENTA INFORMATICAE, 2006, 69 (03) : 273 - 285
  • [43] Efficient query processing with reduced implicate tries
    Murray, Neil V.
    Rosenthal, Erik
    [J]. Journal of Automated Reasoning, 2007, 38 (1-3): : 155 - 172
  • [44] Efficient Query Processing for Scalable Web Search
    Tonellotto, Nicola
    Macdonald, Craig
    Ounis, Iadh
    [J]. FOUNDATIONS AND TRENDS IN INFORMATION RETRIEVAL, 2018, 12 (4-5): : 319 - 500
  • [45] Efficient Processing of the Skyline-CL Query
    Huang, Zhenhua
    Zhang, Juan
    Tian, Chunqi
    [J]. ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2016, 41 (08) : 2801 - 2811
  • [46] Combining efficient XML compression with query processing
    Skibinski, Przemyslaw
    Swacha, Jakub
    [J]. ADVANCES IN DATABASES AND INFORMATION SYSTEMS, PROCEEDINGS, 2007, 4690 : 330 - +
  • [47] Efficient maximal reverse skyline query processing
    Banaei-Kashani, Farnoush
    Ghaemi, Parisa
    Movaqar, Bahman
    Kazemitabar, Seyed Jalal
    [J]. GEOINFORMATICA, 2017, 21 (03) : 549 - 572
  • [48] Efficient iceberg query processing in sensor networks
    Yang, Heejung
    Chung, Chin-Wan
    [J]. Computer Journal, 2013, 57 (12): : 1834 - 1851
  • [49] Efficient query processing for streamed XML fragments
    Huo, Huan
    Wang, Guoren
    Hui, Xiaoyun
    Zhou, Rui
    Ning, Bo
    Xiao, Chuan
    [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PROCEEDINGS, 2006, 3882 : 468 - 482
  • [50] Efficient query processing in large traffic networks
    Kriegel, Hans-Peter
    Kroeger, Peer
    Kunath, Peter
    Renz, Matthias
    Schmidt, Tim
    [J]. 2008 IEEE 24TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2008, : 1451 - +