On the public citation graph

Sampling issues in parallel database systems

0 signed · 38 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
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.1145/113379.113380openalex-snapshot
A comparison of sorting algorithms for the connection machine CM-2
inferredcites →https://doi.org/10.1145/115790.115837openalex-snapshot
Error-constrained COUNT query evaluation in relational databases
inferredcites →https://doi.org/10.1145/122058.122071openalex-snapshot
Parallel database systems
inferredcites →https://doi.org/10.1145/308386.308455openalex-snapshot
Statistical estimators for relational algebra expressions
inferredcites →https://doi.org/10.1145/322248.322254openalex-snapshot
Expected Length of the Longest Probe Sequence in Hash Code Searching
inferredcites →https://doi.org/10.1145/66926.66933openalex-snapshot
Processing aggregate relational queries with hard time constraints
inferredcites →https://doi.org/10.1145/67544.66933openalex-snapshot
Processing aggregate relational queries with hard time constraints
inferredcites →https://doi.org/10.1145/93597.93611openalex-snapshot
Practical selectivity estimation through adaptive sampling

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/spe.4380220702openalex-snapshot
Tuning a parallel database algorithm on a shared‐memory multiprocessor
inferred← citeshttps://doi.org/10.1007/3-540-44681-8_42openalex-snapshot
A Classification of Skew Effects in Parallel Database Systems
inferred← citeshttps://doi.org/10.1007/3-540-60608-4_35openalex-snapshot
Efficiently following object references for large object collections and small main memory
inferred← citeshttps://doi.org/10.1007/bf00140664openalex-snapshot
Random sampling from databases: a survey
inferred← citeshttps://doi.org/10.1007/bf01263656openalex-snapshot
A load-balanced parallel sorting algorithm for shared-nothing architectures
inferred← citeshttps://doi.org/10.1016/j.parco.2003.05.003openalex-snapshot
Parallel bulk-loading of spatial data
inferred← citeshttps://doi.org/10.1023/a:1021567425133openalex-snapshot
Fully Dynamic Partitioning: Handling Data Skew in Parallel Data Cube Computation
inferred← citeshttps://doi.org/10.1023/a:1026458902456openalex-snapshot
Intensive Data Management in Parallel Systems: A Survey
inferred← citeshttps://doi.org/10.1109/69.599930openalex-snapshot
Efficient bulk-loading of gridfiles
inferred← citeshttps://doi.org/10.1109/cluster.2019.8891005openalex-snapshot
Engineering a Distributed Histogram Sort
inferred← citeshttps://doi.org/10.1109/icde.2007.367885openalex-snapshot
Load Distribution Fairness in P2P Data Management Systems
inferred← citeshttps://doi.org/10.1109/icebe.2005.47openalex-snapshot
Data partitioning over data streams based on change-aware sampling
inferred← citeshttps://doi.org/10.1109/ipdpsw.2010.5470692openalex-snapshot
Out-of-core distribution sort in the FG programming environment
inferred← citeshttps://doi.org/10.1109/pdis.1991.183115openalex-snapshot
Parallel sorting on a shared-nothing architecture using probabilistic splitting
inferred← citeshttps://doi.org/10.1145/1376616.1376693openalex-snapshot
Efficient bulk insertion into a distributed ordered table
inferred← citeshttps://doi.org/10.1145/152610.152611openalex-snapshot
Query evaluation techniques for large databases
inferred← citeshttps://doi.org/10.1145/156883.156894openalex-snapshot
Database research at Wisconsin
inferred← citeshttps://doi.org/10.1145/170035.170086openalex-snapshot
Algorithms for loading parallel grid files
inferred← citeshttps://doi.org/10.1145/1807128.1807150openalex-snapshot
Towards automatic optimization of MapReduce programs
inferred← citeshttps://doi.org/10.1145/2213836.2213965openalex-snapshot
CloudRAMSort
inferred← citeshttps://doi.org/10.1145/2391229.2391245openalex-snapshot
Balancing reducer skew in MapReduce workloads using progressive sampling
inferred← citeshttps://doi.org/10.1145/2396761.2398423openalex-snapshot
You can stop early with COLA
inferred← citeshttps://doi.org/10.1349/ddlp.349openalex-snapshot
Tackling latency using FG
inferred← citeshttps://doi.org/10.14778/3402707.3402711openalex-snapshot
A Framework for supporting DBMS-like indexes in the cloud
inferred← citeshttps://doi.org/10.31274/etd-180810-333openalex-snapshot
Combinatorial design and development of biomaterials for use as drug delivery devices and immune adjuvants
inferred← citeshttps://doi.org/10.48550/arxiv.1605.05566openalex-snapshot
Naughton's Wisconsin Bibliography: A Brief Guide
inferred← citeshttps://doi.org/10.5220/0003995100160026openalex-snapshot
An Efficient Sampling Scheme for Approximate Processing of Decision Support Queries
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.