Using logarithmic code-expansion to speedup index access and maintenance
3rd International Conference, FODO 1989 on Foundations of Data Organization and Algorithms
Database management systems
Computer architecture (2nd ed.): a quantitative approach
Computer architecture (2nd ed.): a quantitative approach
The Asilomar report on database research
ACM SIGMOD Record
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Efficient Differential Timeslice Computation
IEEE Transactions on Knowledge and Data Engineering
A Study of Index Structures for Main Memory Database Management Systems
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Cache Conscious Indexing for Decision-Support in Main Memory
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Database Architecture Optimized for the New Bottleneck: Memory Access
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
DBMSs on a Modern Processor: Where Does Time Go?
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Cache Conscious Algorithms for Relational Query Processing
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Optimizing multidimensional index trees for main memory access
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Main-memory index structures with fixed-size partial keys
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Improving index performance through prefetching
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
On supporting containment queries in relational database management systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Computation regrouping: restructuring programs for temporal data cache locality
ICS '02 Proceedings of the 16th international conference on Supercomputing
Conjunctive selection conditions in main memory
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
B-trees: bearing fruits of all kinds
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
Compacting discriminator information for spatial trees
ADC '02 Proceedings of the 13th Australasian database conference - Volume 5
Implementing database operations using SIMD instructions
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Fractal prefetching B+-Trees: optimizing both cache and disk performance
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
The set-associative cache performance of search trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient Evaluation of Continuous Range Queries on Moving Objects
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Handbook of massive data sets
Effect of node size on the performance of cache-conscious B+-trees
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Contorting high dimensional data for efficient main memory KNN processing
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Main Memory Evaluation of Monitoring Queries Over Moving Objects
Distributed and Parallel Databases
Selection conditions in main memory
ACM Transactions on Database Systems (TODS)
Improving Hash Join Performance through Prefetching
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Main Memory Indexing: The Case for BD-Tree
IEEE Transactions on Knowledge and Data Engineering
Buffering databse operations for enhanced instruction cache performance
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Restructuring computations for temporal data cache locality
International Journal of Parallel Programming
Deleting keys of B-trees in parallel
Journal of Parallel and Distributed Computing
An efficient cache conscious multi-dimensional index structure
Information Processing Letters
Indexing High-Dimensional Data for Efficient In-Memory Similarity Search
IEEE Transactions on Knowledge and Data Engineering
Cache-Conscious Automata for XML Filtering
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Finding Patterns on Protein Surfaces: Algorithms and Applications to Protein Classification
IEEE Transactions on Knowledge and Data Engineering
Exploring bit-difference for approximate KNN search in high-dimensional databases
ADC '05 Proceedings of the 16th Australasian database conference - Volume 39
Improving database performance on simultaneous multithreading processors
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Cache-conscious frequent pattern mining on a modern processor
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Handling frequent updates of moving objects
Proceedings of the 14th ACM international conference on Information and knowledge management
Multithreaded architectures and the sort benchmark
DaMoN '05 Proceedings of the 1st international workshop on Data management on new hardware
A characterization of data mining algorithms on a modern processor
DaMoN '05 Proceedings of the 1st international workshop on Data management on new hardware
Making CSB+-Trees processor conscious
DaMoN '05 Proceedings of the 1st international workshop on Data management on new hardware
Hardware supported memory access for high performance main memory databases
DaMoN '05 Proceedings of the 1st international workshop on Data management on new hardware
A portal for access to complex distributed information about energy
dg.o '02 Proceedings of the 2002 annual national conference on Digital government research
Realizing parallelism in database operations: insights from a massively multithreaded architecture
DaMoN '06 Proceedings of the 2nd international workshop on Data management on new hardware
A memory subsystem with comparator arrays for main memory database operations
Proceedings of the 2006 ACM symposium on Applied computing
Cache-Conscious Automata for XML Filtering
IEEE Transactions on Knowledge and Data Engineering
Cache-conscious frequent pattern mining on modern and emerging processors
The VLDB Journal — The International Journal on Very Large Data Bases
Fast similarity join for multi-dimensional data
Information Systems
Adaptive Index Utilization in Memory-Resident Structural Joins
IEEE Transactions on Knowledge and Data Engineering
HAT-trie: a cache-conscious trie-based data structure for strings
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Efficient columnar storage in B-trees
ACM SIGMOD Record
Generic database cost models for hierarchical memory systems
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient execution of multiple queries on deep memory hierarchy
Journal of Computer Science and Technology
Buffering accesses to memory-resident index structures
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
P*TIME: highly scalable OLTP DBMS for managing update-intensive stream workload
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Index compression is good, especially for random access
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Tlink-tree: main memory index structure with concurrency control and recovery
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
The end of an architectural era: (it's time for a complete rewrite)
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A general framework for improving query processing performance on multi-level memory hierarchies
DaMoN '07 Proceedings of the 3rd international workshop on Data management on new hardware
Cache-oblivious databases: Limitations and opportunities
ACM Transactions on Database Systems (TODS)
OLTP through the looking glass, and what we found there
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Breaking the memory wall in MonetDB
Communications of the ACM - Surviving the data deluge
An Extended R-Tree Indexing Method Using Selective Prefetching in Main Memory
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007
WSEAS Transactions on Computers
The Optimization of In-Memory Space Partitioning Trees for Cache Utilization
IEICE - Transactions on Information and Systems
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
Dictionary-based order-preserving string compression for main memory column stores
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Cache-conscious buffering for database operators with state
Proceedings of the Fifth International Workshop on Data Management on New Hardware
Indexing Moving Objects Using Short-Lived Throwaway Indexes
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Trees or grids?: indexing moving objects in main memory
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Comparing integer data structures for 32- and 64-bit keys
Journal of Experimental Algorithmics (JEA)
Database architecture evolution: mammals flourished long before dinosaurs became extinct
Proceedings of the VLDB Endowment
MCC-DB: minimizing cache conflicts in multi-core processors for databases
Proceedings of the VLDB Endowment
An efficient cache conscious multi-dimensional index structure
Information Processing Letters
Scalable parallel word search in multicore/multiprocessor systems
The Journal of Supercomputing
Suffix tree construction algorithms on modern hardware
Proceedings of the 13th International Conference on Extending Database Technology
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Enhancing the B+-tree by dynamic node popularity caching
Information Processing Letters
Tree-traversal orientation analysis
LCPC'06 Proceedings of the 19th international conference on Languages and compilers for parallel computing
An enhanced main memory index structure employing the level prefetching technique
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
J+-tree: a new index structure in main memory
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
CST-trees: cache sensitive t-trees
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
High-dimensional indexing: transformational approaches to high-dimensional range and similarity searches
Cache conscious trees: how do they perform on contemporary commodity microprocessors?
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Indexing high-dimensional data for main-memory similarity search
Information Systems
Indexing large-scale raster geospatial data using massively parallel GPGPU computing
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Engineering scalable, cache and space efficient tries for strings
The VLDB Journal — The International Journal on Very Large Data Bases
ISB-tree: A new indexing scheme with efficient expected behaviour
Journal of Discrete Algorithms
The HV-tree: a memory hierarchy aware version index
Proceedings of the VLDB Endowment
Redesigning the string hash table, burst trie, and BST to exploit cache
Journal of Experimental Algorithmics (JEA)
Transactions on large-scale data- and knowledge-centered systems II
Transactions on large-scale data- and knowledge-centered systems II
MOVIES: indexing moving objects by shooting index images
Geoinformatica
Designing fast architecture-sensitive tree search on modern multicore/many-core processors
ACM Transactions on Database Systems (TODS)
Fast updates on read-optimized databases using multi-core CPUs
Proceedings of the VLDB Endowment
Massive concurrent deletion of keys in b*-tree
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
CLUR-Tree for supporting frequent updates of data stream over sensor networks
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Performance analysis of the cache conscious-generalized search tree
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Cache conscious trees on modern microprocessors
Proceedings of the 4th International Conference on Uniquitous Information Management and Communication
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
A snappy b+-trees index reconstruction for main-memory storage systems
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Optimizing write performance for read optimized databases
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
MiniTasking: improving cache performance for multiple query workloads
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
MR-Tree: a cache-conscious main memory spatial index structure for mobile GIS
W2GIS'04 Proceedings of the 4th international conference on Web and Wireless Geographical Information Systems
A spatial index using MBR compression and hashing technique for mobile map service
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Efficient main-memory algorithms for set containment join using inverted lists
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
Cache craftiness for fast multicore key-value storage
Proceedings of the 7th ACM european conference on Computer Systems
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Foundations and Trends in Databases
KISS-Tree: smart latch-free in-memory indexing on modern architectures
DaMoN '12 Proceedings of the Eighth International Workshop on Data Management on New Hardware
VAST-Tree: a vector-advanced and compressed structure for massive data tree traversal
Proceedings of the 15th International Conference on Extending Database Technology
An efficient method for record management in flash memory environment
Journal of Systems Architecture: the EUROMICRO Journal
Only aggressive elephants are fast elephants
Proceedings of the VLDB Endowment
Adapting the b+-tree for asymmetric i/o
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Scalable and dynamically balanced shared-everything OLTP with physiological partitioning
The VLDB Journal — The International Journal on Very Large Data Bases
SMIX: self-managing indexes for dynamic workloads
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
RCached-tree: an index structure for efficiently answering popular queries
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Concurrent operations of O2-tree on shared memory multicore architectures
ADC '13 Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137
Design and evaluation of storage organizations for read-optimized main memory databases
Proceedings of the VLDB Endowment
Eliminating unscalable communication in transaction processing
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
Previous research has shown that cache behavior is important for main memory index structures. Cache conscious index structures such as Cache Sensitive Search Trees (CSS-Trees) perform lookups much faster than binary search and T-Trees. However, CSS-Trees are designed for decision support workloads with relatively static data. Although B+-Trees are more cache conscious than binary search and T-Trees, their utilization of a cache line is low since half of the space is used to store child pointers. Nevertheless, for applications that require incremental updates, traditional B+-Trees perform well.Our goal is to make B+-Trees as cache conscious as CSS-Trees without increasing their update cost too much. We propose a new indexing technique called “Cache Sensitive B+-Trees” (CSB+-Trees). It is a variant of B+-Trees that stores all the child nodes of any given node contiguously, and keeps only the address of the first child in each node. The rest of the children can be found by adding an offset to that address. Since only one child pointer is stored explicitly, the utilization of a cache line is high. CSB+-Trees support incremental updates in a way similar to B+-Trees.We also introduce two variants of CSB+-Trees. Segmented CSB+-Trees divide the child nodes into segments. Nodes within the same segment are stored contiguously and only pointers to the beginning of each segment are stored explicitly in each node. Segmented CSB+-Trees can reduce the copying cost when there is a split since only one segment needs to be moved. Full CSB+-Trees preallocate space for the full node group and thus reduce the split cost. Our performance studies show that CSB+-Trees are useful for a wide range of applications.