On the public citation graph
Robust and efficient memory management in Apache AsterixDB
0 signed · 49 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.1007/3-540-54345-7_67openalex-snapshot
Two algorithms for approxmate string matching in static texts
inferredcites →https://doi.org/10.1007/bf03037022openalex-snapshot
Application of hash to data base machine and its architecture
inferredcites →https://doi.org/10.1109/icde.2008.4497434openalex-snapshot
Efficient Merging and Filtering Algorithms for Approximate String Searches
inferredcites →https://doi.org/10.1109/icde.2011.5767921openalex-snapshot
Hyracks: A flexible and extensible foundation for data-intensive computing
inferredcites →https://doi.org/10.1109/tkde.2014.2313874openalex-snapshot
Main-Memory Hash Joins on Modern Processor Architectures
inferredcites →https://doi.org/10.1145/1132960.1132964openalex-snapshot
Implementing sorting in database systems
inferredcites →https://doi.org/10.1145/1363189.1363198openalex-snapshot
The five-minute rule twenty years later, and how flash memory changes the rules
inferredcites →https://doi.org/10.1145/152610.152611openalex-snapshot
Query evaluation techniques for large databases
inferredcites →https://doi.org/10.1145/170036.170051openalex-snapshot
Partially preemptible hash joins
inferredcites →https://doi.org/10.1145/1994.2022openalex-snapshot
Principles of database buffer management
inferredcites →https://doi.org/10.1145/2464157.2466485openalex-snapshot
A bloat-aware design for big data applications
inferredcites →https://doi.org/10.1145/271074.271094openalex-snapshot
The five-minute rule ten years later, and other computer storage rules of thumb
inferredcites →https://doi.org/10.1145/2757667.2757684openalex-snapshot
Performance analysis of NVMe SSDs and their implication on real world databases
inferredcites →https://doi.org/10.1145/3132847.3132916openalex-snapshot
A Study of Main-Memory Hash Joins on Many-core Processor
inferredcites →https://doi.org/10.1145/3276980openalex-snapshot
Optimal Bloom Filters and Adaptive Merging for LSM-Trees
inferredcites →https://doi.org/10.1145/38713.38755openalex-snapshot
The 5 minute rule for trading memory for disc accesses and the 10 byte rule for trading memory for CPU time
inferredcites →https://doi.org/10.1145/38714.38755openalex-snapshot
The 5 minute rule for trading memory for disc accesses and the 10 byte rule for trading memory for CPU time
inferredcites →https://doi.org/10.1145/602259.602261openalex-snapshot
Implementation techniques for main memory database systems
inferredcites →https://doi.org/10.1145/6314.6315openalex-snapshot
Join processing in database systems with large main memories
inferredcites →https://doi.org/10.14778/2732951.2732958openalex-snapshot
Storage management in AsterixDB
inferredcites →https://doi.org/10.14778/2735703.2735704openalex-snapshot
Improving main memory hash joins on Intel Xeon Phi processors
inferredcites →https://doi.org/10.48550/arxiv.1407.0454openalex-snapshot
AsterixDB: A Scalable, Open Source BDMS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00778-023-00826-9openalex-snapshot
Towards flexibility and robustness of LSM trees
inferred← citeshttps://doi.org/10.1109/bigdata62323.2024.10825803openalex-snapshot
A Hybrid Approach to Group-By and Aggregation Query Execution
inferred← citeshttps://doi.org/10.1109/icde.2019.00008openalex-snapshot
AsterixDB Mid-Flight: A Case Study in Building Systems in Academia
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00041openalex-snapshot
DynaHash: Efficient Data Rebalancing in Apache AsterixDB
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00067openalex-snapshot
Deferred Flushing for Out-of-Order Arrivals in Apache IoTDB
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00278openalex-snapshot
Automatic Parameter Tuning for Compaction in Lsm-Tree Based Databases
inferred← citeshttps://doi.org/10.1145/3318464.3384399openalex-snapshot
Breaking Down Memory Walls in LSM-based Storage Systems
inferred← citeshttps://doi.org/10.1145/3448016.3450577openalex-snapshot
Wisconsin Benchmark Data Generator
inferred← citeshttps://doi.org/10.1145/3465998.3466002openalex-snapshot
Reducing Bloom Filter CPU Overhead in LSM-Trees on Modern Storage Devices
inferred← citeshttps://doi.org/10.1145/3617333openalex-snapshot
Learning to Optimize LSM-trees: Towards A Reinforcement Learning based Key-Value Store for Dynamic Workloads
inferred← citeshttps://doi.org/10.1145/3626739openalex-snapshot
NOCAP: Near-Optimal Correlation-Aware Partitioning Joins
inferred← citeshttps://doi.org/10.1145/3654978openalex-snapshot
Structural Designs Meet Optimality: Exploring Optimized LSM-tree Structures in a Colossal Configuration Space
inferred← citeshttps://doi.org/10.1145/3677138openalex-snapshot
CAMAL: Optimizing LSM-trees via Active Learning
inferred← citeshttps://doi.org/10.1145/3709662openalex-snapshot
Aster: Enhancing LSM-structures for Scalable Graph Database
inferred← citeshttps://doi.org/10.1145/3725310openalex-snapshot
How to Grow an LSM-tree? Towards Bridging the Gap Between Theory and Practice
inferred← citeshttps://doi.org/10.14778/3547305.3547327openalex-snapshot
Design trade-offs for a robust dynamic hybrid hash join
inferred← citeshttps://doi.org/10.14778/3717755.3717767openalex-snapshot
Are Joins over LSM-Trees Ready? Take RocksDB as an Example
inferred← citeshttps://doi.org/10.14778/3796195.3796208openalex-snapshot
ArceKV: Towards Workload-driven LSM-compactions for Key-Value Store Under Dynamic Workloads
inferred← citeshttps://doi.org/10.14778/3827998.3828033openalex-snapshot
The Evolution of Storage in Apache AsterixDB
inferred← citeshttps://doi.org/10.48550/arxiv.2004.10360openalex-snapshot
Breaking Down Memory Walls: Adaptive Memory Management in LSM-based Storage Systems (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.2105.11075openalex-snapshot
DynaHash: Efficient Data Rebalancing in Apache AsterixDB (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.2110.13801openalex-snapshot
Endure: A Robust Tuning Paradigm for LSM Trees Under Workload Uncertainty
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.