On the public citation graph
Optimal selection of secondary indexes
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/3-540-51251-9_3openalex-snapshot
Index selection in relational databases
inferredcites →https://doi.org/10.1007/978-1-4613-1881-1_41openalex-snapshot
Index Selection in Relational Databases
inferredcites →https://doi.org/10.1007/bf00976642openalex-snapshot
The choice of partial inversions and combined indices
inferredcites →https://doi.org/10.1016/0306-4379(75)90003-4openalex-snapshot
The optimal selection of secondary indices for files
inferredcites →https://doi.org/10.1016/0306-4379(79)90024-3openalex-snapshot
A heuristic approach for determining the optimal degree of file inversion
inferredcites →https://doi.org/10.1016/0306-4379(79)90033-4openalex-snapshot
File organizations and their reorganization
inferredcites →https://doi.org/10.1016/0378-4754(83)90070-8openalex-snapshot
Distributed data sharing systems
inferredcites →https://doi.org/10.1093/comjnl/20.4.302openalex-snapshot
Improving the performance of an intelligent data management system
inferredcites →https://doi.org/10.1109/tse.1983.236458openalex-snapshot
On the Selection of an Optimal Set of Indexes
inferredcites →https://doi.org/10.1109/tse.1984.5010296openalex-snapshot
On the Optimal Selection of Multilist Database Structures
inferredcites →https://doi.org/10.1145/320289.320296openalex-snapshot
The difficulty of optimum index selection
inferredcites →https://doi.org/10.1145/320521.320537openalex-snapshot
Minimum cost selection of secondary indexes for formatted files
inferredcites →https://doi.org/10.1145/359461.359475openalex-snapshot
Approximating block accesses in database organizations
inferredcites →https://doi.org/10.1145/360762.360766openalex-snapshot
Analysis and performance of inverted data base structures
inferredcites →https://doi.org/10.1145/509383.509385openalex-snapshot
Index selection in a self-adaptive data base management system
inferredcites →https://doi.org/10.1145/509384.509385openalex-snapshot
Index selection in a self-adaptive data base management system
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-36605-9_26openalex-snapshot
A Genetic Algorithm for the Index Selection Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-07941-7_34openalex-snapshot
Relational Database Index Selection Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-85654-2_71openalex-snapshot
Compressing Very Large Database Workloads for Continuous Online Index Selection
inferred← citeshttps://doi.org/10.1007/978-3-642-02190-9_1openalex-snapshot
Automatic Index Selection in RDBMS by Exploring Query Execution Plan Space
inferred← citeshttps://doi.org/10.1016/0169-023x(93)90023-iopenalex-snapshot
On the selection of secondary indices in relational databases
inferred← citeshttps://doi.org/10.1016/j.ins.2009.02.009openalex-snapshot
An index selection method without repeated optimizer estimations
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00050-5openalex-snapshot
Separating lifted odd-hole inequalities to solve the index selection problem
inferred← citeshttps://doi.org/10.1016/s0898-1221(98)00256-9openalex-snapshot
Near optimal multiple choice index selection for relational databases
inferred← citeshttps://doi.org/10.1016/s0957-4174(03)00003-4openalex-snapshot
A knowledge-based approach for index selection in relational databases
inferred← citeshttps://doi.org/10.1109/69.476501openalex-snapshot
Exact and approximate algorithms for the index selection problem in physical database design
inferred← citeshttps://doi.org/10.1109/icci.1993.315323openalex-snapshot
Index selection in relational databases
inferred← citeshttps://doi.org/10.1109/icde.2000.839397openalex-snapshot
DB2 advisor: an optimizer smart enough to recommend its own indexes
inferred← citeshttps://doi.org/10.1109/icdew.2016.7495648openalex-snapshot
On a self-tuning index recommendation approach for databases
inferred← citeshttps://doi.org/10.1109/tkde.2007.190690openalex-snapshot
Online Index Recommendations for High-Dimensional Databases Using Query Workloads
inferred← citeshttps://doi.org/10.1109/tkde.2024.3422006openalex-snapshot
Automatic Index Tuning: A Survey
inferred← citeshttps://doi.org/10.1145/221270.221325openalex-snapshot
The index suggestion problem for object database applications
inferred← citeshttps://doi.org/10.1145/356901.356905openalex-snapshot
Surveyor's Forum: The File Assignment Problem
inferred← citeshttps://doi.org/10.1145/356901.356906openalex-snapshot
Surveyor's Forum: The File Assignment Problem
inferred← citeshttps://doi.org/10.1145/3665323openalex-snapshot
Self-tuning Database Systems: A Systematic Literature Review of Automatic Database Schema Design and Tuning
inferred← citeshttps://doi.org/10.17771/pucrio.acad.48805openalex-snapshot
COMBINAÇÃO E SELEÇÃO AUTOMÁTICA DE AÇÕES DE SINTONIA FINA
inferred← citeshttps://doi.org/10.21936/si2014_v35.n2.675openalex-snapshot
Indeksowanie tabel dla różnych gęstości grup zapytań SQL (na przykładzie Oracle 11g)
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.