Cache Conscious Indexing for Decision-Support in Main Memory

No abstract is available for this paper.

• Publication year

  1999

• Venue

  Very Large Data Bases Conference

• Publication date

  1999-09-07

• Fields of study

  Computer Science

• Identifiers
  DOI 10.7916/D8T441ZB
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Asilomar report on database research

  1998cited by this paper
• DataBlitz: A High Performance Main-Memory Storage Manager

  1998cited by this paper
• Cache Memories

  1998cited by this paper
• Improving Pointer-Based Codes Through Cache-Conscious Data Placement

  1998cited by this paper
• Hash Joins and Hash Teams in Microsoft SQL Server

  1998cited by this paper
• Teaching an OLTP database kernel advanced datawarehousing techniques

  1997cited by this paper
• The influence of caches on the performance of sorting

  1997cited by this paper
• The influence of caches on the performance of heaps

  1996cited by this paper
• “One size fits all” database architectures do not work for DSS

  1995cited by this paper
• Dalí: A High Performance Main Memory Storage Manager

  1994cited by this paper
• Cache Conscious Algorithms for Relational Query Processing

  1994cited by this paper
• AlphaSort: a RISC machine sort

  1994cited by this paper
• An Evaluation of Starburst's Memory Resident Storage Component

  1992cited by this paper
• Main Memory Database Systems: An Overview

  1992cited by this paper
• Transaction Processing: Concepts and Techniques

  1992cited by this paper
• A data locality optimizing algorithm

  1991cited by this paper
• Query optimization in a memory-resident domain relational calculus database system

  1990cited by this paper
• Multiprocessor Main Memory Transaction Processing

  1988cited by this paper
• Two Access Methods Using Compact Binary Trees

  1987cited by this paper
• A recovery algorithm for a high-performance memory-resident database system

  1987cited by this paper
• A Study of Index Structures for a Main Memory Database Management System

  1986influential reference
• Query processing in main memory database management systems

  1986cited by this paper
• A Crash Recovery Scheme for a Memory-Resident Database System

  1986cited by this paper
• Design of a Memory Resident DBMS

  1985cited by this paper
• An Algorithm to Construct a Compact B-Tree in Case of Ordered Keys

  1983cited by this paper
• Ubiquitous B-Tree

  1979cited by this paper
• Access path selection in a relational database management system

  1979cited by this paper
• Sorting and Searching

  1973cited by this paper
• The Art of Computer Programming

  1968cited by this paper

• B-Trees Are Back: Engineering Fast and Pageable Node Layouts

  2025cites this paper
• BS-tree: A gapped data-parallel B-tree

  2025cites this paper
• Bigger Is Not Better: The Fastest Static GPU Index Is Also Lightweight!

  2025cites this paper
• VEGA: An Active-tuning Learned Index with Group-Wise Learning Granularity

  2025cites this paper
• FB+-tree: A Memory-Optimized B+-tree with Latch-Free Update

  2025cites this paper
• Multi-camera vision-based synchronous positioning and mapping for green construction of electric substations

  2024cites this paper
• Learned index for non-key queries

  2024cites this paper
• A Fast Learned Key-Value Store for Concurrent and Distributed Systems

  2024cites this paper
• Spruce: a Fast yet Space-saving Structure for Dynamic Graph Storage

  2024cites this paper
• On Distribution Dependent Sub-Logarithmic Query Time of Learned Indexing

  2023cites this paper
• Blink-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases

  2023cites this paper
• Towards Data-Based Cache Optimization of B+-Trees

  2023cites this paper
• From Specific to Generic Learned Sorted Set Dictionaries: A Theoretically Sound Paradigm Yelding Competitive Data Structural Boosters in Practice

  2023cites this paper
• L EARNED I NDEX WITH D YNAMIC ϵ

  2023cites this paper
• Simple and Robust Dynamic Two-Dimensional Convex Hull

  2023cites this paper
• Height Optimized Tries

  2022cites this paper
• DPISCAN: Distributed and parallel architecture with indexing for structural clustering of massive dynamic graphs

  2022influential citation
• HybriDS: Cache-Conscious Concurrent Data Structures for Near-Memory Processing Architectures

  2022cites this paper
• SIMD-Matcher: A SIMD-based Arbitrary Matching Framework

  2022cites this paper
• Learned Index with Dynamic ✏

  2022cites this paper
• Standard versus uniform binary search and their variants in learned static indexing: The case of the searching on sorted data benchmarking software platform

  2022influential citation
• B2-Tree: Page-Based String Indexing in Concurrent Environments

  2022cites this paper
• L EARNED I NDEX WITH D YNAMIC (cid:15)

  2021cites this paper
• Cuckoo Trie: Exploiting Memory-Level Parallelism for Efficient DRAM Indexing

  2021cites this paper
• FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems

  2021cites this paper
• Learned Sorted Table Search and Static Indexes in Small Model Space

  2021cites this paper
• Learned Sorted Table Search and Static Indexes in Small Space: Methodological and Practical Insights via an Experimental Study

  2021cites this paper
• The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures

  2021cites this paper
• Updatable Learned Index with Precise Positions

  2021cites this paper
• A Pluggable Learned Index Method via Sampling and Gap Insertion

  2021cites this paper
• Hist-Tree: Those Who Ignore It Are Doomed to Learn

  2021cites this paper
• CARMI: A Cache-Aware Learned Index with a Cost-based Construction Algorithm

  2021cites this paper
• Understanding and analysis of B+ trees on NVM towards consistency and efficiency

  2020influential citation
• Learning from Data to Speed-up Sorted Table Search Procedures: Methodology and Practical Guidelines

  2020cites this paper
• Revisiting Sorted Table Search Procedures with Machine Learning: Methodological Insights via an Experimental Study

  2020cites this paper
• Robust Performance of Main Memory Data Structures by Configuration

  2020cites this paper
• Optimizing Adaptive Radix Trees for NVM-Based Hybrid Memory Architecture

  2020cites this paper
• B3-Tree

  2020cites this paper
• Utilizing the column imprints to accelerate no‐partitioning hash joins in large‐scale edge systems

  2020cites this paper
• A High Throughput B+tree for SIMD Architectures

  2020cites this paper
• Compressed Key Sort and Fast Index Reconstruction

  2020cites this paper
• Closing the Performance Gap between DRAM and PM for In-Memory Index Structures

  2020cites this paper
• There is No Such Thing as an "Index"! or: The next 500 Indexing Papers

  2020cites this paper
• Transforming Query Sequences for High-Throughput B+ Tree Processing on Many-Core Processors

  2019cites this paper
• S3: A Scalable In-memory Skip-List Index for Key-Value Store

  2019cites this paper
• An Efficient Indexing Structure for Multidimensional Categorical Range Aggregation Query

  2019cites this paper
• In-memory transaction processing: efficiency and scalability considerations

  2019cites this paper
• Superseding traditional indexes by orchestrating learning and geometry

  2019influential citation
• Recipe: converting concurrent DRAM indexes to persistent-memory indexes

  2019cites this paper
• SDC: a software defined cache for efficient data indexing

  2019cites this paper
• Fast Concurrent Reads and Updates with PMAs

  2019cites this paper
• Harmonia: a high throughput B+tree for GPUs

  2019cites this paper
• Indexing Trajectories for Travel-Time Histogram Retrieval

  2019cites this paper
• ALEX: An Updatable Adaptive Learned Index

  2019cites this paper
• Hyperion: Building the Largest In-memory Search Tree

  2019cites this paper
• Parallel Index-based Stream Join on a Multicore CPU

  2019cites this paper
• An Information and Communication Platform Supporting Analytics for Elderly Care

  2019cites this paper
• Efficient Processing of Range Queries in Main Memory

  2019influential citation
• In-Memory Trajectory Indexing for On-The-Fly Travel-Time Estimation

  2019cites this paper
• A Scalable Learned Index Scheme in Storage Systems

  2019influential citation
• The PGM-index

  2019influential citation
• Packed Memory Arrays - Rewired

  2019cites this paper
• Accelerating mono and multi-column selection predicates in modern main-memory database systems

  2019cites this paper
• Hybrid Indexes by Exploring Traditional B-Tree and Linear Regression

  2019cites this paper
• Accelerating in-memory transaction processing using general purpose graphics processing units

  2019cites this paper
• Cracking In-Memory Database Index A Case Study for Adaptive Radix Tree Index

  2019cites this paper
• SIMD Acceleration for Main-Memory Index Structures - A Survey

  2018cites this paper
• Query Execution on Modern CPUs

  2018cites this paper
• Write-Optimal Radix Tree: A Deterministic Indexing Structure for Persistent Memory Storage Systems

  2018cites this paper
• Handbook of Parallel Constraint Reasoning

  2018influential citation
• 2 B +-tree for Persistent Memory 2 . 1 Challenge : clflush and mfence

  2018cites this paper
• Endurable Transient Inconsistency in Byte-Addressable Persistent B+-Tree

  2018cites this paper
• MLB+-tree: A Multi-level B+-tree Index for Multidimensional Range Query on Seismic Data

  2018cites this paper
• SIGMOD officers, committees, and awardees

  2018cites this paper
• Hardware-aided update acceleration in a hybrid Semantic Web database system

  2018cites this paper
• Multicore architecture and cache optimization techniques for solving graph problems

  2018cites this paper
• A Comprehensive Performance Evaluation of Modern In-Memory Indices

  2018influential citation
• Towards efficient analytic query processing in main-memory column-stores

  2018cites this paper
• MILC: Inverted List Compression in Memory

  2017cites this paper
• Index Search Algorithms for Databases and Modern CPUs

  2017influential citation
• WORT: Write Optimal Radix Tree for Persistent Memory Storage Systems

  2017cites this paper
• Parallel optimization of a type of dynamic hashing

  2017cites this paper
• Scalable dataspace construction

  2017cites this paper
• Hybrid architecture for hardware-accelerated query processing in semantic web databases based on runtime reconfigurable FPGAs

  2017cites this paper
• Proposal : Parallel Balanced Binary Trees Using Just Join

  2017cites this paper
• Parallelizing Skip Lists for In-Memory Multi-Core Database Systems

  2017cites this paper
• xB+-Tree: Access-Pattern-Aware Cache-Line-Based Tree for Non-volatile Main Memory Architecture

  2017cites this paper
• PI : a Parallel in-memory skip list based Index

  2016cites this paper
• Cache-Sensitive Memory Layout for Dynamic Binary Trees

  2016cites this paper
• Transactional memory analysis using CSB+ trees

  2016cites this paper
• Towards a GPU accelerated spatial computing framework

  2016cites this paper
• A Cache-Efficient Sorting Algorithm for Database and Data Mining Computations using Graphics Processors

  2016cites this paper
• Closing the circle of algorithmic and system-centric database optimization: a comprehensive survey on adaptive indexing, data partitioning, and the rewiring of virtual memory

  2016cites this paper
• Optimizing Bw-tree Indexing Performance

  2016cites this paper
• New Combinatorial Properties and Algorithms for AVL Trees

  2016influential citation
• RUMA has it: Rewired User-space Memory Access is Possible!

  2016cites this paper
• A Hybrid B+-tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms

  2016cites this paper
• Cache-Sensitive Skip List: Efficient Range Queries on Modern CPUs

  2016cites this paper
• Performance of Point and Range Queries for In-memory Databases Using Radix Trees on GPUs

  2016cites this paper
• Speedup Graph Processing by Graph Ordering

  2016cites this paper