Demonstrating Indexing for Near-Sorted Data
Recently proposed indexing techniques for near-sorted data are demonstrated, highlighting the performance implications of textbook ingestion in B + -trees as well as how the method achieves better ingestion performance.