On the public citation graph
Partial-match retrieval for dynamic files
0 signed · 47 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/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
inferredcites →https://doi.org/10.1145/322123.322126openalex-snapshot
Optimality Properties of Multiple-Key Hashing Functions
inferredcites →https://doi.org/10.1145/359007.359013openalex-snapshot
Partial-match retrieval using indexed descriptor files
inferredcites →https://doi.org/10.1145/360827.360831openalex-snapshot
Attribute based file organization in a paged memory environment
inferredcites →https://doi.org/10.2307/2316512openalex-snapshot
Optimization in Integers and Related Extremal Problems.
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-13883-8_87openalex-snapshot
Grid file algorithms: An analysis in the biased case
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/978-94-009-5044-3_5openalex-snapshot
Implementation Issues of Logic Programming Languages
inferred← citeshttps://doi.org/10.1007/bf00996923openalex-snapshot
Multidimensional extendible hashing for partial-match queries
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/bf01935368openalex-snapshot
Partial match retrieval using recursive linear hashing
inferred← citeshttps://doi.org/10.1007/bf01990535openalex-snapshot
Optimal dynamic multi-attribute hashing for range queries
inferred← citeshttps://doi.org/10.1016/0020-0255(93)90126-7openalex-snapshot
Concurrent operations in multi-attribute linear hashing
inferred← citeshttps://doi.org/10.1016/0169-023x(88)90004-3openalex-snapshot
Issues in relational database performance (invited paper ISDBMS)
inferred← citeshttps://doi.org/10.1016/0306-4379(93)90041-xopenalex-snapshot
Optimal MMI file systems for orthogonal range retrieval
inferred← citeshttps://doi.org/10.1016/0743-1066(84)90024-4openalex-snapshot
A KWIC (key word in context) bibliography on prolog and logic programming
inferred← citeshttps://doi.org/10.1016/b978-0-934613-40-8.50017-8openalex-snapshot
A Superjoin Algorithm for Deductive Databases
inferred← citeshttps://doi.org/10.1016/s0020-0255(97)10017-2openalex-snapshot
Parallel relational operations using clustered surrogate files on shared-nothing multiprocessors
inferred← citeshttps://doi.org/10.1109/32.6184openalex-snapshot
Gray codes for partial match and range queries
inferred← citeshttps://doi.org/10.1109/52.17804openalex-snapshot
Multikey, extensible hashing for relational databases
inferred← citeshttps://doi.org/10.1109/69.87965openalex-snapshot
An efficient file structure for document retrieval in the automated office environment
inferred← citeshttps://doi.org/10.1109/69.91065openalex-snapshot
Multilevel extendible hashing: a file structure for very large databases
inferred← citeshttps://doi.org/10.1109/adc.2000.819818openalex-snapshot
Efficient range query retrieval for non-uniform data distributions
inferred← citeshttps://doi.org/10.1109/cmpsac.1996.544601openalex-snapshot
Optimal linear hashing files for orthogonal range retrieval
inferred← citeshttps://doi.org/10.1109/fmpc.1990.89463openalex-snapshot
Parallel relational operations based on clustered surrogate files
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/icde.1986.7266214openalex-snapshot
Implementation of multi-key extendible hashing as an access method for a relational DBMS
inferred← citeshttps://doi.org/10.1109/icde.1987.7272370openalex-snapshot
An efficient file structure for document retrieval in the automated office environment
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/pccc.1993.344471openalex-snapshot
Signature file hashing using term occurrence and query frequencies
inferred← citeshttps://doi.org/10.1109/sfcs.1983.79openalex-snapshot
Tree structures for partial match retrieval
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/12047.12048openalex-snapshot
Associative searching in multiple storage units
inferred← citeshttps://doi.org/10.1145/143559.143652openalex-snapshot
Parallel main memory database system
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
inferred← citeshttps://doi.org/10.1145/5383.5453openalex-snapshot
Partial match retrieval of multidimensional data
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.4289openalex-snapshot
The Topological Information Retrieval System and the Topological Paradigm: a Unification of the Major Models of Information Retrieval.
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.