On the public citation graph
Efficient approximation of correlated sums on data streams
0 signed · 42 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.1997.1545openalex-snapshot
The Space Complexity of Approximating the Frequency Moments
inferredcites →https://doi.org/10.1007/3-540-46541-3_16openalex-snapshot
An Approximate L p-Difference Algorithm for Massive Data Streams
inferredcites →https://doi.org/10.1090/dimacs/050/02openalex-snapshot
Synopsis data structures for massive data sets
inferredcites →https://doi.org/10.1109/sffcs.1999.814623openalex-snapshot
An approximate L/sup 1/-difference algorithm for massive data streams
inferredcites →https://doi.org/10.1145/375663.375665openalex-snapshot
On computing correlated aggregates over continual data streams
inferredcites →https://doi.org/10.1145/375663.375670openalex-snapshot
Space-efficient online computation of quantile summaries
inferredcites →https://doi.org/10.1145/376284.375665openalex-snapshot
On computing correlated aggregates over continual data streams
inferredcites →https://doi.org/10.1145/376284.375670openalex-snapshot
Space-efficient online computation of quantile summaries
inferredcites →https://doi.org/10.1145/543613.543615openalex-snapshot
Models and issues in data stream systems
inferredcites →https://doi.org/10.1145/543614.543615openalex-snapshot
Models and issues in data stream systems
inferredcites →https://doi.org/10.1145/564691.564699openalex-snapshot
Processing complex aggregate queries over data streams
inferredcites →https://doi.org/10.1145/564696.564699openalex-snapshot
Processing complex aggregate queries over data streams
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.5281/zenodo.1074611openalex-extracted
A Novel In-Place Sorting Algorithm With O(N Log Z) Comparisons And O(N Log Z) Moves
inferred← citeshttps://doi.org/10.1002/sam.10053openalex-snapshot
Time‐decayed correlated aggregates over data streams
inferred← citeshttps://doi.org/10.1007/s00453-014-9917-1openalex-snapshot
A General Method for Estimating Correlated Aggregates Over a Data Stream
inferred← citeshttps://doi.org/10.1007/s10618-015-0438-6openalex-snapshot
Identifying correlated heavy-hitters in a two-dimensional data stream
inferred← citeshttps://doi.org/10.1007/s10618-017-0526-xopenalex-snapshot
Fast and accurate mining of correlated heavy hitters
inferred← citeshttps://doi.org/10.1016/j.eij.2010.06.003openalex-snapshot
An empirical study on SAJQ (Sorting Algorithm for Join Queries)
inferred← citeshttps://doi.org/10.1016/j.ins.2020.08.011openalex-snapshot
Effective and efficient top-k query processing over incomplete data streams
inferred← citeshttps://doi.org/10.1109/c3it.2015.7060123openalex-snapshot
A novel in-place sorting algorithm with element wise restricted swap
inferred← citeshttps://doi.org/10.1109/gcc.2008.115openalex-snapshot
Query Prediction in Large Scale Data Intensive Event Stream Analysis Systems
inferred← citeshttps://doi.org/10.1109/icde.2012.62openalex-snapshot
A General Method for Estimating Correlated Aggregates over a Data Stream
inferred← citeshttps://doi.org/10.1109/icdm.2007.71openalex-snapshot
Efficient Data Sampling in Heterogeneous Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/pccc.2009.5403820openalex-snapshot
Finding correlated heavy-hitters over data streams
inferred← citeshttps://doi.org/10.1109/ssdbm.2007.32openalex-snapshot
Effective Summarization of Multi-Dimensional Data Streams for Historical Stream Mining
inferred← citeshttps://doi.org/10.1109/tkde.2006.48openalex-snapshot
Maintaining sliding window skylines on data streams
inferred← citeshttps://doi.org/10.1109/tpds.2017.2778734openalex-snapshot
Computing Hierarchical Summary from Two-Dimensional Big Data Streams
inferred← citeshttps://doi.org/10.1145/1066157.1066227openalex-snapshot
Fast and approximate stream mining of quantiles and frequencies using graphics processors
inferred← citeshttps://doi.org/10.1145/3357384.3357863openalex-snapshot
Efficient Join Processing Over Incomplete Data Streams
inferred← citeshttps://doi.org/10.1145/3448016.3457238openalex-snapshot
Online Topic-Aware Entity Resolution Over Incomplete Data Streams
inferred← citeshttps://doi.org/10.1360/jos161252openalex-snapshot
Processing Algorithms for Predictive Aggregate Queries over Data Streams
inferred← citeshttps://doi.org/10.31274/etd-180810-111openalex-snapshot
A study of time-decayed aggregates computation on data streams
inferred← citeshttps://doi.org/10.31274/etd-180810-2263openalex-snapshot
Detecting exploit patterns from network packet streams
inferred← citeshttps://doi.org/10.3390/mca15020208openalex-snapshot
A New Sorting Algorithm for Accelerating Join-Based Queries
inferred← citeshttps://doi.org/10.4018/978-1-60566-328-9.ch002openalex-snapshot
Improving OLAP Analysis of Multidimensional Data Streams via Efficient Compression Techniques
inferred← citeshttps://doi.org/10.4156/jcit.vol4.issue4.9openalex-snapshot
A Multi Join Algorithm Utilizing Double Indices
inferred← citeshttps://doi.org/10.48550/arxiv.1611.04942openalex-snapshot
Fast and Accurate Mining of Correlated Heavy Hitters
inferred← citeshttps://doi.org/10.48550/arxiv.1908.08654openalex-snapshot
Efficient Join Processing Over Incomplete Data Streams (Technical Report)
inferred← citeshttps://doi.org/10.48550/arxiv.2103.08720openalex-snapshot
Online Topic-Aware Entity Resolution Over Incomplete Data Streams (Technical Report)
inferred← citeshttps://doi.org/10.5281/zenodo.1332819openalex-snapshot
An Efficient Multi Join Algorithm Utilizing A Lattice Of Double Indices
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.