On the public citation graph
Optimal partial-match retrieval
0 signed · 29 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.1145/320071.320074openalex-snapshot
Optimal partial-match retrieval when fields are independently specified
inferredcites →https://doi.org/10.1145/322123.322126openalex-snapshot
Optimality Properties of Multiple-Key Hashing Functions
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-51295-0_128openalex-snapshot
Partial-match retrieval for dynamic files using linear hashing with partial expansions
inferred← citeshttps://doi.org/10.1007/bf01931657openalex-snapshot
Multi-attribute hashing with multiple file copies for high performance partial-match retrieval
inferred← citeshttps://doi.org/10.1007/bf01944474openalex-snapshot
Partial-match retrieval for dynamic files
inferred← citeshttps://doi.org/10.1007/bf01990535openalex-snapshot
Optimal dynamic multi-attribute hashing for range queries
inferred← citeshttps://doi.org/10.1007/bfb0032441openalex-snapshot
Parallelism for high performance query processing
inferred← citeshttps://doi.org/10.1016/0020-0190(81)90034-xopenalex-snapshot
Optimal choice of discriminators in a balanced k-d binary search tree
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90248-8openalex-snapshot
Multidisk partial match file design with known access pattern
inferred← citeshttps://doi.org/10.1016/0306-4379(87)90029-9openalex-snapshot
Optimal bucket size for multiattribute retrieval in partitioned files
inferred← citeshttps://doi.org/10.1016/0306-4379(90)90049-uopenalex-snapshot
An effective representation of complex clauses in a relational database
inferred← citeshttps://doi.org/10.1016/b978-1-4832-1313-2.50026-3openalex-snapshot
An Effective Method for Storing and Retrieving PROLOG Clauses from a Relational Database
inferred← citeshttps://doi.org/10.1093/comjnl/40.7.416openalex-snapshot
Optimal Clustering of Relations to Improve Sorting and Partitioning for Joins
inferred← citeshttps://doi.org/10.1093/comjnl/41.5.283openalex-snapshot
High-Performance Operations Using a Compressed Database Architecture
inferred← citeshttps://doi.org/10.1109/32.6184openalex-snapshot
Gray codes for partial match and range queries
inferred← citeshttps://doi.org/10.1109/hicss.1988.11738openalex-snapshot
Back end architecture based on transformed inverted lists-A surrogate file structure for a very large data/knowledge base
inferred← citeshttps://doi.org/10.1109/mc.1987.1663506openalex-snapshot
Computer Architecture for a Surrogate File to a Very Large Data/Knowledge Base
inferred← citeshttps://doi.org/10.1109/tkde.2002.1019219openalex-snapshot
A stochastic programming approach for range query retrieval problems
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/1379272.1379285openalex-snapshot
Index tuning for parameterized streaming groupby queries
inferred← citeshttps://doi.org/10.1145/16856.16877openalex-snapshot
Multiattribute hashing using Gray codes
inferred← citeshttps://doi.org/10.1145/256163.256165openalex-snapshot
Data structures for efficient broker implementation
inferred← citeshttps://doi.org/10.1145/27629.214285openalex-snapshot
Optimal signature extraction and information loss
inferred← citeshttps://doi.org/10.1145/319996.320006openalex-snapshot
Partial-match retrieval using hashing and descriptors
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.