Result: Fast computation of database operations using content-addressable memories

Title:
Fast computation of database operations using content-addressable memories
Authors:
BANDI, Nagender, AGRAWAL, Divyakant, EL ABBADI, Amr
Source:
Database and expert systems applications (17th international conference, DEXA 2006, Kraków, Poland, September 4-8, 2006)0DEXA 2006. :389-398
Publisher Information:
Berlin; Heidelberg; New York: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 9 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Gestion des mémoires et des fichiers (y compris la protection et la sécurité des fichiers), Memory and file management (including protection and security), Systèmes d'information. Bases de données, Information systems. Data bases, Intelligence artificielle, Artificial intelligence, Architecture réseau, Network architecture, Arquitectura red, Base donnée, Database, Base dato, Classification forme, Pattern classification, Commutation paquet, Packet switching, Conmutación por paquete, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Complexité temps, Time complexity, Complejidad tiempo, Concordance forme, Pattern matching, Détecteur intrus, Intruder detector, Detector intruso, Fabrication assistée, Computer aided manufacturing, Fabricación asistida por computador, Gestion mémoire, Storage management, Gestión memoria, Goulot étranglement, Bottleneck, Gollete estrangulamiento, Grande vitesse, High speed, Gran velocidad, Hiérarchie mémoire, Memory hierarchy, Jerarquía memoria, Intelligence artificielle, Artificial intelligence, Inteligencia artificial, Routeur, Router, Système détection intrusion, Intrusion detection systems, Système expert, Expert system, Sistema experto, Sécurité informatique, Computer security, Seguridad informatica, Temps linéaire, Linear time, Tiempo lineal, Triage, Sorting, Tría
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Computer Science University of California at Santa Barbara, United States
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19151279
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19151279
Database:
PASCAL Archive

Further Information

Research efforts on conventional CPU architectures over the past decade have focused primarily on performance enhancement. In contrast, the NPU (Network Processing Unit) architectures have evolved significantly in terms of functionality. The memory hierarchy of a typical network router features a Content-Addressable Memory (CAM) which provides very fast constant-time lookups over large amounts of data and facilitates a wide range of novel high-speed networking solutions such as Packet Classification, Intrusion Detection and Pattern Matching. While these networking applications span an entirely different domain than the database applications, they share a common operation of searching for a particular data entry among huge amounts of data. In this paper, we investigate how CAM-based technology can help in addressing the existing memory hierarchy bottlenecks in database operations. We present several high-speed CAM-based solutions for computationally intensive database operations. In particular, we discuss an efficient linear-time complexity CAM-based sorting algorithm and apply it to develop a fast solution for complex join operations widely used in database applications.