On the public citation graph

Erratum for Discovering Order Dependencies through Order Compatibility (EDBT 2019)

0 signed · 72 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 points at this work

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

inferred← citeshttps://doi.org/10.1007/s00778-021-00683-4openalex-snapshot
Efficient distributed discovery of bidirectional order dependencies
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00059openalex-snapshot
Efficient Set-Based Order Dependency Discovery with a Level-Wise Hybrid Strategy
inferred← citeshttps://doi.org/10.1145/3375395.3387647openalex-snapshot
New Results for the Complexity of Resilience for Binary Conjunctive Queries with Self-Joins
inferred← citeshttps://doi.org/10.1145/3375395.3387654openalex-snapshot
First-Order Rewritability in Consistent Query Answering with Respect to Multiple Keys
inferred← citeshttps://doi.org/10.1145/3379446openalex-snapshot
Debugging Large-scale Datalog
inferred← citeshttps://doi.org/10.1145/3404835.3463105openalex-snapshot
Retrieving Skill-Based Teams from Collaboration Networks
inferred← citeshttps://doi.org/10.1145/3411764.3445267openalex-snapshot
Glinda: Supporting Data Science with Live Programming, GUIs and a Domain-specific Language
inferred← citeshttps://doi.org/10.1145/3449148openalex-snapshot
Problematic Machine Behavior
inferred← citeshttps://doi.org/10.1145/3452021.3458814openalex-snapshot
Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction
inferred← citeshttps://doi.org/10.1145/3514221.3517911openalex-snapshot
Triton Join: Efficiently Scaling to a Large Join State on GPUs with Fast Interconnects
inferred← citeshttps://doi.org/10.1145/3514221.3526184openalex-snapshot
Efficient Evaluation of Arbitrarily-Framed Holistic SQL Aggregates and Window Functions
inferred← citeshttps://doi.org/10.1145/3546918.3546919openalex-snapshot
Automatic Array Transformation to Columnar Storage at Run Time
inferred← citeshttps://doi.org/10.1145/3548785.3548810openalex-snapshot
Self-Adapting Design and Maintenance of Multi-Model Databases
inferred← citeshttps://doi.org/10.1145/3555041.3589402openalex-snapshot
Main Memory Database Recovery Strategies
inferred← citeshttps://doi.org/10.1145/3555041.3589405openalex-snapshot
Fairness in Ranking: From Values to Technical Choices and Back
inferred← citeshttps://doi.org/10.1145/3555041.3589407openalex-snapshot
Optimizing Tensor Computations: From Applications to Compilation and Runtime Techniques
inferred← citeshttps://doi.org/10.1145/3555041.3589712openalex-snapshot
BCNF* - From Normalized- to Star-Schemas and Back Again
inferred← citeshttps://doi.org/10.1145/3555041.3589732openalex-snapshot
DIALITE: Discover, Align and Integrate Open Data Tables
inferred← citeshttps://doi.org/10.1145/3579051.3579070openalex-snapshot
Ontology-based Data Federation
inferred← citeshttps://doi.org/10.1145/3579990.3580020openalex-snapshot
Looplets: A Language for Structured Coiteration
inferred← citeshttps://doi.org/10.1145/3584372.3588655openalex-snapshot
Extremal Fitting Problems for Conjunctive Queries
inferred← citeshttps://doi.org/10.1145/3588682openalex-snapshot
AWARE: Workload-aware, Redundancy-exploiting Linear Algebra
inferred← citeshttps://doi.org/10.1145/3588689openalex-snapshot
SANTOS: Relationship-based Semantic Table Union Search
inferred← citeshttps://doi.org/10.1145/3588699openalex-snapshot
One-shot Garbage Collection for In-memory OLTP through Temporality-aware Version Storage
inferred← citeshttps://doi.org/10.1145/3588717openalex-snapshot
Optimizing Tensor Programs on Flexible Storage
inferred← citeshttps://doi.org/10.1145/3588955openalex-snapshot
INEv: In-Network Evaluation for Event Stream Processing
inferred← citeshttps://doi.org/10.1145/3589265openalex-snapshot
GIO: Generating Efficient Matrix and Frame Readers for Custom Data Formats by Example
inferred← citeshttps://doi.org/10.1145/3589272openalex-snapshot
HR-Index: An Effective Index Method for Historical Reachability Queries over Evolving Graphs
inferred← citeshttps://doi.org/10.1145/3589295openalex-snapshot
Free Join: Unifying Worst-Case Optimal and Traditional Joins
inferred← citeshttps://doi.org/10.1145/3589776openalex-snapshot
What's the Difference? Incremental Processing with Change Queries in Snowflake
inferred← citeshttps://doi.org/10.1145/3592980.3595302openalex-snapshot
Zero-sided RDMA: Network-driven Data Shuffling
inferred← citeshttps://doi.org/10.1145/3592980.3595323openalex-snapshot
Processing-in-Memory for Databases: Query Processing and Data Transfer
inferred← citeshttps://doi.org/10.1145/3617338openalex-snapshot
SAGA: A Scalable Framework for Optimizing Data Cleaning Pipelines for Machine Learning Applications
inferred← citeshttps://doi.org/10.1145/3626246.3653391openalex-snapshot
Stage: Query Execution Time Prediction in Amazon Redshift
inferred← citeshttps://doi.org/10.1145/3626246.3654692openalex-snapshot
Learned Query Optimizer: What is New and What is Next
inferred← citeshttps://doi.org/10.1145/3626246.3654694openalex-snapshot
SIMDified Data Processing - Foundations, Abstraction, and Advanced Techniques
inferred← citeshttps://doi.org/10.1145/3626712openalex-snapshot
Udon: Efficient Debugging of User-Defined Functions in Big Data Systems with Line-by-Line Control
inferred← citeshttps://doi.org/10.1145/3626761openalex-snapshot
DProvDB: Differentially Private Query Processing with Multi-Analyst Provenance
inferred← citeshttps://doi.org/10.1145/3627673.3679211openalex-snapshot
Human-in-the-Loop Feature Discovery for Tabular Data
inferred← citeshttps://doi.org/10.1145/3627673.3679573openalex-snapshot
Revisiting Optimal Window Aggregation in Data Streams: The Prefix-Sum Approach
inferred← citeshttps://doi.org/10.1145/3627673.3679764openalex-snapshot
Discovering Graph Generating Dependencies for Property Graph Profiling
inferred← citeshttps://doi.org/10.1145/3629104.3666030openalex-snapshot
AquaLang: A Dataflow Programming Language
inferred← citeshttps://doi.org/10.1145/3629526.3645036openalex-snapshot
ShuffleBench: A Benchmark for Large-Scale Data Shuffling Operations with Distributed Stream Processing Frameworks
inferred← citeshttps://doi.org/10.1145/3635138.3654763openalex-snapshot
Recent Increments in Incremental View Maintenance
inferred← citeshttps://doi.org/10.1145/3639271openalex-snapshot
Optimizing Nested Recursive Queries
inferred← citeshttps://doi.org/10.1145/3639291openalex-snapshot
Zero-sided RDMA: Network-driven Data Shuffling for Disaggregated Heterogeneous Cloud DBMSs
inferred← citeshttps://doi.org/10.1145/3639328openalex-snapshot
Summarized Causal Explanations For Aggregate Views
inferred← citeshttps://doi.org/10.1145/3654935openalex-snapshot
DecoPa: Query Decomposition for Parallel Complex Event Processing
inferred← citeshttps://doi.org/10.1145/3654941openalex-snapshot
Fault Tolerance Placement in the Internet of Things
inferred← citeshttps://doi.org/10.1145/3654948openalex-snapshot
Hyper: A High-Performance and Memory-Efficient Learned Index via Hybrid Construction
inferred← citeshttps://doi.org/10.1145/3654953openalex-snapshot
Low-Latency Adaptive Distributed Stream Join System Based on a Flexible Join Model
inferred← citeshttps://doi.org/10.1145/3654969openalex-snapshot
Query Refinement for Diverse Top-k Selection
inferred← citeshttps://doi.org/10.1145/3663741.3664781openalex-snapshot
On-Demand Pattern Aggregation in Event Networks
inferred← citeshttps://doi.org/10.1145/3677134openalex-snapshot
Enabling Adaptive Sampling for Intra-Window Join: Simultaneously Optimizing Quantity and Quality
inferred← citeshttps://doi.org/10.1145/3689031.3717485openalex-snapshot
Impeller: Stream Processing on Shared Logs
inferred← citeshttps://doi.org/10.1145/3695837openalex-snapshot
Insert-Only versus Insert-Delete in Dynamic Query Evaluation
inferred← citeshttps://doi.org/10.1145/3698828openalex-snapshot
Towards a Converged Relational-Graph Optimization Framework
inferred← citeshttps://doi.org/10.1145/3709653openalex-snapshot
Online Marketplace: A Benchmark for Data Management in Microservices
inferred← citeshttps://doi.org/10.1145/3709682openalex-snapshot
DISCES: Systematic Discovery of Event Stream Queries
inferred← citeshttps://doi.org/10.1145/3709705openalex-snapshot
Modyn: Data-Centric Machine Learning Pipeline Orchestration
inferred← citeshttps://doi.org/10.1145/3720473openalex-snapshot
Finch: Sparse and Structured Tensor Programming with Control Flow
inferred← citeshttps://doi.org/10.1145/3725242openalex-snapshot
Output-Sensitive Evaluation of Regular Path Queries
inferred← citeshttps://doi.org/10.1145/3725247openalex-snapshot
Rewriting Consistent Answers On Annotated Data
inferred← citeshttps://doi.org/10.1145/3732777openalex-snapshot
A Survey on Failure Analysis and Fault Injection in AI Systems
inferred← citeshttps://doi.org/10.1145/3734517openalex-snapshot
Any-k Algorithms for Enumerating Ranked Answers to Conjunctive Queries
inferred← citeshttps://doi.org/10.11591/ijeecs.v25.i2.pp1094-1102openalex-snapshot
Efficient processing of continuous spatial-textual queries over geo-textual data stream
inferred← citeshttps://doi.org/10.2200/s00655ed1v01y201507wbe013openalex-snapshot
Entity Resolution in the Web of Data
inferred← citeshttps://doi.org/10.2200/s00870ed1v01y201807dtm050openalex-snapshot
Query Processing over Incomplete Databases
inferred← citeshttps://doi.org/10.2200/s00873ed1v01y201808dtm051openalex-snapshot
Querying Graphs
inferred← citeshttps://doi.org/10.2200/s00986ed1v01y202001dtm062openalex-snapshot
Cloud-Based RDF Data Management
inferred← citeshttps://doi.org/10.48550/arxiv.2005.14068openalex-snapshot
Discovering Domain Orders through Order Dependencies
inferred← citeshttps://doi.org/10.48550/arxiv.2101.02174openalex-snapshot
Efficient Discovery of Approximate Order Dependencies
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.