On the public citation graph
Alphasort: A cache-sensitive parallel external sort
0 signed · 73 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/spe.4380220702openalex-snapshot
Tuning a parallel database algorithm on a shared‐memory multiprocessor
inferredcites →https://doi.org/10.1007/3-540-51324-8_32openalex-snapshot
Parallel sorting methods for large data volumes on a hypercube database computer
inferredcites →https://doi.org/10.1007/3-540-51324-8_33openalex-snapshot
Evaluation of 18-stage pipeline hardware sorter
inferredcites →https://doi.org/10.1007/3-540-53065-7_131openalex-snapshot
Sorting large data files on POOMA
inferredcites →https://doi.org/10.1007/978-1-4613-1679-4_9openalex-snapshot
Parallel Partition Sort for Database Machines
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0400642-2openalex-snapshot
Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth
inferredcites →https://doi.org/10.1109/12.2222openalex-snapshot
Sorting large files on a backend multiprocessor
inferredcites →https://doi.org/10.1109/32.24711openalex-snapshot
Improving quicksort performance with a codeword data structure
inferredcites →https://doi.org/10.1109/isca.1994.288161openalex-snapshot
Characterization of Alpha AXP performance using TP and SPEC workloads
inferredcites →https://doi.org/10.1109/pdis.1991.183115openalex-snapshot
Parallel sorting on a shared-nothing architecture using probabilistic splitting
inferredcites →https://doi.org/10.1109/tc.1986.1676699openalex-snapshot
Synchronized Disk Interleaving
inferredcites →https://doi.org/10.1145/191995.192017openalex-snapshot
Characterization of alpha AXP performance using TP and SPEC workloads
inferredcites →https://doi.org/10.2469/cp.v1986.n2.5openalex-snapshot
Strategies for Effective Asset/Liability Management
inferredcites →https://doi.org/10.6083/ns0646417openalex-snapshot
Parallel external sorting in volcano
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-0-387-39940-9_658openalex-snapshot
Cache-Conscious Query Processing
inferred← citeshttps://doi.org/10.1007/978-1-4419-8590-3_10openalex-snapshot
Parallel External Sorting
inferred← citeshttps://doi.org/10.1007/978-1-4614-8265-9_658openalex-snapshot
Cache-Conscious Query Processing
inferred← citeshttps://doi.org/10.1007/978-1-4899-7993-3_658-2openalex-snapshot
Cache-Conscious Query Processing
inferred← citeshttps://doi.org/10.1007/978-3-030-27520-4_15openalex-snapshot
Improved Programming-Language Independent MapReduce on Shared-Memory Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-15743-1_46openalex-snapshot
Implementing the Comparison-Based External Sort
inferred← citeshttps://doi.org/10.1007/978-3-642-02011-7_9openalex-snapshot
psort, Yet Another Fast Stable Sorting Software
inferred← citeshttps://doi.org/10.1007/s00778-006-0005-2openalex-snapshot
Compression techniques for fast external sorting
inferred← citeshttps://doi.org/10.1007/s00778-016-0426-5openalex-snapshot
External sorting on flash storage: reducing cell wearing and increasing efficiency by avoiding intermediate writes
inferred← citeshttps://doi.org/10.1007/s10115-011-0429-xopenalex-snapshot
PI-Join: Efficiently processing join queries on massive data
inferred← citeshttps://doi.org/10.1007/s10618-010-0176-8openalex-snapshot
A disk-aware algorithm for time series motif discovery
inferred← citeshttps://doi.org/10.1007/s13222-011-0062-6openalex-snapshot
Sorting in a Memory Hierarchy with Flash Memory
inferred← citeshttps://doi.org/10.1016/b978-0-32-390796-5.00017-6openalex-snapshot
Database parallelism, big data and analytics, deep learning
inferred← citeshttps://doi.org/10.1016/j.future.2024.107490openalex-snapshot
LSTM-Oppurs: Opportunistic user recruitment strategy based on deep learning in mobile crowdsensing system
inferred← citeshttps://doi.org/10.1016/j.future.2025.107860openalex-snapshot
AS2: Adaptive sorting algorithm selection for heterogeneous workloads and systems
inferred← citeshttps://doi.org/10.1016/j.ijpe.2015.02.024openalex-snapshot
Productisation: A review and research agenda
inferred← citeshttps://doi.org/10.1016/j.jss.2009.02.028openalex-snapshot
FAST: Flash-aware external sorting for mobile database systems
inferred← citeshttps://doi.org/10.1016/j.parco.2014.12.002openalex-snapshot
Extending the BSP model for multi-core and out-of-core computing: MBSP
inferred← citeshttps://doi.org/10.1109/cluster.2011.75openalex-snapshot
Datamation: A Quarter of a Century and Four Orders of Magnitude Later
inferred← citeshttps://doi.org/10.1109/icde.2001.914847openalex-snapshot
B-tree indexes and CPU caches
inferred← citeshttps://doi.org/10.1109/icde.2013.6544834openalex-snapshot
The Bw-Tree: A B-tree for new hardware platforms
inferred← citeshttps://doi.org/10.1109/icde.2016.7498330openalex-snapshot
Using SSDs to scale up Google Fusion Tables, a database-in-the-cloud
inferred← citeshttps://doi.org/10.1109/icdew.2008.4498379openalex-snapshot
A general and efficient algorithm for “top” queries
inferred← citeshttps://doi.org/10.1109/icdm.2009.15openalex-snapshot
Finding Time Series Motifs in Disk-Resident Data
inferred← citeshttps://doi.org/10.1109/icdmic.2014.6954224openalex-snapshot
Analytical & empirical analysis of external sorting algorithms
inferred← citeshttps://doi.org/10.1109/lcn.2008.4664143openalex-snapshot
GENI - global environment for network innovations
inferred← citeshttps://doi.org/10.1145/1132960.1132964openalex-snapshot
Implementing sorting in database systems
inferred← citeshttps://doi.org/10.1145/1363189.1363198openalex-snapshot
The five-minute rule twenty years later, and how flash memory changes the rules
inferred← citeshttps://doi.org/10.1145/1413254.1413264openalex-snapshot
The Five-Minute Rule 20 Years Later: and How Flash Memory Changes the Rules
inferred← citeshttps://doi.org/10.1145/1739041.1739087openalex-snapshot
Self-selecting, self-tuning, incrementally optimized indexes
inferred← citeshttps://doi.org/10.1145/1807167.1807194openalex-snapshot
Analyzing the energy efficiency of a database server
inferred← citeshttps://doi.org/10.1145/1963190.1970377openalex-snapshot
psort , yet another fast stable sorting software
inferred← citeshttps://doi.org/10.1145/2168836.2168855openalex-snapshot
Cache craftiness for fast multicore key-value storage
inferred← citeshttps://doi.org/10.1145/233269.233336openalex-snapshot
A super scalar sort algorithm for RISC processors
inferred← citeshttps://doi.org/10.1145/2339530.2378374openalex-snapshot
Exact Primitives for Time Series Data Mining
inferred← citeshttps://doi.org/10.1145/235968.233336openalex-snapshot
A super scalar sort algorithm for RISC processors
inferred← citeshttps://doi.org/10.1145/3318464.3389729openalex-snapshot
External Merge Sort for Top-K Queries
inferred← citeshttps://doi.org/10.1145/3472456.3472495openalex-snapshot
Using Vectorized Execution to Improve SQL Query Performance on Spark
inferred← citeshttps://doi.org/10.1145/3570956openalex-snapshot
Robust and Efficient Sorting with Offset-value Coding
inferred← citeshttps://doi.org/10.1145/3709664openalex-snapshot
B-Trees Are Back: Engineering Fast and Pageable Node Layouts
inferred← citeshttps://doi.org/10.1145/3778176openalex-snapshot
Offset-Value Coding in Database Query Execution
inferred← citeshttps://doi.org/10.1145/781027.781063openalex-snapshot
Effect of node size on the performance of cache-conscious B + -trees
inferred← citeshttps://doi.org/10.14778/3598581.3598585openalex-snapshot
WiscSort: External Sorting for Byte-Addressable Storage
inferred← citeshttps://doi.org/10.14778/3725688.3725691openalex-snapshot
FB + -Tree: A Memory-Optimized B + -Tree with Latch-Free Update
inferred← citeshttps://doi.org/10.14778/3836663.3836667openalex-snapshot
CrocSort: Resource-Efficient, Skew-Resilient Parallel External Merge Sort
inferred← citeshttps://doi.org/10.48550/arxiv.1909.08006openalex-snapshot
Leyenda: An Adaptive, Hybrid Sorting Algorithm for Large Scale Data with Limited Memory
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0308004openalex-snapshot
DPG: A Cache-Efficient Accelerator for Sorting and for Join Operators
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.