On the public citation graph
Combining Incompleteness and Ranking in Tree Queries
0 signed · 24 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.1006/jcss.2001.1811openalex-snapshot
Querying Incomplete Information in Semistructured Data
inferredcites →https://doi.org/10.1007/11780991_13openalex-snapshot
Incrementally Computing Ordered Answers of Acyclic Conjunctive Queries
inferredcites →https://doi.org/10.1007/s00778-004-0128-2openalex-snapshot
Supporting top-k join queries in relational databases
inferredcites →https://doi.org/10.1016/0020-0190(88)90065-8openalex-snapshot
On generating all maximal independent sets
inferredcites →https://doi.org/10.1016/b978-012722442-8/50072-0openalex-snapshot
Supporting Top-k Join Queries in Relational Databases
inferredcites →https://doi.org/10.1145/1017074.1017087openalex-snapshot
Twig query processing over graph-structured XML data
inferredcites →https://doi.org/10.1145/1142351.1142377openalex-snapshot
Finding and approximating top-k answers in keyword proximity search
inferredcites →https://doi.org/10.1145/303976.303999openalex-snapshot
Queries with incomplete answers over semistructured data
inferredcites →https://doi.org/10.1145/375551.375558openalex-snapshot
Flexible queries over semistructured data
inferredcites →https://doi.org/10.1287/mnsc.18.7.401openalex-snapshot
A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
inferredcites →https://doi.org/10.5555/1182635.1164191openalex-snapshot
Full disjunctions: polynomial-delay iterators in action
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10796-017-9748-0openalex-snapshot
Object-stack: An object-oriented approach for top-k keyword querying over fuzzy XML
inferred← citeshttps://doi.org/10.1007/s11280-011-0149-xopenalex-snapshot
Querying and ranking incomplete twigs in probabilistic XML
inferred← citeshttps://doi.org/10.1016/j.ins.2010.09.001openalex-snapshot
Matching twigs in fuzzy XML
inferred← citeshttps://doi.org/10.1016/j.knosys.2017.02.003openalex-snapshot
Tree pattern matching in heterogeneous fuzzy XML databases
inferred← citeshttps://doi.org/10.1109/fskd.2010.5569314openalex-snapshot
FTwig: Efficient algorithm for processing fuzzy XML twig pattern matching
inferred← citeshttps://doi.org/10.1109/icde.2009.24openalex-snapshot
Flexible XML Querying Using Skyline Semantics
inferred← citeshttps://doi.org/10.1145/1645953.1645971openalex-snapshot
Efficient processing of twig pattern matching in fuzzy XML
inferred← citeshttps://doi.org/10.14778/3402707.3402739openalex-snapshot
Optimizing and parallelizing ranked enumeration
inferred← citeshttps://doi.org/10.3233/kes-180379openalex-snapshot
A structure-based approach of keyword querying for fuzzy XML data
inferred← citeshttps://doi.org/10.46298/lmcs-21(2:14)2025openalex-snapshot
Ranked Enumeration of Conjunctive Query Results
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.