On the public citation graph
Big data: Scale down, scale up, scale out
0 signed · 34 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.1006/jcss.2001.1813openalex-snapshot
Tracking Join and Self-Join Sizes in Limited Storage
inferredcites →https://doi.org/10.1016/0022-0000(85)90041-8openalex-snapshot
Probabilistic counting algorithms for data base applications
inferredcites →https://doi.org/10.1109/ipdps.2010.5470354openalex-snapshot
Oblivious algorithms for multicores and network of processors
inferredcites →https://doi.org/10.1109/mprv.2003.1251166openalex-snapshot
IrisNet: An architecture for a worldwide sensor web
inferredcites →https://doi.org/10.1145/1989493.1989553openalex-snapshot
Scheduling irregular parallel computations on hierarchical caches
inferredcites →https://doi.org/10.1145/2124295.2124312openalex-snapshot
Scalable inference in latent variable models
inferredcites →https://doi.org/10.1145/2145816.2145840openalex-snapshot
Internally deterministic parallel algorithms can be fast
inferredcites →https://doi.org/10.1145/2486159.2486189openalex-snapshot
Reducing contention through priority updates
inferredcites →https://doi.org/10.1145/2612669.2612678openalex-snapshot
Experimental analysis of space-bounded schedulers
inferredcites →https://doi.org/10.1145/2670979.2670984openalex-snapshot
Exploiting iterative-ness for parallel ML computations
inferredcites →https://doi.org/10.1145/2755573.2755604openalex-snapshot
Sorting with Asymmetric Read and Write Costs
inferredcites →https://doi.org/10.1145/276304.276334openalex-snapshot
New sampling-based summary statistics for improving approximate query answers
inferredcites →https://doi.org/10.1145/2806777.2806778openalex-snapshot
Managed communication and consistency for fast data-parallel iterative analytics
inferredcites →https://doi.org/10.1145/304181.304207openalex-snapshot
Join synopses for approximate query answering
inferredcites →https://doi.org/10.1145/304181.304581openalex-snapshot
The Aqua approximate query answering system
inferredcites →https://doi.org/10.1145/335168.335230openalex-snapshot
Towards estimation error guarantees for distinct values
inferredcites →https://doi.org/10.1145/335191.335450openalex-snapshot
Congressional samples for approximate answering of group-by queries
inferredcites →https://doi.org/10.1145/872757.872818openalex-snapshot
Cache-and-query for wide area sensor databases
inferredcites →https://doi.org/10.1184/r1/6475613openalex-snapshot
Exploiting bounded staleness to speed up Big Data analytics
inferredcites →https://doi.org/10.14778/1453856.1453961openalex-snapshot
Online maintenance of very large random samples on flash storage
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-3-319-39077-2_7openalex-snapshot
The Macro-DSE for HPC Processing Unit: The Physical Constraints Perspective
inferred← citeshttps://doi.org/10.1007/978-3-319-49580-4_4openalex-snapshot
Towards an Experimental LegoLand: Slice Modification and Recovery in ExoGENI Testbed
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_191-2openalex-snapshot
Elastic Resource Management in Stream Processing
inferred← citeshttps://doi.org/10.1109/bigdata.2015.7363751openalex-snapshot
Scalejoin: A deterministic, disjoint-parallel and skew-resilient stream join
inferred← citeshttps://doi.org/10.1109/tbdata.2016.2624274openalex-snapshot
ScaleJoin: A Deterministic, Disjoint-Parallel and Skew-Resilient Stream Join
inferred← citeshttps://doi.org/10.1109/tpds.2022.3181979openalex-snapshot
STRETCH: Virtual Shared-Nothing Parallelism for Scalable and Elastic Stream Processing
inferred← citeshttps://doi.org/10.1134/s1995080221070246openalex-snapshot
Parallel Version of the Framework for Clustering Error Messages
inferred← citeshttps://doi.org/10.1145/3524053.3542750openalex-snapshot
Research Summary: Deterministic, Explainable and Efficient Stream Processing
inferred← citeshttps://doi.org/10.48550/arxiv.2005.04935openalex-snapshot
Performance Modeling and Vertical Autoscaling of Stream Joins
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.