On the public citation graph
Storage cost considerations in secondary index selection
0 signed · 39 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/bf00976642openalex-snapshot
The choice of partial inversions and combined indices
inferredcites →https://doi.org/10.1057/jors.1970.122openalex-snapshot
Integer Programming and Network Flows.
inferredcites →https://doi.org/10.1109/t-c.1969.222542openalex-snapshot
Optimal File Allocation in a Multiple Computer System
inferredcites →https://doi.org/10.1145/1499586.1499662openalex-snapshot
Optimal file allocation in multi-level storage systems
inferredcites →https://doi.org/10.1145/321592.321596openalex-snapshot
Optimization of Memory Hierarchies in Multiprogrammed Systems
inferredcites →https://doi.org/10.1145/357980.358007openalex-snapshot
A relational model of data for large shared data banks
inferredcites →https://doi.org/10.1145/360827.360831openalex-snapshot
Attribute based file organization in a paged memory environment
inferredcites →https://doi.org/10.1145/362384.362685openalex-snapshot
A relational model of data for large shared data banks
inferredcites →https://doi.org/10.1145/800184.810505openalex-snapshot
An optimization problem on the selection of secondary keys
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
inferredcites →https://doi.org/10.2307/3008450openalex-snapshot
Integer Programming and Network Flows.
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-11214-6_1openalex-snapshot
An integrated approach to database design
inferred← citeshttps://doi.org/10.1007/978-1-4612-5798-1_2openalex-snapshot
A Multivariate Statistical Model for Data Base Performance Evaluation
inferred← citeshttps://doi.org/10.1007/978-1-4613-9883-7_1openalex-snapshot
A Survey of File Organizations and Performance
inferred← citeshttps://doi.org/10.1007/978-3-642-53962-6_43openalex-snapshot
A Parallel Chemical Reaction Optimization for Multiple Choice Knapsack Problem
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90101-7openalex-snapshot
Approximating block accesses in database organizations
inferred← citeshttps://doi.org/10.1016/0020-0255(88)90006-0openalex-snapshot
Batched searching in database organizations
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90124-ropenalex-snapshot
Pipeline architectures for dynamic programming algorithms
inferred← citeshttps://doi.org/10.1016/0304-3975(76)90048-7openalex-snapshot
Approximate algorithms for some generalized knapsack problems
inferred← citeshttps://doi.org/10.1016/0306-4379(84)90017-6openalex-snapshot
Estimating block selectivities
inferred← citeshttps://doi.org/10.1016/0306-4379(88)90015-4openalex-snapshot
The effect of buffer size on pages accessed in random files
inferred← citeshttps://doi.org/10.1016/0306-4379(91)90007-vopenalex-snapshot
Approximating block accesses in random files: The case of blocking factors lower than one
inferred← citeshttps://doi.org/10.1016/0377-0427(93)e0264-mopenalex-snapshot
A hybrid dynamic programming/branch-and-bound algorithm for the multiple-choice knapsack problem
inferred← citeshttps://doi.org/10.1016/s0305-0548(96)00063-9openalex-snapshot
An urn model with applications to database performance evaluation
inferred← citeshttps://doi.org/10.1093/comjnl/25.3.368openalex-snapshot
On Estimating the Cost of Accessing Records in Blocked Database Organizations
inferred← citeshttps://doi.org/10.1145/182.358452openalex-snapshot
Estimating block accesses in database organizations
inferred← citeshttps://doi.org/10.1145/2588555.2595635openalex-snapshot
Parallel I/O aware query optimization
inferred← citeshttps://doi.org/10.1145/329.318578openalex-snapshot
Implications of certain assumptions in database performance evauation
inferred← citeshttps://doi.org/10.1145/359461.359475openalex-snapshot
Approximating block accesses in database organizations
inferred← citeshttps://doi.org/10.1145/509383.509385openalex-snapshot
Index selection in a self-adaptive data base management system
inferred← citeshttps://doi.org/10.1145/509384.509385openalex-snapshot
Index selection in a self-adaptive data base management system
inferred← citeshttps://doi.org/10.1145/582095.582109openalex-snapshot
Performance analysis of three related assignment problems
inferred← citeshttps://doi.org/10.1145/800179.810182openalex-snapshot
Optimization of large sequential data files
inferred← citeshttps://doi.org/10.3390/math13071097openalex-snapshot
Solution Methods for the Multiple-Choice Knapsack Problem and Their Applications
inferred← citeshttps://doi.org/10.71655/uvcibv.petxb-r7538openalex-snapshot
Separability as a physical database design methodology
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.