On the public citation graph
Database operations in a cube-connected multicomputer system
0 signed · 43 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.1016/0743-7315(84)90003-0openalex-snapshot
Dynamically partitionable multicomputers with switchable memory
inferredcites →https://doi.org/10.1109/icde.1987.7272354openalex-snapshot
Implementing relational database operations in a cube-connected multicomputer system
inferredcites →https://doi.org/10.1109/mc.1979.1658656openalex-snapshot
The Role of Associative Array Processers in Data Base Machine Architecture
inferredcites →https://doi.org/10.1109/mm.1986.304707openalex-snapshot
A Microprocessor-based Hypercube Supercomputer
inferredcites →https://doi.org/10.1109/tc.1985.1676534openalex-snapshot
A Database Machine for Very Large Relational Databases
inferredcites →https://doi.org/10.1109/tc.1986.1676839openalex-snapshot
The Architecture of SM3: A Dynamically Partitionable Multicomputer System
inferredcites →https://doi.org/10.1109/tse.1986.6312905openalex-snapshot
NON-VON's performance on certain database benchmarks
inferredcites →https://doi.org/10.1145/6424.6427openalex-snapshot
Evaluating two massively parallel machines
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.4380220304openalex-snapshot
A parallel database‐driven protocol verification system prototype
inferred← citeshttps://doi.org/10.1007/978-1-4615-2746-6_4openalex-snapshot
Performance Analysis of Parallel Object-Oriented Query Processing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-58066-6_15openalex-snapshot
Parallel Relational Database Algorithms
inferred← citeshttps://doi.org/10.1007/bf01263339openalex-snapshot
Performance analysis of parallel object-oriented query processing algorithms
inferred← citeshttps://doi.org/10.1016/0164-1212(90)90032-hopenalex-snapshot
Fault tolerance on a hypercube: A database application
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00028-mopenalex-snapshot
A load balanced multicomputer relational database system for highly skewed data
inferred← citeshttps://doi.org/10.1016/0743-7315(90)90132-9openalex-snapshot
Squashed embedding of E-R schemas in hypercubes
inferred← citeshttps://doi.org/10.1016/s0164-1212(97)00056-3openalex-snapshot
A parallel join algorithm for SIMD architectures
inferred← citeshttps://doi.org/10.1063/1.44493openalex-snapshot
Functional data representation in scientific information systems
inferred← citeshttps://doi.org/10.1109/12.260633openalex-snapshot
Dynamic load balancing in very large shared-nothing hypercube database computers
inferred← citeshttps://doi.org/10.1109/2.60877openalex-snapshot
Multiprocessor algorithms for relational-database operators on hypercube systems
inferred← citeshttps://doi.org/10.1109/3477.752794openalex-snapshot
A self-processing network model for relational databases
inferred← citeshttps://doi.org/10.1109/40.108569openalex-snapshot
VLSI accelerators for large database systems
inferred← citeshttps://doi.org/10.1109/40.124381openalex-snapshot
Experimentation with hypercube database engines
inferred← citeshttps://doi.org/10.1109/49.16865openalex-snapshot
Protocol verification using database technology
inferred← citeshttps://doi.org/10.1109/69.204100openalex-snapshot
Join and data redistribution algorithms for hypercubes
inferred← citeshttps://doi.org/10.1109/69.298176openalex-snapshot
Site and query scheduling policies in multicomputer database systems
inferred← citeshttps://doi.org/10.1109/69.404036openalex-snapshot
Applying segmented right-deep trees to pipelining multiple hash joins
inferred← citeshttps://doi.org/10.1109/69.506709openalex-snapshot
Optimization of parallel execution for multi-join queries
inferred← citeshttps://doi.org/10.1109/69.617058openalex-snapshot
The NUMA with clusters of processors for parallel join
inferred← citeshttps://doi.org/10.1109/71.207588openalex-snapshot
A virtual bus architecture for dynamic parallel processing
inferred← citeshttps://doi.org/10.1109/dpds.1990.113704openalex-snapshot
Efficient parallel algorithms for functional dependency manipulations
inferred← citeshttps://doi.org/10.1109/icde.1992.213205openalex-snapshot
Scheduling and processor allocation for parallel execution of multijoin queries
inferred← citeshttps://doi.org/10.1109/icsmc.1991.169762openalex-snapshot
Massive parallelism for massive data applications
inferred← citeshttps://doi.org/10.1109/icsmc.1991.169763openalex-snapshot
VLSI and optical technologies for mass data processing
inferred← citeshttps://doi.org/10.1109/parbse.1990.77112openalex-snapshot
Range search in parallel using distributed data structures
inferred← citeshttps://doi.org/10.1109/parbse.1990.77192openalex-snapshot
On the design, implementation, and evaluation of a portable parallel database system
inferred← citeshttps://doi.org/10.1109/pdis.1994.331733openalex-snapshot
An efficient parallel join algorithm based on hypercube-partitioning
inferred← citeshttps://doi.org/10.1109/spdp.1990.143636openalex-snapshot
A virtual bus for dynamic parallel processing
inferred← citeshttps://doi.org/10.1145/128762.128764openalex-snapshot
Join processing in relational databases
inferred← citeshttps://doi.org/10.1145/152610.152611openalex-snapshot
Query evaluation techniques for large databases
inferred← citeshttps://doi.org/10.1145/319057.319078openalex-snapshot
Efficient parallel algorithms for functional dependency manipulations
inferred← citeshttps://doi.org/10.1145/3473138openalex-snapshot
Scaling Membership of Byzantine Consensus
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5018openalex-snapshot
Fast Parallel Algorithms on a Class of Graph Structures With Applications in Relational Databases and Computer Networks.
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5277openalex-snapshot
Parallel and Distributed Algorithms for a Class of Graph-Related Computational Problems.
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.