On the public citation graph
Functional Aggregate Queries with Additive Inequalities
0 signed · 58 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/978-3-540-74915-8_18openalex-snapshot
On Acyclic Conjunctive Queries and Constant Delay Enumeration
inferredcites →https://doi.org/10.1007/s00224-016-9684-2openalex-snapshot
Answering Conjunctive Queries with Inequalities
inferredcites →https://doi.org/10.1016/b978-155860869-6/50017-2openalex-snapshot
Efficient Algorithms for Processing XPath Queries
inferredcites →https://doi.org/10.1016/j.patrec.2009.09.011openalex-snapshot
Data clustering: 50 years beyond K-means
inferredcites →https://doi.org/10.1109/focs.2008.43openalex-snapshot
Size Bounds and Query Plans for Relational Joins
inferredcites →https://doi.org/10.1137/0217026openalex-snapshot
A Functional Approach to Data Structures and Its Use in Multidimensional Searching
inferredcites →https://doi.org/10.1145/1150402.1150429openalex-snapshot
Training linear SVMs in linear time
inferredcites →https://doi.org/10.1145/1559845.1559887openalex-snapshot
Secondary-storage confidence computation for conjunctive queries with inequalities
inferredcites →https://doi.org/10.1145/1998196.1998198openalex-snapshot
Orthogonal range searching on the RAM, revisited
inferredcites →https://doi.org/10.1145/2213556.2213565openalex-snapshot
Worst-Case Optimal Join Algorithms
inferredcites →https://doi.org/10.1145/2448496.2448498openalex-snapshot
Enumerating with constant delay the answers to a query
inferredcites →https://doi.org/10.1145/2535926openalex-snapshot
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
inferredcites →https://doi.org/10.1145/2636918openalex-snapshot
Constraint Solving via Fractional Edge Covers
inferredcites →https://doi.org/10.1145/2723372.2723713openalex-snapshot
Learning Generalized Linear Models Over Normalized Data
inferredcites →https://doi.org/10.1145/2882903.2882939openalex-snapshot
Learning Linear Regression Models over Factorized Joins
inferredcites →https://doi.org/10.1145/3034786.3056105openalex-snapshot
What Do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog Have to Do with One Another?
inferredcites →https://doi.org/10.1145/3093754.3093757openalex-snapshot
Juggling Functions Inside a Database
inferredcites →https://doi.org/10.1145/3196959.3196960openalex-snapshot
In-Database Learning with Sparse Tensors
inferredcites →https://doi.org/10.1145/3294052.3319694openalex-snapshot
On Functional Aggregate Queries with Additive Inequalities
inferredcites →https://doi.org/10.1145/3375661openalex-snapshot
Learning Models over Relational Data Using Sparse Tensors and Functional Dependencies
inferredcites →https://doi.org/10.1145/42267.42273openalex-snapshot
On conjunctive queries containing inequalities
inferredcites →https://doi.org/10.1145/564691.564705openalex-snapshot
Accelerating XPath location steps
inferredcites →https://doi.org/10.1145/79147.79149openalex-snapshot
Lower bounds for orthogonal range searching: part II. The arithmetic model
inferredcites →https://doi.org/10.14778/2367502.2367510openalex-snapshot
The MADlib analytics library
inferredcites →https://doi.org/10.14778/2831360.2831362openalex-snapshot
Lightning fast and space efficient inequality joins
inferredcites →https://doi.org/10.4230/lipics.icdt.2019.21openalex-snapshot
Boolean Tensor Decomposition for Conjunctive Queries with Negation
inferredcites →https://doi.org/10.5555/1966806.1966812openalex-snapshot
Pegasos: primal estimated sub-gradient solver for SVM
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-024-00888-3openalex-snapshot
In-database query optimization on SQL with ML predicates
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00299openalex-snapshot
Toward Responsive DBMS: Optimal Join Algorithms, Enumeration, Factorization, Ranking, and Dynamic Programming
inferred← citeshttps://doi.org/10.1109/iucc-cit-dsci-smartcns55181.2021.00064openalex-snapshot
A New Interval Algebra for Temporal Data Modeling and Analysis
inferred← citeshttps://doi.org/10.1137/22m1512211openalex-snapshot
Counting Small Induced Subgraphs with Hereditary Properties
inferred← citeshttps://doi.org/10.1145/3465480.3467843openalex-snapshot
Machine learning over static and dynamic relational data
inferred← citeshttps://doi.org/10.1145/3514221.3517830openalex-snapshot
Conjunctive Queries with Comparisons
inferred← citeshttps://doi.org/10.1145/3517804.3524156openalex-snapshot
The Complexity of Boolean Conjunctive Queries with Intersection Joins
inferred← citeshttps://doi.org/10.1145/3517804.3526234openalex-snapshot
Tight Fine-Grained Bounds for Direct Access on Join Queries
inferred← citeshttps://doi.org/10.1145/3584372.3589936openalex-snapshot
A Query Language Perspective on Graph Learning
inferred← citeshttps://doi.org/10.1145/3626735openalex-snapshot
Lightweight Materialization for Fast Dashboards Over Joins
inferred← citeshttps://doi.org/10.1145/3651138openalex-snapshot
Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization
inferred← citeshttps://doi.org/10.1145/3654971openalex-snapshot
Relational Algorithms for Top-k Query Evaluation
inferred← citeshttps://doi.org/10.1145/3717823.3718141openalex-snapshot
A Fine-Grained Classification of Subquadratic Patterns for Subgraph Listing and Friends
inferred← citeshttps://doi.org/10.1145/3725235openalex-snapshot
Fast Matrix Multiplication meets the Submodular Width
inferred← citeshttps://doi.org/10.1145/3725242openalex-snapshot
Output-Sensitive Evaluation of Regular Path Queries
inferred← citeshttps://doi.org/10.1145/3780099openalex-snapshot
Conjunctive Queries with Negation and Aggregation: A Linear Time Characterization
inferred← citeshttps://doi.org/10.1145/3788852.3805595openalex-snapshot
Query Optimization and Evaluation via Information Theory
inferred← citeshttps://doi.org/10.1145/3801891openalex-snapshot
Acyclic Conjunctive Regular Path Queries are no Harder than Corresponding Conjunctive Queries
inferred← citeshttps://doi.org/10.1145/3801904openalex-snapshot
Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time
inferred← citeshttps://doi.org/10.14778/3611479.3611508openalex-snapshot
Saibot: A Differentially Private Data Search Platform
inferred← citeshttps://doi.org/10.14778/3611479.3611509openalex-snapshot
JoinBoost: Grow Trees over Normalized Data Using Only SQL
inferred← citeshttps://doi.org/10.14778/3659437.3659454openalex-snapshot
Rapidash: Efficient Detection of Constraint Violations
inferred← citeshttps://doi.org/10.48550/arxiv.2107.13923openalex-snapshot
Machine Learning over Static and Dynamic Relational Data
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.