On the public citation graph

Optimal Joins Using Compressed Quadtrees

0 signed · 45 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.1002/spe.2198openalex-snapshot
Optimized succinct data structures for massive data
inferredcites →https://doi.org/10.1007/978-1-84628-959-0openalex-snapshot
Variable-length Codes for Data Compression
inferredcites →https://doi.org/10.1007/978-3-030-00668-6_23openalex-snapshot
Getting the Most Out of Wikidata: Semantic Technology Usage in Wikipedia’s Knowledge Graph
inferredcites →https://doi.org/10.1007/978-3-030-30793-6_15openalex-snapshot
A Worst-Case Optimal Join Algorithm for SPARQL
inferredcites →https://doi.org/10.1007/978-3-642-02184-8openalex-snapshot
Networked Knowledge - Networked Media
inferredcites →https://doi.org/10.1007/bf00288933openalex-snapshot
Quad trees a data structure for retrieval on composite keys
inferredcites →https://doi.org/10.1007/bf01940874openalex-snapshot
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
inferredcites →https://doi.org/10.1007/s00778-009-0165-yopenalex-snapshot
The RDF-3X engine for scalable management of RDF data
inferredcites →https://doi.org/10.1007/s10115-014-0770-yopenalex-snapshot
Compressed vertical partitioning for efficient RDF management
inferredcites →https://doi.org/10.1016/0743-7315(90)90079-5openalex-snapshot
Costs of quadtree representation of nondense matrices
inferredcites →https://doi.org/10.1016/b978-012088469-8.50005-xopenalex-snapshot
Compressing Large Boolean Matrices Using Reordering Techniques
inferredcites →https://doi.org/10.1016/j.ipm.2018.05.007openalex-snapshot
Hybrid compression of inverted lists for reordered document collections
inferredcites →https://doi.org/10.1016/j.is.2013.08.003openalex-snapshot
Compact representation of Web graphs with extended functionality
inferredcites →https://doi.org/10.1016/j.is.2015.08.008openalex-snapshot
Practical compressed string dictionaries
inferredcites →https://doi.org/10.1016/j.is.2017.05.003openalex-snapshot
Compressed representation of dynamic binary relations with applications
inferredcites →https://doi.org/10.1017/cbo9781316588284openalex-snapshot
Compact Data Structures
inferredcites →https://doi.org/10.1109/dcc.2015.57openalex-snapshot
Faster Compressed Quadtrees
inferredcites →https://doi.org/10.1137/1.9781611972870.6openalex-snapshot
Practical Entropy-Compressed Rank/Select Dictionary
inferredcites →https://doi.org/10.1137/110859440openalex-snapshot
Size Bounds and Query Plans for Relational Joins
inferredcites →https://doi.org/10.1145/2213556.2213565openalex-snapshot
Worst-Case Optimal Join Algorithms
inferredcites →https://doi.org/10.1145/2220357.2220363openalex-snapshot
Size and Treewidth Bounds for Conjunctive Queries
inferredcites →https://doi.org/10.1145/2590989.2590991openalex-snapshot
Skew strikes back
inferredcites →https://doi.org/10.1145/2594538.2594547openalex-snapshot
Beyond worst-case analysis for joins with minesweeper
inferredcites →https://doi.org/10.1145/2601073openalex-snapshot
Fully Functional Static and Dynamic Succinct Trees
inferredcites →https://doi.org/10.1145/2629489openalex-snapshot
Wikidata
inferredcites →https://doi.org/10.1145/2764947.2764948openalex-snapshot
Join Processing for Graph Patterns
inferredcites →https://doi.org/10.1145/2902251.2902280openalex-snapshot
FAQ
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/3034786.3056449openalex-snapshot
Communication Cost in Parallel Query Evaluation
inferredcites →https://doi.org/10.1145/3129246openalex-snapshot
EmptyHeaded
inferredcites →https://doi.org/10.1145/3196959.3196979openalex-snapshot
Compressed Representations of Conjunctive Query Results
inferredcites →https://doi.org/10.1145/3448016.3457256openalex-snapshot
Worst-Case Optimal Graph Joins in Almost No Space
inferredcites →https://doi.org/10.1201/b16859-12openalex-snapshot
Mapping Relational Databases to Linked Data
inferredcites →https://doi.org/10.48550/arxiv.1404.0703openalex-snapshot
Joins via Geometric Resolutions: Worst-case and Beyond

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_4openalex-snapshot
Evaluating Regular Path Queries on Compressed Adjacency Matrices
inferred← citeshttps://doi.org/10.1007/978-3-031-72200-4_17openalex-snapshot
Compressed Graph Representations for Evaluating Regular Path Queries
inferred← citeshttps://doi.org/10.1007/978-981-97-5575-2_36openalex-snapshot
EPEI: An RDF Retrieval System Based on Efficient Predicate-Entity Indexing
inferred← citeshttps://doi.org/10.1007/s00778-024-00885-6openalex-snapshot
Evaluating regular path queries on compressed adjacency matrices
inferred← citeshttps://doi.org/10.1007/s00778-025-00945-5openalex-snapshot
CompactLTJ: Space & Time Efficient Leapfrog Triejoin on Graph Databases
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00082openalex-snapshot
TeMatch: A Fast Temporal Subgraph Matching Framework with Temporal-Aware Subgraph Matching Algorithms
inferred← citeshttps://doi.org/10.1145/3639294openalex-snapshot
Worst-Case-Optimal Similarity Joins on Graph Databases
inferred← citeshttps://doi.org/10.1145/3734517openalex-snapshot
Any-k Algorithms for Enumerating Ranked Answers to Conjunctive Queries
inferred← citeshttps://doi.org/10.1145/3810460.3812779openalex-snapshot
Boosting Graph Joins and Matrix Multiplications in Little Space
inferred← citeshttps://doi.org/10.14778/3611479.3611492openalex-snapshot
Fast Search-by-Classification for Large-Scale Databases Using Index-Aware Decision Trees and Random Forests
inferred← citeshttps://doi.org/10.3390/math10142402openalex-snapshot
An Improved Model for Kernel Density Estimation Based on Quadtree and Quasi-Interpolation
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.