Efficient In-Memory Indexing with Generalized Prefix Trees

No abstract is available for this paper.

• Publication year

  2011

• Venue

  Datenbanksysteme für Business, Technologie und Web

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A MASTER'S THESIS

  2012cited by this paper
• Communications of the ACM

  2011cited by this paper
• FAST: fast architecture sensitive tree search on modern CPUs and GPUs

  2010cited by this paper
• Some Lessons Learned

  2010cited by this paper
• Design and evaluation of a benchmark for main memory transaction processing systems

  2009cited by this paper
• DBLP - Some Lessons Learned

  2009cited by this paper
• Prefetching J+-Tree: A Cache-Optimized Main Memory Database Index Structure

  2009cited by this paper
• k-ary search on modern processors

  2009cited by this paper
• Dictionary-based order-preserving string compression for main memory column stores

  2009cited by this paper
• CST-Trees: Cache Sensitive T-Trees

  2007cited by this paper
• Efficient Hash Probes on Modern Processors

  2007cited by this paper
• Updating a cracked database

  2007cited by this paper
• HAT-Trie: A Cache-Conscious Trie-Based Data Structure For Strings

  2007cited by this paper
• Fractal prefetching B+-Trees: optimizing both cache and disk performance

  2002cited by this paper
• Implementing database operations using SIMD instructions

  2002cited by this paper
• Burst tries: a fast, efficient data structure for string keys

  2002cited by this paper
• Main-memory index structures with fixed-size partial keys

  2001cited by this paper
• Making B+- trees cache conscious in main memory

  2000cited by this paper
• Optimizing database architecture for the new bottleneck: memory access

  2000cited by this paper
• Cache Conscious Indexing for Decision-Support in Main Memory

  1999cited by this paper
• The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition

  1997cited by this paper
• Fast algorithms for sorting and searching strings

  1997cited by this paper
• Implementing deletion in B+-trees

  1995cited by this paper
• Linear hashing with separators—a dynamic hashing scheme achieving one-access

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

  1986influential reference
• Linear Hashing: A New Tool for File and Table Addressing

  1980cited by this paper
• Extendible hashing—a fast access method for dynamic files

  1979cited by this paper
• A dichromatic framework for balanced trees

  1978cited by this paper
• Prefix B-trees

  1977cited by this paper
• Organization and maintenance of large ordered indexes

  1972cited by this paper
• Organization and maintenance of large ordered indices

  1970cited by this paper
• File structures using hashing functions

  1970cited by this paper
• PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric

  1968cited by this paper
• Trie memory

  1960cited by this paper

• RadixGraph: A Fast, Space-Optimized Data Structure for Dynamic Graph Storage (Extended Version)

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

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

  2025cites this paper
• A survey on Persistent Memory indexes: Recent advances, challenges and opportunities

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

  2023cites this paper
• GIO: Generating Efficient Matrix and Frame Readers for Custom Data Formats by Example

  2023cites this paper
• PIM-trie: A Skew-resistant Trie for Processing-in-Memory

  2023cites this paper
• Height Optimized Tries

  2022influential citation
• Adaptive Hybrid Indexes

  2022cites this paper
• Achieving Efficient and Privacy-Preserving Set Containment Search Over Encrypted Data

  2022cites this paper
• DyFT: a dynamic similarity search method on integer sketches

  2021cites this paper
• Accelerated Seeding for Genome Sequence Alignment with Enumerated Radix Trees

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

  2021cites this paper
• Retrieving Mobile Phone Information Based on Digital Search Tree

  2021cites this paper
• Dynamic Similarity Search on Integer Sketches

  2020cites this paper
• START — Self-Tuning Adaptive Radix Tree

  2020cites this paper
• Order-Preserving Key Compression for In-Memory Search Trees

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

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

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

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

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

  2019cites this paper
• Textual and Visual Information Retrieval using Query Refinement and Pattern Analysis

  2018cites this paper
• HOT: A Height Optimized Trie Index for Main-Memory Database Systems

  2018influential citation
• Indexing Execution Patterns in Workflow Provenance Graphs through Generalized Trie Structures

  2018cites this paper
• Cluster Indexing and GR Encoding with Similarity Measure for CBIR Applications

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

  2018influential citation
• Learned Index ( a ) B-Tree

  2017cites this paper
• Energy-Aware Data Management on NUMA Architectures

  2017cites this paper
• Tide-tree: A self-tuning indexing scheme for hybrid storage system

  2017cites this paper
• The Case for Learned Index Structures

  2017cites this paper
• WORT: Write Optimal Radix Tree for Persistent Memory Storage Systems

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

  2017cites this paper
• Incremental branching adaptive radix tree

  2017cites this paper
• Advancing a Gateway Infrastructure for Wind Turbine Data Analysis

  2016cites this paper
• Analytic Performance Model of a Main-Memory Index Structure

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

  2016cites this paper
• Efficient indexing for big data in Hadoop MapReduce and main memory databases

  2015cites this paper
• In Memory Data Management and Analysis

  2015cites this paper
• A Case Study in Optimizing HTM-Enabled Dynamic Data Structures : Patricia Tries

  2015cites this paper
• Geographic information extraction, disambiguation and ranking techniques

  2015cites this paper
• In-memory OLAP aggregation on GPUs using CUDA Dynamic Parallelism

  2015cites this paper
• Creating a Concurrent In-Memory B-Tree Optimized for NUMA Systems

  2015cites this paper
• ERIS live: a NUMA-aware in-memory storage engine for tera-scale multiprocessor systems

  2014cites this paper
• ERIS: A NUMA-Aware In-Memory Storage Engine for Analytical Workload

  2014cites this paper
• Adapting Tree Structures for Processing with SIMD Instructions

  2014influential citation
• G-Paradex: GPU-Based Parallel Indexing for Fast Data Deduplication

  2013cites this paper
• BUZZARD: a NUMA-aware in-memory indexing system

  2013cites this paper
• The adaptive radix tree: ARTful indexing for main-memory databases

  2013cites this paper
• Query processing on prefix trees live

  2013cites this paper
• Composite Group-Keys: Space-efficient Indexing of Multiple Columns for Compressed In-Memory Column Stores

  2013cites this paper
• QPPT: Query Processing on Prefix Trees

  2013influential citation
• Scalable ordered indexing of streaming data

  2012cites this paper
• A high-throughput in-memory index, durable on flash-based SSD: insights into the winning solution of the SIGMOD programming contest 2011

  2012cites this paper
• KISS-Tree: smart latch-free in-memory indexing on modern architectures

  2012cites this paper
• SIGMOD Officers , Committees , and Awardees ( continued )

  year unknowncites this paper
• Evaluating Alternative Structures for Prefix Trees

  year unknowncites this paper