On the public citation graph
Aggregate Query Answering on Possibilistic Data with Cardinality Constraints
0 signed · 31 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/s00778-007-0080-zopenalex-snapshot
Databases with uncertainty and lineage
inferredcites →https://doi.org/10.1007/s00778-009-0167-9openalex-snapshot
Anonymizing bipartite graph data using safe groupings
inferredcites →https://doi.org/10.1007/s10479-006-0091-yopenalex-snapshot
Progress in computational mixed integer programming—A look back from the other side of the tipping point
inferredcites →https://doi.org/10.1016/b978-1-55860-890-0.x5000-2openalex-snapshot
Constraint Processing
inferredcites →https://doi.org/10.1109/icde.2006.174openalex-snapshot
Working Models for Uncertain Data
inferredcites →https://doi.org/10.1109/icde.2007.367905openalex-snapshot
Representing and Querying Correlated Tuples in Probabilistic Databases
inferredcites →https://doi.org/10.1109/icde.2007.367906openalex-snapshot
10106Worlds and Beyond: Efficient Representation and Processing of Incomplete Information
inferredcites →https://doi.org/10.1109/icde.2008.4497507openalex-snapshot
Fast and Simple Relational Processing of Uncertain Data
inferredcites →https://doi.org/10.1145/1044731.1044734openalex-snapshot
Aggregate operators in probabilistic databases
inferredcites →https://doi.org/10.1145/1401890.1401982openalex-snapshot
Anonymizing transaction databases for publication
inferredcites →https://doi.org/10.1145/1559795.1559835openalex-snapshot
Consensus answers for queries over probabilistic databases
inferredcites →https://doi.org/10.1145/1634.1886openalex-snapshot
Incomplete Information in Relational Databases
inferredcites →https://doi.org/10.1145/1989323.1989409openalex-snapshot
Querying uncertain data with aggregate constraints
inferredcites →https://doi.org/10.1145/502512.502572openalex-snapshot
Real world performance of association rule algorithms
inferredcites →https://doi.org/10.14778/1453856.1453874openalex-snapshot
Privacy-preserving anonymization of set-valued data
inferredcites →https://doi.org/10.14778/1453856.1453947openalex-snapshot
Anonymizing bipartite graph data using safe groupings
inferredcites →https://doi.org/10.14778/1687627.1687733openalex-snapshot
Anonymization of set-valued data via top-down, local generalization
inferredcites →https://doi.org/10.48550/arxiv.cs/0606075openalex-snapshot
10^(10^6) Worlds and Beyond: Efficient Representation and Processing of Incomplete Information
inferredcites →https://doi.org/10.5555/1182635.1164209openalex-snapshot
ULDBs: databases with uncertainty and lineage
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ett.4130openalex-snapshot
(τ, m)‐ slicedBucket privacy model for sequential anonymization for improving privacy and utility
inferred← citeshttps://doi.org/10.1002/sec.982openalex-snapshot
On query execution over encrypted data
inferred← citeshttps://doi.org/10.1007/978-3-319-18123-3_7openalex-snapshot
Tracing Errors in Probabilistic Databases Based on the Bayesian Network
inferred← citeshttps://doi.org/10.1007/978-3-319-25264-3_27openalex-snapshot
A Working Model for Uncertain Data with Lineage
inferred← citeshttps://doi.org/10.1007/978-981-10-6893-5_16openalex-snapshot
Query Optimization Strategies in Probabilistic Relational Databases
inferred← citeshttps://doi.org/10.1007/978-981-13-1651-7_32openalex-snapshot
Assumption Queries Processing of Probabilistic Relational Databases
inferred← citeshttps://doi.org/10.1007/s00778-018-0511-zopenalex-snapshot
Probabilistic Cardinality Constraints
inferred← citeshttps://doi.org/10.1016/j.datak.2017.03.005openalex-snapshot
Probabilistic object deputy model for uncertain data and lineage management
inferred← citeshttps://doi.org/10.1145/3448016.3459238openalex-snapshot
Logical Schema Design that Quantifies Update Inefficiency and Join Efficiency
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3268445/v1openalex-snapshot
Query Optimization in Uncertain and Probabilistic Databases
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.